Hans L. Bodlaender

Cited by

	All	Since 2018
Citations	20763	5570
h-index	68	38
i10-index	186	103

1100

550

275

825

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202366 88 121 142 167 258 208 325 263 188 267 269 360 391 435 563 668 665 707 817 865 937 991 1098 1040 995 919 976 938 921 1013 891 1001 803

Public access

View all

34 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensVerified email at thilikos.info
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityVerified email at math2.rwth-aachen.de
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Jan van LeeuwenUtrecht UniversityVerified email at uu.nl
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)Verified email at uu.nl
Stefan KratschProfessor at Humboldt University BerlinVerified email at informatik.hu-berlin.de
Tom C. van der ZandenMaastricht UniversityVerified email at maastrichtuniversity.nl
Klaus JansenProfessor, Computer Science, University of KielVerified email at informatik.uni-kiel.de
rod downeyVictoria University, WellingtonVerified email at vuw.ac.nz
Rolf NiedermeierTU BerlinVerified email at tu-berlin.de
Alexander GrigorievMaastricht UniversityVerified email at maastrichtuniversity.nl
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, SwitzerlandVerified email at idsia.ch
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyVerified email at tue.nl
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechVerified email at cs.upc.edu
Gerard TelVerified email at uu.nl
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Yota OtachiNagoya UniversityVerified email at nagoya-u.jp

Hans L. Bodlaender

Professor Computer Science, Utrecht University

Verified email at uu.nl - Homepage

algorithms computational complexity graph algorithms graph theory fixed parameter algorithms and complexity


Title Sort by citations Sort by year Sort by 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	2204	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1240	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	952	1994
On problems without polynomial kernels HL Bodlaender, RG Downey, MR Fellows, D Hermelin Journal of Computer and System Sciences 75 (8), 423-434, 2009	616	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988	553	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	504*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	486*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997	439	1997
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	350	1990
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	344	2016
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	342*	2011
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	331	2008
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	316	2002
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	308	1991
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International Colloquium on Automata, Languages, and Programming, 273-283, 1992	292	1992
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	291*	2004
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	285	2011
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	272	2010
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	272	1993
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	255	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors