Hans L. Bodlaender

Dikutip oleh

	Semua	Sejak 2020
Kutipan	22736	5297
indeks-h	72	34
indeks-i10	198	108

1200

600

300

900

19901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202572 89 108 176 173 252 207 331 261 191 267 270 365 405 452 581 706 658 711 823 893 978 1012 1100 1058 1000 922 963 1019 971 1008 868 919 1055 1159 283

Akses publik

Lihat semua

39 artikel

0 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Dimitrios M. ThilikosNational and Kapodistrian University of AthensEmail yang diverifikasi di thilikos.info
Arie KosterProfessor of Discrete Optimization, RWTH Aachen UniversityEmail yang diverifikasi di math2.rwth-aachen.de
Fedor V. FominProfessor of Computer Science, University of BergenEmail yang diverifikasi di uib.no
Dieter Kratschprofesseur d'informatique, Universite de LorraineEmail yang diverifikasi di univ-lorraine.fr
Jan van LeeuwenUtrecht UniversityEmail yang diverifikasi di uu.nl
Johan M. M. van RooijUtrecht University (20%) and Valcon (80%)Email yang diverifikasi di uu.nl
Stefan KratschProfessor at Humboldt University BerlinEmail yang diverifikasi di informatik.hu-berlin.de
Tom C. van der ZandenMaastricht UniversityEmail yang diverifikasi di maastrichtuniversity.nl
Klaus JansenProfessor, Computer Science, University of KielEmail yang diverifikasi di informatik.uni-kiel.de
Alexander GrigorievMaastricht UniversityEmail yang diverifikasi di maastrichtuniversity.nl
rod downeyVictoria University, WellingtonEmail yang diverifikasi di vuw.ac.nz
Rolf NiedermeierTU BerlinEmail yang diverifikasi di tu-berlin.de
Linda C. van der GaagSenior researcher, Dalle Molle Institute for Artificial Intelligence Research, Lugano, SwitzerlandEmail yang diverifikasi di idsia.ch
Jesper NederlofUtrecht UniversityEmail yang diverifikasi di uu.nl
Bart M. P. JansenAssociate Professor, Eindhoven University of TechnologyEmail yang diverifikasi di tue.nl
Maria SernaProfessor. Computer Science. Universitat Politecnica de Catalunya. Barcelona TechEmail yang diverifikasi di cs.upc.edu
Gerard TelEmail yang diverifikasi di uu.nl
Daniel LokshtanovProfessor of Computer Science, UCSBEmail yang diverifikasi di ucsb.edu
Jan Arne TelleUniversity of Bergen, NorwayEmail yang diverifikasi di ii.uib.no
Yota OtachiNagoya UniversityEmail yang diverifikasi di nagoya-u.jp

Ikuti

Hans L. Bodlaender

Professor Computer Science, Utrecht University

Email yang diverifikasi di uu.nl - Beranda

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


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
A linear time algorithm for finding tree-decompositions of small treewidth HL Bodlaender SIAM Journal on Computing 25 (6), 1305-1317, 1996	2378	1996
A partial k-arboretum of graphs with bounded treewidth HL Bodlaender Theoretical Computer Science 209 (1-2), 1-45, 1998	1406	1998
A tourist guide through treewidth HL Bodlaender Developments in Theoretical Computer Science 1, 1994	1044	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	651	2009
Dynamic programming on graphs with bounded treewidth HL Bodlaender Automata, Languages and Programming: 15th International Colloquium Tampere …, 1988	607	1988
Efficient and constructive algorithms for the pathwidth and treewidth of graphs HL Bodlaender, T Kloks Journal of Algorithms 21, 358-402, 1996	554*	1996
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree HL Bodlaender, JR Gilbert, H Hafsteinsson, T Kloks J. Algorithms 18 (2), 238-255, 1995	537*	1995
Treewidth: Algorithmic techniques and results HL Bodlaender International symposium on mathematical foundations of computer science, 19-36, 1997	480	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	388	2016
Kernelization Lower Bounds By Cross-Composition HL Bodlaender, BMP Jansen, S Kratsch STACS 2011, 165-176, 2011	370*	2011
Combinatorial optimization on graphs of bounded treewidth HL Bodlaender, AMCA Koster The Computer Journal 51 (3), 255-269, 2008	356	2008
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees HL Bodlaender Journal of Algorithms 11 (4), 631-643, 1990	356	1990
Fixed parameter algorithms for dominating set and related problems on planar graphs Alber, Bodlaender, Fernau, Kloks, Niedermeier Algorithmica 33, 461-493, 2002	332	2002
On the complexity of some coloring games HL Bodlaender International Journal of Foundations of Computer Science 2 (02), 133-147, 1991	325	1991
Treewidth computations I. Upper bounds HL Bodlaender, AMCA Koster Information and Computation 208 (3), 259-275, 2010	324	2010
Kernel bounds for disjoint cycles and disjoint paths HL Bodlaender, S Thomassé, A Yeo Theoretical Computer Science, 2011	304	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	303	2015
Approximations for λ-colorings of graphs HL Bodlaender, T Kloks, RB Tan, J Van Leeuwen The Computer Journal 47 (2), 193, 2004	303*	2004
Two strikes against perfect phylogeny HL Bodlaender, MR Fellows, TJ Warnow International colloquium on automata, languages, and programming, 273-283, 1992	299	1992
The pathwidth and treewidth of cographs HL Bodlaender, RH Möhring SIAM Journal on Discrete Mathematics 6 (2), 181-188, 1993	284	1993

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama