Follow
Hans L. Bodlaender
Title
Cited by
Cited by
Year
A linear time algorithm for finding tree-decompositions of small treewidth
HL Bodlaender
SIAM Journal on Computing 25 (6), 1305-1317, 1996
21041996
A partial k-arboretum of graphs with bounded treewidth
HL Bodlaender
Theoretical Computer Science 209 (1-2), 1-45, 1998
11731998
A tourist guide through treewidth
HL Bodlaender
Developments in Theoretical Computer Science 1, 1994
9041994
On problems without polynomial kernels
HL Bodlaender, RG Downey, MR Fellows, D Hermelin
Journal of Computer and System Sciences 75 (8), 423-434, 2009
6052009
Dynamic programming on graphs with bounded treewidth
HL Bodlaender
International Colloquium on Automata, Languages, and Programming, 105-118, 1988
5271988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
HL Bodlaender, T Kloks
Journal of Algorithms 21, 358-402, 1996
464*1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks
J. Algorithms 18 (2), 238-255, 1995
457*1995
Treewidth: Algorithmic techniques and results
HL Bodlaender
International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997
4401997
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
HL Bodlaender
Journal of Algorithms 11 (4), 631-643, 1990
3281990
Kernelization Lower Bounds By Cross-Composition
HL Bodlaender, BMP Jansen, S Kratsch
STACS 2011, 165-176, 2011
327*2011
Combinatorial optimization on graphs of bounded treewidth
HL Bodlaender, AMCA Koster
The Computer Journal 51 (3), 255-269, 2008
3142008
A 5-Approximation Algorithm for Treewidth
HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ...
SIAM Journal on Computing 45 (2), 317-378, 2016
3122016
Fixed parameter algorithms for dominating set and related problems on planar graphs
J Alber, HL Bodlaender, H Fernau, T Kloks, R Niedermeier
Algorithmica 33 (4), 461-493, 2002
3082002
Two strikes against perfect phylogeny
HL Bodlaender, MR Fellows, TJ Warnow
International Colloquium on Automata, Languages, and Programming, 273-283, 1992
2881992
Approximations for λ-colorings of graphs
HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen
The Computer Journal 47 (2), 193, 2004
277*2004
Kernel bounds for disjoint cycles and disjoint paths
HL Bodlaender, S Thomassé, A Yeo
Theoretical Computer Science, 2011
2752011
Treewidth computations I. Upper bounds
HL Bodlaender, AMCA Koster
Information and Computation 208 (3), 259-275, 2010
2582010
The pathwidth and treewidth of cographs
HL Bodlaender, RH Möhring
SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993
2581993
On the complexity of some coloring games
HL Bodlaender
International Journal of Foundations of Computer Science 2 (02), 133-147, 1991
2301991
Discovering treewidth
HL Bodlaender
International Conference on Current Trends in Theory and Practice of …, 2005
2262005
The system can't perform the operation now. Try again later.
Articles 1–20