Hans L. Bodlaender

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)

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)

Hans L. Bodlaender, Pål G. 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)

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)

Johan M. M. van Rooij, Hans L. Bodlaender: Exact Algorithms for Edge Domination. Algorithmica 64(4): 535-563 (2012)

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)

Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger: Scheduling of pipelined operator graphs. J. Scheduling 15(3): 323-332 (2012)

Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On exact algorithms for treewidth. ACM Transactions on Algorithms 9(1): 12 (2012)

Hans L. Bodlaender, Jurriaan Hage: On switching classes, NLC-width, cliquewidth and treewidth. Theor. Comput. Sci. 429: 30-35 (2012)

Hans L. Bodlaender: Fixed-Parameter Tractability of Treewidth and Pathwidth. The Multivariate Algorithmic Revolution and Beyond 2012: 196-227

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Structural Parameterizations of Pathwidth. SWAT 2012: 352-363

Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx (Eds.): 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

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernelization Lower Bounds By Cross-Composition. CoRR abs/1206.5941 (2012)

Linda C. van der Gaag, Hans L. Bodlaender, Ad Feelders: Monotonicity in Bayesian Networks. CoRR abs/1207.4160 (2012)

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Structural Parameterizations of Pathwidth. CoRR abs/1207.4900 (2012)

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)

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)

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011)

Johan M. M. van Rooij, Hans L. Bodlaender: Exact algorithms for dominating set. Discrete Applied Mathematics 159(17): 2147-2164 (2011)

Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi: Spanning tree congestion of k-outerplanar graphs. Discrete Mathematics 311(12): 1040-1045 (2011)

Hans L. Bodlaender, Arie M. C. A. Koster: Treewidth computations II. Lower bounds. Inf. Comput. 209(7): 1103-1119 (2011)

Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35): 4570-4578 (2011)

Linda C. van der Gaag, Hans L. Bodlaender: On Stopping Evidence Gathering for Diagnostic Bayesian Networks. ECSQARU 2011: 170-181

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) 2011: 437-448

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. IPEC 2011: 145-158

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

Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender: A Local Search Algorithm for Branchwidth. SOFSEM 2011: 444-454

Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender: Partition into Triangles on Bounded Degree Graphs. SOFSEM 2011: 558-569

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176

Bart M. P. Jansen, Hans L. Bodlaender: Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. STACS 2011: 177-188

Hans L. Bodlaender, Johan M. M. van Rooij: Exact Algorithms for Intervalizing Colored Graphs. TAPAS 2011: 45-56

Hans L. Bodlaender, Dieter Kratsch: Exact Algorithms for Kayles. WG 2011: 59-70

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. CoRR abs/1104.4217 (2011)

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. CoRR abs/1106.4141 (2011)

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)

Hans L. Bodlaender, Arie M. C. A. Koster: Treewidth computations I. Upper bounds. Inf. Comput. 208(3): 259-275 (2010)

Hans L. Bodlaender, Albert Hendriks, Alexander Grigoriev, Nadejda V. Grigorieva: The Valve Location Problem in Simple Network Topologies. INFORMS Journal on Computing 22(3): 433-442 (2010)

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)

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)

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

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

Hans L. Bodlaender, Marc Comas: A Kernel for Convex Recoloring of Weighted Forests. SOFSEM 2010: 212-223

Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen: Complexity Results for the Spanning Tree Congestion Problem. WG 2010: 3-14

Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. CoRR abs/1011.4224 (2010)

Bart M. P. Jansen, Hans L. Bodlaender: Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. CoRR abs/1012.4701 (2010)

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)

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)

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)

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)

Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA 2009: 566-577

Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. FOCS 2009: 629-638

Hans L. Bodlaender: Kernelization: New Upper and Lower Bound Techniques. IWPEC 2009: 17-37

Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx: Planar Capacitated Dominating Set Is W[1]-Hard. IWPEC 2009: 50-60

Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. CoRR abs/0904.0727 (2009)

Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008)

Hans L. Bodlaender, Arie M. C. A. Koster: Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. 51(3): 255-269 (2008)

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574

Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293

Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan: A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. ISAAC 2008: 306-317

Hans L. Bodlaender, Eelko Penninkx: A Linear Kernel for Planar Feedback Vertex Set. IWPEC 2008: 160-171

