Hans L. Bodlaender

Citée par

	Toutes	Depuis 2018
Citations	20149	4967
indice h	67	36
indice i10	185	97

1200

600

300

900

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202363 83 122 135 160 246 203 325 261 177 259 285 369 384 412 623 675 657 706 803 877 955 982 1112 1042 987 912 976 951 900 1008 926 1053 125

Accès public

Tout afficher

31 articles

1 article

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensAdresse e-mail validée de thilikos.info
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityAdresse e-mail validée de math2.rwth-aachen.de
Fedor V. FominProfessor of Computer Science, University of BergenAdresse e-mail validée de uib.no
Michael FellowsProfessor of Informatics, University of BergenAdresse e-mail validée de uib.no
Dieter Kratschprofesseur d'informatique, Universite de LorraineAdresse e-mail validée de univ-lorraine.fr
Jan van LeeuwenUtrecht UniversityAdresse e-mail validée de uu.nl
Johan M. M. van RooijUtrecht University (20%) and Valcon (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
Rolf NiedermeierTU BerlinAdresse e-mail validée de tu-berlin.de
Tom C. van der ZandenMaastricht UniversityAdresse e-mail validée de maastrichtuniversity.nl
rod downeyVictoria University, WellingtonAdresse e-mail validée de vuw.ac.nz
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
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyAdresse e-mail validée de tue.nl
Jesper NederlofUtrecht UniversityAdresse e-mail validée de uu.nl
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechAdresse e-mail validée de cs.upc.edu
Gerard TelAdresse e-mail validée de uu.nl
Henning FernauProfessor für Informatik, Universität TrierAdresse e-mail validée de uni-trier.de
Daniel LokshtanovProfessor of Computer Science, UCSBAdresse e-mail validée de ucsb.edu

Suivre

Hans L. Bodlaender

Professor Computer Science, Utrecht University

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

algorithms computational complexity graph 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	2159	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1199	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	923	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	608	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988	534	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	483*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	478*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender Mathematical Foundations of Computer Science 1997: 22nd International …, 1997	439	1997
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	339	1990
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	333*	2011
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	327	2016
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	321	2008
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
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	295	1991
Two strikes against perfect phylogeny HL Bodlaender Unknown Publisher, 1992	291	1992
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	277*	2004
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	275	2011
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	264	1993
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	263	2010
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	234	2015

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

Suivre

Citée par

Coauteurs