BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × Finland
1 × Hungary
1 × Iceland
1 × Italy
1 × Latvia
1 × Spain
1 × Sweden
1 × Switzerland
1 × USA
Collaborated with:
∅ M.R.Fellows T.Kloks S.Kratsch D.M.Thilikos B.d.Fluiter T.Hagerup B.M.P.Jansen M.T.Hallett D.Kratsch T.Warnow M.Cygan J.Nederlof R.G.Downey D.Hermelin
Talks about:
treewidth (7) algorithm (5) graph (4) problem (3) bound (3) time (3) pathwidth (2) linear (2) kernel (2) determinist (1)

Person: Hans L. Bodlaender

DBLP DBLP: Bodlaender:Hans_L=

Contributed to:

ICALP (1) 20132013
ICALP (1) 20112011
ICALP (1) 20082008
ICALP 19971997
ICALP 19951995
STOC 19941994
ICALP 19931993
STOC 19931993
ICALP 19921992
ICALP 19911991
ICALP 19881988

Wrote 12 papers:

ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
ICALP-v1-2011-BodlaenderJK #analysis #combinator #kernel #preprocessor
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (HLB, BMPJ, SK), pp. 437–448.
ICALP-A-2008-BodlaenderDFH #kernel #on the #polynomial #problem
On Problems without Polynomial Kernels (HLB, RGD, MRF, DH), pp. 563–574.
ICALP-1997-BodlaenderT #algorithm #linear
Constructive Linear Time Algorithms for Branchwidth (HLB, DMT), pp. 627–637.
ICALP-1995-BodlaenderF #graph
Intervalizing k-Colored Graphs (HLB, BdF), pp. 87–98.
ICALP-1995-BodlaenderH #algorithm #bound #parallel
Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.
STOC-1994-BodlaenderFH #bound #problem
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (HLB, MRF, MTH), pp. 449–458.
ICALP-1993-BodlaenderKK #graph #permutation
Treewidth and Pathwidth of Permutation Graphs (HLB, TK, DK), pp. 114–125.
STOC-1993-Bodlaender #algorithm #linear
A linear time algorithm for finding tree-decompositions of small treewidth (HLB), pp. 226–234.
ICALP-1992-BodlaenderFW
Two Strikes Against Perfect Phylogeny (HLB, MRF, TW), pp. 273–283.
ICALP-1991-BodlaenderK #algorithm #graph
Better Algorithms for the Pathwidth and Treewidth of Graphs (HLB, TK), pp. 544–555.
ICALP-1988-Bodlaender #bound #graph #programming
Dynamic Programming on Graphs with Bounded Treewidth (HLB), pp. 105–118.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.