Hans L. Bodlaender

Cited by

	All	Since 2017
Citations	19547	5300
h-index	67	36
i10-index	185	105

1200

600

300

900

19901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202278 74 99 135 159 210 205 334 252 180 257 280 356 397 436 576 672 651 717 855 900 964 972 1118 1064 997 904 986 939 929 1054 958 430

Public access

View all

35 articles

1 article

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
Klaus JansenProfessor, Computer Science, University of KielVerified email at informatik.uni-kiel.de
Rolf NiedermeierTU BerlinVerified email at tu-berlin.de
rod downeyVictoria University, WellingtonVerified email at vuw.ac.nz
Alexander GrigorievMaastricht UniversityVerified email at maastrichtuniversity.nl
Tom C. van der ZandenMaastricht 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
Henning FernauProfessor für Informatik, Universität TrierVerified email at uni-trier.de
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu

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	2079	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1164	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	898	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	601	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender International Colloquium on Automata, Languages, and Programming, 105-118, 1988	525	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	460*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	450*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997	441	1997
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	326	1990
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	318*	2011
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	310	2002
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	309	2008
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	303	2016
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International Colloquium on Automata, Languages, and Programming, 273-283, 1992	289	1992
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	275*	2004
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	270	2011
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	256	1993
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	253	2010
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	228	1991
Discovering treewidth HL Bodlaender International Conference on Current Trends in Theory and Practice of …, 2005	225	2005

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 this author

Cited by

Co-authors