Hans L. Bodlaender 个人学术档案

引用次数

	总计	2019 年至今
引用	21704	5494
h 指数	70	37
i10 指数	193	109

1100

550

275

825

1990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202465 88 105 165 167 255 209 329 261 187 268 269 361 391 436 573 684 661 718 816 882 931 1010 1079 1062 998 902 960 970 964 1010 887 970 1093 569

开放获取的出版物数量

查看全部

35 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Dimitrios M. Thilikos在 thilikos.info 的电子邮件经过验证
Arie KosterProfessor of Discrete Optimization, RWTH Aachen University在 math2.rwth-aachen.de 的电子邮件经过验证
Michael FellowsProfessor of Informatics, University of Bergen在 uib.no 的电子邮件经过验证
Fedor V. FominProfessor of Computer Science, University of Bergen在 uib.no 的电子邮件经过验证
Dieter Kratschprofesseur d'informatique, Universite de Lorraine在 univ-lorraine.fr 的电子邮件经过验证
Jan van LeeuwenUtrecht University在 uu.nl 的电子邮件经过验证
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)在 uu.nl 的电子邮件经过验证
Stefan KratschProfessor at Humboldt University Berlin在 informatik.hu-berlin.de 的电子邮件经过验证
Klaus JansenProfessor, Computer Science, University of Kiel在 informatik.uni-kiel.de 的电子邮件经过验证
Tom C. van der ZandenMaastricht University在 maastrichtuniversity.nl 的电子邮件经过验证
rod downeyVictoria University, Wellington在 vuw.ac.nz 的电子邮件经过验证
Rolf NiedermeierTU Berlin在 tu-berlin.de 的电子邮件经过验证
Alexander GrigorievMaastricht University在 maastrichtuniversity.nl 的电子邮件经过验证
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, Switzerland在 idsia.ch 的电子邮件经过验证
Jesper NederlofUtrecht University在 uu.nl 的电子邮件经过验证
Bart M. P. JansenAssociate Professor, Eindhoven University of Technology在 tue.nl 的电子邮件经过验证
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona Tech在 cs.upc.edu 的电子邮件经过验证
Gerard Tel在 uu.nl 的电子邮件经过验证
Daniel LokshtanovProfessor of Computer Science, UCSB在 ucsb.edu 的电子邮件经过验证
Todd WarehamProfessor of Computer Science, Memorial University of Newfoundland在 mun.ca 的电子邮件经过验证

关注

Hans L. Bodlaender

Professor Computer Science, Utrecht University

在 uu.nl 的电子邮件经过验证 - 首页

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


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
A linear time algorithm for finding tree-decompositions of small treewidth HL Bodlaender SIAM Journal on Computing 25 (6), 1305-1317, 1996	2283	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1331	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	974	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	631	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988	572	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	524*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	507*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International Symposium on Mathematical Foundations of Computer Science, 19-36, 1997	451	1997
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	366	2016
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	356*	2011
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	348	1990
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	344	2008
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	326	2002
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	317	1991
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	298*	2004
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International colloquium on automata, languages, and programming, 273-283, 1992	297	1992
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	296	2010
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	295	2011
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	286	2015
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	278	1993

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用