Hans L. Bodlaender

Cited by

	All	Since 2019
Citations	22074	5802
h-index	71	38
i10-index	195	112

1100

550

275

825

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202465 86 102 160 174 256 210 328 261 188 269 274 362 409 438 573 686 663 720 811 887 952 1014 1068 1051 994 906 958 988 977 996 876 937 1096 917

Public access

View all

37 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Dimitrios M. ThilikosVerified 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
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyVerified email at tue.nl
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, SwitzerlandVerified email at idsia.ch
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
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Todd WarehamProfessor of Computer Science, Memorial University of NewfoundlandVerified email at mun.ca

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	2319	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1353	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	1002	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	637	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988	585	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	536*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	517*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997	462	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	374	2016
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	362*	2011
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	352	1990
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	350	2008
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	329	2002
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	319	1991
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	310	2010
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	301	2011
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International colloquium on automata, languages, and programming, 273-283, 1992	299	1992
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	297*	2004
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	292	2015
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	280	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