home	education	contact	library	calendar	search
	about us	research	people	archive	services	jobs

publications by dr. H.L. Bodlaender

• Metis is a dutch, academic research information database
• see also: Metis for Departement Informatica
• please send notifications, questions, remarks etc to metis@cs.uu.nl
• see also : research -> Metis overviews

dr. H.L. Bodlaender

• contact information
• my technical reports
• group algorithmic systems

some publications

Overwijk, A., Penninkx, E. & Bodlaender, H.L. (2011). A Local Search Algorithm for Branchwidth. In I. Cerná, T. Gyimóthy, J. Hromkovic, K..G. Jeffery, R. Královic, M. Vukolic & S. Wolf (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science Vol. 6543. Lecture Notes in Computer Science (pp. 444-454). Spriner.

Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2011). Cross-Composition: A New Technique for Kernelization Lower Bounds. In C. Dürr & T. Schwentick (Eds.), Proceedings 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 (pp. 165-176). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Rooij, J.M.M. van & Bodlaender, H.L. (2011). Exact algorithms for dominating set. Discrete Applied Mathematics, 159, 2147-2164.

Bodlaender, H.L. & Rooij, J.M.M. van (2011). Exact algorithms for intervalizing colored graphs. In A Marchetti-Spaccamela & M Segal (Eds.), Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems TAPAS 2011 Vol. 6595. Lecture Notes in Computer Science (pp. 45-56). Springer.

Bodlaender, H.L., Heggernes, P. & Villanger, Y. (2011). Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica, 61(4), 817-838.

Bodlaender, H.L., Thomassé, S. & Yeo, A. (2011). Kernel bounds for disjoint cycles and disjoint paths. Theoretical Computer Science, 412, 4570-4578.

Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2011). Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. In O. Owe, M. Steffen & J..A. Telle (Eds.), Proceedings 18th International Symposium on Fundamentals of Computation Theory, FCT 2011 Vol. 6914. Lecture Notes in Computer Science (pp. 240-251). Springer.

Rooij, J.M.M. van, Kooten Niekerk, M.E. van & Bodlaender, H.L. (2011). Partition into Triangles on Bounded Degree Graphs. In I. Cerná, T. Gyimóthy, J. Hromkovic, K. Jeffery, R. Královic, M. Vukolic, S. Wolf & S. Wolf (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science Vol. 6543. Lecture Notes in Computer Science (pp. 558-569). Springer.

Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2011). Preprocessing for Treewidth: A combinatorial analysis through kernelization. In L. Aceto, M. Henzinger & J. Sgall (Eds.), Proceedings of the 38th International Colloquium on Automata, Languages, and Programming ICALP 2011 Vol. 6755. Lecture Notes in Computer Science (pp. 437-448). Springer.

Bodlaender, H.L., Fellows, M.R., Langston, M.A., Ragan, M.A., Rosamond, F.A. & Weyer, M. (2011). Quadratic kernelization for the convex recoloring of trees. Algorithmica, 61, 362-388.

Bodlaender, H.L., Kozawa, K., Matsushima, T. & Otachi, Y. (2011). Spanning tree congestion of k-outerplanar graphs. Discrete Mathematics, 311, 1040-1045.

Bodlaender, H.L. & Koster, A.M.C.A. (2011). Treewidth computations II. Lower bounds. Information and Computation, 209, 1103-1119.

Jansen, B.M.P. & Bodlaender, H.L. Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. In T Schwentick & C Dürr (Eds.), 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 (pp. 177-188). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Bodlaender, H.L. & Dijk, T.C. van (2010). A cubic kernel for feedback vertex set and loop cutset. Theory of computing systems, 46, 566-597.

Comas, M & Bodlaender, H.L. (2010). A kernel for convex recoloring of weighted forests. In J van Leeuwen, A Muscholl, D Peleg, J. Pokorny & B Rumke (Eds.), Proceedings of the 36th Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2010 Vol. 5901. Lecture Notes in Computer Science (pp. 212-223). Berlin: Springer.

Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C. & Rosamond, F.A. (2010). Clustering with partial information. Theoretical Computer Science, 411, 1202-1211.

Otachi, Y., Bodlaender, H.L. & Leeuwen, E.J. van (2010). Complexity Results for the Spanning Tree Congestion Problem. : Department of Information and Computing Sciences, Utrecht University.

Otachi, Y., Bodlaender, H.L. & Leeuwen, E.J. van (2010). Complexity results for the Spanning Tree Congestion Problem. In D.M. Thilikos (Ed.), Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2010 Vol. 6410. Lecture Notes in Computer Science (pp. 3-14). Springer.

Dorn, F., Penninkx, E., Bodlaender, H.L. & Fomin, F.V. (2010). Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Algorithmica, 58, 790-810.

Bodlaender, H.L. & Rooij, J.M.M. van (2010). Exact algorithms for Intervalizing Colored Graphs. : Department of Information and Computing Sciences, Utrecht University.

Bodlaender, H.L., Leeuwen, E.J. van & Rooij, J.M.M. van (2010). Faster algorithms on branch and clique decompositions. In P. Hlineny & A. Kucera (Eds.), Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010 Vol. 6281. Lecture Notes in Computer Science (pp. 174-185). Berlin: Springer.

Rooij, J.M.M. van, Kooten Niekerk, M.E. van & Bodlaender, H.L. (2010). Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms. : Department of Information and Computing Sciences, Utrecht University.

Bodlaender, H.L., Kozawa, K., Matsushima, T. & Otachi, Y. (2010). Spanning tree congestion of k-outerplanar graphs. : Department of Information and Computing Sciences, Utrecht University.

Bodlaender, H.L., Grigoriev, A., Grigorieva, N.V. & Hendriks, A. (2010). The Valve Location Problem in Simple Network Topologies. INFORMS Journal on Computing, 22, 433-442.

Kwisthout, J.H.P., Bodlaender, H.L. & Gaag, L.C. van der (2010). The necessity of bounded treewidth for efficient inference in Bayesian networks. In H. Coelho, R. Studer & M. Wooldridge (Eds.), Proceedings of the 23rd European Conference on Artificial Intelligence, ECAI 2010 (pp. 237-242). Amsterdam: IOS Press.

Bodlaender, H.L. & Koster, A.M.C.A. (2010). Treewidth Computations II. Lower Bounds. : Department of Information and Computing Sciences, Utrecht University.

Bodlaender, H.L. & Koster, A.M.C.A. (2010). Treewidth computations I. Upper bounds. Information and Computation, 208, 259-275.

Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S. & Thilikos, D.M. (2009). (Meta) Kernelization. onbekend: UU BETA ICS Departement Informatica.

Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S. & Thilikos, D.M. (2009). (Meta) kernelization. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS 2009 (pp. 629-638). IEEE Press.

Bodlaender, H.L. & Penninkx, E. (2009). A Linear Kernel for Planar Feedback Vertex Set. In M. Grohe & R. Niedermeier (Eds.), Proceedings Third International Workshop on Parameterized and Exact Computation, IWPEC 2008 (pp. 160-171). Berlin: Springer.

Bodlaender, H.L., Penninkx, E. & Tan, R.B. (2008). A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. In S.-H. Hong, H. Nagamochi & T. Fukunaga (Eds.), Proceedings 19th International Symposium on Algorithms and Computation, ISAAC 2008 Vol. 5369. Lecture Notes in Computer Science (pp. 306-317). Berlin: Springer.

Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2009). A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. onbekend: UU BETA ICS Departement Informatica.

Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C. & Rosamond, F.A. (2008). Clustering with Partial Information. In E Ochmanski & J Tyszkiewicz (Eds.), Proceedings 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008 Vol. 5162. Lecture Notes in Computer Science (pp. 144-155). Berlin: Springer.

Kwisthout, J.H.P. & Bodlaender, H.L. (2009). Conditional Lower Bounds on the Complexity of Probabilistic Inference. onbekend: UU BETA ICS Departement Informatica.

Bodlaender, H.L., Fellows, M.R. & Thilikos, Dimitrios (2009). Derivation of algorithms for cutwidth and related graph layout parameters. Journal of computer and system sciences, 75(4), 231-244.

Rooij, J.M.M. van & Bodlaender, H.L. (2009). Design by Measure and Conquer: A faster exact algorithm for dominating set. onbekend: UU BETA ICS Departement Informatica.

Rooij, J.M.M. van & Bodlaender, H.L. (2009). Dynamic programming on tree decompositions using generalised fast subset convolution. In A Fiat & P Sanders (Eds.), Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009 Vol. 5757. Lecture Notes in Computer Science (pp. 566-577). Berlin: Springer.

Bodlaender, H.L., Heggernes, P. & Villanger, Y. (2008). Faster Parameterized Algorithms for Minimum Fill-In. In S.-H. Hong, H. Nagamochi & T. Fukunaga (Eds.), Proceedings 19th International Symposium on Algorithms and Computation, ISAAC 2008 Vol. 5369. Lecture Notes in Computer Science (pp. 282-293). Berlin: Springer.

Bodlaender, H.L., Tan, R.B., Dijk, T.C. van & Leeuwen, J. van (2008). Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. In J Gudmundsson (Ed.), Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory Vol. 5124. Lecture Notes in Computer Science (pp. 102-113). Berlijn: Springer.

Bodlaender, H.L., Thomassé, S. & Yeo, A. (2009). Kernel bounds for Disjoint Cycles and Disjoint Paths. In A Fiat & P Sanders (Eds.), Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009 Vol. 5757. Lecture Notes in Computer Science (pp. 635-646). Berlin: Springer.

Bodlaender, H.L. (2009). Kernelization: New upper and lower bound techniques. In J Chen & F Fomin (Eds.), Proceedings of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009 Vol. 5917. Lecture Notes in Computer Science (pp. 17-37). Berlin: Springer.

Bodlaender, H.L., Downey, R.G., Fellows, M. R. & Hermelin, D. (2009). On problems without polynomial kernels. Journal of computer and system sciences, 75(8), 423-434.

Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R. & Wolle, T. (2009). On the minimum corridor connection problem and other generalized geometric problems. Computational geometry, 42(9), 939-951.

Bodlaender, H.L., Lokshtanov, D. & Penninkx, E. (2009). Planar capacitated dominating set is W[1]-hard. In J Chen & F Fomin (Eds.), Proceedings of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009 Vol. 5917. Lecture Notes in Computer Science (pp. 50-60). Berlin: Springer.

Bodlaender, H.L., Grigoriev, A., Grigorieva, N.V. & Hendriks, A. (2008). The Valve Location Problem in Simple Network Topologies. In H Broersma, T Erlebach, T Friedetzky & D Paulusma (Eds.), Proceedings 34th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2008 Vol. 5344. Lecture Notes in Computer Science (pp. 55-65). Berlijn: Springer.

Bodlaender, H.L., Grigoriev, A., Grigorieva, N.V. & Hendriks, A. (2009). The valve location problem. In J Hurink, W Kern, G..F. Post & G Still (Eds.), Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization (pp. 13-16). Enschede: University of Twente.

Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2009). Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst., 44(2), 160-174.

Bodlaender, H.L., Thomassé, S. & Yeo, A. (2008). Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels. UU-CS 2008-30. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C. & Rosamond, F.A. (2008). Clustering with partial information. UU-CS 2008-33. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C. & Rosamond, F.A. (2008). Clustering with partial information. Reports in Informatics UU-CS-2008-33. Bergen, Norway: Department of Informatics, University of Bergen.

Bodlaender, H.L. & Koster, A.M.C.A. (2008). Combinatorial Optimization on Graphs of Bounded Treewidth. The Computer Journal, 51(3), 255-269.

Kwisthout, J., Bodlaender, H.L. & Tel, G. (2008). Complexity results for local monotonicity in probabilistic networks. In M.M. Dastani & E. de Jong (Eds.), Proceedings of the 19th Belgisch-Nederlandse conferentie class = Wet, Artificiële Intelligentie BNAIC'07.

Rooij, J.M.M. van & Bodlaender, H.L. (2008). Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. In S Albers & P. Weil (Eds.), Proceedings STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science Vol. 08001. Dagblad De Limburger (pp. 657-668). Schloss Dagstuhl, Germany: Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI).

Bodlaender, H.L. & Fomin, F.V. (2004). Equitable colorings of bounded treewidth graphs. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004 Vol. 3153. Lecture Notes in Computer Science (pp. 204-214). Springer.

Rooij, J.M.M. van & Bodlaender, H.L. (2008). Exact Algorithms for Edge Domination. In M Grohe & R. Niedermeier (Eds.), Proceedings Third International Workshop on Parameterized and Exact Computation, IWPEC 2008 (pp. 214-255). Berlin: Springer.

Bodlaender, H.L., Heggernes, P. & Villanger, Y. (2008). Faster parameterized algorithms for Minimum Fill-In. UU-CS 2008-042. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Tan, R.B., van Dijk, T.C. & Leeuwen, J. van (2008). Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. UU-CS 2008-005. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Downey, R.G., Fellows, M.R. & Hermelin, D. (2008). On Problems Without Polynomial Kernels (Extended Abstract). In L. Aceto, I. Damgaard, L.A. Goldberg, M.M. Halldorsson, A. Ingolfsdottir & I. Walukuewics (Eds.), Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2008 Vol. 5125. Lecture Notes in Computer Science (pp. 563-574). Springer.

Bodlaender, H.L., Brandstädt, A., Kratsch, D., Rao, M. & Spinrad, J. (2008). On algorithms for (P_5,gem)-free graphs. Theoretical Computer Science, 349, 2-21.

