Hans L. Bodlaender

Cited by

	All	Since 2016
Citations	18523	5237
h-index	67	34
i10-index	183	103

1200

600

300

900

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202175 80 108 130 162 207 196 317 266 183 261 267 366 370 432 572 678 650 719 837 910 956 990 1105 1055 1019 934 980 967 945 1135 272

Public access

View all

26 articles

2 articles

available

not available

Based on funding mandates

Co-authors

Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerified email at math.uoa.gr
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityVerified email at math2.rwth-aachen.de
Michael FellowsProfessor of Informatics, University of BergenVerified email at uib.no
Jan van LeeuwenUtrecht UniversityVerified email at uu.nl
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Johan M. M. van RooijUtrecht University (20%) and VIQTOR DAVIS (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
rod downeyVictoria University, WellingtonVerified email at vuw.ac.nz
Rolf NiedermeierProfessor of Theoretical Computer Science, TU BerlinVerified email at tu-berlin.de
Bart M. P. JansenAssistant Professor, Eindhoven University of TechnologyVerified email at tue.nl
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
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechVerified email at cs.upc.edu
Tom C. van der ZandenMaastricht UniversityVerified email at maastrichtuniversity.nl
Jesper NederlofUtrecht UniversityVerified email at uu.nl
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerified email at ucsb.edu
Jan Arne TelleUniversity of Bergen, NorwayVerified email at ii.uib.no

Hans L. Bodlaender

Professor Computer Science, Utrecht University and Technical University Eindhoven

Verified email at uu.nl - Homepage

algorithms network 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	1958	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1076	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	868	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	563	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender International Colloquium on Automata, Languages, and Programming, 105-118, 1988	485	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	435*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	424*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997	417	1997
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	315	1990
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	303	2002
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	293	2008
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International Colloquium on Automata, Languages, and Programming, 273-283, 1992	287	1992
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	277*	2011
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	258	2011
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	256*	2004
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	249	1993
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	242	2016
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	238	2010
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	214	1991
Classes of graphs with bounded tree-width HL Bodlaender Unknown Publisher, 1986	213	1986

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

Upload PDF

Follow this author

Cited by

Co-authors