Johan M. M. van Rooij, Hans L. Bodlaender: Exact Algorithms for Edge Domination. IWPEC 2008: 214-225

Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155

Johan M. M. van Rooij, Hans L. Bodlaender: Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. STACS 2008: 657-668

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

Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks: The Valve Location Problem in Simple Network Topologies. WG 2008: 55-65

Hans L. Bodlaender: Treewidth of Graphs. Encyclopedia of Algorithms 2008

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)

Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster: Safe Reduction Rules for Weighted Treewidth. Algorithmica 47(2): 139-158 (2007)

Alexander Grigoriev, Hans L. Bodlaender: Algorithms for Graphs Embeddable with Few Crossings per Edge. Algorithmica 49(1): 1-11 (2007)

Hans L. Bodlaender, Arie M. C. A. Koster: On the maximum cardinality search lower bound for treewidth. Discrete Applied Mathematics 155(11): 1348-1372 (2007)

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

Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks: The valve location problem. CTW 2007: 13-16

Johan Kwisthout, Hans L. Bodlaender, Gerard Tel: Local Monotonicity in Probabilistic Networks. ECSQARU 2007: 548-559

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

Emgad H. Bachoore, Hans L. Bodlaender: Weighted Treewidth Algorithmic Techniques and Results. ISAAC 2007: 893-903

Hans L. Bodlaender: Treewidth: Structure and Algorithms. SIROCCO 2007: 11-25

Hans L. Bodlaender: A Cubic Kernel for Feedback Vertex Set. STACS 2007: 320-331

Hans L. Bodlaender, Arie M. C. A. Koster: Safe separators for treewidth. Discrete Mathematics 306(3): 337-350 (2006)

Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster: Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10(1): 5-49 (2006)

Irit Katriel, Hans L. Bodlaender: Online topological ordering. ACM Transactions on Algorithms 2(3): 364-379 (2006)

Emgad H. Bachoore, Hans L. Bodlaender: A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. AAIM 2006: 255-266

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

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

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

Hans L. Bodlaender: Treewidth: Characterizations, Applications, and Computations. WG 2006: 1-14

Hans L. Bodlaender, Michael A. Langston (Eds.): 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

Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof: Preprocessing Rules for Triangulation of Probabilistic Networks. Computational Intelligence 21(3): 286-305 (2005)

Hans L. Bodlaender, Fedor V. Fomin: Tree decompositions with small cost. Discrete Applied Mathematics 145(2): 143-154 (2005)

Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: Cutwidth I: A linear time fixed parameter algorithm. J. Algorithms 56(1): 1-24 (2005)

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)

Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: On algorithms for (P₅, gem)-free graphs. Theor. Comput. Sci. 349(1): 2-21 (2005)

Hans L. Bodlaender, Fedor V. Fomin: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1): 22-30 (2005)

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

Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. ESA 2005: 391-402

Alexander Grigoriev, Hans L. Bodlaender: Algorithms for Graphs Embeddable with Few Crossings Per Edge. FCT 2005: 378-387

Irit Katriel, Hans L. Bodlaender: Online topological ordering. SODA 2005: 443-450

Hans L. Bodlaender: Discovering Treewidth. SOFSEM 2005: 1-16

Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender: Degree-Based Treewidth Lower Bounds. WEA 2005: 101-112

Emgad H. Bachoore, Hans L. Bodlaender: New Upper Bound Heuristics for Treewidth. WEA 2005: 216-227

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004)

Hans L. Bodlaender, Gerard Tel: A Note on Rectilinearity and Angular Resolution. J. Graph Algorithms Appl. 8: 89-94 (2004)

Hans L. Bodlaender, Jan Arne Telle: Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. 11(4): 374-385 (2004)

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Preassigned Frequencies. SIAM Journal on Optimization 15(1): 1-16 (2004)

Hans L. Bodlaender, Arie M. C. A. Koster: Safe Seperators for Treewidth. ALENEX/ANALC 2004: 70-78

Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle: Contraction and Treewidth Lower Bounds. ESA 2004: 628-639

Hans L. Bodlaender, Dimitrios M. Thilikos: Computing Small Search Numbers in Linear Time. IWPEC 2004: 37-48

Hans L. Bodlaender, Fedor V. Fomin: Equitable Colorings of Bounded Treewidth Graphs. MFCS 2004: 180-190