Bodlaender, H.L., Demaine, E.D., Fellows, M.R., Guo, J., Hermelin, D., Lokshtanov, D., Müller, M., Raman, V., Rooij, J . van & Rosamond, F.A. (2008). Open Problems in Parameterized and Exact Computation - IWPEC 2008. UU-CS 2008-017. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L. & Koster, A.M.C.A. (2008). Treewidth Computations I. Upper Bounds. UU-CS 2008-032. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Grigoriev, A. & Koster, A.M.C.A. (2008). Treewidth lower bounds with brambles. Algorithmica, 51, 81-98.

Bodlaender, H.L. (2007). A cubic kernel for feedback vertex set. In W. Thomas & P. Well (Eds.), Proceedings 24th International Symposium on Theoretical Aspects of Computer Science, STACS 2007 (pp. 320-331). Springer, Lecture Notes in Computer Science.

Grigoriev, A. & Bodlaender, H.L. (2007). Algorithms for graphs embeddable with few crossings per edge. Algorithmica, 49, 1-11.

Bodlaender, H.L. & Koster, A.M.C.A. (2007). Combinatorial Optimization on Graphs of Bounded Treewidth. The Computer Journal.

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Complexity Results for Local Monotonicity in Probabilistic Networks (extended abstract). In M.M. Dastani & E. de Jong (Eds.), Proceedings of the 19th BNAIC, October 17-19, 2007 (pp. 369-370).

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Complexity results for local monotonicity in probabilistic networks. CS-UU 2007-050. onbekend: UU WINFI Informatica en Informatiekunde.

Rooij, J.M.M. van & Bodlaender, H.L. (2007). Exact algorithms for Edge Domination. CS-UU 2007-051. onbekend: UU WINFI Informatica en Informatiekunde.

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Local Monotonicity in Probabilistic Networks. In K. Mellouli & K. Mellouli (Eds.), Procedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQUARU 2007 (pp. 548-559). Springer-Verlag.

Bodlaender, H.L., Downey, R.G., Fellows, M. R. & Hermelin, D. (2007). On Problems Without Polynomial Kernels. UU-CS 2007-046. onbekend: UU WINFI Informatica en Informatiekunde.

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

Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R. & Wolle, T. (2007). On the minimum corridor connection problem and other generalized geometric problems. CS-UU 2007-031. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Fellows, M. R., Langston, M.A., Ragan, M.A., Rosamond, F.A. & Weyer, M. (2007). Quadratic kernelization for convex recoloring of trees. In G. Lin (Ed.), Proceedings 13th Annual International Computing and Combinatorics Conference, COCOON 2007 (pp. 86-96). Heidelberg: Springer, Lecture Notes in Computer Science, volume 4598.

Bodlaender, H.L., Fellows, M. R., Langston, M.A., Ragan, M.A., Rosamond, F.A. & Weyer, M. (2007). Quadratic kernelization for convex recoloring of trees. UU-CS 2007-035. onbekend: UU WINFI Informatica en Informatiekunde.

Van den Eijkhof, F., Bodlaender, H.L. & Koster, A.M.C.A. (2007). Safe reduction rules for weighted treewidth. Algorithmica, 47, 139-158.

Bodlaender, H.L., Grigoriev, A., Grigorieva, N.V. & Hendriks, A. (2007). The Valve Location Problem in Simple Network Topologies. CS-UU 2007-019. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L. (2007). Treewidth: Structure and Algorithms. In G. Prencipe & S. Zaks (Eds.), Proceedings 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007 (pp. 11-25). Springer, Lecture Notes in Computer Science, volume 4474.

Bachoore, E.H. & Bodlaender, H.L. (2007). Weighted Treewidth: Algorithmic Techniques and Results. In T. Tokuyama (Ed.), Proceedings 18th International Symposium on Algorithms and Computation, ISAAC 2007 (pp. 893-903). Springer Lecture Notes in Computer Science, volume 4835.

Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. CS-UU 2007-009. onbekend: UU WINFI Informatica en Informatiekunde.

Alt, H., Bodlaender, H.L., Kreveld, M.J. van, Rote, G. & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. In P. Crescenzi, G. Prencipe & G. Pucci (Eds.), Proceedings 4th International Conference on Fun with Algorithms, FUN 2007 (pp. 16-29). Springer, Lecture Notes in Computer Science, volume 4475.

Bachoore, E.H. & Bodlaender, H.L. (2006). A branch and bound algorithm for exact, upper, and lower bounds on treewidth. onbekend: UU WINFI Informatica en Informatiekunde.

Bachoore, E. & Bodlaender, H.L. (2006). A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In Siu-Wing Cheng & Chung.Keung Poon (Eds.), Proceedings 2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006 (pp. 255-266). Springer, Lecture Notes in Computer Science, volume 4041.

Bodlaender, H.L. (2006). A cubic kernel for feedback vertex set. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L. & Kratsch, D. (2006). An exact algorithm for graph coloring with polynomial memory. onbekend: UU WINFI Informatica en Informatiekunde.

Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2006). Complexity Results for Local Monotonicity in Probabilistic Networks. uu cs UU-CS-2007-050. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2006). Contraction and treewidth lower bounds. Journal of Graph Algorithms and Applications, 10, 5-49.

Bachoore, E.H. & Bodlaender, H.L. (2006). Convex recolorings of leaf-colored trees. onbekend: UU WINFI Informatica en Informatiekunde.

Dorn, F., Penninkx, E., Bodlaender, H.L. & Fomin, F.V. (2006). Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. onbekend: UU WINFI Informatica en Informatiekunde.

Bakker, E.M., Bodlaender, H.L., Tan, R.B. & Leeuwen, J. van (2006). Interval Routing and Minor-Monotone Graph Parameters. UU-CS 2006-001. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Fellows, M.R., Langston, M.A., Ragan, M.A., Rosamond, F.A. & Weyer, M. (2006). Kernelization for Convex Recoloring. In Broersma H., S.S. Dantchev, M. Johnson & S. Szeider (Eds.), Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK (pp. 23-35). King's College, London.

Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2006). On exact algorithms for treewidth. In Y. Azar & T. Erlebach (Eds.), Proceedings 14th Annual European Symposium on Algorithms ESA 2006 (pp. 672-683). Springer, Lecture Notes in Computer Science, volume 4168.

Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2006). On exact algorithms for treewidth. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R. & Wolle, T. (2006). On the minimum corridor connection problem and other generalized geometric problems. In T. Erleback & C. Kaklamanis (Eds.), Proceedings 4th International Workshop on Approximation and Online Algorithms Vol. 4368. Lecture Notes in Computer Science (pp. 69-82). Springer.

Katriel, I. & Bodlaender, H.L. (2006). Online topological ordering. ACM Transactions on Algorithms, 2, 364-379.

Katriel, I. & Bodlaender, H.L. (2006). Online topological ordering. ACM Transactions on Algorithms, 2, 364-379.

Bodlaender, H.L., Cai, L., Chen, J., Fellows, M.R., Telle, J.A. & Marx, D. (2006). Open Problems in Parameterized and Exact Computation --- IWPEC 2006. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L. & Langston, M.A. (Eds.). (2006). Parameterized and Exact Computation, Second International Workshop, IWPEC 2006 (Lecture Notes in Computer Science, 4169). Berlin: Springer.

