×

Bodlaender, Hans L.

Compute Distance To:
Author ID: bodlaender.hans-l Recent zbMATH articles by "Bodlaender, Hans L."
Published as: Bodlaender, Hans L.; Bodlaender, H. L.; Bodlaender, Hans
Homepage: http://www.staff.science.uu.nl/~bodla101/
External Links: MGP · ORCID · Wikidata · dblp · GND · IdRef
Documents Indexed: 256 Publications since 1984, including 1 Book
7 Contributions as Editor
Reviewing Activity: 142 Reviews
Biographic References: 1 Publication
Co-Authors: 149 Co-Authors with 222 Joint Publications
4,238 Co-Co-Authors
all top 5

Co-Authors

41 single-authored
19 Thilikos, Dimitrios M.
18 Fomin, Fedor V.
15 Kloks, Ton
15 van der Zanden, Tom C.
14 Koster, Arie M. C. A.
13 Kratsch, Dieter
12 Fellows, Michael Ralph
12 Van Leeuwen, Jan
11 Kratsch, Stefan
11 van Rooij, Johan M. M.
10 Penninkx, Eelko
9 Jansen, Bart M. P.
9 Otachi, Yota
8 Grigoriev, Alexander
7 Jansen, Klaus
6 Heggernes, Pinar
6 Nederlof, Jesper
6 Ono, Hirotaka
6 Tan, Richard B.
6 Tel, Gerard
6 Woeginger, Gerhard Johannes
5 de Berg, Mark Theodoor
5 De Fluiter, Babette Lucie Elisabeth
5 Kisfaludi-Bak, Sándor
5 Lokshtanov, Daniel
5 Wolle, Thomas
4 Downey, Rodney Graham
4 Hanaka, Tesshu
4 Niedermeier, Rolf
4 Rosamond, Frances A.
4 Serna Iglesias, Maria José
4 Telle, Jan Arne
4 van der Wegen, Marieke
4 Van Leeuwen, Erik Jan
3 Bachoore, Emgad H.
3 Hagerup, Torben
3 Kwisthout, Johan
3 Langston, Michael A.
3 Marx, Dániel
3 van der Gaag, Linda C.
3 van Dijk, Thomas C.
3 van Kreveld, Marc J.
3 Yamazaki, Koichi
2 Alber, Jochen
2 Alt, Helmut
2 Bodewes, Jelco M.
2 Brandstädt, Andreas
2 Broersma, Hajo J.
2 Cornelissen, Gunther
2 Cygan, Marek
2 Dinneen, Michael J.
2 Dorn, Frederic
2 Fafianie, Stefan
2 Feremans, Corinne
2 Fernau, Henning
2 Gilbert, John R.
2 Grigorieva, Nadejda V.
2 Hafsteinsson, Hjálmtýr
2 Hallett, Michael T.
2 Hendriks, Albert
2 Hermelin, Danny
2 Jaffke, Lars
2 Kant, Goos
2 Katriel, Irit
2 Khoussainov, Bakhadyr M.
2 Kolay, Sudeshna
2 Kreuzen, Vincent J. C.
2 Mancini, Federico
2 Moran, Shlomo
2 Müller, Haiko
2 Okamoto, Yoshio
2 Papadopoulos, Charis
2 Pieterse, Astrid
2 Pyatkin, Artëm Valer’evich
2 Ragan, Mark A.
2 Rao, Michaël
2 Rote, Günter
2 Rotics, Udi
2 Saurabh, Saket
2 Schoone, Anneke A.
2 Sitters, Rene A.
2 Spinrad, Jeremy P.
2 Thomassé, Stéphan
2 van Antwerpen-de Fluiter, Babette
2 van den Eijkhof, Frank
2 van Kooten Niekerk, Marcel E.
2 Villanger, Yngve
2 Warmuth, Manfred K.
2 Warnow, Tandy J.
2 Weyer, Mark
2 Yeo, Anders
2 Zantema, Hans
1 Barkema, Gerard T.
1 Beame, Paul W.
1 Betzler, Nadja
1 Bonsma, Paul S.
1 Bredereck, Robert
1 Brettell, Nick
1 Comas, Marc
1 D’Ambrosio, Federico
...and 49 more Co-Authors

Publications by Year

Citations contained in zbMATH Open