Linda C. van der Gaag, Hans L. Bodlaender, A. J. Feelders: Monotonicity in Bayesian Networks. UAI 2004: 569-576

Hans L. Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier: Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P₄'s. WEA 2004: 87-99

Hans L. Bodlaender, Arie M. C. A. Koster: On the Maximum Cardinality Search Lower Bound for Treewidth. WG 2004: 81-92

Hans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003)

Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen: Finding a bigtriangleup-regular supergraph of minimum order. Discrete Applied Mathematics 131(1): 3-9 (2003)

Hans L. Bodlaender: Necessary Edges in k-Chordalisations of Graphs. J. Comb. Optim. 7(3): 283-290 (2003)

Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad: Linear Time Algorithms for Some NP-Complete Problems on (P₅, Gem)-Free Graphs. FCT 2003: 61-72

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

Hans L. Bodlaender (Ed.): 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

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)

Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: Relaxed Update and Partition Network Games. Fundam. Inform. 49(4): 301-312 (2002)

Hans Zantema, Hans L. Bodlaender: Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002)

Hans L. Bodlaender, Dieter Kratsch: Kayles and Nimbers. J. Algorithms 43(1): 106-119 (2002)

Hans L. Bodlaender, Fedor V. Fomin: Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2): 190-200 (2002)

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

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222

Hans L. Bodlaender, Fedor V. Fomin: Tree Decompositions with Small Cost. SWAT 2002: 378-387

Hans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397

Frank van den Eijkhof, Hans L. Bodlaender: Safe Reduction Rules for Weighted Treewidth. WG 2002: 176-185

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)

Arie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel: Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8: 54-57 (2001)

Hans L. Bodlaender, Babette van Antwerpen-de Fluiter: Reduction Algorithms for Graphs of Small Treewidth. Inf. Comput. 167(2): 86-119 (2001)

Hans L. Bodlaender: A Generic NP-hardness Proof for a Variant of Graph Coloring. J. UCS 7(12): 1114-1124 (2001)

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

Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: On Game-Theoretic Models of Networks. ISAAC 2001: 550-561

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

Fedor V. Fomin, Hans L. Bodlaender: Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176

Hans L. Bodlaender: Introduction. Algorithmica 27(3): 209-211 (2000)

Hans L. Bodlaender: The algorithmic theory of treewidth. Electronic Notes in Discrete Mathematics 5: 27-30 (2000)

Hans Zantema, Hans L. Bodlaender: Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. 11(2): 343-354 (2000)

Hans L. Bodlaender, Klaus Jansen: On the Complexity of the Maximum Cut Problem. Nord. J. Comput. 7(1): 14-31 (2000)

Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy 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)

Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. ISAAC 2000: 192-203

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: lambda-Coloring of Graphs. STACS 2000: 395-406

Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier: Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110

Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos: Isomorphism for Graphs of Bounded Distance Width. Algorithmica 24(2): 105-127 (1999)

Hans L. Bodlaender: A note on domino treewidth. Discrete Mathematics & Theoretical Computer Science 3(4): 141-150 (1999)

Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier: SIMPLE MAX-CUT for unit interval graphs and graphs with few P₄s. Electronic Notes in Discrete Mathematics 3: 19-26 (1999)

Hans L. Bodlaender, Dimitrios M. Thilikos: Graphs with Branchwidth at Most Three. J. Algorithms 32(2): 167-194 (1999)

Herman J. Haverkort, Hans L. Bodlaender: Finding a minimal tree in a polygon with its medial axis. CCCG 1999

H. N. de Ridder, Hans L. Bodlaender: Graph Automorphisms with Maximal Projection Distances. FCT 1999: 204-214

Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller: Treewidth and Minimum Fill-in on d-Trapezoid Graphs. J. Graph Algorithms Appl. 2(2) (1998)

Hans L. Bodlaender, Torben Hagerup: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM J. Comput. 27(6): 1725-1746 (1998)

Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Rankings of Graphs. SIAM J. Discrete Math. 11(1): 168-181 (1998)

Hans L. Bodlaender: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209(1-2): 1-45 (1998)

Hans L. Bodlaender, Torben Hagerup: Tree Decompositions of Small Diameter. MFCS 1998: 702-712

Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle: Linear-Time Register Allocation for a Fixed Number of Registers. SODA 1998: 574-583

