Hans L. Bodlaender

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 99

Top Venues

Publications

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 (2024)
Hans L. Bodlaender, Krisztina Szilágyi
XNLP-hardness of Parameterized Problems on Planar Graphs. CoRR (2024)
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)
Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP (2023)
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)
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) (2023)
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC (2023)
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 (2023)
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 (2023)
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) (2023)
Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. 67 (1) (2023)
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
The Parameterised Complexity of Integer Multicommodity Flow. CoRR (2023)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
On the Complexity of Problems on Tree-Structured Graphs. IPEC (2022)
Hans L. Bodlaender
The Parameterized Complexity Binary CSP for Graphs with a Small Vertex Cover and Related Results. CoRR (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob
List Colouring Trees in Logarithmic Space. ESA (2022)
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) (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob
List Colouring Trees in Logarithmic Space. CoRR (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure. CoRR (2022)
Hans L. Bodlaender, Nils Donselaar, Johan Kwisthout
Parameterized Completeness Results for Bayesian Inference. PGM (2022)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob
On the parameterized complexity of computing tree-partitions. CoRR (2022)
Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
Problems hard for treewidth but easy for stable gonality. CoRR (2022)
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 (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
On the Complexity of Problems on Tree-structured Graphs. CoRR (2022)
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)
Hans L. Bodlaender, Nils Donselaar, Johan Kwisthout
Parameterized Complexity Results for Bayesian Inference. CoRR (2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob
On the Parameterized Complexity of Computing Tree-Partitions. IPEC (2022)
Hans L. Bodlaender
From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability. WALCOM (2022)
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) (2022)
Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
Problems Hard for Treewidth but Easy for Stable Gonality. WG (2022)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. 35 (3) (2021)
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 (2021)
Hans L. Bodlaender
Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. WG (2021)
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
Stable Divisorial Gonality is in NP. Theory Comput. Syst. 65 (2) (2021)
Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
Parameterized Complexities of Dominating and Independent Set Reconfiguration. IPEC (2021)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS (2021)
Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. WALCOM (2021)
Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
Parameterized Complexities of Dominating and Independent Set Reconfiguration. CoRR (2021)
Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR (2021)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. AAMAS (2020)
Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
Recognizing hyperelliptic graphs in polynomial time. Theor. Comput. Sci. 815 (2020)
Hans L. Bodlaender, Marieke van der Wegen
Parameterized Complexity of Scheduling Chains of Jobs with Delays. CoRR (2020)
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) (2020)
Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
Constructing Tree Decompositions of Graphs with Bounded Gonality. COCOON (2020)
Hans L. Bodlaender, Tom C. van der Zanden
On the exact complexity of polyomino packing. Theor. Comput. Sci. 839 (2020)
Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
Knot Diagrams of Treewidth Two. WG (2020)
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 (2020)
Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes. CoRR (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes. LATIN (2020)
Hans L. Bodlaender, Marieke van der Wegen
Parameterized Complexity of Scheduling Chains of Jobs with Delays. IPEC (2020)
Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
Constructing Tree Decompositions of Graphs with Bounded Gonality. CoRR (2020)
Hans L. Bodlaender
Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation. CoRR (2020)
Hans L. Bodlaender
EATCS-IPEC Nerode Prize 2020 - Call for Nominations. Bull. EATCS 130 (2020)
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) (2020)
Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
Hedonic Seat Arrangement Problems. CoRR (2020)
Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
Typical Sequences Revisited - Computing Width Parameters of Graphs. STACS (2020)
Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
Knot Diagrams of Treewidth Two. CoRR (2019)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-Free Graph Coloring. WADS (2019)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the maximum weight minimal separator. Theor. Comput. Sci. 796 (2019)
Jianer Chen, Hans L. Bodlaender, Virginia Vassilevska Williams
EATCS-IPEC Nerode Prize 2019 - Call for Nominations. Bull. EATCS 127 (2019)
Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR (2019)
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 (2019)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica 81 (7) (2019)
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
Stable Divisorial Gonality is in NP. SOFSEM (2019)
Hans L. Bodlaender, Tom C. van der Zanden
On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142 (2019)
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) (2019)
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)
Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
Parameterized Complexity of Conflict-free Graph Coloring. CoRR (2019)
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)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR (2018)
Federico D'Ambrosio, Gerard T. Barkema, Hans L. Bodlaender
Optimal data structures for stochastic driven simulations. CoRR (2018)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. 236 (2018)
Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
Stable divisorial gonality is in NP. CoRR (2018)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica 80 (7) (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS (2018)
Hans L. Bodlaender, Tom C. van der Zanden
On the Exact Complexity of Polyomino Packing. FUN (2018)
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 (2018)
Hans L. Bodlaender, Tom C. van der Zanden
On Exploring Temporal Graphs of Small Pathwidth. CoRR (2018)
Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
Recognizing Hyperelliptic Graphs in Polynomial Time. WG (2018)
Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
Fast Dynamic Programming on Graph Decompositions. CoRR (2018)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR (2017)
Tom C. van der Zanden, Hans L. Bodlaender
Computing Treewidth on the GPU. CoRR (2017)
Hans L. Bodlaender, Tom C. van der Zanden
Improved Lower Bounds for Graph Embedding Problems. CIAC (2017)
Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
On the Maximum Weight Minimal Separator. TAMC (2017)
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 (2017)
Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
Recognizing hyperelliptic graphs in polynomial time. CoRR (2017)
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 (2017)
Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS (2017)
Tom C. van der Zanden, Hans L. Bodlaender
Computing Treewidth on the GPU. IPEC (2017)
Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden
Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP (2016)
Hans L. Bodlaender, Jesper Nederlof
Subexponential time algorithms for finding small tree and path decompositions. CoRR (2016)
Hans L. Bodlaender, Tom C. van der Zanden
Improved Lower Bounds for Graph Embedding Problems. CoRR (2016)
Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
n 5-Approximation Algorithm for Treewidth. SIAM J. Comput. 45 (2) (2016)
Hans L. Bodlaender, Johan M. M. van Rooij
Exact Algorithms for Intervalizing Coloured Graphs. Theory Comput. Syst. 58 (2) (2016)
Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij
Cut and Count and Representative Sets on Branch Decompositions. IPEC (2016)
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
(Meta) Kernelization. J. ACM 63 (5) (2016)
Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren
Robust Recoverable Path Using Backup Nodes. SOFSEM (2016)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC (2016)
Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC (2016)
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) (2015)

Hans L. Bodlaender.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hans L. Bodlaender