230 Publications have been cited 4,299 times in 2,467 Documents Cited by Year
A linear-time algorithm for finding tree-decompositions of small treewidth. Zbl 0864.68074
Bodlaender, Hans L.
412
1996
A partial k-arboretum of graphs with bounded treewidth. Zbl 0912.68148
Bodlaender, Hans L.
325
1998
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
186
2009
A tourist guide through treewidth. Zbl 0804.68101
Bodlaender, Hans L.
159
1993
Kernelization lower bounds by cross-composition. Zbl 1295.05222
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
99
2014
Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Zbl 0861.68036
Bodlaender, Hans L.; Kloks, Ton
91
1996
A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282
Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał
82
2016
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1221.68099
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders
79
2011
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Zbl 0818.68118
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton
78
1995
Treewidth: Algorithmic techniques and results. Zbl 0941.05057
Bodlaender, Hans L.
78
1997
On the complexity of some coloring games. Zbl 0753.05061
Bodlaender, Hans L.
73
1991
(Meta) kernelization. Zbl 1292.68089
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
72
2009
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs. Zbl 1016.68055
Alber, J.; Bodlaender, H. L.; Fernau, H.; Kloks, T.; Niedermeier, R.
69
2002
The pathwidth and treewidth of cographs. Zbl 0773.05091
Bodlaender, Hans L.; Möhring, Rolf H.
60
1993
Rankings of graphs. Zbl 0907.68137
Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Heiko; Tuza, Zsolt
58
1998
Kernelization: new upper and lower bound techniques. Zbl 1273.68158
Bodlaender, Hans L.
56
2009
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1327.68126
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper
55
2015
A linear time algorithm for finding tree-decompositions of small treewidth. Zbl 1310.05194
Bodlaender, Hans L.
54
1993
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157
van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter
52
2009
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Zbl 0716.68042
Bodlaender, Hans L.
52
1990
Algorithms for graphs embeddable with few crossings per edge. Zbl 1131.68120
Grigoriev, Alexander; Bodlaender, Hans L.
48
2007
Treewidth computations. I: Upper bounds. Zbl 1186.68328
Bodlaender, Hans L.; Koster, Arie M. C. A.
46
2010
Treewidth and pathwidth of permutation graphs. Zbl 0840.05087
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter
46
1995
Approximations for \(\lambda\)-colorings of graphs. Zbl 1039.68090
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan
44
2004
Treewidth: Characterizations, applications, and computations. Zbl 1167.68404
Bodlaender, Hans L.
41
2006
Diameter increase caused by edge deletion. Zbl 0646.05038
Schoone, A. A.; Bodlaender, H. L.; van Leeuwen, J.
40
1987
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
39
2011
\(\lambda\)-coloring of graphs. Zbl 0982.05050
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan
38
2000
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract). Zbl 1345.68152
Bodlaender, Hans L.; Fellows, Michael R.; Hallett, Michael T.
37
1994
On linear time minor tests with depth-first search. Zbl 0764.68107
Bodlaender, Hans L.
36
1993
Some classes of graphs with bounded treewidth. Zbl 0684.68047
Bodlaender, H. L.
36
1988
On disjoint cycles. Zbl 0803.05030
Bodlaender, Hans L.
35
1994
Achromatic number is NP-complete for cographs and interval graphs. Zbl 0684.68046
Bodlaender, Hans L.
34
1989
Scheduling with incompatible jobs. Zbl 0822.68011
Bodlaender, Hans L.; Jansen, Klaus; Woeginger, Gerhard J.
31
1994
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Zbl 1200.05223
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.
30
2010
Safe separators for treewidth. Zbl 1084.05065
Bodlaender, Hans L.; Koster, Arie M. C. A.
29
2006
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1256.68081
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders
28
2009
Discovering treewidth. Zbl 1117.68451
Bodlaender, Hans L.
28
2005
Parallel algorithms with optimal speedup for bounded treewidth. Zbl 0907.68089
Bodlaender, Hans L.; Hagerup, Torben
28
1998
Cutwidth I: A linear time fixed parameter algorithm. Zbl 1161.68856
Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L.
27
2005
Restrictions of graph partition problems. I. Zbl 0873.68158
Bodlaender, Hans L.; Jansen, Klaus
27
1995
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
26
2016
Cutwidth II: Algorithms for partial \(w\)-trees of bounded degree. Zbl 1161.68857
Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L.
25
2005
Dynamic programming on graphs with bounded treewidth. Zbl 0649.68039
Bodlaender, Hans L.
25
1988
Treewidth for graphs with small chordality. Zbl 0895.68113
Bodlaender, Hans L.; Thilikos, Dimitrios M.
24
1997
Constructive linear time algorithms for branchwidth. Zbl 1401.05277
Bodlaender, Hans L.; Thilikos, Dimitrios M.
23
1997
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196
Jansen, Bart M. P.; Bodlaender, Hans L.
23
2013
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
22
2008
On the complexity of the maximum cut problem. Zbl 0963.68224
Bodlaender, Hans L.; Jansen, Klaus
22
2000
Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Zbl 1162.05354
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.
21
2005
Treewidth: computational experiments. Zbl 1409.05176
Koster, Arie M. C. A.; Bodlaender, Hans L.; van Hoesel, Stan P. M.
21
2001
Treewidth and minimum fill-in on \(d\)-trapezoid graphs. Zbl 0905.68101
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
21
1998
The parameterized complexity of sequence alignment and consensus. Zbl 0888.68060
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Wareham, Harold T.
19
1995
Treewidth computations. II. Lower bounds. Zbl 1220.68071
Bodlaender, Hans L.; Koster, Arie M. C. A.
19
2011
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1296.68074
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper
19
2013
Exact algorithms for dominating set. Zbl 1237.05157
Van Rooij, Johan M. M.; Bodlaender, Hans L.
19
2011
Reduction algorithms for graphs of small treewidth. Zbl 1008.05140
Bodlaender, Hans L.; van Antwerpen-de Fluiter, Babette
18
2001
Contraction and treewidth lower bounds. Zbl 1161.68644
Bodlaender, Hans L.; Wolle, Thomas; Koster, Arie M. C. A.
18
2006
Better algorithms for the pathwidth and treewidth of graphs. Zbl 0764.68108
Bodlaender, Hans L.; Kloks, Ton
17
1991
A cubic kernel for feedback vertex set and loop cutset. Zbl 1215.68170
Bodlaender, Hans L.; van Dijk, Thomas C.
17
2010
Design by measure and conquer. A faster exact algorithm for dominating set. Zbl 1259.68097
Van Rooij, Johan M. M.; Bodlaender, Hans L.
17
2008
A cubic kernel for feedback vertex set. Zbl 1186.68217
Bodlaender, Hans L.
16
2007
Equitable colorings of bounded treewidth graphs. Zbl 1086.68096
Bodlaender, Hans L.; Fomin, Fedor V.
16
2005
On the complexity of some coloring games. Zbl 0770.90098
Bodlaender, Hans L.
16
1992
Treewidth lower bounds with brambles. Zbl 1138.68065
Bodlaender, Hans L.; Grigoriev, Alexander; Koster, Arie M. C. A.
16
2008
On the complexity of scheduling incompatible jobs with unit-times. Zbl 0925.90222
Bodlaender, Hans L.; Jansen, Klaus
16
1993
A note on exact algorithms for vertex ordering problems on graphs. Zbl 1253.68164
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
16
2012
Computational complexity of norm-maximization. Zbl 0722.90080
Bodlaender, Hans L.; Gritzmann, P.; Klee, V.; van Leeuwen, J.
15
1990
Planar graph augmentation problems. Zbl 0764.68075
Kant, Goos; Bodlaender, Hans L.
15
1991
Constructive linear time algorithms for small cutwidth and carving-width. Zbl 1044.68709
Thilikos, Dimitrios M.; Serna, Maria J.; Bodlaender, Hans L.
15
2000
On intervalizing \(k\)-colored graphs for DNA physical mapping. Zbl 0867.92008
Bodlaender, Hans L.; de Fluiter, Babette
15
1996
Triangulating planar graphs while minimizing the maximum degree. Zbl 0879.68082
Kant, Goos; Bodlaender, Hans L.
15
1997
\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling. Zbl 0857.90056
Bodlaender, Hans L.; Fellows, Michael R.
15
1995
On exact algorithms for treewidth. Zbl 1131.68481
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
15
2006
On algorithms for (\(P_5\), gem)-free graphs. Zbl 1086.68050
Bodlaender, Hans L.; Brandstädt, Andreas; Kratsch, Dieter; Rao, Michaël; Spinrad, Jeremy
14
2005
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
14
2011
On exact algorithms for Treewidth. Zbl 1301.05328
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
14
2012
Linear-time register allocation for a fixed number of register. Zbl 0930.68016
Bodlaender, Hans; Gustedt, Jens; Telle, Jan Arne
13
1998
Computing the treewidth and the minimum fill-in with the modular decomposition. Zbl 1045.68151
Bodlaender, Hans L.; Rotics, Udi
12
2003
Complexity of path-forming games. Zbl 0776.90100
Bodlaender, Hans L.
12
1993
Approximating treewidth, pathwidth, and minimum elimination tree height. Zbl 0768.68121
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton
12
1992
Tree decompositions with small cost. Zbl 1084.05057
Bodlaender, Hans L.; Fomin, Fedor V.
12
2005
Graphs with branchwidth at most three. Zbl 0946.68103
Bodlaender, Hans L.; Thilikos, Dimitrios M.
12
1999
Treewidth: structure and algorithms. Zbl 1201.05076
Bodlaender, Hans L.
11
2007
Safe reduction rules for weighted treewidth. Zbl 1108.68091
van den Eijkhof, Frank; Bodlaender, Hans L.; Koster, M. C. A.
11
2007
Faster algorithms on branch and clique decompositions. Zbl 1287.05147
Bodlaender, Hans L.; van Leeuwen, Erik Jan; van Rooij, Johan M. M.; Vatshelle, Martin
11
2010
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Zbl 0945.68145
Bodlaender, Hans L.; Fellows, Michael R.; Hallett, Michael T.; Wareham, H. Todd; Warnow, Tandy J.
11
2000
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
11
2013
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092
Jansen, Bart M. P.; Bodlaender, Hans L.
11
2011
Kernel bounds for path and cycle problems. Zbl 1407.68207
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
11
2013
Approximation of pathwidth of outerplanar graphs. Zbl 1005.68113
Bodlaender, Hans L.; Fomin, Fedor V.
10
2002
The necessity of bounded treewidth for efficient inference in Bayesian networks. Zbl 1211.68275
Kwisthout, Johan H. P.; Bodlaender, Hans L.; Van Der Gaag, L. C.
10
2010
A linear kernel for planar Feedback Vertex Set. Zbl 1142.68451
Bodlaender, Hans L.; Penninkx, Eelko
10
2008
Planar capacitated dominating set is \(W[1]\)-hard. Zbl 1273.68145
Bodlaender, Hans L.; Lokshtanov, Daniel; Penninkx, Eelko
10
2009
Approximating tree width and pathwidth of some classes of perfect graphs. Zbl 0925.05052
Kloks, Ton; Bodlaender, Hans
10
1992
Isomorphism for graphs of bounded distance width. Zbl 0934.68071
Yamazaki, K.; Bodlaender, H. L.; de Fluiter, B.; Thilikos, D. M.
10
1999
Partition into triangles on bounded degree graphs. Zbl 1286.68214
van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L.
10
2013
A simple linear time algorithm for triangulating three-colored graphs. Zbl 0785.68042
Bodlaender, Hans L.; Kloks, Ton
9
1993
Domino treewidth. Zbl 0882.68106
Bodlaender, Hans L.; Engelfriet, Joost
9
1997
On interval routing schemes and treewidth. Zbl 0892.68069
Bodlaender, Hans L.; van Leeuwen, Jan; Tan, Richard; Thilikos, Dimitrios M.
9
1997
Steiner trees for hereditary graph classes: a treewidth perspective. Zbl 1477.68203
Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan
1
2021
Stable divisorial gonality is in NP. Zbl 1477.68204
Bodlaender, Hans L.; van der Wegen, Marieke; van der Zanden, Tom C.
1
2021
Recognizing hyperelliptic graphs in polynomial time. Zbl 1436.05105
Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke
1
2020
Subgraph isomorphism on graph classes that exclude a substructure. Zbl 07272773
Bodlaender, Hans L.; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C.
1
2020
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. Zbl 07294223
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C.
1
2020
Constructing tree decompositions of graphs with bounded gonality. Zbl 07336120
Bodlaender, Hans L.; van Dobben de Bruyn, Josse; Gijswijt, Dion; Smit, Harry
1
2020
On the maximum weight minimal separator. Zbl 1435.68239
Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka
4
2019
On exploring always-connected temporal graphs of small pathwidth. Zbl 1469.68072
Bodlaender, Hans L.; van der Zanden, Tom C.
4
2019
Parameterized complexity of conflict-free graph coloring. Zbl 07152208
Bodlaender, Hans L.; Kolay, Sudeshna; Pieterse, Astrid
4
2019
Stable divisorial gonality is in NP. Zbl 1444.68138
Bodlaender, Hans L.; van der Wegen, Marieke; van der Zanden, Tom C.
1
2019
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1427.68353
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; Zanden, Tom C. van der
4
2018
A faster parameterized algorithm for pseudoforest deletion. Zbl 1377.05184
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota
3
2018
Recognizing hyperelliptic graphs in polynomial time. Zbl 06982995
Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke
3
2018
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. Zbl 1393.68067
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota
2
2018
Computing treewidth on the GPU. Zbl 1443.68213
van der Zanden, Tom C.; Bodlaender, Hans L.
2
2018
Characterizing width two for variants of treewidth. Zbl 1350.05116
Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.; Kwon, O-joung; Ok, Seongmin
3
2017
A faster parameterized algorithm for pseudoforest deletion. Zbl 1398.68216
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota
3
2017
The homogeneous broadcast problem in narrow and wide strips. Zbl 1421.68113
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor
2
2017
Improved lower bounds for graph embedding problems. Zbl 1486.68123
Bodlaender, Hans L.; van der Zanden, Tom C.
2
2017
42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Zbl 1376.68011
1
2017
Cut and count and representative sets on branch decompositions. Zbl 1398.05205
Pino, Willem J. A.; Bodlaender, Hans L.; van Rooij, Johan M. M.
1
2017
On the maximum weight minimal separator. Zbl 1435.68238
Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka
1
2017
A \(c^k n\) 5-approximation algorithm for treewidth. Zbl 1333.05282
Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus S.; Fomin, Fedor V.; Lokshtanov, Daniel; Pilipczuk, Michał
82
2016
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
26
2016
Subexponential time algorithms for embedding \(H\)-minor free graphs. Zbl 1388.68103
Bodlaender, Hans L.; Nederlof, Jesper; van der Zanden, Tom C.
7
2016
Exact algorithms for intervalizing coloured graphs. Zbl 1331.05202
Bodlaender, Hans L.; van Rooij, Johan M. M.
1
2016
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1327.68126
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper
55
2015
Subexponential time algorithms for finding small tree and path decompositions. Zbl 1422.68183
Bodlaender, Hans L.; Nederlof, Jesper
5
2015
Definability equals recognizability for \(k\)-outerplanar graphs. Zbl 1378.03032
Jaffke, Lars; Bodlaender, Hans L.
5
2015
Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Zbl 1346.05249
Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne
3
2015
Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions. Zbl 1312.68230
Fafianie, Stefan; Bodlaender, Hans; Nederlof, Jesper
3
2015
Exact algorithms for Kayles. Zbl 1305.05143
Bodlaender, Hans L.; Kratsch, Dieter; Timmer, Sjoerd T.
2
2015
Google Scholar makes it hard – the complexity of organizing one’s publications. Zbl 1338.68085
Bodlaender, Hans L.; van Kreveld, Marc
1
2015
PSPACE-completeness of Bloxorz and of games with 2-buttons. Zbl 1459.68080
van der Zanden, Tom C.; Bodlaender, Hans L.
1
2015
Kernelization lower bounds by cross-composition. Zbl 1295.05222
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
99
2014
On making a distinguished vertex of minimum degree by vertex deletion. Zbl 1360.68492
Betzler, Nadja; Bodlaender, Hans L.; Bredereck, Robert; Niedermeier, Rolf; Uhlmann, Johannes
3
2014
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196
Jansen, Bart M. P.; Bodlaender, Hans L.
23
2013
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1296.68074
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper
19
2013
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
11
2013
Kernel bounds for path and cycle problems. Zbl 1407.68207
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
11
2013
Partition into triangles on bounded degree graphs. Zbl 1286.68214
van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L.
10
2013
The fine details of fast dynamic programming over tree decompositions. Zbl 1406.68067
Bodlaender, Hans L.; Bonsma, Paul; Lokshtanov, Daniel
8
2013
Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions. Zbl 1309.68209
Fafianie, Stefan; Bodlaender, Hans L.; Nederlof, Jesper
5
2013
Fixed-parameter tractability and characterizations of small special treewidth. Zbl 1400.05234
Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.
2
2013
A note on exact algorithms for vertex ordering problems on graphs. Zbl 1253.68164
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
16
2012
On exact algorithms for Treewidth. Zbl 1301.05328
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M.
14
2012
Exact algorithms for edge domination. Zbl 1264.68211
van Rooij, Johan M. M.; Bodlaender, Hans L.
9
2012
Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
9
2012
Fixed-parameter tractability of treewidth and pathwidth. Zbl 1358.68119
Bodlaender, Hans L.
6
2012
Kernel bounds for path and cycle problems. Zbl 1352.68092
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
5
2012
The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Zbl 1245.68001
4
2012
Scheduling of pipelined operator graphs. Zbl 1280.68084
Bodlaender, Hans L.; Schuurman, Petra; Woeginger, Gerhard J.
4
2012
Parameterized complexity of the spanning tree congestion problem. Zbl 1253.68163
Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; van Leeuwen, Erik Jan
4
2012
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1221.68099
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders
79
2011
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
39
2011
Treewidth computations. II. Lower bounds. Zbl 1220.68071
Bodlaender, Hans L.; Koster, Arie M. C. A.
19
2011
Exact algorithms for dominating set. Zbl 1237.05157
Van Rooij, Johan M. M.; Bodlaender, Hans L.
19
2011
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan
14
2011
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092
Jansen, Bart M. P.; Bodlaender, Hans L.
11
2011
Faster parameterized algorithms for Minimum Fill-in. Zbl 1230.68100
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
7
2011
Quadratic kernelization for convex recoloring of trees. Zbl 1234.68146
Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark
5
2011
Partition into triangles on bounded degree graphs. Zbl 1298.68119
van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L.
4
2011
The complexity of finding \(k\)th most probable explanations in probabilistic networks. Zbl 1298.68202
Kwisthout, Johan H. P.; Bodlaender, Hans L.; van der Gaag, Linda C.
3
2011
Spanning tree congestion of \(k\)-outerplanar graphs. Zbl 1223.05017
Bodlaender, Hans L.; Kozawa, Kyohei; Matsushima, Takayoshi; Otachi, Yota
3
2011
A local search algorithm for branchwidth. Zbl 1298.05304
Overwijk, Arnold; Penninkx, Eelko; Bodlaender, Hans L.
2
2011
Exact algorithms for Kayles. Zbl 1339.05251
Bodlaender, Hans L.; Kratsch, Dieter
2
2011
Exact algorithms for intervalizing colored graphs. Zbl 1325.05160
Bodlaender, Hans L.; van Rooij, Johan M. M.
1
2011
On stopping evidence gathering for diagnostic Bayesian networks. Zbl 1341.62259
van der Gaag, Linda C.; Bodlaender, Hans L.
1
2011
Treewidth computations. I: Upper bounds. Zbl 1186.68328
Bodlaender, Hans L.; Koster, Arie M. C. A.
46
2010
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Zbl 1200.05223
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V.
30
2010
A cubic kernel for feedback vertex set and loop cutset. Zbl 1215.68170
Bodlaender, Hans L.; van Dijk, Thomas C.
17
2010
Faster algorithms on branch and clique decompositions. Zbl 1287.05147
Bodlaender, Hans L.; van Leeuwen, Erik Jan; van Rooij, Johan M. M.; Vatshelle, Martin
11
2010
The necessity of bounded treewidth for efficient inference in Bayesian networks. Zbl 1211.68275
Kwisthout, Johan H. P.; Bodlaender, Hans L.; Van Der Gaag, L. C.
10
2010
Complexity results for the spanning tree congestion problem. Zbl 1308.68067
Otachi, Yota; Bodlaender, Hans L.; van Leeuwen, Erik Jan
4
2010
Clustering with partial information. Zbl 1213.05222
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances
2
2010
The valve location problem in simple network topologies. Zbl 1243.90086
Bodlaender, Hans L.; Hendriks, Albert; Grigoriev, Alexander; Grigorieva, Nadejda V.
2
2010
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
186
2009
(Meta) kernelization. Zbl 1292.68089
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M.
72
2009
Kernelization: new upper and lower bound techniques. Zbl 1273.68158
Bodlaender, Hans L.
56
2009
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157
van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter
52
2009
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1256.68081
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders
28
2009
Planar capacitated dominating set is \(W[1]\)-hard. Zbl 1273.68145
Bodlaender, Hans L.; Lokshtanov, Daniel; Penninkx, Eelko
10
2009
Derivation of algorithms for cutwidth and related graph layout parameters. Zbl 1165.68523
Bodlaender, Hans L.; Fellows, Michael R.; Thilikos, Dimitrios M.
6
2009
On the minimum corridor connection problem and other generalized geometric problems. Zbl 1200.05215
Bodlaender, Hans L.; Feremans, Corinne; Grigoriev, Alexander; Penninkx, Eelko; Sitters, René; Wolle, Thomas
5
2009
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny
22
2008
Design by measure and conquer. A faster exact algorithm for dominating set. Zbl 1259.68097
Van Rooij, Johan M. M.; Bodlaender, Hans L.
17
2008
Treewidth lower bounds with brambles. Zbl 1138.68065
Bodlaender, Hans L.; Grigoriev, Alexander; Koster, Arie M. C. A.
16
2008
A linear kernel for planar Feedback Vertex Set. Zbl 1142.68451
Bodlaender, Hans L.; Penninkx, Eelko
10
2008
Exact algorithms for edge domination. Zbl 1142.68601
van Rooij, Johan M. M.; Bodlaender, Hans L.
8
2008
A linear kernel for the \(k\)-Disjoint Cycle problem on planar graphs. Zbl 1183.68412
Bodlaender, Hans L.; Penninkx, Eelko; Tan, Richard B.
4
2008
Clustering with partial information. Zbl 1173.68596
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances
3
2008
The valve location problem in simple network topologies. Zbl 1202.90260
Bodlaender, Hans L.; Grigoriev, Alexander; Grigorieva, Nadejda V.; Hendriks, Albert
2
2008
Faster parameterized algorithms for Minimum Fill-In. Zbl 1183.05075
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve
1
2008
Algorithms for graphs embeddable with few crossings per edge. Zbl 1131.68120
Grigoriev, Alexander; Bodlaender, Hans L.
48
2007
A cubic kernel for feedback vertex set. Zbl 1186.68217
Bodlaender, Hans L.
16
2007
Treewidth: structure and algorithms. Zbl 1201.05076
Bodlaender, Hans L.
11
2007
Safe reduction rules for weighted treewidth. Zbl 1108.68091
van den Eijkhof, Frank; Bodlaender, Hans L.; Koster, M. C. A.
11
2007
Quadratic kernelization for convex recoloring of trees. Zbl 1206.68141
Bodlaender, Hans L.; Fellows, Michael R.; Langston, Michael A.; Ragan, Mark A.; Rosamond, Frances A.; Weyer, Mark
6
2007
On the maximum cardinality search lower bound for treewidth. Zbl 1119.05101
Bodlaender, Hans L.; Koster, Arie M. C. A.
3
2007
On the minimum corridor connection problem and other generalized geometric problems. Zbl 1129.90340
Bodlaender, Hans; Feremans, Corinne; Grigoriev, Alexander; Penninkx, Eelko; Sitters, René; Wolle, Thomas
2
2007
...and 130 more Documents
all top 5