Hans L. Bodlaender, Dimitrios M. Thilikos: Treewidth for Graphs with Small Chordality. Discrete Applied Mathematics 79(1-3): 45-61 (1997)

Goos Kant, Hans L. Bodlaender: Triangulating Planar Graphs while Minimizing the Maximum Degree. Inf. Comput. 135(1): 1-14 (1997)

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)

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)

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)

Hans L. Bodlaender, Joost Engelfriet: Domino Treewidth. J. Algorithms 24(1): 94-123 (1997)

Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos: Isomorphism for Graphs of Bounded Distance Width. CIAC 1997: 276-287

Hans L. Bodlaender, Dimitrios M. Thilikos: Constructive Linear Time Algorithms for Branchwidth. ICALP 1997: 627-637

Hans L. Bodlaender: Treewidth: Algorithmoc Techniques and Results. MFCS 1997: 19-36

Babette de Fluiter, Hans L. Bodlaender: Parallel Algorithms for Treewidth Two. WG 1997: 157-170

Hans L. Bodlaender, Babette van Antwerpen-de Fluiter: On Intervalizing K-colored Graphs for DNA Physical Mapping. Discrete Applied Mathematics 71(1-3): 55-77 (1996)

Hans L. Bodlaender, Ton Kloks: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. J. Algorithms 21(2): 358-402 (1996)

Hans L. Bodlaender: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6): 1305-1317 (1996)

Hans L. Bodlaender, Babette de Fluiter: Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. COCOON 1996: 199-208

Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans: Finite-State Computability of Annotations of Strings and Trees. CPM 1996: 384-391

Hans L. Bodlaender, Babette de Fluiter: Parallel Algorithms for Series Parallel Graphs. ESA 1996: 277-289

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11(1): 49-57 (1995)

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)

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995)

Hans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discrete Math. 8(4): 606-616 (1995)

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)

Hans L. Bodlaender, Klaus Jansen: Restrictions of Graph Partition Problems. Part I. Theor. Comput. Sci. 148(1): 93-109 (1995)

Hans L. Bodlaender, Babette de Fluiter: Intervalizing k-Colored Graphs. ICALP 1995: 87-98

Hans L. Bodlaender, Torben Hagerup: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ICALP 1995: 268-279

Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen: On Interval Routing Schemes and Treewidth. WG 1995: 181-196

Hans L. Bodlaender: Improved Self-reduction Algorithms for Graphs with Bounded Treewidth. Discrete Applied Mathematics 54(2-3): 101-115 (1994)

Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. Discrete Applied Mathematics 55(3): 219-232 (1994)

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)

Hans L. Bodlaender: On Disjoint Cycles. Int. J. Found. Comput. Sci. 5(1): 59-68 (1994)

Hans L. Bodlaender, Gerard Tel, Nicola Santoro: Trade-Offs in Non-Reversing Diameter. Nord. J. Comput. 1(1): 111-134 (1994)

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30

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

Hans L. Bodlaender, Klaus Jansen: On the Complexity of the Maximum Cut Problem. STACS 1994: 769-780

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

Hans L. Bodlaender, Joost Engelfriet: Domino Treewith (Extended Abstract). WG 1994: 1-13

Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Ranking of Graphs. WG 1994: 292-304

Hans L. Bodlaender: A Tourist Guide through Treewidth. Acta Cybern. 11(1-2): 1-22 (1993)

Hans L. Bodlaender: On Linear Time Minor Tests with Depth-First Search. J. Algorithms 14(1): 1-23 (1993)

Hans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. J. Algorithms 15(1): 160-172 (1993)

Hans L. Bodlaender: Book review. Math. Meth. of OR 38(1): 18 (1993)

Hans L. Bodlaender, Rolf H. Möhring: The Pathwidth and Treewidth of Cographs. SIAM J. Discrete Math. 6(2): 181-188 (1993)

Hans L. Bodlaender: Complexity of Path-Forming Games. Theor. Comput. Sci. 110(1): 215-245 (1993)

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

Hans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. ICALP 1993: 114-125

Hans L. Bodlaender, Klaus Jansen: On the Complexity of Scheduling Incompatible Jobs with Unit-Times. MFCS 1993: 291-300

Hans L. Bodlaender: A linear time algorithm for finding tree-decompositions of small treewidth. STOC 1993: 226-234

Hans L. Bodlaender: On Reduction Algorithms for Graphs with Small Treewidth. WG 1993: 45-56

