Hans L. Bodlaender

Sitert av

	Alle	Siden 2016
Sitater	18959	5675
h-indeks	67	35
i10-indeks	181	106

1200

600

300

900

19891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202147 74 78 114 133 165 210 200 319 261 188 256 270 368 380 434 576 660 644 725 840 902 964 965 1102 1051 998 899 958 926 925 1116 842

Offentlig tilgang

Vis alle

31 artikler

1 artikkel

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerifisert e-postadresse på math.uoa.gr
Fedor V. FominProfessor of Computer Science, University of BergenVerifisert e-postadresse på uib.no
Michael FellowsProfessor of Informatics, University of BergenVerifisert e-postadresse på uib.no
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityVerifisert e-postadresse på math2.rwth-aachen.de
Jan van LeeuwenUtrecht UniversityVerifisert e-postadresse på uu.nl
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerifisert e-postadresse på univ-lorraine.fr
Johan M. M. van RooijUtrecht University (20%) and VIQTOR DAVIS (80%)Verifisert e-postadresse på uu.nl
Stefan KratschProfessor at Humboldt University BerlinVerifisert e-postadresse på informatik.hu-berlin.de
Klaus JansenProfessor, Computer Science, University of KielVerifisert e-postadresse på informatik.uni-kiel.de
rod downeyVictoria University, WellingtonVerifisert e-postadresse på vuw.ac.nz
Alexander GrigorievMaastricht UniversityVerifisert e-postadresse på maastrichtuniversity.nl
Tom C. van der ZandenMaastricht UniversityVerifisert e-postadresse på maastrichtuniversity.nl
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, SwitzerlandVerifisert e-postadresse på idsia.ch
Bart M. P. JansenAssistant Professor, Eindhoven University of TechnologyVerifisert e-postadresse på tue.nl
Jesper NederlofUtrecht UniversityVerifisert e-postadresse på uu.nl
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechVerifisert e-postadresse på cs.upc.edu
Daniel LokshtanovAssociate Professor in Computer Science, UCSBVerifisert e-postadresse på ucsb.edu
Jan Arne TelleUniversity of Bergen, NorwayVerifisert e-postadresse på ii.uib.no
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerifisert e-postadresse på cs.rwth-aachen.de
Pinar HeggernesProfessor of computer science, University of BergenVerifisert e-postadresse på ii.uib.no

Hans L. Bodlaender

Professor Computer Science, Utrecht University and Technical University Eindhoven

Verifisert e-postadresse på uu.nl - Startside

algorithms network algorithms graph theory fixed parameter algorithms and complexity


Tittel Sortér etter sitater Sortér etter år Sortér etter tittel	Sitert av Sitert av	År
A linear time algorithm for finding tree-decompositions of small treewidth HL Bodlaender SIAM Journal on Computing 25 (6), 1305-1317, 1996	2020	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1136	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	888	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	576	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender International Colloquium on Automata, Languages, and Programming, 105-118, 1988	514	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	450*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	439*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997	424	1997
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	320	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	306	2002
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	303	2008
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	299*	2011
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International Colloquium on Automata, Languages, and Programming, 273-283, 1992	290	1992
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	268	2016
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	266*	2004
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	261	2011
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	249	1993
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	245	2010
Classes of graphs with bounded tree-width HL Bodlaender Unknown Publisher, 1986	222	1986
Discovering treewidth HL Bodlaender International Conference on Current Trends in Theory and Practice of …, 2005	218	2005

Systemet kan ikke utføre handlingen. Prøv igjen senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg denne forfatteren

Sitert av

Medforfattere