Cited by 2,686 Authors

87 Bodlaender, Hans L.
79 Fomin, Fedor V.
79 Thilikos, Dimitrios M.
74 Saurabh, Saket
53 Golovach, Petr A.
52 Niedermeier, Rolf
51 Lokshtanov, Daniel
37 Fellows, Michael Ralph
37 Kratsch, Dieter
37 Paulusma, Daniël
36 Jansen, Bart M. P.
36 Pilipczuk, Marcin L.
35 Sau, Ignasi
34 Kratsch, Stefan
32 Pilipczuk, Michał
29 Otachi, Yota
29 Szeider, Stefan
27 Heggernes, Pinar
27 Marx, Dániel
25 Komusiewicz, Christian
24 Gutin, Gregory Z.
23 Chen, Jian-er
23 Cygan, Marek
23 Raman, Venkatesh
22 Guo, Jiong
22 Liedloff, Mathieu
21 Ganian, Robert
21 Kloks, Ton
21 Lampis, Michael
21 Wood, David Ronald
21 Zehavi, Meirav
20 Hermelin, Danny
20 Ono, Hirotaka
20 Panolan, Fahad
20 Paul, Christophe
20 Telle, Jan Arne
20 Van Leeuwen, Erik Jan
19 Andres, Stephan Dominique
19 Bazgan, Cristina
19 Fernau, Henning
19 Nisse, Nicolas
19 Paschos, Vangelis Th.
19 Todinca, Ioan
19 Tuza, Zsolt
19 Villanger, Yngve
18 Hanaka, Tesshu
18 Mnich, Matthias
18 Ordyniak, Sebastian
17 Montecchiani, Fabrizio
16 Kamiński, Marcin Marek
16 Kanj, Iyad A.
16 Kwon, Ojoung
16 Liotta, Giuseppe
16 Lozin, Vadim Vladislavovich
16 Misra, Neeldhara
16 Ramanujan, M. S.
15 Gurski, Frank
15 Kratochvíl, Jan
15 van Bevern, René
15 Wahlström, Magnus
15 Wang, Jianxin
15 Yeo, Anders
15 Zhu, Xuding
14 Courcelle, Bruno
14 Downey, Rodney Graham
14 Eiben, Eduard
14 Kobayashi, Yasuaki
14 Suchý, Ondřej
14 van ’t Hof, Pim
13 Bekos, Michael A.
13 Kawarabayashi, Ken-ichi
13 Kobayashi, Yusuke
13 Monnot, Jérôme
13 Rossmanith, Peter
13 Rzążewski, Paweł
12 Eppstein, David Arthur
12 Giannopoulou, Archontia C.
12 Jansen, Klaus
12 Kanté, Mamadou Moustapha
12 Nagamochi, Hiroshi
12 Nishimura, Naomi
12 Papadopoulos, Charis
12 Rosamond, Frances A.
12 Uhlmann, Johannes
12 Woltran, Stefan
12 Xia, Ge
12 Xiao, Mingyu
11 Ducoffe, Guillaume
11 Feng, Qilong
11 Gaspers, Serge
11 Hliněný, Petr
11 Hong, Seok-Hee
11 Knop, Dušan
11 Mertzios, George B.
11 Müller, Haiko
11 Nichterlein, André
11 Philip, Geevarghese
11 Scarcello, Francesco
11 Sorge, Manuel
10 Adler, Isolde
...and 2,586 more Authors
all top 5

