A linear-time algorithm for finding tree-decompositions of small treewidth. Zbl 0864.68074
Bodlaender, Hans L. |
|
1996
|
A partial k-arboretum of graphs with bounded treewidth. Zbl 0912.68148
Bodlaender, Hans L. |
|
1998
|
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2009
|
A tourist guide through treewidth. Zbl 0804.68101
Bodlaender, Hans L. |
|
1993
|
Kernelization lower bounds by cross-composition. Zbl 1295.05222
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2014
|
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ł |
|
2016
|
Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Zbl 0861.68036
Bodlaender, Hans L.; Kloks, Ton |
|
1996
|
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1327.68126
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper |
|
2015
|
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Zbl 0818.68118
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton |
|
1995
|
Dynamic programming on graphs with bounded treewidth. Zbl 0649.68039
Bodlaender, Hans L. |
|
1988
|
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1221.68099
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders |
|
2011
|
(Meta) kernelization. Zbl 1292.68089
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. |
|
2009
|
Treewidth: Algorithmic techniques and results. Zbl 0941.05057
Bodlaender, Hans L. |
|
1997
|
On the complexity of some coloring games. Zbl 0753.05061
Bodlaender, Hans L. |
|
1991
|
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. |
|
2002
|
A linear time algorithm for finding tree-decompositions of small treewidth. Zbl 1310.05194
Bodlaender, Hans L. |
|
1993
|
The pathwidth and treewidth of cographs. Zbl 0773.05091
Bodlaender, Hans L.; Möhring, Rolf H. |
|
1993
|
Rankings of graphs. Zbl 0907.68137
Bodlaender, Hans L.; Deogun, Jitender S.; Jansen, Klaus; Kloks, Ton; Kratsch, Dieter; Müller, Heiko; Tuza, Zsolt |
|
1998
|
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Zbl 0716.68042
Bodlaender, Hans L. |
|
1990
|
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157
van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter |
|
2009
|
Algorithms for graphs embeddable with few crossings per edge. Zbl 1131.68120
Grigoriev, Alexander; Bodlaender, Hans L. |
|
2007
|
Kernelization: new upper and lower bound techniques. Zbl 1273.68158
Bodlaender, Hans L. |
|
2009
|
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. |
|
2016
|
Approximations for \(\lambda\)-colorings of graphs. Zbl 1039.68090
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan |
|
2004
|
Treewidth computations. I: Upper bounds. Zbl 1186.68328
Bodlaender, Hans L.; Koster, Arie M. C. A. |
|
2010
|
Treewidth: Characterizations, applications, and computations. Zbl 1167.68404
Bodlaender, Hans L. |
|
2006
|
Treewidth and pathwidth of permutation graphs. Zbl 0840.05087
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter |
|
1995
|
Diameter increase caused by edge deletion. Zbl 0646.05038
Schoone, A. A.; Bodlaender, H. L.; van Leeuwen, J. |
|
1987
|
On disjoint cycles. Zbl 0803.05030
Bodlaender, Hans L. |
|
1994
|
On linear time minor tests with depth-first search. Zbl 0764.68107
Bodlaender, Hans L. |
|
1993
|
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2011
|
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Zbl 1200.05223
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V. |
|
2010
|
Some classes of graphs with bounded treewidth. Zbl 0684.68047
Bodlaender, H. L. |
|
1988
|
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. |
|
1994
|
\(\lambda\)-coloring of graphs. Zbl 0982.05050
Bodlaender, Hans L.; Kloks, Ton; Tan, Richard B.; van Leeuwen, Jan |
|
2000
|
Parallel algorithms with optimal speedup for bounded treewidth. Zbl 0907.68089
Bodlaender, Hans L.; Hagerup, Torben |
|
1998
|
Scheduling with incompatible jobs. Zbl 0822.68011
Bodlaender, Hans L.; Jansen, Klaus; Woeginger, Gerhard J. |
|
1994
|
Safe separators for treewidth. Zbl 1084.05065
Bodlaender, Hans L.; Koster, Arie M. C. A. |
|
2006
|
Discovering treewidth. Zbl 1117.68451
Bodlaender, Hans L. |
|
2005
|
Achromatic number is NP-complete for cographs and interval graphs. Zbl 0684.68046
Bodlaender, Hans L. |
|
1989
|
Cutwidth I: A linear time fixed parameter algorithm. Zbl 1161.68856
Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L. |
|
2005
|
Constructive linear time algorithms for branchwidth. Zbl 1401.05277
Bodlaender, Hans L.; Thilikos, Dimitrios M. |
|
1997
|
Restrictions of graph partition problems. I. Zbl 0873.68158
Bodlaender, Hans L.; Jansen, Klaus |
|
1995
|
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196
Jansen, Bart M. P.; Bodlaender, Hans L. |
|
2013
|
Two strikes against perfect phylogeny. Zbl 1425.68136
Bodlaender, Hans L.; Fellows, Mike R.; Warnow, Tandy J. |
|
1992
|
On the complexity of the maximum cut problem. Zbl 0963.68224
Bodlaender, Hans L.; Jansen, Klaus |
|
2000
|
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1256.68081
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders |
|
2009
|
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2008
|
Treewidth for graphs with small chordality. Zbl 0895.68113
Bodlaender, Hans L.; Thilikos, Dimitrios M. |
|
1997
|
Cutwidth II: Algorithms for partial \(w\)-trees of bounded degree. Zbl 1161.68857
Thilikos, Dimitrios M.; Serna, Maria; Bodlaender, Hans L. |
|
2005
|
Exact algorithms for dominating set. Zbl 1237.05157
Van Rooij, Johan M. M.; Bodlaender, Hans L. |
|
2011
|
Reduction algorithms for graphs of small treewidth. Zbl 1008.05140
Bodlaender, Hans L.; van Antwerpen-de Fluiter, Babette |
|
2001
|
Treewidth computations. II. Lower bounds. Zbl 1220.68071
Bodlaender, Hans L.; Koster, Arie M. C. A. |
|
2011
|
Equitable colorings of bounded treewidth graphs. Zbl 1086.68096
Bodlaender, Hans L.; Fomin, Fedor V. |
|
2005
|
Treewidth and minimum fill-in on \(d\)-trapezoid graphs. Zbl 0905.68101
Bodlaender, Hans L.; Kloks, Ton; Kratsch, Dieter; Müller, Haiko |
|
1998
|
Treewidth: computational experiments. Zbl 1409.05176
Koster, Arie M. C. A.; Bodlaender, Hans L.; van Hoesel, Stan P. M. |
|
2001
|
On the complexity of some coloring games. Zbl 0770.90098
Bodlaender, Hans L. |
|
1992
|
\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling. Zbl 0857.90056
Bodlaender, Hans L.; Fellows, Michael R. |
|
1995
|
On the complexity of scheduling incompatible jobs with unit-times. Zbl 0925.90222
Bodlaender, Hans L.; Jansen, Klaus |
|
1993
|
A cubic kernel for feedback vertex set and loop cutset. Zbl 1215.68170
Bodlaender, Hans L.; van Dijk, Thomas C. |
|
2010
|
Better algorithms for the pathwidth and treewidth of graphs. Zbl 0764.68108
Bodlaender, Hans L.; Kloks, Ton |
|
1991
|
The parameterized complexity of sequence alignment and consensus. Zbl 0888.68060
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Wareham, Harold T. |
|
1995
|
Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Zbl 1162.05354
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V. |
|
2005
|
Linear-time register allocation for a fixed number of register. Zbl 0930.68016
Bodlaender, Hans; Gustedt, Jens; Telle, Jan Arne |
|
1998
|
Contraction and treewidth lower bounds. Zbl 1161.68644
Bodlaender, Hans L.; Wolle, Thomas; Koster, Arie M. C. A. |
|
2006
|
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1296.68074
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper |
|
2013
|
NC-algorithms for graphs with small treewidth. Zbl 1533.68211
Bodlaender, Hans L. |
|
1989
|
Kernel bounds for path and cycle problems. Zbl 1407.68207
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
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. |
|
2012
|
Approximating treewidth, pathwidth, and minimum elimination tree height. Zbl 0768.68121
Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton |
|
1992
|
Constructive linear time algorithms for small cutwidth and carving-width. Zbl 1044.68709
Thilikos, Dimitrios M.; Serna, Maria J.; Bodlaender, Hans L. |
|
2000
|
Design by measure and conquer. A faster exact algorithm for dominating set. Zbl 1259.68097
Van Rooij, Johan M. M.; Bodlaender, Hans L. |
|
2008
|
A cubic kernel for feedback vertex set. Zbl 1186.68217
Bodlaender, Hans L. |
|
2007
|
Treewidth lower bounds with brambles. Zbl 1138.68065
Bodlaender, Hans L.; Grigoriev, Alexander; Koster, Arie M. C. A. |
|
2008
|
On exact algorithms for treewidth. Zbl 1131.68481
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. |
|
2006
|
On intervalizing \(k\)-colored graphs for DNA physical mapping. Zbl 0867.92008
Bodlaender, Hans L.; de Fluiter, Babette |
|
1996
|
On exact algorithms for Treewidth. Zbl 1301.05328
Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. |
|
2012
|
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2013
|
Faster algorithms on branch and clique decompositions. Zbl 1287.05147
Bodlaender, Hans L.; van Leeuwen, Erik Jan; van Rooij, Johan M. M.; Vatshelle, Martin |
|
2010
|
Planar graph augmentation problems. Zbl 0764.68075
Kant, Goos; Bodlaender, Hans L. |
|
1991
|
Triangulating planar graphs while minimizing the maximum degree. Zbl 0879.68082
Kant, Goos; Bodlaender, Hans L. |
|
1997
|
Approximation of pathwidth of outerplanar graphs. Zbl 1005.68113
Bodlaender, Hans L.; Fomin, Fedor V. |
|
2002
|
Computational complexity of norm-maximization. Zbl 0722.90080
Bodlaender, Hans L.; Gritzmann, P.; Klee, V.; van Leeuwen, J. |
|
1990
|
Planar capacitated dominating set is \(W[1]\)-hard. Zbl 1273.68145
Bodlaender, Hans L.; Lokshtanov, Daniel; Penninkx, Eelko |
|
2009
|
On algorithms for (\(P_5\), gem)-free graphs. Zbl 1086.68050
Bodlaender, Hans L.; Brandstädt, Andreas; Kratsch, Dieter; Rao, Michaël; Spinrad, Jeremy |
|
2005
|
Graphs with branchwidth at most three. Zbl 0946.68103
Bodlaender, Hans L.; Thilikos, Dimitrios M. |
|
1999
|
Partition into triangles on bounded degree graphs. Zbl 1286.68214
van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L. |
|
2013
|
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2011
|
Kayles and Numbers. Zbl 1005.68112
Bodlaender, Hans L.; Kratsch, Dieter |
|
2002
|
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. |
|
2000
|
The fine details of fast dynamic programming over tree decompositions. Zbl 1406.68067
Bodlaender, Hans L.; Bonsma, Paul; Lokshtanov, Daniel |
|
2013
|
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092
Jansen, Bart M. P.; Bodlaender, Hans L. |
|
2011
|
Complexity of path-forming games. Zbl 0776.90100
Bodlaender, Hans L. |
|
1993
|
A linear kernel for planar Feedback Vertex Set. Zbl 1142.68451
Bodlaender, Hans L.; Penninkx, Eelko |
|
2008
|
Safe reduction rules for weighted treewidth. Zbl 1108.68091
van den Eijkhof, Frank; Bodlaender, Hans L.; Koster, M. C. A. |
|
2007
|
Treewidth: structure and algorithms. Zbl 1201.05076
Bodlaender, Hans L. |
|
2007
|
Tree decompositions with small cost. Zbl 1084.05057
Bodlaender, Hans L.; Fomin, Fedor V. |
|
2005
|
Exact algorithms for edge domination. Zbl 1264.68211
van Rooij, Johan M. M.; Bodlaender, Hans L. |
|
2012
|
A faster parameterized algorithm for pseudoforest deletion. Zbl 1377.05184
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota |
|
2018
|
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 |
|
2018
|
An ETH-tight exact algorithm for Euclidean TSP. Zbl 07693611
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Kolay, Sudeshna |
|
2023
|
Problems hard for treewidth but easy for stable gonality. Zbl 07682403
Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke |
|
2022
|
Parameterized complexities of dominating and independent set reconfiguration. Zbl 07803587
Bodlaender, Hans L.; Groenland, Carla; Swennenhuis, Céline M. F. |
|
2021
|
Parameterized complexity of conflict-free graph coloring. Zbl 1527.68154
Bodlaender, Hans L.; Kolay, Sudeshna; Pieterse, Astrid |
|
2021
|
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 |
|
2021
|
Stable divisorial gonality is in NP. Zbl 1477.68204
Bodlaender, Hans L.; van der Wegen, Marieke; van der Zanden, Tom C. |
|
2021
|
Parameterized complexity of bandwidth of caterpillars and weighted path emulation. Zbl 07538564
Bodlaender, Hans L. |
|
2021
|
Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes. Zbl 07405958
Saitoh, Toshiki; Yoshinaka, Ryo; Bodlaender, Hans L. |
|
2021
|
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. Zbl 1497.68375
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C. |
|
2020
|
Typical sequences revisited – computing width parameters of graphs. Zbl 07650942
Bodlaender, Hans L.; Jaffke, Lars; Telle, Jan Arne |
|
2020
|
Subgraph isomorphism on graph classes that exclude a substructure. Zbl 1492.68102
Bodlaender, Hans L.; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C. |
|
2020
|
Parameterized complexity of scheduling chains of jobs with delays. Zbl 07764095
Bodlaender, Hans L.; van der Wegen, Marieke |
|
2020
|
Constructing tree decompositions of graphs with bounded gonality. Zbl 07336120
Bodlaender, Hans L.; van Dobben de Bruyn, Josse; Gijswijt, Dion; Smit, Harry |
|
2020
|
Recognizing hyperelliptic graphs in polynomial time. Zbl 1436.05105
Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke |
|
2020
|
Steiner trees for hereditary graph classes. Zbl 07600807
Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan |
|
2020
|
Knot diagrams of treewidth two. Zbl 07636197
Bodlaender, Hans L.; Burton, Benjamin; Fomin, Fedor V.; Grigoriev, Alexander |
|
2020
|
On exploring always-connected temporal graphs of small pathwidth. Zbl 1469.68072
Bodlaender, Hans L.; van der Zanden, Tom C. |
|
2019
|
On the maximum weight minimal separator. Zbl 1435.68239
Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka |
|
2019
|
Parameterized complexity of conflict-free graph coloring. Zbl 1528.68273
Bodlaender, Hans L.; Kolay, Sudeshna; Pieterse, Astrid |
|
2019
|
Stable divisorial gonality is in NP. Zbl 1444.68138
Bodlaender, Hans L.; van der Wegen, Marieke; van der Zanden, Tom C. |
|
2019
|
Subgraph isomorphism on graph classes that exclude a substructure. Zbl 1525.68092
Bodlaender, Hans L.; Hanaka, Tesshu; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C. |
|
2019
|
A faster parameterized algorithm for pseudoforest deletion. Zbl 1377.05184
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota |
|
2018
|
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 |
|
2018
|
Recognizing hyperelliptic graphs in polynomial time. Zbl 1517.68276
Bodewes, Jelco M.; Bodlaender, Hans L.; Cornelissen, Gunther; van der Wegen, Marieke |
|
2018
|
Computing treewidth on the GPU. Zbl 1443.68213
van der Zanden, Tom C.; Bodlaender, Hans L. |
|
2018
|
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. Zbl 1393.68067
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota |
|
2018
|
On the exact complexity of polyomino packing. Zbl 1453.68091
Bodlaender, Hans L.; van der Zanden, Tom C. |
|
2018
|
A faster parameterized algorithm for pseudoforest deletion. Zbl 1398.68216
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota |
|
2017
|
Characterizing width two for variants of treewidth. Zbl 1350.05116
Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C.; Kwon, O-joung; Ok, Seongmin |
|
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. |
|
2017
|
Improved lower bounds for graph embedding problems. Zbl 1486.68123
Bodlaender, Hans L.; van der Zanden, Tom C. |
|
2017
|
The homogeneous broadcast problem in narrow and wide strips. Zbl 1421.68113
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor |
|
2017
|
42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Zbl 1376.68011
|
|
2017
|
On the maximum weight minimal separator. Zbl 1435.68238
Hanaka, Tesshu; Bodlaender, Hans L.; van der Zanden, Tom C.; Ono, Hirotaka |
|
2017
|
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees. Zbl 1369.05048
Jaffke, Lars; Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne |
|
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ł |
|
2016
|
(Meta) kernelization. Zbl 1425.68137
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. |
|
2016
|
Subexponential time algorithms for embedding \(H\)-minor free graphs. Zbl 1388.68103
Bodlaender, Hans L.; Nederlof, Jesper; van der Zanden, Tom C. |
|
2016
|
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. Zbl 1388.68104
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota |
|
2016
|
Exact algorithms for intervalizing coloured graphs. Zbl 1331.05202
Bodlaender, Hans L.; van Rooij, Johan M. M. |
|
2016
|
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1327.68126
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper |
|
2015
|
PSPACE-completeness of Bloxorz and of games with 2-buttons. Zbl 1459.68080
van der Zanden, Tom C.; Bodlaender, Hans L. |
|
2015
|
Definability equals recognizability for \(k\)-outerplanar graphs. Zbl 1378.03032
Jaffke, Lars; Bodlaender, Hans L. |
|
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 |
|
2015
|
Subexponential time algorithms for finding small tree and path decompositions. Zbl 1422.68183
Bodlaender, Hans L.; Nederlof, Jesper |
|
2015
|
Recognizability equals definability for graphs of bounded treewidth and bounded chordality. Zbl 1346.05249
Bodlaender, Hans L.; Heggernes, Pinar; Telle, Jan Arne |
|
2015
|
Exact algorithms for Kayles. Zbl 1305.05143
Bodlaender, Hans L.; Kratsch, Dieter; Timmer, Sjoerd T. |
|
2015
|
Google Scholar makes it hard – the complexity of organizing one’s publications. Zbl 1338.68085
Bodlaender, Hans L.; van Kreveld, Marc |
|
2015
|
Kernelization lower bounds by cross-composition. Zbl 1295.05222
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
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 |
|
2014
|
Lower bounds for kernelization. Zbl 1456.68063
Bodlaender, Hans L. |
|
2014
|
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter. Zbl 1286.68196
Jansen, Bart M. P.; Bodlaender, Hans L. |
|
2013
|
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Zbl 1296.68074
Bodlaender, Hans L.; Cygan, Marek; Kratsch, Stefan; Nederlof, Jesper |
|
2013
|
Kernel bounds for path and cycle problems. Zbl 1407.68207
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2013
|
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1290.05143
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2013
|
Partition into triangles on bounded degree graphs. Zbl 1286.68214
van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L. |
|
2013
|
The fine details of fast dynamic programming over tree decompositions. Zbl 1406.68067
Bodlaender, Hans L.; Bonsma, Paul; Lokshtanov, Daniel |
|
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 |
|
2013
|
Fixed-parameter tractability and characterizations of small special treewidth. Zbl 1400.05234
Bodlaender, Hans L.; Kratsch, Stefan; Kreuzen, Vincent J. C. |
|
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. |
|
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. |
|
2012
|
Exact algorithms for edge domination. Zbl 1264.68211
van Rooij, Johan M. M.; Bodlaender, Hans L. |
|
2012
|
Kernel bounds for structural parameterizations of pathwidth. Zbl 1357.68078
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
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 |
|
2012
|
Fixed-parameter tractability of treewidth and pathwidth. Zbl 1358.68119
Bodlaender, Hans L. |
|
2012
|
Kernel bounds for path and cycle problems. Zbl 1352.68092
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2012
|
Scheduling of pipelined operator graphs. Zbl 1280.68084
Bodlaender, Hans L.; Schuurman, Petra; Woeginger, Gerhard J. |
|
2012
|
The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Zbl 1245.68001
|
|
2012
|
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1221.68099
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders |
|
2011
|
Cross-composition: a new technique for kernelization lower bounds. Zbl 1230.68085
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2011
|
Exact algorithms for dominating set. Zbl 1237.05157
Van Rooij, Johan M. M.; Bodlaender, Hans L. |
|
2011
|
Treewidth computations. II. Lower bounds. Zbl 1220.68071
Bodlaender, Hans L.; Koster, Arie M. C. A. |
|
2011
|
Preprocessing for treewidth: a combinatorial analysis through kernelization. Zbl 1333.68204
Bodlaender, Hans L.; Jansen, Bart M. P.; Kratsch, Stefan |
|
2011
|
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. Zbl 1230.68092
Jansen, Bart M. P.; Bodlaender, Hans L. |
|
2011
|
Faster parameterized algorithms for Minimum Fill-in. Zbl 1230.68100
Bodlaender, Hans L.; Heggernes, Pinar; Villanger, Yngve |
|
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 |
|
2011
|
Spanning tree congestion of \(k\)-outerplanar graphs. Zbl 1223.05017
Bodlaender, Hans L.; Kozawa, Kyohei; Matsushima, Takayoshi; Otachi, Yota |
|
2011
|
Partition into triangles on bounded degree graphs. Zbl 1298.68119
van Rooij, Johan M. M.; van Kooten Niekerk, Marcel E.; Bodlaender, Hans L. |
|
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. |
|
2011
|
Exact algorithms for Kayles. Zbl 1339.05251
Bodlaender, Hans L.; Kratsch, Dieter |
|
2011
|
A local search algorithm for branchwidth. Zbl 1298.05304
Overwijk, Arnold; Penninkx, Eelko; Bodlaender, Hans L. |
|
2011
|
On stopping evidence gathering for diagnostic Bayesian networks. Zbl 1341.62259
van der Gaag, Linda C.; Bodlaender, Hans L. |
|
2011
|
Exact algorithms for intervalizing colored graphs. Zbl 1325.05160
Bodlaender, Hans L.; van Rooij, Johan M. M. |
|
2011
|
Treewidth computations. I: Upper bounds. Zbl 1186.68328
Bodlaender, Hans L.; Koster, Arie M. C. A. |
|
2010
|
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Zbl 1200.05223
Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor V. |
|
2010
|
A cubic kernel for feedback vertex set and loop cutset. Zbl 1215.68170
Bodlaender, Hans L.; van Dijk, Thomas C. |
|
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 |
|
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. |
|
2010
|
Complexity results for the spanning tree congestion problem. Zbl 1308.68067
Otachi, Yota; Bodlaender, Hans L.; van Leeuwen, Erik Jan |
|
2010
|
Clustering with partial information. Zbl 1213.05222
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Federico; Papadopoulos, Charis; Rosamond, Frances |
|
2010
|
The valve location problem in simple network topologies. Zbl 1243.90086
Bodlaender, Hans L.; Hendriks, Albert; Grigoriev, Alexander; Grigorieva, Nadejda V. |
|
2010
|
On problems without polynomial kernels. Zbl 1192.68288
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2009
|
(Meta) kernelization. Zbl 1292.68089
Bodlaender, Hans L.; Fomin, Fedor V.; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. |
|
2009
|
Dynamic programming on tree decompositions using generalised fast subset convolution. Zbl 1256.68157
van Rooij, Johan M. M.; Bodlaender, Hans L.; Rossmanith, Peter |
|
2009
|
Kernelization: new upper and lower bound techniques. Zbl 1273.68158
Bodlaender, Hans L. |
|
2009
|
Kernel bounds for disjoint cycles and disjoint paths. Zbl 1256.68081
Bodlaender, Hans L.; Thomassé, Stéphan; Yeo, Anders |
|
2009
|
Planar capacitated dominating set is \(W[1]\)-hard. Zbl 1273.68145
Bodlaender, Hans L.; Lokshtanov, Daniel; Penninkx, Eelko |
|
2009
|
Derivation of algorithms for cutwidth and related graph layout parameters. Zbl 1165.68523
Bodlaender, Hans L.; Fellows, Michael R.; Thilikos, Dimitrios M. |
|
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 |
|
2009
|
On problems without polynomial kernels (extended abstract). Zbl 1153.68554
Bodlaender, Hans L.; Downey, Rodney G.; Fellows, Michael R.; Hermelin, Danny |
|
2008
|
...and 157 more Documents |