Hans L. Bodlaender: Dynamic Algorithms for Graphs with Treewidth 2. WG 1993: 112-124

Hans L. Bodlaender, Dieter Kratsch: The Complexity of Coloring Games on Perfect Graphs. Theor. Comput. Sci. 106(2): 309-326 (1992)

Hans L. Bodlaender, Michael R. Fellows, Tandy Warnow: Two Strikes Against Perfect Phylogeny. ICALP 1992: 273-283

Ton Kloks, Hans L. Bodlaender: Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ISAAC 1992: 116-125

Hans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. STACS 1992: 415-423

Goos Kant, Hans L. Bodlaender: Triangulating Planar Graphs While Minimizing the Maximum Degree. SWAT 1992: 258-271

Ton Kloks, Hans L. Bodlaender: Testing Superperfection of k-Trees. SWAT 1992: 292-303

Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. WG 1992: 37-49

Hans L. Bodlaender: Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. WG 1992: 90-102

Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. Universität Trier, Mathematik/Informatik, Forschungsbericht 92-09 (1992)

Hans L. Bodlaender: On the Complexity of Some Coloring Games. Int. J. Found. Comput. Sci. 2(2): 133-147 (1991)

Hans L. Bodlaender: Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors. J. Comput. Syst. Sci. 42(1): 97-118 (1991)

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)

Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296

Hans L. Bodlaender, Ton Kloks: Better Algorithms for the Pathwidth and Treewidth of Graphs. ICALP 1991: 544-555

Goos Kant, Hans L. Bodlaender: Planar Graph Augmentation Problems (Extended Abstract). WADS 1991: 286-298

Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson: Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG 1991: 1-12

Hans L. Bodlaender: On Disjoint Cycles. WG 1991: 230-238

Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen: Computational complexity of norm-maximization. Combinatorica 10(2): 203-225 (1990)

Hans L. Bodlaender: The Complexity of Finding Uniform Emulations on Paths and Ring Networks. Inf. Comput. 86(1): 87-106 (1990)

Hans L. Bodlaender, Gerard Tel: Bit-Optimal Election in Synchronous Rings. Inf. Process. Lett. 36(1): 53-56 (1990)

Hans L. Bodlaender: Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. J. Algorithms 11(4): 631-643 (1990)

Hans L. Bodlaender, Rolf H. Möhring: The Pathwidth and Treewidth of Cographs. SWAT 1990: 301-309

Hans L. Bodlaender: On the Complexity of Some Coloring Games. WG 1990: 30-40

Hans L. Bodlaender: Achromatic Number is NP-Complete for Cographs and Interval Graphs. Inf. Process. Lett. 31(3): 135-138 (1989)

Hans L. Bodlaender: The Classification of Coverings of Processor Networks. J. Parallel Distrib. Comput. 6(1): 166-182 (1989)

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

Paul Beame, Hans L. Bodlaender: Distributed Computing on TRansitive Networks: The Thorus. STACS 1989: 294-303

Hans L. Bodlaender: On Linear Time Minor Tests and Depth First Search. WADS 1989: 577-590

Hans L. Bodlaender: Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. WG 1989: 232-244

Hans L. Bodlaender: Some Classes of Graphs with Bounded Treewidth. Bulletin of the EATCS 36: 116-125 (1988)

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)

Hans L. Bodlaender: The Complexity of Finding Uniform Emulations on Fixed Graphs. Inf. Process. Lett. 29(3): 137-141 (1988)

Hans L. Bodlaender: Dynamic Programming on Graphs with Bounded Treewidth. ICALP 1988: 105-118

Hans L. Bodlaender: Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. SWAT 1988: 223-232

Hans L. Bodlaender: NC-Algorithms for Graphs with Small Treewidth. WG 1988: 1-10

Hans L. Bodlaender: New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors. GI Jahrestagung 1987: 82-88

Hans L. Bodlaender, Jan van Leeuwen: Simulation of Large Networks on Smaller Networks. Information and Control 71(3): 143-180 (1986)

Hans L. Bodlaender, Jan van Leeuwen: New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. STACS 1986: 119-129

Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen: Improved Diameter Bounds for Altered Graphs. WG 1986: 227-236

Hans L. Bodlaender, Jan van Leeuwen: Simulation of Large Networks on Smaller Networks. STACS 1985: 47-58