Cited in 178 Serials

326 Discrete Applied Mathematics
321 Theoretical Computer Science
226 Algorithmica
103 Journal of Computer and System Sciences
97 Discrete Mathematics
76 Information Processing Letters
61 Journal of Combinatorial Optimization
58 SIAM Journal on Discrete Mathematics
52 Theory of Computing Systems
43 Information and Computation
38 Artificial Intelligence
32 Journal of Discrete Algorithms
28 European Journal of Combinatorics
27 Journal of Combinatorial Theory. Series B
26 Discrete Optimization
22 SIAM Journal on Computing
21 Journal of Graph Theory
17 The Electronic Journal of Combinatorics
16 Journal of Graph Algorithms and Applications
15 Computational Geometry
14 Graphs and Combinatorics
13 International Journal of Approximate Reasoning
12 Operations Research Letters
11 Computers & Operations Research
11 Annals of Operations Research
11 International Journal of Foundations of Computer Science
11 Journal of Scheduling
10 Discrete & Computational Geometry
10 Linear Algebra and its Applications
9 Networks
9 Discussiones Mathematicae. Graph Theory
8 European Journal of Operational Research
8 ACM Journal of Experimental Algorithmics
7 Combinatorica
7 Mathematical Programming. Series A. Series B
7 Computer Science Review
6 Distributed Computing
6 Algorithms
5 Acta Informatica
5 Applied Mathematics and Computation
5 Information Sciences
5 Annals of Pure and Applied Logic
5 Combinatorics, Probability and Computing
5 The Journal of Artificial Intelligence Research (JAIR)
5 Theory and Practice of Logic Programming
5 Quantum Information Processing
5 AKCE International Journal of Graphs and Combinatorics
5 Discrete Mathematics, Algorithms and Applications
5 ACM Transactions on Computation Theory
4 Order
4 Journal of Automated Reasoning
4 Applied Mathematics Letters
4 Computational Complexity
4 Annals of Mathematics and Artificial Intelligence
4 Mathematical Methods of Operations Research
4 RAIRO. Theoretical Informatics and Applications
4 RAIRO. Operations Research
4 Logical Methods in Computer Science
4 Electronic Journal of Graph Theory and Applications
4 Prikladnaya Diskretnaya Matematika
3 Acta Mathematicae Applicatae Sinica. English Series
3 International Journal of Computer Mathematics
3 Constraints
3 Journal of Discrete Mathematical Sciences & Cryptography
3 Trudy Instituta Matematiki
3 Mathematics in Computer Science
2 Indian Journal of Pure & Applied Mathematics
2 Journal of Combinatorial Theory. Series A
2 Journal of Optimization Theory and Applications
2 Random Structures & Algorithms
2 International Journal of Computational Geometry & Applications
2 SIAM Journal on Optimization
2 Computational Optimization and Applications
2 Applied Mathematics. Series B (English Edition)
2 Journal of Mathematical Sciences (New York)
2 INFORMS Journal on Computing
2 Annals of Combinatorics
2 Discrete Mathematics and Theoretical Computer Science. DMTCS
2 JMMA. Journal of Mathematical Modelling and Algorithms
2 Journal of Applied Mathematics and Computing
2 Proceedings of the Steklov Institute of Mathematics
2 Optimization Letters
2 Mathematical Programming Computation
2 Journal of Applied and Computational Topology
1 Journal of the Franklin Institute
1 Journal of Mathematical Physics
1 ACM Transactions on Mathematical Software
1 Advances in Mathematics
1 BIT
1 Computing
1 Czechoslovak Mathematical Journal
1 International Journal of Mathematics and Mathematical Sciences
1 International Journal of Game Theory
1 The Journal of Symbolic Logic
1 Kybernetika
1 Kyungpook Mathematical Journal
1 Mathematische Annalen
1 Mathematical Systems Theory
1 Mathematika
1 Naval Research Logistics
...and 78 more Serials
all top 5