Bodlaender, H.L. & Koster, A.M.C.A. (2006). Safe separators for treewidth. Discrete Mathematics, 306, 337-350.

Bodlaender, H.L. (2006). Treewidth: Characterizations, Applications, and Computations. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L. (2006). Treewidth: Characterizations, Applications, and Computations. In Fedor.V. Fomin (Ed.), Proceedings 32nd International Workshop on class = Wet, Graph-Theoretic Concepts in Computer Science WG 2006 (pp. 1-14). Springer, Lecture Notes in Computer Science, volume 4271.

Bachoore, E. & Bodlaender, H.L. (2006). Weighted treewidth: Algorithmic techniques and results. onbekend: UU WINFI Informatica en Informatiekunde.

Grigoriev, A. & Bodlaender, H.L. (2005). Algorithms for graphs embeddable with few crossings per edge. In M. Liskiewicz & R. Reischuk (Eds.), Proceedings 15th International Symposium on Fundamentals of Computation Theory, FCT 2005 (pp. 378-387). Luebeck, Germany: Springer-Verlag, Lecture Notes in Computer Science, vol 3623.

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

Thilikos, Dimitrios , Serna, Maria J. & Bodlaender, H.L. (2005). Cutwidth II: Algorithms for partial $w$-trees of bounded degree. Journal of Algorithms, 56, 25-49.

Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2005). Degree-based treewidth lower bounds. In Sotiris.E. Nikoletseas (Ed.), Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms WEA 2005 (pp. 101-112). Springer-Verlag, Lecture Notes in Computer Science 3503.

Bodlaender, H.L. (2005). Discovering Treewidth. UU-CS 2005-018. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L. (2005). Discovering treewidth. In SOFSEM 2005: Theory and Practive of Computer Science: 31st Conference on Current Trends in Theory and Practive of Computer Science (pp. 1-16). Springer-Verlag, Lecture Notes in Computer Science Volume 33.

Dorn, F., Penninkx, E., Bodlaender, H.L. & Fomin, F.V. (2005). Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In Proceedings 13th Annual European Symposium on Algorithms -- ESA 2005 (pp. 95-106). Springer-Verlag, Lecture Notes in Computer Science 3669.

Bodlaender, H.L. & Fomin, F.V. (2005). Equitable colorings of bounded treewidth graphs. Theoretical Computer Science, 349, 22-30.

Bachoore, E. & Bodlaender, H.L. (2005). New upper bound heuristics for treewidth. In Sotiris.E. Nikoletseas (Ed.), Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms WEA 2005 (pp. 217-227). Springer-Verlag, Lecture Notes in Computer Science 3503.

Katriel, Irit & Bodlaender, H.L. (2005). Online Topological Ordering. UU-CS 2005-011. onbekend: UU WINFI Informatica en Informatiekunde.

Katriel, Irit & Bodlaender, H.L. (2005). Online topological ordering. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005 (pp. 443-450).

Bodlaender, H.L., Koster, A.M.C.A. & Van den Eijkhof, F. (2005). Preprocessing rules for triangulation of probabilistic networks. Computational Intelligence, 21, 286-305.

Bodlaender, H.L. & Fomin, F.V. (2005). Tree decompositions with small cost. Discrete Applied Mathematics, 145, 143-154.

Bodlaender, H.L., Grigoriev, A. & Koster, A.M.C.A. (2005). Treewidth Lower Bounds with Brambles. UU-CS 2005-051. onbekend: UU WINFI Informatica en Informatiekunde.

Bodlaender, H.L., Grigoriev, A. & Koster, A.M.C.A. (2005). Treewidth lower bounds with brambles. In Proceedings 13th Annual European Symposium on Algorithms -- ESA 2005 (pp. 391-402). Springer-Verlag, Lecture Notes in Computer Science 3669.

Wolle, T., Koster, A.M.C.A. & Bodlaender, H.L. (2004). A Note on Contraction Degeneracy. UU-CS 2004-042. Utrecht: Utrecht University: Information and Computing Sciences.

Wolle, T. & Bodlaender, H.L. (2004). A Note on Edge Contraction. UU-CS 2004-028. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Wolle, T. (2004). A Note on the Complexity of Network Reliability Problems. UU-CS 2004-001. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Tel, G. (2004). A note on rectilinearity and angular resolution. Journal on Graph Algorithms and Applications, 8, 89-94.

Grigoriev, A. & Bodlaender, H.L. (2004). Algorithms for graphs embeddable with few crossings per edge. UU-CS 2004-058. Utrecht, the Netherlands: Institute of Information and Computing Sciences.

Bodlaender, H.L., Kloks, T., Tan, R.B. & Leeuwen, J. van (2004). Approximations for Lambda-Colorings of Graphs. The Computer Journal, 47, 193-204.

Bodlaender, H.L. & Thilikos, D.M. (2004). Computing small search numbers in linear time. In R. Downey, M. Fellows & F. Dehne (Eds.), Proceedings First International Workshop on Parameterized and Exact Computation (pp. 37-48). Berlin: Springer-Verlag.

Bodlaender, H.L. & Wolle, T. (2004). Contraction Degeneracy on Cographs. UU-CS 2004-031. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2004). Contraction and Treewidth Lower Bounds. UU-CS 2004-034. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2004). Contraction and treewidth lower bounds. In S. Albers & T. Radzik (Eds.), Proceedings 12th Annual European Symposium on Algorithms, ESA2004 (pp. 628-639). Springer-Verlag.

Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2004). Degree-Based Treewidth Lower Bounds. UU-CS 2004-050. Utrecht: Utrecht University: Information and Computing Sciences.

Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2004). Degree-based treewidth lower bounds. Berlin, Germany: Konrad-Zuse-Zentrum für Informationstechnik Berlin.

Bodlaender, H.L. & Fomin, F.V. (2004). Equitable colorings of bounded treewidth graphs. UU-CS 2004-010. Utrecht: Utrecht University: Information and Computing Sciences.

Gaag, L.C. van der, Bodlaender, H.L. & Feelders, A.J. (2004). Monotonicity in Bayesian Networks. In M. Chickering & J. Halpern (Eds.), Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (pp. 569-576). AUAI Press.

Bachoore, E. & Bodlaender, H.L. (2004). New Upper Bound Heuristics for Treewidth. UU-CS 2004-036. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Koster, A.M.C.A. (2004). On the Maximum Cardinality Search Lower Bound for Treewidth. Berlin, Germany: Konrad-Zuse-Zentrum für Informationstechnik Berlin.

Bodlaender, H.L. & Koster, A.M.C.A. (2004). On the Maximum Cardinality Search Lower Bound for Treewidth. UU-CS 2004-053. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Koster, A.M.C.A. (2004). On the Maximum Cardinality Search Lower Bound for Treewidth. In Proceedings 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2004 (pp. 81-92). Berlin: Springer-Verlag.

