Hans L. Bodlaender

397 papers A* 19A 32B 86C 10Misc 5Journal 212Unranked 27

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. SODA Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen
2026	J	`jnl`	Parameterized Complexities of Dominating and Independent Set Reconfiguration. Algorithmica Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
2026	J	`jnl`	Trade-off between spread and width for tree decompositions. CoRR Hans L. Bodlaender, Carla Groenland
2026	J	`jnl`	XALP-completeness of parameterized problems on planar graphs. Discret. Appl. Math. Hans L. Bodlaender, Krisztina Szilágyi
2025	A	`conf`	A Sketch of Parameterized Complexity (Invited Talk). GD Hans L. Bodlaender
2025	J	`jnl`	Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. J. Comput. Syst. Sci. Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	B	`conf`	Concurrency Constrained Scheduling with Tree-Like Constraints. WG Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
2025	J	`jnl`	Concurrency Constrained Scheduling with Tree-Like Constraints. CoRR Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen
2025	B	`conf`	Deterministically Counting k-Paths and Trees Parameterized by Treewidth in Single-Exponential Time. IPEC Jonne Visser, Hans L. Bodlaender
2025	J	`jnl`	Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. CoRR Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen
2025	J	`jnl`	Hedonic seat arrangement problems. Auton. Agents Multi Agent Syst. Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2025	J	`jnl`	On Equivalent Characterizations of NP in Abstract Models of Computation. CoRR Jeremy C. Kirn, Lucas Meijer, Tillmann Miltzow, Hans L. Bodlaender
2025	J	`jnl`	On Stable Cutsets in General and Minimum Degree Constrained Graphs. CoRR Mats Vroon, Hans L. Bodlaender
2025	J	`jnl`	Treewidth is NP-Complete on Cubic Graphs. Electron. J. Comb. Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2025	J	`jnl`	XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. Algorithmica Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima
2024	—	`ed.`	19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024, Helsinki, Finland, June 12-14, 2024 SWAT Hans L. Bodlaender
2024	B	`conf`	Approximation Algorithms for Treewidth, Pathwidth, and Treedepth - A Short Survey. WG Hans L. Bodlaender
2024	C	`conf`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	J	`jnl`	On the parameterized complexity of computing tree-partitions. Discret. Math. Theor. Comput. Sci. Hans L. Bodlaender, Carla Groenland, Hugo Jacob
2024	J	`jnl`	Parameterized problems complete for nondeterministic FPT time and logarithmic space. Inf. Comput. Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
2024	B	`conf`	XNLP-Hardness of Parameterized Problems on Planar Graphs. WG Hans L. Bodlaender, Krisztina Szilágyi
2024	J	`jnl`	XNLP-hardness of Parameterized Problems on Planar Graphs. CoRR Hans L. Bodlaender, Krisztina Szilágyi
2023	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Efficiently computing the Shapley value of connectivity games in low-treewidth graphs. Oper. Res. Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers
2023	A*	`conf`	Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. ICALP Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk
2023	B	`conf`	The Parameterised Complexity Of Integer Multicommodity Flow. IPEC Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2023	J	`jnl`	The Parameterised Complexity of Integer Multicommodity Flow. CoRR Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2023	B	`conf`	Treewidth Is NP-Complete on Cubic Graphs. IPEC Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023	J	`jnl`	Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý
2023	J	`jnl`	Typical Sequences Revisited - Computing Width Parameters of Graphs. Theory Comput. Syst. Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
2022	J	`jnl`	Constructing tree decompositions of graphs with bounded gonality. J. Comb. Optim. Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
2022	J	`jnl`	Dynamic sampling from a discrete probability distribution with a known distribution of rates. Comput. Stat. Federico D'Ambrosio, Hans L. Bodlaender, Gerard T. Barkema
2022	J	`jnl`	Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs. CoRR Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers
2022	B	`conf`	From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability. WALCOM Hans L. Bodlaender
2022	A	`conf`	List Colouring Trees in Logarithmic Space. ESA Hans L. Bodlaender, Carla Groenland, Hugo Jacob
2022	J	`jnl`	List Colouring Trees in Logarithmic Space. CoRR Hans L. Bodlaender, Carla Groenland, Hugo Jacob
2022	B	`conf`	On the Complexity of Problems on Tree-Structured Graphs. IPEC Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
2022	J	`jnl`	On the Complexity of Problems on Tree-structured Graphs. CoRR Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk
2022	B	`conf`	On the Parameterized Complexity of Computing Tree-Partitions. IPEC Hans L. Bodlaender, Carla Groenland, Hugo Jacob
2022	J	`jnl`	On the parameterized complexity of computing tree-partitions. CoRR Hans L. Bodlaender, Carla Groenland, Hugo Jacob
2022	—	`conf`	Parameterized Completeness Results for Bayesian Inference. PGM Hans L. Bodlaender, Nils Donselaar, Johan Kwisthout
2022	J	`jnl`	Parameterized Complexity Results for Bayesian Inference. CoRR Hans L. Bodlaender, Nils Donselaar, Johan Kwisthout
2022	B	`conf`	Problems Hard for Treewidth but Easy for Stable Gonality. WG Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
2022	J	`jnl`	Problems hard for treewidth but easy for stable gonality. CoRR Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
2022	J	`jnl`	The Parameterized Complexity Binary CSP for Graphs with a Small Vertex Cover and Related Results. CoRR Hans L. Bodlaender
2022	B	`conf`	XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. IPEC Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima
2022	J	`jnl`	XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure. CoRR Hans L. Bodlaender, Carla Groenland, Hugo Jacob
2021	B	`conf`	Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. WALCOM Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
2021	B	`conf`	Parameterized Complexities of Dominating and Independent Set Reconfiguration. IPEC Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
2021	J	`jnl`	Parameterized Complexities of Dominating and Independent Set Reconfiguration. CoRR Hans L. Bodlaender, Carla Groenland, Céline M. F. Swennenhuis
2021	B	`conf`	Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. WG Hans L. Bodlaender
2021	J	`jnl`	Parameterized Complexity of Conflict-Free Graph Coloring. SIAM J. Discret. Math. Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2021	A*	`conf`	Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. FOCS Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
2021	J	`jnl`	Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. CoRR Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Céline M. F. Swennenhuis
2021	J	`jnl`	Stable Divisorial Gonality is in NP. Theory Comput. Syst. Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
2021	J	`jnl`	Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs. SIAM J. Comput. Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2020	Misc	`conf`	Constructing Tree Decompositions of Graphs with Bounded Gonality. COCOON Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
2020	J	`jnl`	Constructing Tree Decompositions of Graphs with Bounded Gonality. CoRR Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit
2020	J	`jnl`	EATCS-IPEC Nerode Prize 2020 - Call for Nominations. Bull. EATCS Hans L. Bodlaender
2020	J	`jnl`	Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes. CoRR Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
2020	A	`conf`	Hedonic Seat Arrangement Problems. AAMAS Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020	J	`jnl`	Hedonic Seat Arrangement Problems. CoRR Hans L. Bodlaender, Tesshu Hanaka, Lars Jaffke, Hirotaka Ono, Yota Otachi, Tom C. van der Zanden
2020	B	`conf`	Knot Diagrams of Treewidth Two. WG Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
2020	J	`jnl`	On the exact complexity of polyomino packing. Theor. Comput. Sci. Hans L. Bodlaender, Tom C. van der Zanden
2020	B	`conf`	Parameterized Complexity of Scheduling Chains of Jobs with Delays. IPEC Hans L. Bodlaender, Marieke van der Wegen
2020	J	`jnl`	Parameterized Complexity of Scheduling Chains of Jobs with Delays. CoRR Hans L. Bodlaender, Marieke van der Wegen
2020	J	`jnl`	Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation. CoRR Hans L. Bodlaender
2020	J	`jnl`	Recognizing hyperelliptic graphs in polynomial time. Theor. Comput. Sci. Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
2020	B	`conf`	Steiner Trees for Hereditary Graph Classes. LATIN Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2020	A	`conf`	Typical Sequences Revisited - Computing Width Parameters of Graphs. STACS Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
2019	J	`jnl`	EATCS-IPEC Nerode Prize 2019 - Call for Nominations. Bull. EATCS Jianer Chen, Hans L. Bodlaender, Virginia Vassilevska Williams
2019	J	`jnl`	Knot Diagrams of Treewidth Two. CoRR Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev
2019	J	`jnl`	On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. Hans L. Bodlaender, Tom C. van der Zanden
2019	J	`jnl`	On the maximum weight minimal separator. Theor. Comput. Sci. Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2019	B	`conf`	Parameterized Complexity of Conflict-Free Graph Coloring. WADS Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2019	J	`jnl`	Parameterized Complexity of Conflict-free Graph Coloring. CoRR Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse
2019	B	`conf`	Stable Divisorial Gonality is in NP. SOFSEM Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
2019	C	`conf`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CIAC Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	J	`jnl`	Subgraph Isomorphism on Graph Classes that Exclude a Substructure. CoRR Hans L. Bodlaender, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden
2019	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2019	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2019	J	`jnl`	Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs. CoRR Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
2018	J	`jnl`	A faster parameterized algorithm for Pseudoforest Deletion. Discret. Appl. Math. Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2018	A*	`conf`	A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. STOC Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	A*	`conf`	An ETH-Tight Exact Algorithm for Euclidean TSP. FOCS Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Sudeshna Kolay
2018	J	`jnl`	Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2018	J	`jnl`	Fast Dynamic Programming on Graph Decompositions. CoRR Johan M. M. van Rooij, Hans L. Bodlaender, Erik Jan van Leeuwen, Peter Rossmanith, Martin Vatshelle
2018	J	`jnl`	Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
2018	J	`jnl`	On Exploring Temporal Graphs of Small Pathwidth. CoRR Hans L. Bodlaender, Tom C. van der Zanden
2018	Misc	`conf`	On the Exact Complexity of Polyomino Packing. FUN Hans L. Bodlaender, Tom C. van der Zanden
2018	J	`jnl`	Optimal data structures for stochastic driven simulations. CoRR Federico D'Ambrosio, Gerard T. Barkema, Hans L. Bodlaender
2018	B	`conf`	Recognizing Hyperelliptic Graphs in Polynomial Time. WG Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
2018	J	`jnl`	Stable divisorial gonality is in NP. CoRR Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden
2017	B	`ed.`	42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, August 21-25, 2017 MFCS Kim G. Larsen, Hans L. Bodlaender, Jean-François Raskin
2017	J	`jnl`	Characterizing width two for variants of treewidth. Discret. Appl. Math. Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok
2017	B	`conf`	Computing Treewidth on the GPU. IPEC Tom C. van der Zanden, Hans L. Bodlaender
2017	J	`jnl`	Computing Treewidth on the GPU. CoRR Tom C. van der Zanden, Hans L. Bodlaender
2017	J	`jnl`	Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. Eur. J. Comb. Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
2017	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers WG Hans L. Bodlaender, Gerhard J. Woeginger
2017	C	`conf`	Improved Lower Bounds for Graph Embedding Problems. CIAC Hans L. Bodlaender, Tom C. van der Zanden
2017	C	`conf`	On the Maximum Weight Minimal Separator. TAMC Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono
2017	J	`jnl`	Recognizing hyperelliptic graphs in polynomial time. CoRR Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen
2017	B	`conf`	The Homogeneous Broadcast Problem in Narrow and Wide Strips. WADS Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2017	J	`jnl`	The Homogeneous Broadcast Problem in Narrow and Wide Strips. CoRR Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak
2016	J	`jnl`	(Meta) Kernelization. J. ACM Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2016	B	`conf`	A Faster Parameterized Algorithm for Pseudoforest Deletion. IPEC Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2016	J	`jnl`	A c SIAM J. Comput. Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2016	B	`conf`	Cut and Count and Representative Sets on Branch Decompositions. IPEC Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij
2016	B	`conf`	Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. ISAAC Hans L. Bodlaender, Hirotaka Ono, Yota Otachi
2016	J	`jnl`	Exact Algorithms for Intervalizing Coloured Graphs. Theory Comput. Syst. Hans L. Bodlaender, Johan M. M. van Rooij
2016	J	`jnl`	Improved Lower Bounds for Graph Embedding Problems. CoRR Hans L. Bodlaender, Tom C. van der Zanden
2016	—	`ch.`	Kernelization, Exponential Lower Bounds. Encyclopedia of Algorithms Hans L. Bodlaender
2016	B	`conf`	Robust Recoverable Path Using Backup Nodes. SOFSEM Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren
2016	A*	`conf`	Subexponential Time Algorithms for Embedding H-Minor Free Graphs. ICALP Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden
2016	J	`jnl`	Subexponential time algorithms for finding small tree and path decompositions. CoRR Hans L. Bodlaender, Jesper Nederlof
2016	—	`ch.`	Treewidth of Graphs. Encyclopedia of Algorithms Hans L. Bodlaender
2015	J	`jnl`	Definability Equals Recognizability for $k$-Outerplanar Graphs. CoRR Lars Jaffke, Hans L. Bodlaender
2015	B	`conf`	Definability Equals Recognizability for k-Outerplanar Graphs. IPEC Lars Jaffke, Hans L. Bodlaender
2015	J	`jnl`	Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
2015	J	`jnl`	Editorial. Algorithmica Hans L. Bodlaender, MohammadTaghi Hajiaghayi, Giuseppe F. Italiano
2015	J	`jnl`	Erratum to: Editorial. Algorithmica Hans L. Bodlaender, Mohammad Taghi Hajiaghayi, Giuseppe F. Italiano
2015	J	`jnl`	Exact algorithms for Kayles. Theor. Comput. Sci. Hans L. Bodlaender, Dieter Kratsch, Sjoerd T. Timmer
2015	J	`jnl`	Google Scholar makes it hard - the complexity of organizing one's publications. Inf. Process. Lett. Hans L. Bodlaender, Marc J. van Kreveld
2015	J	`jnl`	MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs. CoRR Lars Jaffke, Hans L. Bodlaender
2015	C	`conf`	PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. CIAC Tom C. van der Zanden, Hans L. Bodlaender
2015	B	`conf`	Practical Algorithms for Linear Boolean-width. IPEC Chiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender
2015	J	`jnl`	Practical Algorithms for Linear Boolean-width. CoRR Chiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender
2015	J	`jnl`	Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electron. Notes Discret. Math. Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle
2015	J	`jnl`	Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
2015	A	`conf`	Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. ESA Hans L. Bodlaender, Jesper Nederlof
2014	J	`jnl`	Google Scholar makes it Hard - the complexity of organizing one's publications. CoRR Hans L. Bodlaender, Marc J. van Kreveld
2014	J	`jnl`	Graph Modification Problems (Dagstuhl Seminar 14071). Dagstuhl Reports Hans L. Bodlaender, Pinar Heggernes, Daniel Lokshtanov
2014	J	`jnl`	Kernelization Lower Bounds by Cross-Composition. SIAM J. Discret. Math. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2014	B	`conf`	Lower Bounds for Kernelization. IPEC Hans L. Bodlaender
2014	J	`jnl`	On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann
2014	J	`jnl`	PSPACE-completeness of Bloxorz and of Games with 2-Buttons. CoRR Tom C. van der Zanden, Hans L. Bodlaender
2014	A	`conf`	Provisional Propagation for Verifying Monotonicity of Bayesian Networks. ECAI Merel T. Rietbergen, Linda C. van der Gaag, Hans L. Bodlaender
2013	J	`jnl`	A O(c^k n) 5-Approximation Algorithm for Treewidth CoRR Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	A	`ed.`	Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings ESA Hans L. Bodlaender, Giuseppe F. Italiano
2013	A*	`conf`	An O(c^k n) 5-Approximation Algorithm for Treewidth. FOCS Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk
2013	—	`conf`	Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. ICALP (1) Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
2013	B	`conf`	Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. WG Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen
2013	J	`jnl`	Kernel bounds for path and cycle problems. Theor. Comput. Sci. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2013	J	`jnl`	Partition Into Triangles on Bounded Degree Graphs. Theory Comput. Syst. Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
2013	J	`jnl`	Pre-processing for Triangulation of Probabilistic Networks CoRR Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
2013	J	`jnl`	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. SIAM J. Discret. Math. Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2013	B	`conf`	Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. IPEC Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
2013	J	`jnl`	Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. CoRR Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
2013	B	`conf`	The Fine Details of Fast Dynamic Programming over Tree Decompositions. IPEC Hans L. Bodlaender, Paul S. Bonsma, Daniel Lokshtanov
2013	J	`jnl`	Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. Theory Comput. Syst. Bart M. P. Jansen, Hans L. Bodlaender
2012	J	`jnl`	A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	J	`jnl`	Exact Algorithms for Edge Domination. Algorithmica Johan M. M. van Rooij, Hans L. Bodlaender
2012	—	`conf`	Fixed-Parameter Tractability of Treewidth and Pathwidth. The Multivariate Algorithmic Revolution and Beyond Hans L. Bodlaender
2012	J	`jnl`	Kernel Bounds for Structural Parameterizations of Pathwidth CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2012	—	`conf`	Kernel Bounds for Structural Parameterizations of Pathwidth. SWAT Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2012	J	`jnl`	Kernelization Lower Bounds By Cross-Composition CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2012	J	`jnl`	Monotonicity in Bayesian Networks CoRR Linda C. van der Gaag, Hans L. Bodlaender, Ad Feelders
2012	J	`jnl`	On exact algorithms for treewidth. ACM Trans. Algorithms Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2012	J	`jnl`	On switching classes, NLC-width, cliquewidth and treewidth. Theor. Comput. Sci. Hans L. Bodlaender, Jurriaan Hage
2012	J	`jnl`	Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen
2012	J	`jnl`	Scheduling of pipelined operator graphs. J. Sched. Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger
2012	J	`jnl`	Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time CoRR Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof
2012	—	`ed.`	The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday The Multivariate Algorithmic Revolution and Beyond Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx
2011	B	`conf`	A Local Search Algorithm for Branchwidth. SOFSEM Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender
2011	A	`conf`	Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	—	`conf`	Exact Algorithms for Intervalizing Colored Graphs. TAPAS Hans L. Bodlaender, Johan M. M. van Rooij
2011	B	`conf`	Exact Algorithms for Kayles. WG Hans L. Bodlaender, Dieter Kratsch
2011	J	`jnl`	Exact algorithms for dominating set. Discret. Appl. Math. Johan M. M. van Rooij, Hans L. Bodlaender
2011	J	`jnl`	Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
2011	J	`jnl`	Kernel Bounds for Path and Cycle Problems CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	B	`conf`	Kernel Bounds for Path and Cycle Problems. IPEC Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	J	`jnl`	Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
2011	C	`conf`	On Stopping Evidence Gathering for Diagnostic Bayesian Networks. ECSQARU Linda C. van der Gaag, Hans L. Bodlaender
2011	B	`conf`	Partition into Triangles on Bounded Degree Graphs. SOFSEM Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender
2011	J	`jnl`	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	—	`conf`	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2011	J	`jnl`	Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2011	J	`jnl`	Spanning tree congestion of k-outerplanar graphs. Discret. Math. Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi
2011	B	`conf`	The Complexity of Finding SOFSEM Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag
2011	J	`jnl`	Treewidth computations II. Lower bounds. Inf. Comput. Hans L. Bodlaender, Arie M. C. A. Koster
2011	A	`conf`	Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. STACS Bart M. P. Jansen, Hans L. Bodlaender
2010	J	`jnl`	A Cubic Kernel for Feedback Vertex Set and Loop Cutset. Theory Comput. Syst. Hans L. Bodlaender, Thomas C. van Dijk
2010	B	`conf`	A Kernel for Convex Recoloring of Weighted Forests. SOFSEM Hans L. Bodlaender, Marc Comas
2010	J	`jnl`	Clustering with partial information. Theor. Comput. Sci. Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2010	B	`conf`	Complexity Results for the Spanning Tree Congestion Problem. WG Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen
2010	J	`jnl`	Cross-Composition: A New Technique for Kernelization Lower Bounds CoRR Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch
2010	J	`jnl`	Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
2010	B	`conf`	Faster Algorithms on Branch and Clique Decompositions. MFCS Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle
2010	A	`conf`	The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks. ECAI Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag
2010	J	`jnl`	The Valve Location Problem in Simple Network Topologies. INFORMS J. Comput. Hans L. Bodlaender, Albert Hendriks, Alexander Grigoriev, Nadejda V. Grigorieva
2010	J	`jnl`	Treewidth computations I. Upper bounds. Inf. Comput. Hans L. Bodlaender, Arie M. C. A. Koster
2010	J	`jnl`	Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter CoRR Bart M. P. Jansen, Hans L. Bodlaender
2009	J	`jnl`	(Meta) Kernelization CoRR Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	A*	`conf`	(Meta) Kernelization. FOCS Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos
2009	J	`jnl`	Derivation of algorithms for cutwidth and related graph layout parameters. J. Comput. Syst. Sci. Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
2009	A	`conf`	Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith
2009	A	`conf`	Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo
2009	—	`conf`	Kernelization: New Upper and Lower Bound Techniques. IWPEC Hans L. Bodlaender
2009	J	`jnl`	On problems without polynomial kernels. J. Comput. Syst. Sci. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2009	J	`jnl`	On the minimum corridor connection problem and other generalized geometric problems. Comput. Geom. Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
2009	—	`conf`	Planar Capacitated Dominating Set Is IWPEC Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx
2009	J	`jnl`	Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
2008	—	`conf`	A Linear Kernel for Planar Feedback Vertex Set. IWPEC Hans L. Bodlaender, Eelko Penninkx
2008	B	`conf`	A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. ISAAC Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan
2008	B	`conf`	Clustering with Partial Information. MFCS Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2008	J	`jnl`	Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. Hans L. Bodlaender, Arie M. C. A. Koster
2008	J	`jnl`	Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set CoRR Johan M. M. van Rooij, Hans L. Bodlaender
2008	A	`conf`	Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. STACS Johan M. M. van Rooij, Hans L. Bodlaender
2008	—	`conf`	Exact Algorithms for Edge Domination. IWPEC Johan M. M. van Rooij, Hans L. Bodlaender
2008	B	`conf`	Faster Parameterized Algorithms for Minimum Fill-In. ISAAC Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
2008	—	`conf`	Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. SWAT Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen
2008	—	`conf`	On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2008	B	`conf`	The Valve Location Problem in Simple Network Topologies. WG Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks
2008	J	`jnl`	Treewidth Lower Bounds with Brambles. Algorithmica Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
2008	—	`ch.`	Treewidth of Graphs. Encyclopedia of Algorithms Hans L. Bodlaender
2007	A	`conf`	A Cubic Kernel for Feedback Vertex Set. STACS Hans L. Bodlaender
2007	J	`jnl`	Algorithms for Graphs Embeddable with Few Crossings per Edge. Algorithmica Alexander Grigoriev, Hans L. Bodlaender
2007	C	`conf`	Local Monotonicity in Probabilistic Networks. ECSQARU Johan Kwisthout, Hans L. Bodlaender, Gerard Tel
2007	J	`jnl`	On the maximum cardinality search lower bound for treewidth. Discret. Appl. Math. Hans L. Bodlaender, Arie M. C. A. Koster
2007	Misc	`conf`	Quadratic Kernelization for Convex Recoloring of Trees. COCOON Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2007	J	`jnl`	Safe Reduction Rules for Weighted Treewidth. Algorithmica Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster
2007	C	`conf`	The valve location problem. CTW Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks
2007	B	`conf`	Treewidth: Structure and Algorithms. SIROCCO Hans L. Bodlaender
2007	B	`conf`	Weighted Treewidth Algorithmic Techniques and Results. ISAAC Emgad H. Bachoore, Hans L. Bodlaender
2007	Misc	`conf`	Wooden Geometric Puzzles: Design and Hardness Proofs. FUN Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
2006	C	`conf`	A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. AAIM Emgad H. Bachoore, Hans L. Bodlaender
2006	J	`jnl`	Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster
2006	—	`conf`	Kernelization for Convex Recoloring. ACiD Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2006	A	`conf`	On Exact Algorithms for Treewidth. ESA Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
2006	B	`conf`	On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. WAOA Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
2006	J	`jnl`	Online topological ordering. ACM Trans. Algorithms Irit Katriel, Hans L. Bodlaender
2006	—	`ed.`	Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings IWPEC Hans L. Bodlaender, Michael A. Langston
2006	J	`jnl`	Safe separators for treewidth. Discret. Math. Hans L. Bodlaender, Arie M. C. A. Koster
2006	B	`conf`	Treewidth: Characterizations, Applications, and Computations. WG Hans L. Bodlaender
2005	B	`conf`	Algorithms for Graphs Embeddable with Few Crossings Per Edge. FCT Alexander Grigoriev, Hans L. Bodlaender
2005	J	`jnl`	Cutwidth I: A linear time fixed parameter algorithm. J. Algorithms Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2005	J	`jnl`	Cutwidth II: Algorithms for partial w-trees of bounded degree. J. Algorithms Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2005	—	`conf`	Degree-Based Treewidth Lower Bounds. WEA Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
2005	B	`conf`	Discovering Treewidth. SOFSEM Hans L. Bodlaender
2005	A	`conf`	Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
2005	J	`jnl`	Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. Hans L. Bodlaender, Fedor V. Fomin
2005	—	`conf`	New Upper Bound Heuristics for Treewidth. WEA Emgad H. Bachoore, Hans L. Bodlaender
2005	J	`jnl`	On algorithms for ( Theor. Comput. Sci. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
2005	A*	`conf`	Online topological ordering. SODA Irit Katriel, Hans L. Bodlaender
2005	J	`jnl`	Preprocessing Rules for Triangulation of Probabilistic Networks. Comput. Intell. Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof
2005	J	`jnl`	Tree decompositions with small cost. Discret. Appl. Math. Hans L. Bodlaender, Fedor V. Fomin
2005	A	`conf`	Treewidth Lower Bounds with Brambles. ESA Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
2004	J	`jnl`	A Note on Rectilinearity and Angular Resolution. J. Graph Algorithms Appl. Hans L. Bodlaender, Gerard Tel
2004	J	`jnl`	Approximations for lambda-Colorings of Graphs. Comput. J. Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
2004	—	`conf`	Computing Small Search Numbers in Linear Time. IWPEC Hans L. Bodlaender, Dimitrios M. Thilikos
2004	A	`conf`	Contraction and Treewidth Lower Bounds. ESA Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle
2004	B	`conf`	Equitable Colorings of Bounded Treewidth Graphs. MFCS Hans L. Bodlaender, Fedor V. Fomin
2004	A	`conf`	Monotonicity in Bayesian Networks. UAI Linda C. van der Gaag, Hans L. Bodlaender, A. J. Feelders
2004	B	`conf`	On the Maximum Cardinality Search Lower Bound for Treewidth. WG Hans L. Bodlaender, Arie M. C. A. Koster
2004	J	`jnl`	Radio Labeling with Preassigned Frequencies. SIAM J. Optim. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2004	—	`conf`	Safe Seperators for Treewidth. ALENEX/ANALC Hans L. Bodlaender, Arie M. C. A. Koster
2004	—	`conf`	Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P WEA Hans L. Bodlaender, Celina M. H. de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
2004	J	`jnl`	Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. Hans L. Bodlaender, Jan Arne Telle
2003	J	`jnl`	Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica Hans L. Bodlaender, Udi Rotics
2003	J	`jnl`	Finding a bigtriangleup-regular supergraph of minimum order. Discret. Appl. Math. Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen
2003	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers WG Hans L. Bodlaender
2003	B	`conf`	Linear Time Algorithms for Some NP-Complete Problems on (P FCT Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad
2003	J	`jnl`	Necessary Edges in k-Chordalisations of Graphs. J. Comb. Optim. Hans L. Bodlaender
2003	B	`conf`	Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
2002	J	`jnl`	Approximation of pathwidth of outerplanar graphs. J. Algorithms Hans L. Bodlaender, Fedor V. Fomin
2002	—	`conf`	Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT Hans L. Bodlaender, Udi Rotics
2002	J	`jnl`	Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. Algorithmica Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
2002	J	`jnl`	Kayles and Nimbers. J. Algorithms Hans L. Bodlaender, Dieter Kratsch
2002	A	`conf`	On the Complexity of the MPA Problem in Probabilistic Networks. ECAI Hans L. Bodlaender, Frank van den Eijkhof, Linda C. van der Gaag
2002	A	`conf`	Radio Labeling with Pre-assigned Frequencies. ESA Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2002	J	`jnl`	Relaxed Update and Partition Network Games. Fundam. Informaticae Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
2002	B	`conf`	Safe Reduction Rules for Weighted Treewidth. WG Frank van den Eijkhof, Hans L. Bodlaender
2002	J	`jnl`	Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. Hans Zantema, Hans L. Bodlaender
2002	—	`conf`	Tree Decompositions with Small Cost. SWAT Hans L. Bodlaender, Fedor V. Fomin
2001	J	`jnl`	A Generic NP-hardness Proof for a Variant of Graph Coloring. J. Univers. Comput. Sci. Hans L. Bodlaender
2001	A	`conf`	A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. ESA Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2001	B	`conf`	Approximation of Pathwidth of Outerplanar Graphs. WG Fedor V. Fomin, Hans L. Bodlaender
2001	B	`conf`	On Game-Theoretic Models of Networks. ISAAC Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
2001	J	`jnl`	Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. Algorithmica Hans L. Bodlaender, Babette van Antwerpen-de Fluiter
2001	A	`conf`	Pre-processing for Triangulation of Probabilistic Networks. UAI Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
2001	J	`jnl`	Reduction Algorithms for Graphs of Small Treewidth. Inf. Comput. Hans L. Bodlaender, Babette van Antwerpen-de Fluiter
2001	J	`jnl`	Treewidth: Computational Experiments. Electron. Notes Discret. Math. Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel
2000	B	`conf`	Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. ISAAC Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
2000	J	`jnl`	Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. Hans Zantema, Hans L. Bodlaender
2000	—	`conf`	Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
2000	J	`jnl`	Introduction. Algorithmica Hans L. Bodlaender
2000	J	`jnl`	On the Complexity of the Maximum Cut Problem. Nord. J. Comput. Hans L. Bodlaender, Klaus Jansen
2000	J	`jnl`	The algorithmic theory of treewidth. Electron. Notes Discret. Math. Hans L. Bodlaender
2000	J	`jnl`	The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy J. Warnow
2000	A	`conf`	lambda-Coloring of Graphs. STACS Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
1999	J	`jnl`	A note on domino treewidth. Discret. Math. Theor. Comput. Sci. Hans L. Bodlaender
1999	—	`conf`	Finding a minimal tree in a polygon with its medial axis. CCCG Herman J. Haverkort, Hans L. Bodlaender
1999	B	`conf`	Graph Automorphisms with Maximal Projection Distances. FCT H. N. de Ridder, Hans L. Bodlaender
1999	J	`jnl`	Graphs with Branchwidth at Most Three. J. Algorithms Hans L. Bodlaender, Dimitrios M. Thilikos
1999	J	`jnl`	Isomorphism for Graphs of Bounded Distance Width. Algorithmica Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
1999	J	`jnl`	SIMPLE MAX-CUT for unit interval graphs and graphs with few P Electron. Notes Discret. Math. Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier
1998	J	`jnl`	A Partial Theor. Comput. Sci. Hans L. Bodlaender
1998	A*	`conf`	Linear-Time Register Allocation for a Fixed Number of Registers. SODA Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle
1998	J	`jnl`	Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM J. Comput. Hans L. Bodlaender, Torben Hagerup
1998	J	`jnl`	Rankings of Graphs. SIAM J. Discret. Math. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1998	B	`conf`	Tree Decompositions of Small Diameter. MFCS Hans L. Bodlaender, Torben Hagerup
1998	J	`jnl`	Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
1997	A*	`conf`	Constructive Linear Time Algorithms for Branchwidth. ICALP Hans L. Bodlaender, Dimitrios M. Thilikos
1997	J	`jnl`	Domino Treewidth. J. Algorithms Hans L. Bodlaender, Joost Engelfriet
1997	J	`jnl`	Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. Inf. Process. Lett. Dimitrios M. Thilikos, Hans L. Bodlaender
1997	C	`conf`	Isomorphism for Graphs of Bounded Distance Width. CIAC Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
1997	J	`jnl`	It is Hard to Know when Greedy is Good for Finding Independent Sets. Inf. Process. Lett. Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki
1997	J	`jnl`	On Interval Routing Schemes and Treewidth. Inf. Comput. Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos
1997	B	`conf`	Parallel Algorithms for Treewidth Two. WG Babette de Fluiter, Hans L. Bodlaender
1997	J	`jnl`	Treewidth for Graphs with Small Chordality. Discret. Appl. Math. Hans L. Bodlaender, Dimitrios M. Thilikos
1997	B	`conf`	Treewidth: Algorithmic Techniques and Results. MFCS Hans L. Bodlaender
1997	J	`jnl`	Triangulating Planar Graphs while Minimizing the Maximum Degree. Inf. Comput. Goos Kant, Hans L. Bodlaender
1996	J	`jnl`	A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. Hans L. Bodlaender
1996	J	`jnl`	Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. J. Algorithms Hans L. Bodlaender, Ton Kloks
1996	B	`conf`	Finite-State Computability of Annotations of Strings and Trees. CPM Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
1996	J	`jnl`	On Intervalizing K-colored Graphs for DNA Physical Mapping. Discret. Appl. Math. Hans L. Bodlaender, Babette van Antwerpen-de Fluiter
1996	A	`conf`	Parallel Algorithms for Series Parallel Graphs. ESA Hans L. Bodlaender, Babette de Fluiter
1996	Misc	`conf`	Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. COCOON Hans L. Bodlaender, Babette de Fluiter
1995	J	`jnl`	Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. J. Algorithms Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks
1995	J	`jnl`	Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
1995	A*	`conf`	Intervalizing k-Colored Graphs. ICALP Hans L. Bodlaender, Babette de Fluiter
1995	B	`conf`	On Interval Routing Schemes and Treewidth. WG Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen
1995	A*	`conf`	Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ICALP Hans L. Bodlaender, Torben Hagerup
1995	J	`jnl`	Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
1995	J	`jnl`	Restrictions of Graph Partition Problems. Part I. Theor. Comput. Sci. Hans L. Bodlaender, Klaus Jansen
1995	J	`jnl`	The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
1995	J	`jnl`	Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discret. Math. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
1995	J	`jnl`	W[2]-hardness of precedence constrained K-processor scheduling. Oper. Res. Lett. Hans L. Bodlaender, Michael R. Fellows
1994	A*	`conf`	Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. STOC Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett
1994	B	`conf`	Domino Treewith (Extended Abstract). WG Hans L. Bodlaender, Joost Engelfriet
1994	A	`conf`	Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1994	J	`jnl`	Improved Self-reduction Algorithms for Graphs with Bounded Treewidth. Discret. Appl. Math. Hans L. Bodlaender
1994	J	`jnl`	On Disjoint Cycles. Int. J. Found. Comput. Sci. Hans L. Bodlaender
1994	A	`conf`	On the Complexity of the Maximum Cut Problem. STACS Hans L. Bodlaender, Klaus Jansen
1994	B	`conf`	Ranking of Graphs. WG Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1994	J	`jnl`	Scheduling with Incompatible Jobs. Discret. Appl. Math. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1994	J	`jnl`	The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case Inf. Comput. Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
1994	B	`conf`	The Parameterized Complexity of Sequence Alignment and Consensus. CPM Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
1994	J	`jnl`	Trade-Offs in Non-Reversing Diameter. Nord. J. Comput. Hans L. Bodlaender, Gerard Tel, Nicola Santoro
1993	J	`jnl`	A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. J. Algorithms Hans L. Bodlaender, Ton Kloks
1993	J	`jnl`	A Tourist Guide through Treewidth. Acta Cybern. Hans L. Bodlaender
1993	A*	`conf`	A linear time algorithm for finding tree-decompositions of small treewidth. STOC Hans L. Bodlaender
1993	J	`jnl`	Book review. ZOR Methods Model. Oper. Res. Hans L. Bodlaender
1993	J	`jnl`	Complexity of Path-Forming Games. Theor. Comput. Sci. Hans L. Bodlaender
1993	A	`conf`	Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. ESA Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
1993	B	`conf`	Dynamic Algorithms for Graphs with Treewidth 2. WG Hans L. Bodlaender
1993	J	`jnl`	On Linear Time Minor Tests with Depth-First Search. J. Algorithms Hans L. Bodlaender
1993	B	`conf`	On Reduction Algorithms for Graphs with Small Treewidth. WG Hans L. Bodlaender
1993	B	`conf`	On the Complexity of Scheduling Incompatible Jobs with Unit-Times. MFCS Hans L. Bodlaender, Klaus Jansen
1993	J	`jnl`	The Pathwidth and Treewidth of Cographs. SIAM J. Discret. Math. Hans L. Bodlaender, Rolf H. Möhring
1993	A*	`conf`	Treewidth and Pathwidth of Permutation Graphs. ICALP Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
1992	A	`conf`	A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. STACS Hans L. Bodlaender, Ton Kloks
1992	B	`conf`	Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ISAAC Ton Kloks, Hans L. Bodlaender
1992	B	`conf`	Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. WG Hans L. Bodlaender
1992	J	`jnl`	Scheduling with Incompatible Jobs Universität Trier, Mathematik/Informatik, Forschungsbericht Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1992	B	`conf`	Scheduling with Incompatible Jobs. WG Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1992	—	`conf`	Testing Superperfection of k-Trees. SWAT Ton Kloks, Hans L. Bodlaender
1992	J	`jnl`	The Complexity of Coloring Games on Perfect Graphs. Theor. Comput. Sci. Hans L. Bodlaender, Dieter Kratsch
1992	—	`conf`	Triangulating Planar Graphs While Minimizing the Maximum Degree. SWAT Goos Kant, Hans L. Bodlaender
1992	A*	`conf`	Two Strikes Against Perfect Phylogeny. ICALP Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow
1991	B	`conf`	Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson
1991	A*	`conf`	Better Algorithms for the Pathwidth and Treewidth of Graphs. ICALP Hans L. Bodlaender, Ton Kloks
1991	B	`conf`	Complexity Aspects of Map Compression. Data Compression Conference Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
1991	J	`jnl`	New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors. Theor. Comput. Sci. Hans L. Bodlaender
1991	B	`conf`	On Disjoint Cycles. WG Hans L. Bodlaender
1991	J	`jnl`	On the Complexity of Some Coloring Games. Int. J. Found. Comput. Sci. Hans L. Bodlaender
1991	B	`conf`	Planar Graph Augmentation Problems (Extended Abstract). WADS Goos Kant, Hans L. Bodlaender
1991	J	`jnl`	Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors. J. Comput. Syst. Sci. Hans L. Bodlaender
1990	J	`jnl`	Bit-Optimal Election in Synchronous Rings. Inf. Process. Lett. Hans L. Bodlaender, Gerard Tel
1990	J	`jnl`	Computational complexity of norm-maximization. Comb. Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen
1990	B	`conf`	On the Complexity of Some Coloring Games. WG Hans L. Bodlaender
1990	J	`jnl`	Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. J. Algorithms Hans L. Bodlaender
1990	J	`jnl`	The Complexity of Finding Uniform Emulations on Paths and Ring Networks Inf. Comput. Hans L. Bodlaender
1990	—	`conf`	The Pathwidth and Treewidth of Cographs. SWAT Hans L. Bodlaender, Rolf H. Möhring
1989	J	`jnl`	Achromatic Number is NP-Complete for Cographs and Interval Graphs. Inf. Process. Lett. Hans L. Bodlaender
1989	A	`conf`	Distributed Computing on TRansitive Networks: The Thorus. STACS Paul Beame, Hans L. Bodlaender
1989	B	`conf`	Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. WG Hans L. Bodlaender
1989	B	`conf`	On Linear Time Minor Tests and Depth First Search. WADS Hans L. Bodlaender
1989	J	`jnl`	The Classification of Coverings of Processor Networks. J. Parallel Distributed Comput. Hans L. Bodlaender
1989	B	`conf`	The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. FCT Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
1988	J	`jnl`	A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors. Inf. Process. Lett. Hans L. Bodlaender
1988	A*	`conf`	Dynamic Programming on Graphs with Bounded Treewidth. ICALP Hans L. Bodlaender
1988	B	`conf`	NC-Algorithms for Graphs with Small Treewidth. WG Hans L. Bodlaender
1988	—	`conf`	Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. SWAT Hans L. Bodlaender
1988	J	`jnl`	Some Classes of Graphs with Bounded Treewidth. Bull. EATCS Hans L. Bodlaender
1988	J	`jnl`	The Complexity of Finding Uniform Emulations on Fixed Graphs. Inf. Process. Lett. Hans L. Bodlaender
1987	J	`jnl`	Diameter increase caused by edge deletion. J. Graph Theory Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen
1987	—	`conf`	New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors. GI Jahrestagung Hans L. Bodlaender
1986	B	`conf`	Improved Diameter Bounds for Altered Graphs. WG Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen
1986	A	`conf`	New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. STACS Hans L. Bodlaender, Jan van Leeuwen
1986	J	`jnl`	Simulation of Large Networks on Smaller Networks Inf. Control. Hans L. Bodlaender, Jan van Leeuwen
1985	A	`conf`	Simulation of Large Networks on Smaller Networks. STACS Hans L. Bodlaender, Jan van Leeuwen