Hans L. Bodlaender

Cited by

	All	Since 2020
Citations	22792	5344
h-index	72	35
i10-index	198	108

1200

600

300

900

19901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202572 89 108 176 173 252 207 331 261 191 268 269 365 407 451 581 706 658 712 823 893 981 1009 1099 1061 1003 927 959 1021 970 1012 859 917 1048 1161 342

Public access

View all

39 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Dimitrios M. ThilikosNational 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
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
Alexander GrigorievMaastricht UniversityVerified email at maastrichtuniversity.nl
rod downeyVictoria University, WellingtonVerified email at vuw.ac.nz
Rolf NiedermeierTU BerlinVerified email at tu-berlin.de
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, SwitzerlandVerified email at idsia.ch
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyVerified email at tue.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
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no
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	2382	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1410	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	1048	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	652	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988	607	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	556*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	540*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International symposium on mathematical foundations of computer science, 19-36, 1997	480	1997
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	389	2016
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	371*	2011
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	356	2008
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	356	1990
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	332	2002
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	326	2010
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	326	1991
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	305	2011
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	304	2015
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	303*	2004
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International colloquium on automata, languages, and programming, 273-283, 1992	299	1992
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	284	1993

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