| 2026 | IWOCA | The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth. | Hans L. Bodlaender, Maher Mallem |
| 2026 | MFCS | On Equivalent Characterizations of the Polynomial Hierarchy in Abstract Models of Computation. | Jeremy C. Kirn, Lucas Meijer, Tillmann Miltzow, Hans L. Bodlaender |
| 2026 | SODA | Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen |
| 2026 | WG | Trade-Off Between Spread and Width for Tree Decompositions. | Hans L. Bodlaender, Carla Groenland |
| 2025 | GD | A Sketch of Parameterized Complexity (Invited Talk). | Hans L. Bodlaender |
| 2025 | WG | Concurrency Constrained Scheduling with Tree-Like Constraints. | Hans L. Bodlaender, Danny Hermelin, Erik Jan van Leeuwen |
| 2024 | IWOCA | Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. | Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Danil Paulusma, Siani Smith, Erik Jan van Leeuwen |
| 2024 | WG | Approximation Algorithms for Treewidth, Pathwidth, and Treedepth - A Short Survey. | Hans L. Bodlaender |
| 2024 | WG | XNLP-Hardness of Parameterized Problems on Planar Graphs. | Hans L. Bodlaender, Krisztina Szilgyi |
| 2023 | ICALP | Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters. | Hans L. Bodlaender, Carla Groenland, Michal Pilipczuk |
| 2022 | ESA | List Colouring Trees in Logarithmic Space. | Hans L. Bodlaender, Carla Groenland, Hugo Jacob |
| 2022 | WALCOM | From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability. | Hans L. Bodlaender |
| 2022 | WG | Problems Hard for Treewidth but Easy for Stable Gonality. | Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen |
| 2021 | FOCS | Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. | Hans L. Bodlaender, Carla Groenland, Jesper Nederlof, Cline M. F. Swennenhuis |
| 2021 | WALCOM | Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. | Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender |
| 2021 | WG | Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. | Hans L. Bodlaender |
| 2020 | COCOON | Constructing Tree Decompositions of Graphs with Bounded Gonality. | Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit |
| 2020 | LATIN | Steiner Trees for Hereditary Graph Classes. | Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Danil Paulusma, Erik Jan van Leeuwen |
| 2020 | STACS | Typical Sequences Revisited - Computing Width Parameters of Graphs. | Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle |
| 2020 | WG | Knot Diagrams of Treewidth Two. | Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev |
| 2019 | CIAC | Subgraph Isomorphism on Graph Classes that Exclude a Substructure. | Hans L. Bodlaender, Tesshu Hanaka, Yoshio Okamoto, Yota Otachi, Tom C. van der Zanden |
| 2019 | SOFSEM | Stable Divisorial Gonality is in NP. | Hans L. Bodlaender, Marieke van der Wegen, Tom C. van der Zanden |
| 2019 | WADS | Parameterized Complexity of Conflict-Free Graph Coloring. | Hans L. Bodlaender, Sudeshna Kolay, Astrid Pieterse |
| 2018 | FOCS | An ETH-Tight Exact Algorithm for Euclidean TSP. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Sudeshna Kolay |
| 2018 | FUN | On the Exact Complexity of Polyomino Packing. | Hans L. Bodlaender, Tom C. van der Zanden |
| 2018 | STOC | A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak, Dniel Marx, Tom C. van der Zanden |
| 2018 | WG | Recognizing Hyperelliptic Graphs in Polynomial Time. | Jelco M. Bodewes, Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen |
| 2017 | CIAC | Improved Lower Bounds for Graph Embedding Problems. | Hans L. Bodlaender, Tom C. van der Zanden |
| 2017 | TAMC | On the Maximum Weight Minimal Separator. | Tesshu Hanaka, Hans L. Bodlaender, Tom C. van der Zanden, Hirotaka Ono |
| 2017 | WADS | The Homogeneous Broadcast Problem in Narrow and Wide Strips. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak |
| 2016 | ICALP | Subexponential Time Algorithms for Embedding H-Minor Free Graphs. | Hans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden |
| 2016 | ISAAC | Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. | Hans L. Bodlaender, Hirotaka Ono, Yota Otachi |
| 2016 | SOFSEM | Robust Recoverable Path Using Backup Nodes. | Marjan van den Akker, Hans L. Bodlaender, Thomas C. van Dijk, Han Hoogeveen, Erik van Ommeren |
| 2015 | CIAC | PSPACE-Completeness of Bloxorz and of Games with 2-Buttons. | Tom C. van der Zanden, Hans L. Bodlaender |
| 2015 | ESA | Subexponential Time Algorithms for Finding Small Tree and Path Decompositions. | Hans L. Bodlaender, Jesper Nederlof |
| 2014 | ECAI | Provisional Propagation for Verifying Monotonicity of Bayesian Networks. | Merel T. Rietbergen, Linda C. van der Gaag, Hans L. Bodlaender |
| 2013 | FOCS | An O(c^k n) 5-Approximation Algorithm for Treewidth. | Hans L. Bodlaender, Pl Grns Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
| 2013 | ICALP | Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof |
| 2013 | WG | Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. | Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen |
| 2011 | ECSQARU | On Stopping Evidence Gathering for Diagnostic Bayesian Networks. | Linda C. van der Gaag, Hans L. Bodlaender |
| 2011 | ICALP | Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
| 2011 | STACS | Cross-Composition: A New Technique for Kernelization Lower Bounds. | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
| 2011 | STACS | Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. | Bart M. P. Jansen, Hans L. Bodlaender |
| 2011 | SOFSEM | The Complexity of Finding | Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag |
| 2011 | SOFSEM | A Local Search Algorithm for Branchwidth. | Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender |
| 2011 | SOFSEM | Partition into Triangles on Bounded Degree Graphs. | Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender |
| 2011 | WG | Exact Algorithms for Kayles. | Hans L. Bodlaender, Dieter Kratsch |
| 2010 | ECAI | The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks. | Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag |
| 2010 | MFCS | Faster Algorithms on Branch and Clique Decompositions. | Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle |
| 2010 | SOFSEM | A Kernel for Convex Recoloring of Weighted Forests. | Hans L. Bodlaender, Marc Comas |
| 2010 | WG | Complexity Results for the Spanning Tree Congestion Problem. | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
| 2009 | ESA | Kernel Bounds for Disjoint Cycles and Disjoint Paths. | Hans L. Bodlaender, Stphan Thomass, Anders Yeo |
| 2009 | ESA | Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. | Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith |
| 2009 | FOCS | (Meta) Kernelization. | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
| 2008 | ICALP | On Problems without Polynomial Kernels (Extended Abstract). | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
| 2008 | ISAAC | Faster Parameterized Algorithms for Minimum Fill-In. | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
| 2008 | ISAAC | A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. | Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan |
| 2008 | MFCS | Clustering with Partial Information. | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
| 2008 | STACS | Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. | Johan M. M. van Rooij, Hans L. Bodlaender |
| 2008 | WG | The Valve Location Problem in Simple Network Topologies. | Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks |
| 2007 | COCOON | Quadratic Kernelization for Convex Recoloring of Trees. | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
| 2007 | ECSQARU | Local Monotonicity in Probabilistic Networks. | Johan Kwisthout, Hans L. Bodlaender, Gerard Tel |
| 2007 | FUN | Wooden Geometric Puzzles: Design and Hardness Proofs. | Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Gnter Rote, Gerard Tel |
| 2007 | ISAAC | Weighted Treewidth Algorithmic Techniques and Results. | Emgad H. Bachoore, Hans L. Bodlaender |
| 2007 | STACS | A Cubic Kernel for Feedback Vertex Set. | Hans L. Bodlaender |
| 2007 | SIROCCO | Treewidth: Structure and Algorithms. | Hans L. Bodlaender |
| 2006 | AAIM | A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. | Emgad H. Bachoore, Hans L. Bodlaender |
| 2006 | ESA | On Exact Algorithms for Treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
| 2006 | WAOA | On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. | Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, Ren Sitters, Thomas Wolle |
| 2006 | WG | Treewidth: Characterizations, Applications, and Computations. | Hans L. Bodlaender |
| 2005 | ESA | Treewidth Lower Bounds with Brambles. | Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster |
| 2005 | ESA | Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |
| 2005 | FCT | Algorithms for Graphs Embeddable with Few Crossings Per Edge. | Alexander Grigoriev, Hans L. Bodlaender |
| 2005 | SODA | Online topological ordering. | Irit Katriel, Hans L. Bodlaender |
| 2005 | SOFSEM | Discovering Treewidth. | Hans L. Bodlaender |
| 2004 | ALENEX | Safe Seperators for Treewidth. | Hans L. Bodlaender, Arie M. C. A. Koster |
| 2004 | ESA | Contraction and Treewidth Lower Bounds. | Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle |
| 2004 | MFCS | Equitable Colorings of Bounded Treewidth Graphs. | Hans L. Bodlaender, Fedor V. Fomin |
| 2004 | UAI | Monotonicity in Bayesian Networks. | Linda C. van der Gaag, Hans L. Bodlaender, A. J. Feelders |
| 2004 | WG | On the Maximum Cardinality Search Lower Bound for Treewidth. | Hans L. Bodlaender, Arie M. C. A. Koster |
| 2003 | FCT | Linear Time Algorithms for Some NP-Complete Problems on (P | Hans L. Bodlaender, Andreas Brandstdt, Dieter Kratsch, Michal Rao, Jeremy P. Spinrad |
| 2003 | MFCS | Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. | Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
| 2002 | ECAI | On the Complexity of the MPA Problem in Probabilistic Networks. | Hans L. Bodlaender, Frank van den Eijkhof, Linda C. van der Gaag |
| 2002 | ESA | Radio Labeling with Pre-assigned Frequencies. | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
| 2002 | WG | Safe Reduction Rules for Weighted Treewidth. | Frank van den Eijkhof, Hans L. Bodlaender |
| 2001 | ESA | A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
| 2001 | ISAAC | On Game-Theoretic Models of Networks. | Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov |
| 2001 | UAI | Pre-processing for Triangulation of Probabilistic Networks. | Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag |
| 2001 | WG | Approximation of Pathwidth of Outerplanar Graphs. | Fedor V. Fomin, Hans L. Bodlaender |
| 2000 | ISAAC | Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
| 2000 | STACS | lambda-Coloring of Graphs. | Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen |
| 1999 | FCT | Graph Automorphisms with Maximal Projection Distances. | H. N. de Ridder, Hans L. Bodlaender |
| 1998 | MFCS | Tree Decompositions of Small Diameter. | Hans L. Bodlaender, Torben Hagerup |
| 1998 | SODA | Linear-Time Register Allocation for a Fixed Number of Registers. | Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle |
| 1997 | CIAC | Isomorphism for Graphs of Bounded Distance Width. | Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos |
| 1997 | ICALP | Constructive Linear Time Algorithms for Branchwidth. | Hans L. Bodlaender, Dimitrios M. Thilikos |
| 1997 | MFCS | Treewidth: Algorithmic Techniques and Results. | Hans L. Bodlaender |
| 1997 | WG | Parallel Algorithms for Treewidth Two. | Babette de Fluiter, Hans L. Bodlaender |
| 1996 | COCOON | Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. | Hans L. Bodlaender, Babette de Fluiter |
| 1996 | CPM | Finite-State Computability of Annotations of Strings and Trees. | Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans |
| 1996 | ESA | Parallel Algorithms for Series Parallel Graphs. | Hans L. Bodlaender, Babette de Fluiter |
| 1995 | ICALP | Intervalizing k-Colored Graphs. | Hans L. Bodlaender, Babette de Fluiter |
| 1995 | ICALP | Parallel Algorithms with Optimal Speedup for Bounded Treewidth. | Hans L. Bodlaender, Torben Hagerup |
| 1995 | WG | On Interval Routing Schemes and Treewidth. | Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen |
| 1994 | CPM | The Parameterized Complexity of Sequence Alignment and Consensus. | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham |
| 1994 | ESA | Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1994 | STOC | Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. | Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett |
| 1994 | STACS | On the Complexity of the Maximum Cut Problem. | Hans L. Bodlaender, Klaus Jansen |
| 1994 | WG | Ranking of Graphs. | Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Mller, Zsolt Tuza |
| 1994 | WG | Domino Treewith (Extended Abstract). | Hans L. Bodlaender, Joost Engelfriet |
| 1993 | ESA | Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. | Ton Kloks, Hans L. Bodlaender, Haiko Mller, Dieter Kratsch |
| 1993 | ICALP | Treewidth and Pathwidth of Permutation Graphs. | Hans L. Bodlaender, Ton Kloks, Dieter Kratsch |
| 1993 | MFCS | On the Complexity of Scheduling Incompatible Jobs with Unit-Times. | Hans L. Bodlaender, Klaus Jansen |
| 1993 | STOC | A linear time algorithm for finding tree-decompositions of small treewidth. | Hans L. Bodlaender |
| 1993 | WG | On Reduction Algorithms for Graphs with Small Treewidth. | Hans L. Bodlaender |
| 1993 | WG | Dynamic Algorithms for Graphs with Treewidth 2. | Hans L. Bodlaender |
| 1992 | ICALP | Two Strikes Against Perfect Phylogeny. | Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow |
| 1992 | ISAAC | Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. | Ton Kloks, Hans L. Bodlaender |
| 1992 | STACS | A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. | Hans L. Bodlaender, Ton Kloks |
| 1992 | WG | Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. | Hans L. Bodlaender |
| 1992 | WG | Scheduling with Incompatible Jobs. | Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger |
| 1991 | DCC | Complexity Aspects of Map Compression. | Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks |
| 1991 | ICALP | Better Algorithms for the Pathwidth and Treewidth of Graphs. | Hans L. Bodlaender, Ton Kloks |
| 1991 | WADS | Planar Graph Augmentation Problems (Extended Abstract). | Goos Kant, Hans L. Bodlaender |
| 1991 | WG | On Disjoint Cycles. | Hans L. Bodlaender |
| 1991 | WG | Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. | Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjlmtyr Hafsteinsson |
| 1990 | WG | On the Complexity of Some Coloring Games. | Hans L. Bodlaender |
| 1989 | FCT | The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. | Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth |
| 1989 | STACS | Distributed Computing on TRansitive Networks: The Thorus. | Paul Beame, Hans L. Bodlaender |
| 1989 | WADS | On Linear Time Minor Tests and Depth First Search. | Hans L. Bodlaender |
| 1989 | WG | Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. | Hans L. Bodlaender |
| 1988 | ICALP | Dynamic Programming on Graphs with Bounded Treewidth. | Hans L. Bodlaender |
| 1988 | WG | NC-Algorithms for Graphs with Small Treewidth. | Hans L. Bodlaender |
| 1987 | GI | New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors. | Hans L. Bodlaender |
| 1986 | STACS | New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. | Hans L. Bodlaender, Jan van Leeuwen |
| 1986 | WG | Improved Diameter Bounds for Altered Graphs. | Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen |
| 1985 | STACS | Simulation of Large Networks on Smaller Networks. | Hans L. Bodlaender, Jan van Leeuwen |