Hans L. Bodlaender

Navedeno

	Vse	Od leta 2018
Navedbe	20388	5191
indeks h	68	36
indeks i10	185	100

1200

600

300

900

199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202363 83 115 135 160 248 204 325 257 174 254 285 371 398 407 632 672 657 704 799 881 953 992 1115 1042 986 914 974 954 905 1003 914 1016 395

Javni dostop

Prikaži vse

31 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Dimitrios M. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensPreverjeni e-poštni naslov na thilikos.info
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityPreverjeni e-poštni naslov na math2.rwth-aachen.de
Fedor V. FominProfessor of Computer Science, University of BergenPreverjeni e-poštni naslov na uib.no
Michael FellowsProfessor of Informatics, University of BergenPreverjeni e-poštni naslov na uib.no
Dieter Kratschprofesseur d'informatique, Universite de LorrainePreverjeni e-poštni naslov na univ-lorraine.fr
Jan van LeeuwenUtrecht UniversityPreverjeni e-poštni naslov na uu.nl
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)Preverjeni e-poštni naslov na uu.nl
Stefan KratschProfessor at Humboldt University BerlinPreverjeni e-poštni naslov na informatik.hu-berlin.de
Klaus JansenProfessor, Computer Science, University of KielPreverjeni e-poštni naslov na informatik.uni-kiel.de
Rolf NiedermeierTU BerlinPreverjeni e-poštni naslov na tu-berlin.de
Tom C. van der ZandenMaastricht UniversityPreverjeni e-poštni naslov na maastrichtuniversity.nl
rod downeyVictoria University, WellingtonPreverjeni e-poštni naslov na vuw.ac.nz
Alexander GrigorievMaastricht UniversityPreverjeni e-poštni naslov na maastrichtuniversity.nl
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, SwitzerlandPreverjeni e-poštni naslov na idsia.ch
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyPreverjeni e-poštni naslov na tue.nl
Jesper NederlofUtrecht UniversityPreverjeni e-poštni naslov na uu.nl
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechPreverjeni e-poštni naslov na cs.upc.edu
Gerard TelPreverjeni e-poštni naslov na uu.nl
Henning FernauProfessor für Informatik, Universität TrierPreverjeni e-poštni naslov na uni-trier.de
Daniel LokshtanovProfessor of Computer Science, UCSBPreverjeni e-poštni naslov na ucsb.edu

Spremljaj

Hans L. Bodlaender

Professor Computer Science, Utrecht University

Preverjeni e-poštni naslov na uu.nl - Domača stran

algorithms computational complexity graph algorithms graph theory fixed parameter algorithms and complexity


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
A linear time algorithm for finding tree-decompositions of small treewidth HL Bodlaender SIAM Journal on Computing 25 (6), 1305-1317, 1996	2179	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1218	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	931	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	612	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988	538	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	489*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	483*	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	343	1990
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	335	2016
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	333*	2011
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	323	2008
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	313	2002
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	301	1991
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow Automata, Languages and Programming: 19th International Colloquium Wien …, 1992	292	1992
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	283*	2004
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	278	2011
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	264	2010
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	264	1993
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	241	2015

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji