default search action
Google
Google Scholar
Semantic Scholar
Internet Archive 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
- 2024
[j145]Hans L. Bodlaender
, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis:
Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. 300: 105195 (2024)- [c169]Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA 2024: 206-217 - [e7]Hans L. Bodlaender:
19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024, June 12-14, 2024, Helsinki, Finland. LIPIcs 294, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-318-8 [contents] - [i55]Hans L. Bodlaender, Krisztina Szilágyi:
XNLP-hardness of Parameterized Problems on Planar Graphs. CoRR abs/2402.03087 (2024) - 2023
- [j144]Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle:
Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. 67(1): 52-88 (2023) - [j143]Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers:
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs. Oper. Res. 23(1): 6 (2023) - [j142]Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay:
An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. 52(3): 740-760 (2023) - [c168]Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk:
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP 2023: 27:1-27:20 - [c167]Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen:
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC 2023: 6:1-6:19 - [c166]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13 - [i54]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR abs/2301.10031 (2023) - [i53]Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR abs/2305.01613 (2023) - [i52]Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen:
The Parameterised Complexity of Integer Multicommodity Flow. CoRR abs/2310.05784 (2023) - 2022
- [j141]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) - [j140]Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit:
Constructing tree decompositions of graphs with bounded gonality. J. Comb. Optim. 44(4): 2681-2699 (2022) - [c165]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. ESA 2022: 24:1-24:15 - [c164]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-Structured Graphs. IPEC 2022: 6:1-6:17 - [c163]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the Parameterized Complexity of Computing Tree-Partitions. IPEC 2022: 7:1-7:20 - [c162]Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima:
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC 2022: 8:1-8:18 - [c161]Hans L. Bodlaender, Nils Donselaar, Johan Kwisthout:
Parameterized Completeness Results for Bayesian Inference. PGM 2022: 145-156 - [c160]Hans L. Bodlaender:
From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability. WALCOM 2022: 15-25 - [c159]Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
Problems Hard for Treewidth but Easy for Stable Gonality. WG 2022: 84-97 - [i51]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure. CoRR abs/2201.13119 (2022) - [i50]Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen:
Problems hard for treewidth but easy for stable gonality. CoRR abs/2202.06838 (2022) - [i49]Hans L. Bodlaender, Nils Donselaar, Johan Kwisthout:
Parameterized Complexity Results for Bayesian Inference. CoRR abs/2206.07172 (2022) - [i48]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. CoRR abs/2206.09750 (2022) - [i47]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) - [i46]Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the parameterized complexity of computing tree-partitions. CoRR abs/2206.11832 (2022) - [i45]Hans L. Bodlaender:
The Parameterized Complexity Binary CSP for Graphs with a Small Vertex Cover and Related Results. CoRR abs/2208.12543 (2022) - [i44]Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers:
Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs. CoRR abs/2208.12868 (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) - [i9]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Structural Parameterizations of Pathwidth. CoRR abs/1207.4900 (2012) - [i8]Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof:
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. CoRR abs/1211.1505 (2012) - 2011
- [j100]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61(2): 362-388 (2011) - [j99]Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger:
Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011) - [j98]Johan M. M. van Rooij, Hans L. Bodlaender:
Exact algorithms for dominating set. Discret. Appl. Math. 159(17): 2147-2164 (2011) - [j97]Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi:
Spanning tree congestion of k-outerplanar graphs. Discret. Math. 311(12): 1040-1045 (2011) - [j96]Hans L. Bodlaender, Arie M. C. A. Koster:
Treewidth computations II. Lower bounds. Inf. Comput. 209(7): 1103-1119 (2011) - [j95]Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo:
Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35): 4570-4578 (2011) - [c119]Linda C. van der Gaag, Hans L. Bodlaender:
On Stopping Evidence Gathering for Diagnostic Bayesian Networks. ECSQARU 2011: 170-181 - [c118]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) 2011: 437-448 - [c117]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Path and Cycle Problems. IPEC 2011: 145-158 - [c116]Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag:
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks. SOFSEM 2011: 356-367 - [c115]Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender:
A Local Search Algorithm for Branchwidth. SOFSEM 2011: 444-454 - [c114]Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender:
Partition into Triangles on Bounded Degree Graphs. SOFSEM 2011: 558-569 - [c113]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176 - [c112]Bart M. P. Jansen, Hans L. Bodlaender:
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. STACS 2011: 177-188 - [c111]Hans L. Bodlaender, Johan M. M. van Rooij:
Exact Algorithms for Intervalizing Colored Graphs. TAPAS 2011: 45-56 - [c110]Hans L. Bodlaender, Dieter Kratsch:
Exact Algorithms for Kayles. WG 2011: 59-70 - [i7]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. CoRR abs/1104.4217 (2011) - [i6]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel Bounds for Path and Cycle Problems. CoRR abs/1106.4141 (2011) - 2010
- [j94]Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58(3): 790-810 (2010) - [j93]Hans L. Bodlaender, Arie M. C. A. Koster:
Treewidth computations I. Upper bounds. Inf. Comput. 208(3): 259-275 (2010) - [j92]Hans L. Bodlaender, Albert Hendriks, Alexander Grigoriev, Nadejda V. Grigorieva:
The Valve Location Problem in Simple Network Topologies. INFORMS J. Comput. 22(3): 433-442 (2010) - [j91]Hans L. Bodlaender, Thomas C. van Dijk:
A Cubic Kernel for Feedback Vertex Set and Loop Cutset. Theory Comput. Syst. 46(3): 566-597 (2010) - [j90]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010) - [c109]Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag:
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks. ECAI 2010: 237-242 - [c108]Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle:
Faster Algorithms on Branch and Clique Decompositions. MFCS 2010: 174-185 - [c107]Hans L. Bodlaender, Marc Comas:
A Kernel for Convex Recoloring of Weighted Forests. SOFSEM 2010: 212-223 - [c106]Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen:
Complexity Results for the Spanning Tree Congestion Problem. WG 2010: 3-14 - [i5]Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Cross-Composition: A New Technique for Kernelization Lower Bounds. CoRR abs/1011.4224 (2010) - [i4]Bart M. P. Jansen, Hans L. Bodlaender:
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. CoRR abs/1012.4701 (2010)
2000 – 2009
- 2009
- [j89]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the minimum corridor connection problem and other generalized geometric problems. Comput. Geom. 42(9): 939-951 (2009) - [j88]Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. 75(4): 231-244 (2009) - [j87]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin:
On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009) - [j86]Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. 44(2): 160-174 (2009) - [c105]Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith:
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA 2009: 566-577 - [c104]Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo:
Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646 - [c103]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. FOCS 2009: 629-638 - [c102]Hans L. Bodlaender:
Kernelization: New Upper and Lower Bound Techniques. IWPEC 2009: 17-37 - [c101]Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx:
Planar Capacitated Dominating Set Is W[1]-Hard. IWPEC 2009: 50-60 - [i3]Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos:
(Meta) Kernelization. CoRR abs/0904.0727 (2009) - 2008
- [j85]Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008) - [j84]Hans L. Bodlaender, Arie M. C. A. Koster:
Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. 51(3): 255-269 (2008) - [c100]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin:
On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574 - [c99]Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger:
Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293 - [c98]Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan:
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. ISAAC 2008: 306-317 - [c97]Hans L. Bodlaender, Eelko Penninkx:
A Linear Kernel for Planar Feedback Vertex Set. IWPEC 2008: 160-171 - [c96]Johan M. M. van Rooij, Hans L. Bodlaender:
Exact Algorithms for Edge Domination. IWPEC 2008: 214-225 - [c95]Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond:
Clustering with Partial Information. MFCS 2008: 144-155 - [c94]Johan M. M. van Rooij, Hans L. Bodlaender:
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. STACS 2008: 657-668 - [c93]Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen:
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. SWAT 2008: 102-113 - [c92]Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The Valve Location Problem in Simple Network Topologies. WG 2008: 55-65 - [r1]Hans L. Bodlaender:
Treewidth of Graphs. Encyclopedia of Algorithms 2008 - [i2]Johan M. M. van Rooij, Hans L. Bodlaender:
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. CoRR abs/0802.2827 (2008) - 2007
- [j83]Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster:
Safe Reduction Rules for Weighted Treewidth. Algorithmica 47(2): 139-158 (2007) - [j82]Alexander Grigoriev, Hans L. Bodlaender:
Algorithms for Graphs Embeddable with Few Crossings per Edge. Algorithmica 49(1): 1-11 (2007) - [j81]Hans L. Bodlaender, Arie M. C. A. Koster:
On the maximum cardinality search lower bound for treewidth. Discret. Appl. Math. 155(11): 1348-1372 (2007) - [c91]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Quadratic Kernelization for Convex Recoloring of Trees. COCOON 2007: 86-96 - [c90]Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The valve location problem. CTW 2007: 13-16 - [c89]Johan Kwisthout, Hans L. Bodlaender, Gerard Tel:
Local Monotonicity in Probabilistic Networks. ECSQARU 2007: 548-559 - [c88]Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel:
Wooden Geometric Puzzles: Design and Hardness Proofs. FUN 2007: 16-29 - [c87]Emgad H. Bachoore, Hans L. Bodlaender:
Weighted Treewidth Algorithmic Techniques and Results. ISAAC 2007: 893-903 - [c86]Hans L. Bodlaender:
Treewidth: Structure and Algorithms. SIROCCO 2007: 11-25 - [c85]Hans L. Bodlaender:
A Cubic Kernel for Feedback Vertex Set. STACS 2007: 320-331 - 2006
- [j80]Hans L. Bodlaender, Arie M. C. A. Koster:
Safe separators for treewidth. Discret. Math. 306(3): 337-350 (2006) - [j79]Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster:
Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10(1): 5-49 (2006) - [j78]Irit Katriel, Hans L. Bodlaender:
Online topological ordering. ACM Trans. Algorithms 2(3): 364-379 (2006) - [c84]Emgad H. Bachoore, Hans L. Bodlaender:
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. AAIM 2006: 255-266 - [c83]Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer:
Kernelization for Convex Recoloring. ACiD 2006: 23-35 - [c82]Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos:
On Exact Algorithms for Treewidth. ESA 2006: 672-683 - [c81]Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. WAOA 2006: 69-82 - [c80]Hans L. Bodlaender:
Treewidth: Characterizations, Applications, and Computations. WG 2006: 1-14 - [e2]Hans L. Bodlaender, Michael A. Langston:
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings. Lecture Notes in Computer Science 4169, Springer 2006, ISBN 3-540-39098-7 [contents] - 2005
- [j77]Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof:
Preprocessing Rules for Triangulation of Probabilistic Networks. Comput. Intell. 21(3): 286-305 (2005) - [j76]Hans L. Bodlaender, Fedor V. Fomin:
Tree decompositions with small cost. Discret. Appl. Math. 145(2): 143-154 (2005) - [j75]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender:
Cutwidth I: A linear time fixed parameter algorithm. J. Algorithms 56(1): 1-24 (2005) - [j74]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender:
Cutwidth II: Algorithms for partial w-trees of bounded degree. J. Algorithms 56(1): 25-49 (2005) - [j73]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
On algorithms for (P5, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005) - [j72]Hans L. Bodlaender, Fedor V. Fomin:
Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1): 22-30 (2005) - [c79]Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA 2005: 95-106 - [c78]Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster:
Treewidth Lower Bounds with Brambles. ESA 2005: 391-402 - [c77]Alexander Grigoriev, Hans L. Bodlaender:
Algorithms for Graphs Embeddable with Few Crossings Per Edge. FCT 2005: 378-387 - [c76]Irit Katriel, Hans L. Bodlaender:
Online topological ordering. SODA 2005: 443-450 - [c75]Hans L. Bodlaender:
Discovering Treewidth. SOFSEM 2005: 1-16 - [c74]Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender:
Degree-Based Treewidth Lower Bounds. WEA 2005: 101-112 - [c73]Emgad H. Bachoore, Hans L. Bodlaender:
New Upper Bound Heuristics for Treewidth. WEA 2005: 216-227 - 2004
- [j71]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004) - [j70]Hans L. Bodlaender, Gerard Tel:
A Note on Rectilinearity and Angular Resolution. J. Graph Algorithms Appl. 8: 89-94 (2004) - [j69]Hans L. Bodlaender, Jan Arne Telle:
Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. 11(4): 374-385 (2004) - [j68]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Preassigned Frequencies. SIAM J. Optim. 15(1): 1-16 (2004) - [c72]Hans L. Bodlaender, Arie M. C. A. Koster:
Safe Seperators for Treewidth. ALENEX/ANALC 2004: 70-78 - [c71]Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle:
Contraction and Treewidth Lower Bounds. ESA 2004: 628-639 - [c70]Hans L. Bodlaender, Dimitrios M. Thilikos:
Computing Small Search Numbers in Linear Time. IWPEC 2004: 37-48 - [c69]Hans L. Bodlaender, Fedor V. Fomin:
Equitable Colorings of Bounded Treewidth Graphs. MFCS 2004: 180-190 - [c68]Linda C. van der Gaag, Hans L. Bodlaender, A. J. Feelders:
Monotonicity in Bayesian Networks. UAI 2004: 569-576 - [c67]Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier:
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. WEA 2004: 87-99 - [c66]Hans L. Bodlaender, Arie M. C. A. Koster:
On the Maximum Cardinality Search Lower Bound for Treewidth. WG 2004: 81-92 - 2003
- [j67]Hans L. Bodlaender, Udi Rotics:
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003) - [j66]Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen:
Finding a bigtriangleup-regular supergraph of minimum order. Discret. Appl. Math. 131(1): 3-9 (2003) - [j65]Hans L. Bodlaender:
Necessary Edges in k-Chordalisations of Graphs. J. Comb. Optim. 7(3): 283-290 (2003) - [c65]Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad:
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. FCT 2003: 61-72 - [c64]Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos:
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS 2003: 239-248 - [e1]Hans L. Bodlaender:
Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers. Lecture Notes in Computer Science 2880, Springer 2003, ISBN 3-540-20452-0 [contents] - 2002
- [j64]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier:
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica 33(4): 461-493 (2002) - [j63]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov:
Relaxed Update and Partition Network Games. Fundam. Informaticae 49(4): 301-312 (2002) - [j62]Hans Zantema, Hans L. Bodlaender:
Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002) - [j61]Hans L. Bodlaender, Dieter Kratsch:
Kayles and Nimbers. J. Algorithms 43(1): 106-119 (2002) - [j60]Hans L. Bodlaender, Fedor V. Fomin:
Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2): 190-200 (2002) - [c63]Hans L. Bodlaender, Frank van den Eijkhof, Linda C. van der Gaag:
On the Complexity of the MPA Problem in Probabilistic Networks. ECAI 2002: 675-679 - [c62]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222 - [c61]Hans L. Bodlaender, Fedor V. Fomin:
Tree Decompositions with Small Cost. SWAT 2002: 378-387 - [c60]Hans L. Bodlaender, Udi Rotics:
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397 - [c59]Frank van den Eijkhof, Hans L. Bodlaender:
Safe Reduction Rules for Weighted Treewidth. WG 2002: 176-185 - 2001
- [j59]Hans L. Bodlaender, Babette van Antwerpen-de Fluiter:
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. Algorithmica 29(4): 534-559 (2001) - [j58]Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel:
Treewidth: Computational Experiments. Electron. Notes Discret. Math. 8: 54-57 (2001) - [j57]Hans L. Bodlaender, Babette van Antwerpen-de Fluiter:
Reduction Algorithms for Graphs of Small Treewidth. Inf. Comput. 167(2): 86-119 (2001) - [j56]Hans L. Bodlaender:
A Generic NP-hardness Proof for a Variant of Graph Coloring. J. Univers. Comput. Sci. 7(12): 1114-1124 (2001) - [c58]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender:
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. ESA 2001: 380-390 - [c57]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov:
On Game-Theoretic Models of Networks. ISAAC 2001: 550-561 - [c56]Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag:
Pre-processing for Triangulation of Probabilistic Networks. UAI 2001: 32-39 - [c55]Fedor V. Fomin, Hans L. Bodlaender:
Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176 - 2000
- [j55]Hans L. Bodlaender:
Introduction. Algorithmica 27(3): 209-211 (2000) - [j54]Hans L. Bodlaender:
The algorithmic theory of treewidth. Electron. Notes Discret. Math. 5: 27-30 (2000) - [j53]Hans Zantema, Hans L. Bodlaender:
Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. 11(2): 343-354 (2000) - [j52]Hans L. Bodlaender, Klaus Jansen:
On the Complexity of the Maximum Cut Problem. Nord. J. Comput. 7(1): 14-31 (2000) - [j51]Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy J. Warnow:
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. 244(1-2): 167-188 (2000) - [c54]Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender:
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. ISAAC 2000: 192-203 - [c53]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
lambda-Coloring of Graphs. STACS 2000: 395-406 - [c52]Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier:
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110
1990 – 1999
- 1999
- [j50]Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width. Algorithmica 24(2): 105-127 (1999) - [j49]Hans L. Bodlaender:
A note on domino treewidth. Discret. Math. Theor. Comput. Sci. 3(4): 141-150 (1999) - [j48]Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier:
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. Electron. Notes Discret. Math. 3: 19-26 (1999) - [j47]Hans L. Bodlaender, Dimitrios M. Thilikos:
Graphs with Branchwidth at Most Three. J. Algorithms 32(2): 167-194 (1999) - [c51]Herman J. Haverkort, Hans L. Bodlaender:
Finding a minimal tree in a polygon with its medial axis. CCCG 1999 - [c50]H. N. de Ridder, Hans L. Bodlaender:
Graph Automorphisms with Maximal Projection Distances. FCT 1999: 204-214 - 1998
- [j46]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller:
Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. 2(5): 1-23 (1998) - [j45]Hans L. Bodlaender, Torben Hagerup:
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM J. Comput. 27(6): 1725-1746 (1998) - [j44]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Rankings of Graphs. SIAM J. Discret. Math. 11(1): 168-181 (1998) - [j43]Hans L. Bodlaender:
A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209(1-2): 1-45 (1998) - [c49]Hans L. Bodlaender, Torben Hagerup:
Tree Decompositions of Small Diameter. MFCS 1998: 702-712 - [c48]Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle:
Linear-Time Register Allocation for a Fixed Number of Registers. SODA 1998: 574-583 - 1997
- [j42]Hans L. Bodlaender, Dimitrios M. Thilikos:
Treewidth for Graphs with Small Chordality. Discret. Appl. Math. 79(1-3): 45-61 (1997) - [j41]Goos Kant, Hans L. Bodlaender:
Triangulating Planar Graphs while Minimizing the Maximum Degree. Inf. Comput. 135(1): 1-14 (1997) - [j40]Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos:
On Interval Routing Schemes and Treewidth. Inf. Comput. 139(1): 92-109 (1997) - [j39]Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki:
It is Hard to Know when Greedy is Good for Finding Independent Sets. Inf. Process. Lett. 61(2): 101-111 (1997) - [j38]Dimitrios M. Thilikos, Hans L. Bodlaender:
Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. Inf. Process. Lett. 61(5): 227-232 (1997) - [j37]Hans L. Bodlaender, Joost Engelfriet:
Domino Treewidth. J. Algorithms 24(1): 94-123 (1997) - [c47]Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos:
Isomorphism for Graphs of Bounded Distance Width. CIAC 1997: 276-287 - [c46]Hans L. Bodlaender, Dimitrios M. Thilikos:
Constructive Linear Time Algorithms for Branchwidth. ICALP 1997: 627-637 - [c45]Hans L. Bodlaender:
Treewidth: Algorithmic Techniques and Results. MFCS 1997: 19-36 - [c44]Babette de Fluiter, Hans L. Bodlaender:
Parallel Algorithms for Treewidth Two. WG 1997: 157-170 - 1996
- [j36]Hans L. Bodlaender, Babette van Antwerpen-de Fluiter:
On Intervalizing K-colored Graphs for DNA Physical Mapping. Discret. Appl. Math. 71(1-3): 55-77 (1996) - [j35]Hans L. Bodlaender, Ton Kloks:
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. J. Algorithms 21(2): 358-402 (1996) - [j34]Hans L. Bodlaender:
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6): 1305-1317 (1996) - [c43]Hans L. Bodlaender, Babette de Fluiter:
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. COCOON 1996: 199-208 - [c42]Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans:
Finite-State Computability of Annotations of Strings and Trees. CPM 1996: 384-391 - [c41]Hans L. Bodlaender, Babette de Fluiter:
Parallel Algorithms for Series Parallel Graphs. ESA 1996: 277-289 - 1995
- [j33]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham:
Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. 11(1): 49-57 (1995) - [j32]Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks:
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. J. Algorithms 18(2): 238-255 (1995) - [j31]Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks:
Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995) - [j30]Hans L. Bodlaender, Michael R. Fellows:
W[2]-hardness of precedence constrained K-processor scheduling. Oper. Res. Lett. 18(2): 93-97 (1995) - [j29]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch:
Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discret. Math. 8(4): 606-616 (1995) - [j28]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. 147(1&2): 31-54 (1995) - [j27]Hans L. Bodlaender, Klaus Jansen:
Restrictions of Graph Partition Problems. Part I. Theor. Comput. Sci. 148(1): 93-109 (1995) - [c40]Hans L. Bodlaender, Babette de Fluiter:
Intervalizing k-Colored Graphs. ICALP 1995: 87-98 - [c39]Hans L. Bodlaender, Torben Hagerup:
Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ICALP 1995: 268-279 - [c38]Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen:
On Interval Routing Schemes and Treewidth. WG 1995: 181-196 - 1994
- [j26]Hans L. Bodlaender:
Improved Self-reduction Algorithms for Graphs with Bounded Treewidth. Discret. Appl. Math. 54(2-3): 101-115 (1994) - [j25]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. Discret. Appl. Math. 55(3): 219-232 (1994) - [j24]Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth:
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. Inf. Comput. 108(1): 34-50 (1994) - [j23]Hans L. Bodlaender:
On Disjoint Cycles. Int. J. Found. Comput. Sci. 5(1): 59-68 (1994) - [j22]Hans L. Bodlaender, Gerard Tel, Nicola Santoro:
Trade-Offs in Non-Reversing Diameter. Nord. J. Comput. 1(1): 111-134 (1994) - [c37]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham:
The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30 - [c36]Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch:
Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1994: 508 - [c35]Hans L. Bodlaender, Klaus Jansen:
On the Complexity of the Maximum Cut Problem. STACS 1994: 769-780 - [c34]Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett:
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. STOC 1994: 449-458 - [c33]Hans L. Bodlaender, Joost Engelfriet:
Domino Treewith (Extended Abstract). WG 1994: 1-13 - [c32]Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Ranking of Graphs. WG 1994: 292-304 - 1993
- [j21]Hans L. Bodlaender:
A Tourist Guide through Treewidth. Acta Cybern. 11(1-2): 1-21 (1993) - [j20]Hans L. Bodlaender:
On Linear Time Minor Tests with Depth-First Search. J. Algorithms 14(1): 1-23 (1993) - [j19]Hans L. Bodlaender, Ton Kloks:
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. J. Algorithms 15(1): 160-172 (1993) - [j18]Hans L. Bodlaender:
Book review. ZOR Methods Model. Oper. Res. 38(1): 18 (1993) - [j17]Hans L. Bodlaender, Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs. SIAM J. Discret. Math. 6(2): 181-188 (1993) - [j16]Hans L. Bodlaender:
Complexity of Path-Forming Games. Theor. Comput. Sci. 110(1): 215-245 (1993) - [c31]Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch:
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA 1993: 260-271 - [c30]Hans L. Bodlaender, Ton Kloks, Dieter Kratsch:
Treewidth and Pathwidth of Permutation Graphs. ICALP 1993: 114-125 - [c29]Hans L. Bodlaender, Klaus Jansen:
On the Complexity of Scheduling Incompatible Jobs with Unit-Times. MFCS 1993: 291-300 - [c28]Hans L. Bodlaender:
A linear time algorithm for finding tree-decompositions of small treewidth. STOC 1993: 226-234 - [c27]Hans L. Bodlaender:
On Reduction Algorithms for Graphs with Small Treewidth. WG 1993: 45-56 - [c26]Hans L. Bodlaender:
Dynamic Algorithms for Graphs with Treewidth 2. WG 1993: 112-124 - 1992
- [j15]Hans L. Bodlaender, Dieter Kratsch:
The Complexity of Coloring Games on Perfect Graphs. Theor. Comput. Sci. 106(2): 309-326 (1992) - [c25]Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow:
Two Strikes Against Perfect Phylogeny. ICALP 1992: 273-283 - [c24]Ton Kloks, Hans L. Bodlaender:
Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ISAAC 1992: 116-125 - [c23]Hans L. Bodlaender, Ton Kloks:
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. STACS 1992: 415-423 - [c22]Goos Kant, Hans L. Bodlaender:
Triangulating Planar Graphs While Minimizing the Maximum Degree. SWAT 1992: 258-271 - [c21]Ton Kloks, Hans L. Bodlaender:
Testing Superperfection of k-Trees. SWAT 1992: 292-303 - [c20]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. WG 1992: 37-49 - [c19]Hans L. Bodlaender:
Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. WG 1992: 90-102 - [i1]Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger:
Scheduling with Incompatible Jobs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-09 (1992) - 1991
- [j14]Hans L. Bodlaender:
On the Complexity of Some Coloring Games. Int. J. Found. Comput. Sci. 2(2): 133-147 (1991) - [j13]Hans L. Bodlaender:
Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors. J. Comput. Syst. Sci. 42(1): 97-118 (1991) - [j12]Hans L. Bodlaender:
New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors. Theor. Comput. Sci. 81(2): 237-256 (1991) - [c18]Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks:
Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296 - [c17]Hans L. Bodlaender, Ton Kloks:
Better Algorithms for the Pathwidth and Treewidth of Graphs. ICALP 1991: 544-555 - [c16]Goos Kant, Hans L. Bodlaender:
Planar Graph Augmentation Problems (Extended Abstract). WADS 1991: 286-298 - [c15]Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson:
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG 1991: 1-12 - [c14]Hans L. Bodlaender:
On Disjoint Cycles. WG 1991: 230-238 - 1990
- [j11]Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen:
Computational complexity of norm-maximization. Comb. 10(2): 203-225 (1990) - [j10]Hans L. Bodlaender:
The Complexity of Finding Uniform Emulations on Paths and Ring Networks. Inf. Comput. 86(1): 87-106 (1990) - [j9]Hans L. Bodlaender, Gerard Tel:
Bit-Optimal Election in Synchronous Rings. Inf. Process. Lett. 36(1): 53-56 (1990) - [j8]Hans L. Bodlaender:
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. J. Algorithms 11(4): 631-643 (1990) - [c13]Hans L. Bodlaender, Rolf H. Möhring:
The Pathwidth and Treewidth of Cographs. SWAT 1990: 301-309 - [c12]Hans L. Bodlaender:
On the Complexity of Some Coloring Games. WG 1990: 30-40
1980 – 1989
- 1989
- [j7]Hans L. Bodlaender:
Achromatic Number is NP-Complete for Cographs and Interval Graphs. Inf. Process. Lett. 31(3): 135-138 (1989) - [j6]Hans L. Bodlaender:
The Classification of Coverings of Processor Networks. J. Parallel Distributed Comput. 6(1): 166-182 (1989) - [c11]Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth:
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. FCT 1989: 58-67 - [c10]Paul Beame, Hans L. Bodlaender:
Distributed Computing on TRansitive Networks: The Thorus. STACS 1989: 294-303 - [c9]Hans L. Bodlaender:
On Linear Time Minor Tests and Depth First Search. WADS 1989: 577-590 - [c8]Hans L. Bodlaender:
Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. WG 1989: 232-244 - 1988
- [j5]Hans L. Bodlaender:
Some Classes of Graphs with Bounded Treewidth. Bull. EATCS 36: 116-125 (1988) - [j4]Hans L. Bodlaender:
A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors. Inf. Process. Lett. 27(6): 287-290 (1988) - [j3]Hans L. Bodlaender:
The Complexity of Finding Uniform Emulations on Fixed Graphs. Inf. Process. Lett. 29(3): 137-141 (1988) - [c7]Hans L. Bodlaender:
Dynamic Programming on Graphs with Bounded Treewidth. ICALP 1988: 105-118 - [c6]Hans L. Bodlaender:
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. SWAT 1988: 223-232 - [c5]Hans L. Bodlaender:
NC-Algorithms for Graphs with Small Treewidth. WG 1988: 1-10 - 1987
- [j2]Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen:
Diameter increase caused by edge deletion. J. Graph Theory 11(3): 409-427 (1987) - [c4]Hans L. Bodlaender:
New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors. GI Jahrestagung 1987: 82-88 - 1986
- [j1]Hans L. Bodlaender, Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks. Inf. Control. 71(3): 143-180 (1986) - [c3]Hans L. Bodlaender, Jan van Leeuwen:
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. STACS 1986: 119-129 - [c2]Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen:
Improved Diameter Bounds for Altered Graphs. WG 1986: 227-236 - 1985
- [c1]Hans L. Bodlaender, Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks. STACS 1985: 47-58
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