Bodlaender, H.L., Broersma, H.J., Fomin, F.V., Pyatkin, A.V. & Woeginger, G.J. (2004). Radio labeling with preassigned frequencies. SIAM Journal on Optimization, 15, 1-16.

Bodlaender, H.L. & Koster, A.M.C.A. (2004). Safe separators for treewidth. In Proceedings 6th Workshop on Algorithm Engineering & Experiments ALENEX04 (pp. 70-78).

Bodlaender, H.L., Figueiredo, C.M.H. de, Gutierrez, M., Kloks, T. & Niedermeier, R. (2004). Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4's. In WEA 2004, Proceedings 3rd International Workshop on Experimental and Efficient Algorithms (pp. 87-99). Berlin: Springer-Verlag.

Bodlaender, H.L. & Telle, J.A. (2004). Space-efficient construction variants of dynamic programming. UU-CS 2004-030. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Wolle, T. (2003). A Note on the Complexity of Network Reliability Problems. UU-CS 2004-001. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Rotics, U. (2003). Computing the treewidth and the minimum fill-in with the modular decomposition. Algorithmica, 36, 375-408.

Bodlaender, H.L., Tan, R.B. & Leeuwen, J. van (2003). Finding a Delta-regular supergraph of minimum order. Discrete Applied Mathematics, 131, 3-9.

Bodlaender, H.L. (Ed.). (2003). Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003. Berlin: Springer.

Bodlaender, H.L., Brandstädt, A., Kratsch, D., Rao, M. & Spinrad, J. (2003). Linear time algorithms for some NP-complete problems on (P_5,gem)-free graphs. (Extended abstract). In FCT'03, Proceedings 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 2751 (pp. 61-72). Berlin: Springer-Verlag.

Bodlaender, H.L. (2003). Necessary edges in k-chordalizations of graphs. Journal of Combinatorial Optimization, 7, 283-290.

Bodlaender, H.L., Brandstadt, A., Kratsch, D., Rao, M. & Spinrad, J. (2003). On Algorithms for (P5,Gem)-Free Graphs. UU-CS 2003-038. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Koster, A.M.C.A. & Van den Eijkhof, F. (2003). Pre-processing rules for triangulation of probabilistic networks. UU-CS 2003-001. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Tel, G. (2003). Rectilinear Graphs and Angular Resolution. UU-CS 2003-033. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Koster, A.M.C.A. (2003). Safe Separators for Treewidth. UU-CS 2003-027. Utrecht: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Fellows, M. R. & Thilikos, D.M. (2003). Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. In Proceedings 28nd International Symposium on Mathematical Foundations of Computer Science, MFCS'03, Lecture Notes in Computer Science, volume 2747 (pp. 239-248). Berlin: Springer-Verlag.

Bodlaender, H.L. & Fomin, F.V. (2002). Approximation of pathwidth of outerplanar graphs. Journal of Algorithms, 43, 190-200.

Bodlaender, H.L. & Rotics, U. (2002). Computing the treewidth and the minimum fill-in with the modular decomposition. In M. Penttonen & E.M. Schmidt (Eds.), 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002) (pp. 388-397). Berlin, Germany: Springer-Verlag.

Thilikos, D.M., Fellows, M.R. & Bodlaender, H.L. (2002). Derivation of algorithms for cutwidth and related graph layout problems. UU-CS 2002-032. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T. & Niedermeier, R. (2002). Fixed parameters algorithms for dominating set and related problems on planar graphs. Algorithmica, 33, 461-493.

Bodlaender, H.L. & Kratsch, D. (2002). Kayles and nimbers. Journal of Algorithms, 43, 106-119.

Bodlaender, H.L., Van den Eijkhof, F. & Gaag, L.C. van der (2002). On the complexity of the MPA problem in probabilistic networks. In F. van Harmelen (Ed.), Proceedings 15th European Conference on Artificial Intelligence (pp. 675-679). Amsterdam, the Netherlands: IOS Press.

Bodlaender, H.L., Broersma, H.J., Fomin, F.V., Pyatkin, A.V. & Woeginer, G.J. (2002). Radio labeling with pre-assigned frequencies. UU-CS 2002-026. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Broersma, H.J., Fomin, F.V., Pyatkin, A.V. & Woeginger, G.J. (2002). Radio labelling with pre-assigned frequencies. In R. Moehring & R. Raman (Eds.), 10th Annual European Symposium on Algorithms (ESA 2002) (pp. 211-222). Berlin, Germany: Springer-Verlag.

Bodlaender, H.L., Dinneen, M.J. & Khoussainov, B. (2002). Relaxed update and partition network games. Fundamenta Informaticae, 49, 301-312.

Van den Eijkhof, F. & Bodlaender, H.L. (2002). Safe reduction rules for weighted treewidth. In L. Kucera (Ed.), Graph-Theoretic Concepts in Computer Science (WG 2002) (pp. 176-185). Berlin, Germany: Springer-Verlag.

Van den Eijkhof, F., Bodlaender, H.L. & Koster, A.M.C.A. (2002). Safe reduction rules for weighted treewidth. UU-CS 2002-051. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Zantema, H. & Bodlaender, H.L. (2002). Sizes of ordered decision trees. International Journal of Foundations of Computer Science, 13, 445-458.

Bodlaender, H.L. & Fomin, F.V. (2002). Tree decompositions with small cost. In M. Penttonen & E.M. Schmidt (Eds.), 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002) (pp. 378-387). Berlin, Germany: Springer-Verlag.

Bodlaender, H.L. & Fomin, F.V. (2002). Tree decompositions with small cost. UU-CS 2002-001. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. (2001). A generic NP-hardness proof for a variant of Graph Coloring. UU-CS 2001-08. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. (2001). A generic NP-hardness proof for a variant of graph coloring. Journal of Universal Computer Science, 7(12), 1114-1124.

Bodlaender, H.L., Serna, M.J. & Thilikos, D.M. (2001). A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth. UU-CS 2001-04. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Thilikos, D.M., Serna, M.J. & Bodlaender, H.L. (2001). A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. In F Meyer auf der Heide (Ed.), Proceedings 9th Annual European Symposium on Algorithms ESA 2001 (pp. 380-390). Berlin: Springer-Verlag.

Fomin, F.V. & Bodlaender, H.L. (2001). Approximation of pathwidth of outerplanar graphs. In A. Brandstaedt & L. van Bang (Eds.), Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 (pp. 166-176). Berlin: Springer-Verlag.

Bodlaender, H.L. & Rotics, U. (2001). Computing the treewidth and the minimum fill-in with the modular decomposition. UU-CS 2001-22. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Dinneen, M.J. & Khoussainov, B. (2001). On game theoretic models of networks. In P. Eades & T. Takaoka (Eds.), Proceedings 12th International Symposium on Algorithms and Computation (pp. 550-561). Berlin: Springer-Verlag.

Bodlaender, H.L., Van den Eijkhof, F. & Gaag, L.C. van der (2001). On the MPA problem in probabilistic networks. In B. Kröse, M. de Rijke, G. Schreiber & M. van Someren (Eds.), Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence (pp. 59-66). Amsterdam: Universiteit van Amsterdam.

Bodlaender, H.L. & Antwerpen-de Fluiter, B.L.E van (2001). Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica, 29, 543-559.

Bodlaender, H.L., Koster, A.M.C., Van den Eijkhof, F. & Gaag, L.C. van der (2001). Pre-processing for triangulation of probabilistic networks. In J. Breese & D. Koller (Eds.), Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (pp. 32-39). San Francisco: Morgan Kaufmann.

Bodlaender, H.L., Koster, A.M.C., Van den Eijkhof, F. & Gaag, L.C. van der (2001). Pre-processing for triangulation of probabilistic networks. In B. Kröse, M. de Rijke, G. Schreiber & M. van Someren (Eds.), Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence (pp. 67-68). Amsterdam: Universiteit van Amsterdam.

Bodlaender, H.L. & Antwerpen-de Fluiter, B.L.E van (2001). Reduction algorithms for graphs of small treewidth. Information and Computation, 167, 86-119.

Bodlaender, H.L., Dinneen, M.J. & Khoussainov, B. (2001). Relaxed Update and Partition Network Games. UU-CS 2001-15. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Koster, A.M.C.A., Bodlaender, H.L. & Hoesel, S.P.M. van (2001). Treewidth: Computational Experiments. UU-CS 2001-49. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Koster, A.M.C.A., Bodlaender, H.L. & Hoesel, S.P.M. van (2001). Treewidth: Computational experiments. In H. Broersmna, U. Faigle, J. Hurink & S. Pickl (Eds.), Electronic Notes in Discrete Mathematics. Amsterdam: Elsevier Science Publishers.

Thilikos, D.M., Serna, M.J. & Bodlaender, H.L. (2000). A constructive linear time algorithm for small cutwidth. UU-CS 2000-24. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Fomin, F.V. (2000). Approximation of pathwidth of outerplanar graphs. UU-CS 2000-23. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Kloks, A.J.J., Tan, R.B. & Leeuwen, J. van (2000). Approximations for Lambda-coloring of graphs. UU-CS 2000-25. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Thilikos, D.M. (2000). Constructive linear time algorithms for branchwidth. Barcelona, Spain: Departament de Llenguatges Sistemes Informatics.

Thilikos, D.M. & Bodlaender, H.L. (2000). Constructive linear time algorithms for branchwidth. UU-CS 2000-38. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Thilikos, D.M. & Serna, M.J. (2000). Constructive linear time algorithms for small cutwidth and carving-width. In L. Teng & S.H. Teng (Eds.), Proc. 11th International Symposium on Algorithms And Computation ISAAC '00 (pp. 192-203). Springer-Verlag.

Bodlaender, H.L., Tan, R.B. & Leeuwen, J. van (2000). Finding a Delta-regular supergraph of minimum order. UU-CS 2000-29. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Zantema, H. & Bodlaender, H.L. (2000). Finding small equivalent decision trees is hard. International Journal of Foundations of Computer Science, 11(2), 343-354.

Alber, J., Bodlaender, H.L., Fernau, H. & Niedermeier, R. (2000). Fixed parameter algorithms for planar dominating set. UU-CS 2000-28. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Alber, J., Bodlaender, H.L., Fernau, H. & Niedermeier, R. (2000). Fixed parameter algorithms for planar dominating set and related problems. In M. Halldorsson (Ed.), Proceedings 7th Scandinavian Workshop on Algorithm Theory (pp. 97-110). Springer-Verlag.

Bodlaender, H.L. (2000). Introduction to special issue on treewidth. Algorithmica, 27(3-4), 209-211.

Bodlaender, H.L. & Kratsch, D. (2000). Kayles and nimbers. UU-CS 2000-42. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Kloks, T., Tan, R.B. & Leeuwen, J. van (2000). Lambda-coloring of graphs. In H. Reichel & S. Tison (Eds.), 17th Annual Symposium on Theoretical Aspects of Computer Science (pp. 395-406). Berlin: Springer-Verlag.

Bodlaender, H.L. (2000). Necessary edges in k-chordalizations of graphs. UU-CS 2000-27. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Jansen, K. (2000). On the complexity of the maximum cut problem. Nordic journal of computing, 7, 14-31.

Bodlaender, H.L. (2000, September 28). The Algorithmic Theory of Treewidth. Marseille, 6th International Conference on Graph Theory.

Bodlaender, H.L., Fellows, M.R., Hallett, M.T., Wareham, H.T. & Warnow, T.J. (2000). The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theoretical Computer Science, 244, 167-188.

Haverkort, H.J. & Bodlaender, H.L. (1999). Finding a minimal tree in a polygon with its medial axis. In 11th Canadian Conference on Computational Geometry, Vancouver.

Zantema, H. & Bodlaender, H.L. (1999). Finding small equivalent decision trees is hard. UU-CS 1999-02. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Ridder, H.N. de & Bodlaender, H.L. (1999). Graph automorphisms with maximal projection distances. In G. Ciobanu & G. Paun (Eds.), Proceedings 12th International Symposium on Fundamentals of Computation Theory, FCT'99 (pp. 204-214). Berlin: Springer-Verlag.

Bodlaender, H.L. & Thilikos, D.M. (1999). Graphs with branchwidth at most three. Journal of Algorithms, 32, 167-194.

Yamazaki, K., Bodlaender, H.L., Fluiter, B. de & Thilikos, D.M. (1999). Isomorphism for graphs of bounded distance width. Algorithmica, 24, 105-127.

Zantema, H. & Bodlaender, H.L. (1999). Sizes of decision tables and decision trees. UU-CS 1999-31. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. (1998). A note on domino treewidth. UU-CS 1998-15. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. (1998). A note on domino treewidth. Discrete Mathematics and Theoretical Computer Science, 3, 109-118.

Bodlaender, H.L. (1998). A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209, 1-45.

Bodlaender, H.L. & Thilikos, D.M. (1998). Computing small search numbers in linear time. UU-CS 1998-05. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Hagerup, T. (1998). Parallel algorithms with optimal speedup for bounded treewidth. SIAM Journal on Computing, 27, 1-23.

Bodlaender, H.L., Deogun, J.S., Jansen, K, Kloks, T., Kratsch, D., Muller, H. & Tuza, Z. (1998). Rankings of graphs. SIAM Journal on Discrete Mathematics, 11, 168-181.

Bodlaender, H.L. & Hagerup, T. (1998). Tree decompositions of small diameter. In Proceedings 23nd International Symposium on Mathematical Foundations of Computer Science (MFCS'98) (pp. 702-712). Berlin: Springer-Verlag.

Bodlaender, H.L., Kloks, T., Kratsch, D. & Muller, H. (1998). Treewidth and minimum fill-in on d-trapezoid graphs. Journal Graph Algorithms and Applications, 2, 1-23.

Bodlaender, H.L. & Fluiter, B.L.E. de (1997). A problem on strings with an application to intervalizing colored graphs. Bulletin of the European Association for Theoretical Computer Science, 62, 323-324.

Gaag, L.C. van der & Bodlaender, H.L. (1997). Comparing loop cutsets and clique trees in probabilistic inference. UU-CS 1997-42. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Gaag, L.C. van der & Bodlaender, H.L. (1997). Comparing loop cutsets and clique trees in probabilistic inference. In K. Van Marcke & W. Daelemans (Eds.), Proceedings of the 9th Dutch Conference on Artificial Intelligence (pp. 71-80). Nederlandse Vereniging voor Kunstmatige Intelligentie (NVKI).

Bodlaender, H.L. & Thilikos, D.M. (1997). Constructive linear time algorithms for branchwidth. In P. Degano, R. Gorrieri & A. Marchetti-Spaccamela (Eds.), Proceedings 24th Int. Colloquium on Automata, Languages, and Programming (ICALP'97) (pp. 627-637). Berlin: Springer-Verlag.

Bodlaender, H.L. & Engelfriet, J. (1997). Domino treewidth. Journal of Algorithms, 94-123.

Thilikos, D.M. & Bodlaender, H.L. (1997). Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Information Processing Letters, 61, 227-232.

Bodlaender, H.L. & Thilikos, D.M. (1997). Graphs with branchwidth at most three. UU-CS 1997-37. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Fluiter, B.L.E. de & Bodlaender, H.L. (1997). Intervalizing sandwich graphs. UU-CS 1997-04. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Yamazaki, K., Bodlaender, H.L., Fluiter, B.L.E. de & Thilikos, D.M. (1997). Isomorphism for graphs of bounded distance width. In G. Bongiovanni, D.P. Bovet & G. Di Battista (Eds.), Proceedings 3rd Italian Conference on Algorithms and Complexity (CIAC'97) (pp. 276-287). Berlin: Springer Verlag.

Yamazaki, T., Bodlaender, H.L., Fluiter, B.L.E. de & Thilikos, D.M. (1997). Isomorphism for graphs of bounded distance width. UU-CS 1997-05. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Thilikos, D.M. & Yamazaki, K. (1997). It is hard to know when greedy is good for finding independent sets. Information Processing Letters, 61, 101-106.

Bodlaender, H.L., Leeuwen, J. van, Tan, R. & Thilikos, D.M. (1997). On interval routing schemes and treewidth. Information and Computation, 139, 91-109.

Bodlaender, H.L. & Fluiter, B.L.E. de (1997). Parallel algorithms for series parallel graphs. UU-CS 1997-21. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Fluiter, B.L.E. de & Bodlaender, H.L. (1997). Parallel algorithms for treewidth two. UU-CS 1997-23. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Fluiter, B.L.E. de & Bodlaender, H.L. (1997). Parallel algorithms for treewidth two. In R.H. Mohring (Ed.), Proc 23rd Int. Workshop on Graph Theoretic Concepts in Computer Science (WG'97) (pp. 157-170). Berlin: Springer-Verlag.

Bodlaender, H.L. & Fluiter, B.L.E. de (1997). Reduction algorithms for graphs of small treewidth. UU-CS 1997-24. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. (1997). Treewidth algorithmic techniques and results. In I. Privara & P. Ruzicka (Eds.), Proc 22nd Int. Symposium on Mathematical Foundations of Computer Sciences (MFCS'97) (pp. 19-36). Berlin: Springer-Verlag.

Bodlaender, H.L. & Thilikos, D.M. (1997). Treewidth for graphs with small chordality. Discrete Applied Mathematics, 79, 45-61.

Bodlaender, H.L. (1997). Treewidth: Algorithmic results and techniques. UU-CS 1997-31. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Kant, G. & Bodlaender, H.L. (1997). Triangulating Planar Graphs While Minimizing the Maximum Degree. Information and Computation, 135, 1-14.

Bodlaender, H.L. (1996). A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25, 1305-1317.

Bodlaender, H.L. (1996). A partial k-arboretum of graphs with bounded treewidth. UU-CS 1996-02. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Kloks, T. (1996). Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms, 21, 358-402.

Thilikos, D.M. & Bodlaender, H.L. (1996). Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. UU-CS 1996-30. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Thilikos, D.M. & Yamazaki, T. (1996). It is hard to know when greedy is good for finding independent sets. UU-CS 1996-29. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L., Leeuwen, J. van, Tan, R.B. & Thilikos, D.M. (1996). On interval routing schemes and treewidth. UU-CS 1996-41. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied Mathematics, 71, 55-77.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). Parallel algorithms for series parallel graphs. UU-CS 1996-13. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). Parallel algorithms for series parallel graphs. In J. Diaz & M. Serna (Eds.), Proceedings 4th Annual European Symposium on Algorithms ESA'96 (pp. 277-289). Berlin: Springer- Verlag.

Bodlaender, H.L. & Fluiter, B.L.E. de (1996). Reduction algorithms for constructing solutions in graphs with small treewidth. In Jin-Yi Cai & Chak Kuen Wong (Eds.), Proceedings 2nd Annual International Conference on Computing and Combinatorics (COCOON'96) (pp. 199-208). Springer-Verlag.

Bodlaender, H.L. & Fluiter, B.L.E. de (1995). Intervalizing k-colored graphs. UU-CS 1995-15. Utrecht: Utrecht University.

Bodlaender, H.L. & Fluiter, B.L.E. de (1995). On intervalizing k-colored graphs for DNA physical mapping. UU-CS 1995-20. Utrecht: Utrecht University.

Bodlaender, H.L. (1995). Parallel algorithms with optimal speedup for bounded treewidth. UU-CS 1995-25. Utrecht: Utrecht University.

Bodlaender, H.L., Kratsch, D. & Kloks, A.J.J. (1995). Rankings of graphs. UU-CS 1995-03. Utrecht: Utrecht University.

Bodlaender, H.L. & Fluiter, B.L.E. de (1995). Reduction algorithms for graphs with small treewidth. UU-CS 1995-37. Utrecht: Utrecht University.

Bodlaender, H.L. (1995). The hardness of problems on thin colored graphs. UU-CS 1995-36. Utrecht: Utrecht University.

Bodlaender, H.L. (1995). The parameterized complexity of sequence alignment and consensus. UU-CS 1995-01. Utrecht: Utrecht University.

Bodlaender, H.L., Kratsch, D. & Kloks, A.J.J. (1995). Treewidth and minimum fill-in on d-trapezoid graphs. UU-CS 1995-34. Utrecht: Utrecht University.

Bodlaender, H.L. & Thilikos, D.M. (1995). Treewidth and small separators for graphs with small chordality. UU-CS 1995-02. Utrecht: Utrecht University.

Bodlaender, H.L. (1994). Domino treewidth. UU-CS 1994-11. Utrecht.

Bodlaender, H.L. (1994). W[2]-hardness of Precedence Constrained K-processor Scheduling. UU-CS 1994-14. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1993). Efficient and constructive algorithms for the pathwidth and treewidth of graphs. RUU-CS 93-27. Utrecht.

Bodlaender, H.L. (1992). A linear time algorithm for finding tree-decompositions of small treewidth. RUU-CS 92-27. Utrecht.

Bodlaender, H.L. (1992). A tourist guide through Treewidth. RUU-CS 92-12. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). Approximating treewidth and pathwidth of some classes of perfect graphs. RUU-CS 92-29. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). On the Treewidth and Pathwidth of Permutation Graphs. RUU-CS 92-13. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). Only few graphs have bounded treewidth. RUU-CS 92-35. Utrecht.

Kloks, A.J.J. & Bodlaender, H.L. (1992). Testing superperfection of $k-$trees. RUU-CS 92-09. Utrecht.

Bodlaender, H.L., Kloks, A.J.J. & Kratsch, D. (1992). Treewidth and pathwidth of permutation graphs. RUU-CS 92-30. Utrecht.

Kant, G. & Bodlaender, H.L. (1992). Triangslating planar graphs while minimizing the maximum degree. RUU-CS 92-07. Utrecht.

Bodlaender, H.L. (1992). Two strikes against perfect phylogeny. RUU-CS 92-08. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1991). A simple linear time algorithm for triangulating three-colored graphs. RUU-CS 91-13. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1991). Approximating treewidth, pathwidth, and minimum elimination tree height. RUU-CS 91-01. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1991). Complexity aspects of 2-dimensional data compression. RUU-CS 91-35. Utrecht.

Bodlaender, H.L. (1991). Kayles on special classes of graphs - An application of Sprague-Grundy theory. RUU-CS 91-49. Utrecht.

Bodlaender, H.L. (1991). On the complexity of the maximum cut problem. RUU-CS 91-39. Utrecht.

Kant, G. & Bodlaender, H.L. (1991). Planar graph augmentation problems. RUU-CS 91-25. Utrecht.

Bodlaender, H.L. (1991). Restrictions of graph partition problems. Part I. RUU-CS 91-44. Utrecht.

Bodlaender, H.L. & Kratsch, D. (1991). The complexity of coloring games on perfect graphs. RUU-CS 91-03. Utrecht.

Bodlaender, H.L. & Kloks, A.J.J. (1990). Fast algorithms for the Tron game on trees. RUU-CS 90-11. Utrecht.

Bodlaender, H.L. (1990). On disjoint cycles in graphs. RUU-CS 90-29. Utrecht.

Bodlaender, H.L. (1990). The pathwidth and treewidth of cographs. RUU-CS 90-07. Utrecht.

Bodlaender, H.L. & Tel, G. (1989). Bit-optimal election in synchronous rings. RUU-CS 89-02. Utrecht.

Bodlaender, H.L. (1989). Complexity of path-forming games. RUU-CS 89-29. Utrecht.

Bodlaender, H.L. (1989). On linear time minor tests and depth first search. RUU-CS 89-01. Utrecht.

Bodlaender, H.L. (1989). On the complexity of some coloring games. RUU-CS 89-27. Utrecht.

Bodlaender, H.L. & Tel, G. (1989). Trade-offs in non-reversing diameter. RUU-CS 89-22. Utrecht.

Bodlaender, H.L. (1988). ACHROMATIC NUMBER is NP-complete for cographs and interval graphs. RUU-CS 88-25. Utrecht.

Beame, P.W. & Bodlaender, H.L. (1988). Distributed computing on transitive networks; the torus. RUU-CS 88-31. Utrecht.

Bodlaender, H.L. (1988). Improved self-reduction algorithms for graphs with bounded treewidth. RUU-CS 88-29. Utrecht.

Bodlaender, H.L. (1988). NC-algorithms for graphs of small treewidth. RUU-CS 88-04. Utrecht.

Bodlaender, H.L. (1988). New lower bound techniques for distributed leader finding and other problems on rings of processors. RUU-CS 88-18. Utrecht.

Bodlaender, H.L. (1988). Planar graphs with bounded treewidth. RUU-CS 88-14. Utrecht.

Bodlaender, H.L. (1988). The distributed bit complexity of the ring; from the anonymous to the non-anonymous case. RUU-CS 88-33. Utrecht.

Bodlaender, H.L. (1987). A better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors. RUU-CS 87-13. Utrecht.

Bodlaender, H.L. (1987). A new lowerbound technique for distributed extrema finding on rings of processors. RUU-CS 87-11. Utrecht.

Bodlaender, H.L. (1987). Dynamic programming on graphs with bounded treewidth. RUU-CS 87-22. Utrecht.

Bodlaender, H.L. (1987). Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees. RUU-CS 87-17. Utrecht.

Bodlaender, H.L. (1987). The maximum cut and minimum cut into bounded sets problems on cographs. RUU-CS 87-12. Utrecht.

Bodlaender, H.L. (1986). Classes of graphs with bounded tree-width. RUU-CS 86-22. Utrecht.

Bodlaender, H.L. & Leeuwen, J. van (1986). Distribution of records on a ring of processors. RUU-CS 86-06. Utrecht.

Bodlaender, H.L. (1985). Deadlock-free packet switching networks with variable packet size. RUU-CS 85-25. Utrecht.

Schoone, A.A., Bodlaender, H.L. & Leeuwen, J. van (1985). Diameter increase caused by edge deletion. RUU-CS 85-26. Utrecht.

Bodlaender, H.L. (1985). Emulations of processor networks with buses. RUU-CS 85-20. Utrecht.

Bodlaender, H.L. (1985). Finding grid embeddings with bounded maximum edge length is NP-complete. RUU-CS 85-18. Utrecht.

Bodlaender, H.L. & Leeuwen, J. van (1985). New upperbounds for decentralized extremafinding in a ring of processors. RUU-CS 85-15. Utrecht.

Bodlaender, H.L. (1985). On Approximation algorithms for determining minimum cost emulations. RUU-CS 85-10. Utrecht.

Bodlaender, H.L. & Leeuwen, J. van (1985). On the complexity of finding uniform emulations. RUU-CS 85-04. Utrecht.

Bodlaender, H.L. (1985). Some lowerbound results for decentralized extrema-finding in rings of processors. RUU-CS 85-22. Utrecht.

Bodlaender, H.L. (1985). The classification of coverings of processor networks. RUU-CS 85-11. Utrecht.

Bodlaender, H.L. (1985). The complexity of finding uniform emulations on fixed graphs. RUU-CS 85-14. Utrecht.

Bodlaender, H.L. (1985). The complexity of finding uniform emulations on paths and ring networks. RUU-CS 85-05. Utrecht.

Bodlaender, H.L., Wijshoff, H.A.G. & Leeuwen, J. van (1983). Compositions of double diagonal and cross Latin squares. RUU-CS 83-01. Utrecht.