Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDHans L. Bodlaender
Person information
- affiliation: Utrecht University, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j140]Federico D'Ambrosio
, Hans L. Bodlaender, Gerard T. Barkema:
Dynamic sampling from a discrete probability distribution with a known distribution of rates. Comput. Stat. 37(3): 1203-1228 (2022)- [c159]Hans L. Bodlaender:
From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability. WALCOM 2022: 15-25 - [i49]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure. CoRR abs/2201.13119 (2022) - [i48]Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
Problems hard for treewidth but easy for stable gonality. CoRR abs/2202.06838 (2022) - [i47]Hans L. Bodlaender, Nils Donselaar, Johan Kwisthout:
Parameterized Complexity Results for Bayesian Inference. CoRR abs/2206.07172 (2022) - [i46]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. CoRR abs/2206.09750 (2022) - [i45]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-structured Graphs. CoRR abs/2206.11828 (2022) - [i44]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the parameterized complexity of computing tree-partitions. CoRR abs/2206.11832 (2022) - 2021
- [j139]Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable Divisorial Gonality is in NP. Theory Comput. Syst. 65(2): 428-440 (2021) - [j138]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. 35(3): 2003-2038 (2021) - [j137]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867: 30-39 (2021) - [c158]Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS 2021: 193-204 - [c157]Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. IPEC 2021: 9:1-9:16 - [c156]Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender:
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. WALCOM 2021: 142-153 - [c155]Hans L. Bodlaender:
Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. WG 2021: 15-27 - [i43]Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR abs/2105.14882 (2021) - [i42]Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis:
Parameterized Complexities of Dominating and Independent Set Reconfiguration. CoRR abs/2106.15907 (2021) - 2020
- [j136]Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica 82(12): 3566-3587 (2020) - [j135]Hans L. Bodlaender:
EATCS-IPEC Nerode Prize 2020 - Call for Nominations. Bull. EATCS 130 (2020) - [j134]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. 49(6): 1291-1331 (2020) - [j133]Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
Recognizing hyperelliptic graphs in polynomial time. Theor. Comput. Sci. 815: 121-146 (2020) - [j132]Hans L. Bodlaender, Tom C. van der Zanden:
On the exact complexity of polyomino packing. Theor. Comput. Sci. 839: 13-20 (2020) - [c154]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. AAMAS 2020: 1777-1779 - [c153]Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit:
Constructing Tree Decompositions of Graphs with Bounded Gonality. COCOON 2020: 384-396 - [c152]Hans L. Bodlaender, Marieke van der Wegen:
Parameterized Complexity of Scheduling Chains of Jobs with Delays. IPEC 2020: 4:1-4:15 - [c151]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes. LATIN 2020: 613-624 - [c150]Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Computing Width Parameters of Graphs. STACS 2020: 57:1-57:16 - [c149]Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. WG 2020: 80-91 - [i41]Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden:
Hedonic Seat Arrangement Problems. CoRR abs/2002.10898 (2020) - [i40]Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen:
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR abs/2004.07492 (2020) - [i39]Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit:
Constructing Tree Decompositions of Graphs with Bounded Gonality. CoRR abs/2005.05569 (2020) - [i38]Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender:
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes. CoRR abs/2007.03859 (2020) - [i37]Hans L. Bodlaender, Marieke van der Wegen:
Parameterized Complexity of Scheduling Chains of Jobs with Delays. CoRR abs/2007.09023 (2020) - [i36]Hans L. Bodlaender:
Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation. CoRR abs/2012.01226 (2020)
2010 – 2019
- 2019
- [j131]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica 81(7): 2934-2962 (2019) - [j130]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica 81(7): 2963-2990 (2019) - [j129]Jianer Chen, Hans L. Bodlaender, Virginia Vassilevska Williams:
EATCS-IPEC Nerode Prize 2019 - Call for Nominations. Bull. EATCS 127 (2019) - [j128]Hans L. Bodlaender, Tom C. van der Zanden:
On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142: 68-71 (2019) - [j127]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the maximum weight minimal separator. Theor. Comput. Sci. 796: 294-308 (2019) - [c148]Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC 2019: 87-98 - [c147]Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable Divisorial Gonality is in NP. SOFSEM 2019: 81-93 - [c146]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-Free Graph Coloring. WADS 2019: 168-180 - [i35]Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev:
Knot Diagrams of Treewidth Two. CoRR abs/1904.03117 (2019) - [i34]Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse:
Parameterized Complexity of Conflict-free Graph Coloring. CoRR abs/1905.00305 (2019) - [i33]Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR abs/1905.03643 (2019) - [i32]Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden:
Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR abs/1905.10670 (2019) - 2018
- [j126]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica 80(7): 2160-2180 (2018) - [j125]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. 236: 42-56 (2018) - [c145]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS 2018: 450-461 - [c144]Hans L. Bodlaender, Tom C. van der Zanden:
On the Exact Complexity of Polyomino Packing. FUN 2018: 9:1-9:10 - [c143]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC 2018: 574-586 - [c142]Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
Recognizing Hyperelliptic Graphs in Polynomial Time. WG 2018: 52-64 - [i31]Federico D'Ambrosio, Gerard T. Barkema, Hans L. Bodlaender:
Optimal data structures for stochastic driven simulations. CoRR abs/1802.02379 (2018) - [i30]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden:
Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR abs/1803.10633 (2018) - [i29]Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle:
Fast Dynamic Programming on Graph Decompositions. CoRR abs/1806.01667 (2018) - [i28]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR abs/1807.06933 (2018) - [i27]Hans L. Bodlaender, Tom C. van der Zanden:
On Exploring Temporal Graphs of Small Pathwidth. CoRR abs/1807.11869 (2018) - [i26]Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden:
Stable divisorial gonality is in NP. CoRR abs/1808.06921 (2018) - 2017
- [j124]Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok:
Characterizing width two for variants of treewidth. Discret. Appl. Math. 216: 29-46 (2017) - [j123]Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle:
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb. 66: 191-234 (2017) - [c141]Hans L. Bodlaender, Tom C. van der Zanden:
Improved Lower Bounds for Graph Embedding Problems. CIAC 2017: 92-103 - [c140]Tom C. van der Zanden, Hans L. Bodlaender:
Computing Treewidth on the GPU. IPEC 2017: 29:1-29:13 - [c139]Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono:
On the Maximum Weight Minimal Separator. TAMC 2017: 304-318 - [c138]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS 2017: 289-300 - [e6]Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin:
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark. LIPIcs 83, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-046-0 [contents] - [e5]Hans L. Bodlaender, Gerhard J. Woeginger:
Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10520, Springer 2017, ISBN 978-3-319-68704-9 [contents] - [i25]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak:
The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR abs/1705.01465 (2017) - [i24]Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
Recognizing hyperelliptic graphs in polynomial time. CoRR abs/1706.05670 (2017) - [i23]Tom C. van der Zanden, Hans L. Bodlaender:
Computing Treewidth on the GPU. CoRR abs/1709.09990 (2017) - 2016
- [j122]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016) - [j121]Hans L. Bodlaender, Johan M. M. van Rooij:
Exact Algorithms for Intervalizing Coloured Graphs. Theory Comput. Syst. 58(2): 273-286 (2016) - [j120]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A ck n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45(2): 317-378 (2016) - [c137]Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden:
Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP 2016: 9:1-9:14 - [c136]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC 2016: 20:1-20:12 - [c135]Hans L. Bodlaender, Hirotaka Ono, Yota Otachi:
A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC 2016: 7:1-7:12 - [c134]Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij:
Cut and Count and Representative Sets on Branch Decompositions. IPEC 2016: 27:1-27:12 - [c133]Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren:
Robust Recoverable Path Using Backup Nodes. SOFSEM 2016: 95-106 - [r3]Hans L. Bodlaender:
Kernelization, Exponential Lower Bounds. Encyclopedia of Algorithms 2016: 1013-1017 - [r2]Hans L. Bodlaender:
Treewidth of Graphs. Encyclopedia of Algorithms 2016: 2255-2257 - [i22]Hans L. Bodlaender, Jesper Nederlof:
Subexponential time algorithms for finding small tree and path decompositions. CoRR abs/1601.02415 (2016) - [i21]Hans L. Bodlaender, Tom C. van der Zanden:
Improved Lower Bounds for Graph Embedding Problems. CoRR abs/1610.09130 (2016) - 2015
- [j119]Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica 71(3): 636-660 (2015) - [j118]Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano:
Editorial. Algorithmica 73(4): 748-749 (2015) - [j117]Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano:
Erratum to: Editorial. Algorithmica 73(4): 750 (2015) - [j116]Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle:
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. 49: 559-568 (2015) - [j115]Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243: 86-111 (2015) - [j114]Hans L. Bodlaender, Marc J. van Kreveld:
Google Scholar makes it hard - the complexity of organizing one's publications. Inf. Process. Lett. 115(12): 965-968 (2015) - [j113]Hans L. Bodlaender, Dieter Kratsch, Sjoerd T. Timmer:
Exact algorithms for Kayles. Theor. Comput. Sci. 562: 165-176 (2015) - [c132]Tom C. van der Zanden, Hans L. Bodlaender:
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. CIAC 2015: 403-415 - [c131]Hans L. Bodlaender, Jesper Nederlof:
Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. ESA 2015: 179-190 - [c130]Lars Jaffke, Hans L. Bodlaender:
Definability Equals Recognizability for k-Outerplanar Graphs. IPEC 2015: 175-186 - [c129]Chiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender:
Practical Algorithms for Linear Boolean-width. IPEC 2015: 187-198 - [i20]Lars Jaffke, Hans L. Bodlaender:
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs. CoRR abs/1503.01604 (2015) - [i19]Chiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender:
Practical Algorithms for Linear Boolean-width. CoRR abs/1509.07687 (2015) - [i18]Lars Jaffke, Hans L. Bodlaender:
Definability Equals Recognizability for $k$-Outerplanar Graphs. CoRR abs/1509.08315 (2015) - 2014
- [j112]Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica 68(3): 715-738 (2014) - [j111]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernelization Lower Bounds by Cross-Composition. SIAM J. Discret. Math. 28(1): 277-305 (2014) - [c128]Merel T. Rietbergen, Linda C. van der Gaag, Hans L. Bodlaender:
Provisional Propagation for Verifying Monotonicity of Bayesian Networks. ECAI 2014: 759-764 - [c127]Hans L. Bodlaender:
Lower Bounds for Kernelization. IPEC 2014: 1-14 - [i17]Hans L. Bodlaender, Marc J. van Kreveld:
Google Scholar makes it Hard - the complexity of organizing one's publications. CoRR abs/1410.3820 (2014) - [i16]Tom C. van der Zanden, Hans L. Bodlaender:
PSPACE-completeness of Bloxorz and of Games with 2-Buttons. CoRR abs/1411.5951 (2014) - [i15]Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov:
Graph Modification Problems (Dagstuhl Seminar 14071). Dagstuhl Reports 4(2): 38-59 (2014) - 2013
- [j110]Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender:
Partition Into Triangles on Bounded Degree Graphs. Theory Comput. Syst. 52(4): 687-718 (2013) - [j109]Bart M. P. Jansen, Hans L. Bodlaender:
Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. Theory Comput. Syst. 53(2): 263-299 (2013) - [j108]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. SIAM J. Discret. Math. 27(4): 2108-2142 (2013) - [j107]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel bounds for path and cycle problems. Theor. Comput. Sci. 511: 117-136 (2013) - [c126]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS 2013: 499-508 - [c125]Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. ICALP (1) 2013: 196-207 - [c124]Hans L. Bodlaender, Paul S. Bonsma, Daniel Lokshtanov:
The Fine Details of Fast Dynamic Programming over Tree Decompositions. IPEC 2013: 41-53 - [c123]Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. IPEC 2013: 321-334 - [c122]Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen:
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. WG 2013: 88-99 - [e4]Hans L. Bodlaender, Giuseppe F. Italiano:
Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. Lecture Notes in Computer Science 8125, Springer 2013, ISBN 978-3-642-40449-8 [contents] - [i14]Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag:
Pre-processing for Triangulation of Probabilistic Networks. CoRR abs/1301.2256 (2013) - [i13]Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk:
A O(c^k n) 5-Approximation Algorithm for Treewidth. CoRR abs/1304.6321 (2013) - [i12]Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof:
Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. CoRR abs/1305.7448 (2013) - 2012
- [j106]Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen:
Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012) - [j105]Johan M. M. van Rooij, Hans L. Bodlaender:
Exact Algorithms for Edge Domination. Algorithmica 64(4): 535-563 (2012) - [j104]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012) - [j103]Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger:
Scheduling of pipelined operator graphs. J. Sched. 15(3): 323-332 (2012) - [j102]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On exact algorithms for treewidth. ACM Trans. Algorithms 9(1): 12:1-12:23 (2012) - [j101]Hans L. Bodlaender, Jurriaan Hage:
On switching classes, NLC-width, cliquewidth and treewidth. Theor. Comput. Sci. 429: 30-35 (2012) - [c121]Hans L. Bodlaender:
Fixed-Parameter Tractability of Treewidth and Pathwidth. The Multivariate Algorithmic Revolution and Beyond 2012: 196-227 - [c120]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Structural Parameterizations of Pathwidth. SWAT 2012: 352-363 - [e3]Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx:
The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 7370, Springer 2012, ISBN 978-3-642-30890-1 [contents] - [i11]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernelization Lower Bounds By Cross-Composition. CoRR abs/1206.5941 (2012) - [i10]Linda C. van der Gaag, Hans L. Bodlaender, Ad Feelders:
Monotonicity in Bayesian Networks. CoRR abs/1207.4160 (2012)