Hans L. Bodlaender

Citée par

	Toutes	Depuis 2016
Citations	18441	5174
indice h	67	34
indice i10	183	101

1200

600

300

900

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202175 80 108 128 162 207 196 317 266 183 261 267 366 370 432 572 677 649 712 836 909 953 988 1107 1054 1018 931 973 971 963 1157 175

Coauteurs

Fedor V. FominProfessor of Computer Science, University of BergenAdresse e-mail validée de uib.no
Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensAdresse e-mail validée de math.uoa.gr
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityAdresse e-mail validée de math2.rwth-aachen.de
Michael FellowsProfessor of Informatics, University of BergenAdresse e-mail validée de uib.no
Jan van LeeuwenUtrecht UniversityAdresse e-mail validée de uu.nl
Dieter Kratschprofesseur d'informatique, Universite de LorraineAdresse e-mail validée de univ-lorraine.fr
Johan M. M. van RooijUtrecht University (20%) and VIQTOR DAVIS (80%)Adresse e-mail validée de uu.nl
Stefan KratschProfessor at Humboldt University BerlinAdresse e-mail validée de informatik.hu-berlin.de
Klaus JansenProfessor, Computer Science, University of KielAdresse e-mail validée de informatik.uni-kiel.de
rod downeyVictoria University, WellingtonAdresse e-mail validée de vuw.ac.nz
Rolf NiedermeierProfessor of Theoretical Computer Science, TU BerlinAdresse e-mail validée de tu-berlin.de
Bart M. P. JansenAssistant Professor, Eindhoven University of TechnologyAdresse e-mail validée de tue.nl
Alexander GrigorievMaastricht UniversityAdresse e-mail validée de maastrichtuniversity.nl
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, SwitzerlandAdresse e-mail validée de idsia.ch
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechAdresse e-mail validée de cs.upc.edu
Tom C. van der ZandenMaastricht UniversityAdresse e-mail validée de maastrichtuniversity.nl
Jesper NederlofUtrecht UniversityAdresse e-mail validée de uu.nl
Gerhard WoegingerProfessor of Computer Science, RWTH AachenAdresse e-mail validée de cs.rwth-aachen.de
Daniel LokshtanovAssociate Professor in Computer Science, UCSBAdresse e-mail validée de ucsb.edu
Jan Arne TelleUniversity of Bergen, NorwayAdresse e-mail validée de ii.uib.no

Hans L. Bodlaender

Professor Computer Science, Utrecht University and Technical University Eindhoven

Adresse e-mail validée de uu.nl - Page d'accueil

algorithms network algorithms graph theory fixed parameter algorithms and complexity


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
A linear time algorithm for finding tree-decompositions of small treewidth HL Bodlaender SIAM Journal on Computing 25 (6), 1305-1317, 1996	1951	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1073	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	864	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	561	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender International Colloquium on Automata, Languages, and Programming, 105-118, 1988	484	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	433*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	423*	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	311	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	292	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	274*	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	254*	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	240	2016
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	234	2010
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	213	1991
Classes of graphs with bounded tree-width HL Bodlaender Unknown Publisher, 1986	213	1986

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Importer un PDF

Suivre les mises à jour de cet auteur

Citée par

Coauteurs