Подписаться
Hans L. Bodlaender
Hans L. Bodlaender
Professor Computer Science, Utrecht University
Подтвержден адрес электронной почты в домене uu.nl - Главная страница
Название
Процитировано
Процитировано
Год
A linear time algorithm for finding tree-decompositions of small treewidth
HL Bodlaender
SIAM Journal on Computing 25 (6), 1305-1317, 1996
23661996
A partial k-arboretum of graphs with bounded treewidth
HL Bodlaender
Theoretical Computer Science 209 (1-2), 1-45, 1998
14031998
A tourist guide through treewidth
HL Bodlaender
Developments in Theoretical Computer Science 1, 1994
10351994
On problems without polynomial kernels
HL Bodlaender, RG Downey, MR Fellows, D Hermelin
Journal of Computer and System Sciences 75 (8), 423-434, 2009
6442009
Dynamic programming on graphs with bounded treewidth
HL Bodlaender
Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988
6021988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
HL Bodlaender, T Kloks
Journal of Algorithms 21, 358-402, 1996
554*1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks
J. Algorithms 18 (2), 238-255, 1995
537*1995
Treewidth: Algorithmic techniques and results
HL Bodlaender
International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997
4791997
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
3872016
Kernelization Lower Bounds By Cross-Composition
HL Bodlaender, BMP Jansen, S Kratsch
STACS 2011, 165-176, 2011
366*2011
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
HL Bodlaender
Journal of Algorithms 11 (4), 631-643, 1990
3541990
Combinatorial optimization on graphs of bounded treewidth
HL Bodlaender, AMCA Koster
The Computer Journal 51 (3), 255-269, 2008
3532008
Fixed parameter algorithms for dominating set and related problems on planar graphs
Alber, Bodlaender, Fernau, Kloks, Niedermeier
Algorithmica 33, 461-493, 2002
3312002
On the complexity of some coloring games
HL Bodlaender
International Journal of Foundations of Computer Science 2 (02), 133-147, 1991
3261991
Treewidth computations I. Upper bounds
HL Bodlaender, AMCA Koster
Information and Computation 208 (3), 259-275, 2010
3252010
Kernel bounds for disjoint cycles and disjoint paths
HL Bodlaender, S Thomassé, A Yeo
Theoretical Computer Science, 2011
3052011
Approximations for λ-colorings of graphs
HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen
The Computer Journal 47 (2), 193, 2004
301*2004
Two strikes against perfect phylogeny
HL Bodlaender, MR Fellows, TJ Warnow
International colloquium on automata, languages, and programming, 273-283, 1992
3001992
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
HL Bodlaender, M Cygan, S Kratsch, J Nederlof
Information and Computation 243, 86-111, 2015
2982015
The pathwidth and treewidth of cographs
HL Bodlaender, RH Möhring
SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993
2821993
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20