Cited in 38 Fields

1,669 Computer science (68-XX)
1,637 Combinatorics (05-XX)
340 Operations research, mathematical programming (90-XX)
146 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
70 Mathematical logic and foundations (03-XX)
42 Biology and other natural sciences (92-XX)
25 Information and communication theory, circuits (94-XX)
23 Statistics (62-XX)
19 Convex and discrete geometry (52-XX)
18 Linear and multilinear algebra; matrix theory (15-XX)
12 Manifolds and cell complexes (57-XX)
9 Order, lattices, ordered algebraic structures (06-XX)
9 Probability theory and stochastic processes (60-XX)
9 Quantum theory (81-XX)
8 Algebraic geometry (14-XX)
7 Numerical analysis (65-XX)
6 Statistical mechanics, structure of matter (82-XX)
5 History and biography (01-XX)
5 Dynamical systems and ergodic theory (37-XX)
4 General and overarching topics; collections (00-XX)
4 Commutative algebra (13-XX)
4 Group theory and generalizations (20-XX)
3 General algebraic systems (08-XX)
3 Field theory and polynomials (12-XX)
3 Operator theory (47-XX)
3 Systems theory; control (93-XX)
2 Number theory (11-XX)
2 Associative rings and algebras (16-XX)
2 Functions of a complex variable (30-XX)
1 Nonassociative rings and algebras (17-XX)
1 Category theory; homological algebra (18-XX)
1 Sequences, series, summability (40-XX)
1 Approximations and expansions (41-XX)
1 Calculus of variations and optimal control; optimization (49-XX)
1 Geometry (51-XX)
1 Algebraic topology (55-XX)
1 Mechanics of particles and systems (70-XX)
1 Classical thermodynamics, heat transfer (80-XX)

Citations by Year

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.