prof. dr. H.L. (Hans) Bodlaender
H.L.Bodlaender@uu.nl
Gegenereerd op 2017-09-26 10:58:56


Chair
Algorithms and Complexity
Date of appointment 01.11.2014
Inaugural lecture date 10.12.2015
Strategic themes / Focus areas
Involved in the following study programme(s)
Scientific expertise
Algorithms
Networks
Data Structures
Graphs
Gegenereerd op 2017-09-26 10:58:56
All publications
  2017 - Scholarly publications
Bodlaender, Hans L., Ono, Hirotaka & Otachi, Yota (01.02.2017). A faster parameterized algorithm for pseudoforest deletion. 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
Bodlaender, Hans L., Kratsch, Stefan, Kreuzen, Vincent J C, Kwon, O. joung & Ok, Seongmin (10.01.2017). Characterizing width two for variants of treewidth. Discrete Applied Mathematics, 216, (pp. 29-46) (18 p.).
Pino, Willem J A, Bodlaender, Hans L. & Van Rooij, Johan M M (01.02.2017). Cut and Count and representative sets on branch decompositions. 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
  2017 - Popularising publications
Bodlaender, H.L. (2017). Hoe verbonden is je netwerk?. Nieuw archief voor wiskunde. Serie 5, 18 (1), (pp. 40) (46 p.).
  2016 - Scholarly publications
Bodlaender, Hans L., Fomin, Fedor V., Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, Saket & Thilikos, Dimitrios M. (01.11.2016). (Meta) Kernelization. Journal of the ACM, 63 (5).
Bodlaender, Hans L., Drange, Pål GrØnås, Dregi, Markus S., Fomin, Fedor V., Lokshtanov, Daniel & Pilipczuk, MichaŁ (2016). A cκn 5-Approximation algorithm for treewidth. SIAM Journal on Computing, 45 (2), (pp. 317-378) (62 p.).
Bodlaender, Hans L. & van Rooij, Johan M M (01.02.2016). Exact Algorithms for Intervalizing Coloured Graphs. Theory of Computing Systems, 58 (2), (pp. 273-286) (14 p.).
van den Akker, Marjan, Bodlaender, Hans L., van Dijk, Thomas C., Hoogeveen, Johannes & van Ommeren, Erik (2016). Robust recoverable path using backup nodes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 95-106) (12 p.). Springer.
Bodlaender, Hans, Nederlof, Jesper & van der Zanden, Tom (2016). Subexponential Time Algorithms for Embedding H-Minor Free Graphs. In Yuval Rabani Ioannis Chatzigiannakis Michael Mitzenmacher & Davide Sangiorgi (Eds.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (pp. 1-14) (14 p.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
  2015 - Scholarly publications
Jaffke, Lars & Bodlaender, Hans L. (01.11.2015). Definability equals recognizability for κ-outerplanar graphs. Leibniz International Proceedings in Informatics, LIPIcs (pp. 176-186) (11 p.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
Bodlaender, Hans L., Cygan, Marek, Kratsch, Stefan & Nederlof, Jesper (01.08.2015). Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Information and Computation, 243, (pp. 86-111) (26 p.).
Bodlaender, Hans L., Hajiaghayi, MohammadTaghi & Italiano, Giuseppe F. (01.10.2015). Editorial. Algorithmica, 73 (3).
Bodlaender, H.L., Hajiaghayi, Mohammad Taghi & Italiano, Giuseppe F. (01.12.2015). Erratum to: Editorial [Algorithmica, DOI:10.1007/s00453-015-0074-y]. Algorithmica, 73 (4), (pp. 750) (1 p.).
Bodlaender, Hans L., Kratsch, Dieter & Timmer, Sjoerd T. (11.01.2015). Exact algorithms for Kayles. Theoretical Computer Science, 562, (pp. 165-176) (12 p.).
Bodlaender, Hans L. & van Kreveld, M.J. (2015). Google Scholar makes it hard - the complexity of organizing one's publications. Information Processing Letters, 115 (12), (pp. 965-968) (4 p.).
Jaffke, Lars & Bodlaender, Hans L. (05.03.2015). MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs. arXiv.org (39 p.). 39 pages, 9 figures.
Ten Brinke, Chiel B., Van Houten, Frank J P & Bodlaender, Hans L. (01.11.2015). Practical algorithms for linear boolean-width. Leibniz International Proceedings in Informatics, LIPIcs (pp. 187-198) (12 p.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
Van Der Zanden, Tom C. & Bodlaender, Hans L. (2015). PSPACE-completeness of Bloxorz and of games with 2-buttons. In Vangelis Th. Paschos & Peter Widmayer (Eds.), Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings (pp. 403-415) (13 p.). Springer.
Bodlaender, Hans L., Heggernes, Pinar & Telle, Jan Arne (01.11.2015). Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electronic Notes in Discrete Mathematics, 49, (pp. 559-568) (10 p.).
Fafianie, Stefan, Bodlaender, Hans L. & Nederlof, Jesper (2015). Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica, 71 (3), (pp. 636) (660 p.).
Bodlaender, Hans L. & Nederlof, Jesper (2015). Subexponential time algorithms for finding small tree and path decompositions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 179-190) (12 p.). Springer.
  2014 - Scholarly publications
Bodlaender, Hans L. & van Kreveld, Marc (2014). Google Scholar makes it Hard - the complexity of organizing one's publications. CoRR, abs/1410.3820, (pp. 1-5) (5 p.).
Bodlaender, Hans L., Jansen, Bart M P & Kratsch, Stefan (01.01.2014). Kernelization lower bounds by cross-composition. SIAM Journal on Discrete Mathematics, 28 (1), (pp. 277-305) (29 p.).
Bodlaender, Hans (2014). Kernelization, Exponential Lower Bounds - Encyclopedia of Algorithms. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms (pp. 1-6) (6 p.). Springer US.
Bodlaender, Hans (2014). Lower Bounds for Kernelization. In Marek Cygan & Pinar Heggernes (Eds.), Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (pp. 1-14) (14 p.). Springer International Publishing.
Betzler, Nadja, Bodlaender, Hans L., Bredereck, Robert, Niedermeier, Rolf & Uhlmann, Johannes (01.01.2014). On making a distinguished vertex of minimum degree by vertex deletion. Algorithmica, 68 (3), (pp. 715-738) (24 p.).
Rietbergen, Merel, van der Gaag, Linda & Bodlaender, Hans (2014). Provisional Propagation for Verifying Monotonicity of Bayesian Networks. In Torsten Schaub, Gerhard Friedrich & Barry O. Sullivan (Eds.), ECAI 2014 - 21st European Conference on Artificial Intelligence (pp. 759-764). IOS Press.
Zanden, Tom C. van der & Bodlaender, Hans L. (2014). PSPACE-completeness of Bloxorz and of Games with 2-Buttons. CoRR, abs/1411.5951 (16 p.).
Bodlaender, Hans (2014). Treewidth of Graphs - Encyclopedia of Algorithms. In Ming-Yang Kao (Eds.), Encyclopedia of Algorithms (pp. 1-5) (5 p.). Springer US.
  2013 - Scholarly publications
Bodlaender, Hans L., Drange, Pål Grønås, Dregi, Markus S., Fomin, Fedor V., Lokshtanov, Daniel & Pilipczuk, Michal (2013). A O(ck n) 5-Approximation Algorithm for Treewidth. CoRR, abs/1304.6321.
Bodlaender, H.L. & Italiano, G.F. (2013). Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. (827 p.). Heidelberg New York Dordrecht London: Springer.
Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D. & Pilipczuk, M. (2013). An O(c^k n) 5-Approximation Algorithm for Treewidth. 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013 (pp. 499-508) (10 p.). IEEE Computer Society, 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013.
Bodlaender, H.L., Cygan, M., Kratsch, S. & Nederlof, J. (2013). Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. In F. V. Fomin, F. Freivalds, M. Z. Kwiatkowska & D. Peleg (Eds.), Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I (pp. 196-207) (12 p.). Springer.
Bodlaender, H.L., Kratsch, S. & Kreuzen, S. (2013). Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. In A. Brandstädt, K. Jansen & R. Reischuk (Eds.), Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers (pp. 88-99) (12 p.). Springer, 39th International Workshop on Graph-Theoretic Concepts in Computer Science.
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2013). Kernel bounds for path and cycle problems. Theoretical Computer Science, 511, (pp. 117-136) (20 p.).
van Rooij, J.M.M., Bodlaender, H.L. & van Kooten Niekerk, M.E. (2013). Partition Into Triangles on Bounded Degree Graphs. Theory of Computing Systems, 52 (4), (pp. 687-718) (32 p.).
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2013). Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. SIAM Journal on Discrete Mathematics, 27 (4), (pp. 2108-2142) (35 p.).
Fafianie, S., Bodlaender, H.L. & Kratsch, S. (2013). Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. In G. Gutin & S. Szeider (Eds.), Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. (pp. 321-334) (14 p.). Springer, 8th International Symposium on Parameterized and Exact Computation.
Bodlaender, H.L., Bonsma, P. & Lokshtanov, D. (2013). The Fine Details of Fast Dynamic Programming over Tree Decompositions. In G. Gutin & S. Szeider (Eds.), Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers (pp. 41-53) (13 p.). Springer, 8th International Symposium on Parameterized and Exact Computation.
Jansen, B.M.P. & Bodlaender, H.L. (2013). Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. Theory of Computing Systems, 53 (2), (pp. 263-299) (37 p.).
  2012 - Scholarly publications
Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2012). A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory of Computing Systems, 50 (3), (pp. 420-432) (13 p.).
van Rooij, J.M.M. & Bodlaender, H.L. (2012). Exact Algorithms for Edge Domination. Algorithmica, 64 (4), (pp. 535-564) (30 p.).
Bodlaender, H.L. (2012). Fixed-Parameter Tractability of Treewidth and Pathwidth. In H.L. Bodlaender, R.G. Downey, F.V. Fomin & D. Marx (Eds.), The Multivariate Algorithmic Revolution and Beyond (pp. 196-227) (32 p.). Springer.
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (2012). Kernel Bounds for Path and Cycle Problems. In Dániel Marx & Peter Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers (pp. 145-158) (14 p.). Springer, DBLP:conf/iwpec/BodlaenderJK11.
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (04.07.2012). Kernel Bounds for Structural Parameterizations of Pathwidth. In F. V. Fomin & P. Kaski (Eds.), Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012 (pp. 352-363) (12 p.). Springer, Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops.
Bodlaender, Hans L., Jansen, Bart M. P. & Kratsch, Stefan (2012). Kernel Bounds for Structural Parameterizations of Pathwidth. CoRR, abs/1207.4900.
Bodlaender, Hans L., Jansen, Bart M. P. & Kratsch, Stefan (2012). Kernelization Lower Bounds By Cross-Composition. CoRR, abs/1206.5941.
van der Gaag, Linda, Bodlaender, Hans L. & Feelders, Ad (2012). Monotonicity in Bayesian Networks. CoRR, abs/1207.4160.
Bodlaender, H.L., Fomin, F.V., Koster, A.M.C.A., Kratsch, D. & Thilikos, D.M. (2012). On exact algorithms for treewidth. ACM Transactions on Algorithms, 9 (1) (23 p.).
Hage, J. & Bodlaender, H.L. (2012). On switching classes, NLC-width, cliquewidth and treewidth. Theoretical Computer Science, 429, (pp. 30-35) (6 p.).
Bodlaender, H.L., Fomin, F.V., Golovach, P.A., Otachi, Y. & van Leeuwen, E.J. (2012). Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica, 64 (1), (pp. 85-111) (27 p.).
Bodlaender, H.L. (26.09.2012). Probabilistic Inference and Monadic Second Order Logic. In J.C.M. Baeten, T. Ball & F. de Boer (Eds.), Proceedings 7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science IFIP-TCS 2012 (pp. 43-56) (14 p.). Berlin/Heidelberg: Springer, 7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science.
Bodlaender, H.L., Schuurman, P. & Woeginger, G.J. (2012). Scheduling of pipelined operator graphs. Journal of Scheduling, 15 (3), (pp. 323-332) (10 p.).
Bodlaender, Hans L., Cygan, Marek, Kratsch, Stefan & Nederlof, Jesper (2012). Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. CoRR, abs/1211.1505.
Bodlaender, H.L., Downey, R.G., Fomin, F.V. & Marx, D. (2012). The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. (496 p.). Berlin: Springer.
  2011 - Scholarly 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 (pp. 444-454) (11 p.). Springer, SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science.
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) (12 p.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011.
van Rooij, J.M.M. & Bodlaender, H.L. (2011). Exact algorithms for dominating set. Discrete Applied Mathematics, 159, (pp. 2147-2164) (18 p.).
Bodlaender, H.L. & van Rooij, J.M.M. (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 (pp. 45-56) (12 p.). Springer, 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems.
Bodlaender, H.L. & Kratsch, D. (21.06.2011). Exact Algorithms for Kayles. In P. Kolman & J. Kratochvil (Eds.), Proceedings 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 (pp. 59-70) (12 p.). Springer, 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011.
Bodlaender, H.L., Heggernes, P. & Villanger, Y. (2011). Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica, 61 (4), (pp. 817-838) (22 p.).
Bodlaender, H.L., Thomassé, S. & Yeo, A. (2011). Kernel bounds for disjoint cycles and disjoint paths. Theoretical Computer Science, 412, (pp. 4570-4578) (9 p.).
Bodlaender, H.L., Jansen, B.P.M. & Kratsch, S. (2011). Kernel Bounds for Path and Cycle Problems. CoRR, abs/1106.4. DBLP:journals/corr/abs-1106-4141 To appear in IPEC 2011.
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (06.09.2011). Kernel Bounds for Path and Cycle Problems. In D. Marx & P. Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011 (pp. 145-158) (14 p.). Springer, 6th International Symposium on Parameterized and Exact Computation, IPEC 2011.
van der Gaag, L.C. & Bodlaender, H.L. (2011). On Stopping Evidence Gathering for Diagnostic Bayesian Networks. In W Liu (Eds.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 11th European Conference, ECSQARU 2011 (pp. 170-181) (12 p.). Springer, Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 11th European Conference, ECSQARU 2011.
Bodlaender, H.L., Jansen, B.M.P. & Kratsch, S. (22.08.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 (pp. 240-251) (12 p.). Springer, 18th International Symposium on Fundamentals of Computation Theory.
van Rooij, J.M.M., van Kooten Niekerk, M.E. & 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 (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science (pp. 558-569) (12 p.). Springer, SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science.
Bodlaender, Hans L., Jansen, Bart M. P. & Kratsch, Stefan (2011). Preprocessing for Treewidth - A Combinatorial Analysis through Kernelization. CoRR, abs/1104.4217.
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 (pp. 437-448) (12 p.). Springer, ICALP 2011, 38th International Colloquium on Automata, Languages, and Programming.
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, (pp. 362-388) (27 p.).
Bodlaender, H.L., Kozawa, K., Matsushima, T. & Otachi, Y. (2011). Spanning tree congestion of k-outerplanar graphs. Discrete Mathematics, 311, (pp. 1040-1045) (6 p.).
Kwisthout, J., Bodlaender, H.L. & van der Gaag, L.C. (2011). The Complexity of Finding the Most Probable Explanations in Probabilistic Networks. 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 (pp. 356-367) (12 p.). Springer, SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science.
Bodlaender, H.L. & Koster, A.M.C.A. (2011). Treewidth computations II. Lower bounds. Information and Computation, 209, (pp. 1103-1119) (17 p.).
Jansen, B.M.P. & Bodlaender, H.L. (2011). 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) (12 p.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011.
  2010 - Scholarly publications
Bodlaender, H.L. & van Dijk, T.C. (2010). A cubic kernel for feedback vertex set and loop cutset. Theory of Computing Systems, 46, (pp. 566-597) (32 p.).
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 (pp. 212-223) (12 p.). Berlin: Springer, 36th Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2010.
Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C. & Rosamond, F.A. (2010). Clustering with partial information. Theoretical Computer Science, 411, (pp. 1202-1211) (10 p.).
Otachi, Y., Bodlaender, H.L. & van Leeuwen, E.J. (2010). Complexity results for the Spanning Tree Congestion Problem. In D.M. Thilikos (Eds.), Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2010 (pp. 3-14) (12 p.). Springer, International Workshop on Graph Theoretic Concepts in Computer Science.
Bodlaender, Hans L., Jansen, Bart M. P. & Kratsch, Stefan (2010). Cross-Composition: A New Technique for Kernelization Lower Bounds. CoRR, abs/1011.4224.
Dorn, F., Penninkx, E., Bodlaender, H.L. & Fomin, F.V. (2010). Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Algorithmica, 58, (pp. 790-810) (21 p.).
Bodlaender, H.L., van Leeuwen, E.J. & van Rooij, J.M.M. (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 (pp. 174-185) (12 p.). Berlin: Springer, International Symposium on Mathematical Foundations of Computer Science.
Kwisthout, J.H.P., Bodlaender, H.L. & van der Gaag, L.C. (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) (6 p.). Amsterdam: IOS Press, European Conference on Artificial Intelligence.
Bodlaender, H.L., Grigoriev, A., Grigorieva, N.V. & Hendriks, A. (2010). The Valve Location Problem in Simple Network Topologies. INFORMS Journal on Computing, 22, (pp. 433-442) (10 p.).
Bodlaender, H.L. & Koster, A.M.C.A. (2010). Treewidth computations I. Upper bounds. Information and Computation, 208, (pp. 259-275) (17 p.).
Jansen, Bart M. P. & Bodlaender, Hans L. (2010). Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. CoRR, abs/1012.4701.
  2009 - Scholarly publications
Bodlaender, Hans L., Fomin, Fedor V., Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, Saket & Thilikos, Dimitrios M. (2009). (Meta) Kernelization. CoRR, abs/0904.0727.
Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S. & Thilikos, D.M. (2009). (Meta) kernelization. Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS 2009 (pp. 629-638) (10 p.). IEEE Press, 50th Annual Symposium on Foundations of Computer Science, FOCS 2009.
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), (pp. 231-244) (14 p.).
van Rooij, J.M.M. & 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 (pp. 566-577) (12 p.). Berlin: Springer, 17th Annual European Symposium on Algorithms, ESA 2009.
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 (pp. 635-646) (12 p.). Berlin: Springer, 17th Annual European Symposium on Algorithms, ESA 2009.
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), (pp. 423-434) (12 p.).
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: Theory and Applications, 42 (9), (pp. 939-951) (13 p.).
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 (pp. 50-60) (11 p.). Berlin: Springer, 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009.
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) (4 p.). Enschede: University of Twente, Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization.
Bodlaender, H.L., Grigoriev, A., Grigorieva, N.V. & Hendriks, A. (2009). 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 (pp. 55-65) (11 p.). Berlijn: Springer, 34th Workshop on Graph Theoretic Concepts in Computer Science.
Alt, H., Bodlaender, H.L., van Kreveld, M.J., Rote, G. & Tel, G. (2009). Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst., 44 (2), (pp. 160-174) (15 p.). DBLP:journals/mst/AltBKRT09.
  2009 - Professional publications
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 (pp. 17-37) (21 p.). Berlin: Springer, 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009.
  2008 - Scholarly publications
Bodlaender, H.L. & Penninkx, E. (14.05.2008). 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) (12 p.). Berlin: Springer, Third International Workshop on Parameterized and Exact Computation, IWPEC 2008.
Bodlaender, H.L., Penninkx, E. & Tan, R.B. (15.12.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 (pp. 306-317) (12 p.). Berlin: Springer, 19th International Symposium on Algorithms and Computation, ISAAC 2008.
Bodlaender, H.L., Fellows, M.R., Heggernes, P., Mancini, F., Papadopoulos, C. & Rosamond, F.A. (25.08.2008). Clustering with Partial Information. In E Ochmanski & J Tyszkiewicz (Eds.), Proceedings 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008 (pp. 144-155) (12 p.). Berlin: Springer, 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008.
Bodlaender, H.L. & Koster, A.M.C.A. (2008). Combinatorial Optimization on Graphs of Bounded Treewidth. Computer Journal, 51 (3), (pp. 255-269) (15 p.). 161 doi: 10.1093/comjnl/bxm037.
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 164b Fourth European Workshop on Probabilistic Graphical Models (PGM'08).
van Rooij, J.M.M. & Bodlaender, H.L. (21.02.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 (pp. 657-668) (12 p.). Schloss Dagstuhl, Germany: Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science.
Bodlaender, H.L. & Fomin, F.V. (2008). Equitable colorings of bounded treewidth graphs. Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004 (pp. 204-214) (11 p.). Springer, 29th International Symposium on Mathematical Foundations of Computer Science.
van Rooij, J.M.M. & Bodlaender, H.L. (14.05.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) (42 p.). Berlin: Springer, Third International Workshop on Parameterized and Exact Computation, IWPEC 2008.
Bodlaender, H.L., Heggernes, P. & Villanger, Y. (15.12.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 (pp. 282-293) (12 p.). Berlin: Springer, 19th International Symposium on Algorithms and Computation, ISAAC 2008.
Bodlaender, H.L., Tan, R.B., van Dijk, T.C. & van Leeuwen, J. (02.07.2008). Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. In J Gudmundsson (Eds.), Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory (pp. 102-113) (12 p.). Berlijn: Springer, 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008.
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, (pp. 2-21) (20 p.).
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 (pp. 563-574) (12 p.). Springer, ICALP 2008.
Bodlaender, H.L., Grigoriev, A. & Koster, A.M.C.A. (2008). Treewidth lower bounds with brambles. Algorithmica, 51, (pp. 81-98) (18 p.).
  2007 - Scholarly publications
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) (12 p.). Springer, Lecture Notes in Computer Science, 153b.
Grigoriev, A. & Bodlaender, H.L. (2007). Algorithms for graphs embeddable with few crossings per edge. Algorithmica, 49, (pp. 1-11) (11 p.). 139c.
Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Local Monotonicity in Probabilistic Networks. In K. Mellouli (Eds.), Procedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQUARU 2007 (pp. 548-559) (12 p.). Springer, Kwisthout07b ICSM 2007.
Bodlaender, H.L. & Koster, A.M.C.A. (2007). On the maximum cardinality search lower bound for treewidth. Discrete Applied Mathematics, 155, (pp. 1348-1372) (25 p.). 138d.
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 (Eds.), Proceedings 13th Annual International Computing and Combinatorics Conference, COCOON 2007 (pp. 86-96) (11 p.). Heidelberg: Springer, Lecture Notes in Computer Science, volume 4598, 159a.
Van den Eijkhof, F., Bodlaender, H.L. & Koster, A.M.C.A. (2007). Safe reduction rules for weighted treewidth. Algorithmica, 47, (pp. 139-158) (20 p.). 126d.
Bachoore, E.H. & Bodlaender, H.L. (2007). Weighted Treewidth: Algorithmic Techniques and Results. In T. Tokuyama (Eds.), Proceedings 18th International Symposium on Algorithms and Computation, ISAAC 2007 (pp. 893-903) (11 p.). Springer Lecture Notes in Computer Science, volume 4835, BachooreB.
Alt, H., Bodlaender, H.L., van Kreveld, M.J., 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) (14 p.). Springer, Lecture Notes in Computer Science, volume 4475, 158b.
  2007 - Professional publications
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) (15 p.). Springer, Lecture Notes in Computer Science, volume 4474, 160.
  2006 - Scholarly publications
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) (12 p.). Springer, Lecture Notes in Computer Science, volume 4041, 148b.
Bodlaender, H.L., Koster, A.M.C.A. & Wolle, T. (2006). Contraction and treewidth lower bounds. Journal of Graph Algorithms and Applications, 10, (pp. 5-49) (45 p.). 135c.
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) (13 p.). King's College, London, 157.
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) (12 p.). Springer, Lecture Notes in Computer Science, volume 4168, 151b.
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 (pp. 69-82) (14 p.). Springer, WAOA 2006.
Katriel, I. & Bodlaender, H.L. (2006). Online topological ordering. ACM Transactions on Algorithms, 2, (pp. 364-379) (16 p.). 143c WAOA 2006.
Bodlaender, H.L. & Koster, A.M.C.A. (2006). Safe separators for treewidth. Discrete Mathematics, 306, (pp. 337-350) (14 p.). 127c.
Bodlaender, H.L. (2006). Treewidth: Characterizations, Applications, and Computations. In Fedor V. Fomin (Eds.), Proceedings 32nd International Workshop on class = Wet, Graph-Theoretic Concepts in Computer Science WG 2006 (pp. 1-14) (14 p.). Springer, Lecture Notes in Computer Science, volume 4271, 152b Paper for the Seventeenth ICMI Study conference. Technology revisited.
  2005 - Scholarly publications
Grigoriev, A. & Bodlaender, H.L. (2005). Algorithms for graphs embeddable with few crossings per edge. In M. Liskiewicz & R. Reischuk (Eds.), Fundamentals of Computation Theory - Proceedings 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005. (pp. 378-387) (10 p.). Springer, Bod05d.
Thilikos, Dimitrios, Serna, Maria J. & Bodlaender, H.L. (2005). Cutwidth I: A linear time fixed parameter algorithm. Journal of Algorithms in Cognition, Informatics and Logic, 56, (pp. 1-24) (24 p.). 110d.
Thilikos, Dimitrios, Serna, Maria J. & Bodlaender, H.L. (2005). Cutwidth II: Algorithms for partial $w$-trees of bounded degree. Journal of Algorithms in Cognition, Informatics and Logic, 56, (pp. 25-49) (25 p.). 114d.
Koster, A.M.C.A., Wolle, T. & Bodlaender, H.L. (2005). Degree-based treewidth lower bounds. In Sotiris E. Nikoletseas (Eds.), Experimental and Efficient Algorithms - 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005. Proceedings (pp. 101-112) (12 p.). Springer.
Bodlaender, H.L. (2005). Discovering treewidth. In Peter Vojtáš, Mária Bieliková, Bernadette Charron-Bost & Ondrej Sýkora (Eds.), SOFSEM 2005: Theory and Practive of Computer Science - 31st Conference on Current Trends in Theory and Practive of Computer Science Liptovský Ján, Slovakia, January 22-28, 2005. Proceedings (pp. 1-16) (16 p.). Springer.
Dorn, F., Penninkx, E., Bodlaender, H.L. & Fomin, F.V. (2005). Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In Gerth Stølting Brodal & Stefano Leonardi (Eds.), Algorithms – ESA 2005 - 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings (pp. 95-106) (12 p.). Springer.
Bodlaender, H.L. & Fomin, F.V. (2005). Equitable colorings of bounded treewidth graphs. Theoretical Computer Science, 349, (pp. 22-30) (9 p.). Bod05c AOSE 2004.
Bachoore, E. & Bodlaender, H.L. (2005). New upper bound heuristics for treewidth. In Sotiris E. Nikoletseas (Eds.), Experimental and Efficient Algorithms - 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005. Proceedings (pp. 216-227). Springer.
Katriel, Irit & Bodlaender, H.L. (2005). Online topological ordering. Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005 (pp. 443-450) (8 p.). 143b.
Bodlaender, H.L., Koster, A.M.C.A. & Van den Eijkhof, F. (2005). Preprocessing rules for triangulation of probabilistic networks. Computational Intelligence, 21 (3), (pp. 286-305) (20 p.).
Bodlaender, H.L. & Fomin, F.V. (2005). Tree decompositions with small cost. Discrete Applied Mathematics, 145, (pp. 143-154) (12 p.). Bod05b.
Bodlaender, H.L., Grigoriev, A. & Koster, A.M.C.A. (2005). Treewidth lower bounds with brambles. In Gerth Stølting Brodal & Stefano Leonardi (Eds.), Algorithms – ESA 2005 - 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings (pp. 391-402) (12 p.). Springer, Bod05g.
  2004 - Scholarly publications
Bodlaender, H.L. & Tel, G. (2004). A note on rectilinearity and angular resolution. Journal of Graph Algorithms and Applications, 8 (1), (pp. 89-94) (6 p.). 129b.
Bodlaender, H.L., Kloks, T., Tan, R.B. & van Leeuwen, J. (2004). Approximations for Lambda-Colorings of Graphs. Computer Journal, 47, (pp. 193-204) (12 p.).
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) (12 p.). Berlin: Springer, 99b.
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) (12 p.). Springer, 135b.
van der Gaag, L.C., 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) (8 p.). AUAI Press, uai04.
Bodlaender, H.L. & Koster, A.M.C.A. (2004). On the Maximum Cardinality Search Lower Bound for Treewidth. Proceedings 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2004 (pp. 81-92) (12 p.). Berlin: Springer, 138b.
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, (pp. 1-16) (16 p.). 122c I'KNOW'04.
Bodlaender, H.L. & Koster, A.M.C.A. (2004). Safe separators for treewidth. Proceedings 6th Workshop on Algorithm Engineering & Experiments ALENEX04 (pp. 70-78) (9 p.). 127b.
Bodlaender, H.L., de Figueiredo, C.M.H., Gutierrez, M., Kloks, T. & Niedermeier, R. (2004). Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4's. WEA 2004, Proceedings 3rd International Workshop on Experimental and Efficient Algorithms (pp. 87-99) (13 p.). Berlin: Springer, 132.
  2003 - Scholarly publications
Bodlaender, H.L. & Rotics, U. (2003). Computing the treewidth and the minimum fill-in with the modular decomposition. Algorithmica, 36, (pp. 375-408) (34 p.). 118c.
Bodlaender, H.L., Tan, R.B. & van Leeuwen, J. (2003). Finding a Delta-regular supergraph of minimum order. Discrete Applied Mathematics, 131, (pp. 3-9) (7 p.).
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). FCT'03, Proceedings 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 2751 (pp. 61-72) (12 p.). Berlin: Springer, 130b.
Bodlaender, H.L. (2003). Necessary edges in k-chordalizations of graphs. Journal of Combinatorial Optimization, 7, (pp. 283-290) (8 p.). 111b.
Bodlaender, H.L., Fellows, M. R. & Thilikos, D.M. (2003). Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. Proceedings 28nd International Symposium on Mathematical Foundations of Computer Science, MFCS'03, Lecture Notes in Computer Science, volume 2747 (pp. 239-248) (10 p.). Berlin: Springer, 123b.
  2002 - Scholarly publications
Bodlaender, H.L. & Fomin, F.V. (2002). Approximation of pathwidth of outerplanar graphs. Journal of Algorithms in Cognition, Informatics and Logic, 43, (pp. 190-200) (11 p.).
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) (10 p.). Berlin, Germany: Springer.
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, (pp. 461-493) (33 p.).
Bodlaender, H.L. & Kratsch, D. (2002). Kayles and nimbers. Journal of Algorithms in Cognition, Informatics and Logic, 43, (pp. 106-119) (14 p.).
Bodlaender, H.L., Van den Eijkhof, F. & van der Gaag, L.C. (2002). On the complexity of the MPA problem in probabilistic networks. In F. van Harmelen (Eds.), Proceedings 15th European Conference on Artificial Intelligence (pp. 675-679) (5 p.). Amsterdam, the Netherlands: IOS Press.
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) (12 p.). Berlin, Germany: Springer.
Bodlaender, H.L., Dinneen, M.J. & Khoussainov, B. (2002). Relaxed update and partition network games. Fundamenta Informaticae, 49, (pp. 301-312) (12 p.).
Van den Eijkhof, F. & Bodlaender, H.L. (2002). Safe reduction rules for weighted treewidth. In L. Kucera (Eds.), Graph-Theoretic Concepts in Computer Science (WG 2002) (pp. 176-185) (10 p.). Berlin, Germany: Springer.
Zantema, H. & Bodlaender, H.L. (2002). Sizes of ordered decision trees. International Journal of Foundations of Computer Science, 13, (pp. 445-458) (14 p.).
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) (10 p.). Berlin, Germany: Springer.
  2001 - Scholarly publications
Bodlaender, H.L. (2001). A generic NP-hardness proof for a variant of graph coloring. Journal of Universal Computer Science, 7 (12), (pp. 1114-1124) (11 p.).
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 (Eds.), Proceedings 9th Annual European Symposium on Algorithms ESA 2001 (pp. 380-390) (11 p.). Berlin: Springer, 9th Annual European Symposium on Algorithms ESA 2001.
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) (11 p.). Berlin: Springer, 27th International Workshop on Graph-Theoretic Concepts in Computer Science.
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) (12 p.). Berlin: Springer, 12th International Symposium on Algorithms and Computation (ISAAC 2001).
Bodlaender, H.L., Van den Eijkhof, F. & van der Gaag, L.C. (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) (8 p.). Amsterdam: Universiteit van Amsterdam, 13th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2001).
Bodlaender, H.L. & van Antwerpen-de Fluiter, B.L.E (2001). Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica, 29, (pp. 543-559) (17 p.).
Bodlaender, H.L., Koster, A.M.C., Van den Eijkhof, F. & van der Gaag, L.C. (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) (2 p.). Amsterdam: Universiteit van Amsterdam, 13th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC 2001).
Bodlaender, H.L., Koster, A.M.C., Van den Eijkhof, F. & van der Gaag, L.C. (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) (8 p.). San Francisco: Morgan Kaufmann, 17th Conference on Uncertainty in Artificial Intelligence.
Bodlaender, H.L. & van Antwerpen-de Fluiter, B.L.E (2001). Reduction algorithms for graphs of small treewidth. Information and Computation, 167, (pp. 86-119) (34 p.).
Koster, A.M.C.A., Bodlaender, H.L. & van Hoesel, S.P.M. (2001). Treewidth: Computational experiments. In H. Broersmna, U. Faigle, J. Hurink & S. Pickl (Eds.), Electronic Notes in Discrete Mathematics Amsterdam: Elsevier Science, gepubliceerd in(Electronic Notes in Descrete Mathematics) een internet magazine.
  2000 - Scholarly publications
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) (12 p.). Springer.
Zantema, H. & Bodlaender, H.L. (2000). Finding small equivalent decision trees is hard. International Journal of Foundations of Computer Science, 11 (2), (pp. 343-354) (12 p.).
Alber, J., Bodlaender, H.L., Fernau, H. & Niedermeier, R. (2000). Fixed parameter algorithms for planar dominating set and related problems. In M. Halldorsson (Eds.), Proceedings 7th Scandinavian Workshop on Algorithm Theory (pp. 97-110) (14 p.). Springer.
Bodlaender, H.L., Kloks, T., Tan, R.B. & van Leeuwen, J. (2000). Lambda-coloring of graphs. In H. Reichel & S. Tison (Eds.), 17th Annual Symposium on Theoretical Aspects of Computer Science (pp. 395-406) (12 p.). Berlin: Springer.
Bodlaender, H.L. & Jansen, K. (2000). On the complexity of the maximum cut problem. Nordic journal of computing, 7, (pp. 14-31) (18 p.).
Bodlaender, Hans L. (01.07.2000). The algorithmic theory of treewidth. Electronic Notes in Discrete Mathematics, 5, (pp. 27-30) (4 p.).
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, (pp. 167-188) (22 p.).
  2000 - Professional publications
Bodlaender, H.L. (2000). Introduction to special issue on treewidth. Algorithmica, 27 (3-4), (pp. 209-211) (3 p.).
  1999 - Scholarly publications
Haverkort, H.J. & Bodlaender, H.L. (1999). Finding a minimal tree in a polygon with its medial axis. 11th Canadian Conference on Computational Geometry, Vancouver
de Ridder, H.N. & 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) (10 p.). Berlin: Springer.
Bodlaender, H.L. & Thilikos, D.M. (1999). Graphs with branchwidth at most three. Journal of Algorithms in Cognition, Informatics and Logic, 32, (pp. 167-194) (28 p.).
Yamazaki, K., Bodlaender, H.L., de Fluiter, B. & Thilikos, D.M. (1999). Isomorphism for graphs of bounded distance width. Algorithmica, 24, (pp. 105-127) (23 p.).
Bodlaender, Hans L., Kloks, Ton & Niedermeier, Rolf (01.12.1999). SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. Electronic Notes in Discrete Mathematics, 3, (pp. 1-8) (8 p.).
  1998 - Scholarly publications
Bodlaender, H.L. (1998). A note on domino treewidth. Discrete Mathematics and Theoretical Computer Science, 3, (pp. 109-118) (11 p.).
Bodlaender, H.L. & Hagerup, T. (1998). Parallel algorithms with optimal speedup for bounded treewidth. SIAM Journal on Computing, 27, (pp. 1-23) (23 p.).
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, (pp. 168-181) (14 p.).
Bodlaender, H.L. & Hagerup, T. (1998). Tree decompositions of small diameter. Proceedings 23nd International Symposium on Mathematical Foundations of Computer Science (MFCS'98) (pp. 702-712) (11 p.). Berlin: Springer.
Bodlaender, H.L., Kloks, T., Kratsch, D. & Muller, H. (1998). Treewidth and minimum fill-in on d-trapezoid graphs. Journal of Graph Algorithms and Applications, 2 (5), (pp. 1-23) (23 p.).
  1998 - Professional publications
Bodlaender, H.L. (1998). A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209, (pp. 1-45) (45 p.).
  1997 - Scholarly publications
Bodlaender, H.L. & de Fluiter, B.L.E. (1997). A problem on strings with an application to intervalizing colored graphs. Bulletin of the European Association for Theoretical Computer Science, 62, (pp. 323-324) (2 p.).
van der Gaag, L.C. & 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) (10 p.). 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) (11 p.). Berlin: Springer.
Bodlaender, H.L. & Engelfriet, J. (1997). Domino treewidth. Journal of Algorithms in Cognition, Informatics and Logic (24), (pp. 94-123) (30 p.).
Thilikos, D.M. & Bodlaender, H.L. (1997). Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Information Processing Letters, 61, (pp. 227-232) (6 p.).
Yamazaki, K., Bodlaender, H.L., de Fluiter, B.L.E. & 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) (12 p.). Berlin: Springer.
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, (pp. 101-106) (6 p.).
Bodlaender, H.L., van Leeuwen, J., Tan, R. & Thilikos, D.M. (1997). On interval routing schemes and treewidth. Information and Computation, 139, (pp. 91-109) (18 p.).
de Fluiter, B.L.E. & Bodlaender, H.L. (1997). Parallel algorithms for treewidth two. In R.H. Mohring (Eds.), Proc 23rd Int. Workshop on Graph Theoretic Concepts in Computer Science (WG'97) (pp. 157-170) (13 p.). Berlin: Springer.
Bodlaender, H.L. & Thilikos, D.M. (1997). Treewidth for graphs with small chordality. Discrete Applied Mathematics, 79, (pp. 45-61) (16 p.).
Kant, G. & Bodlaender, H.L. (1997). Triangulating Planar Graphs While Minimizing the Maximum Degree. Information and Computation, 135, (pp. 1-14) (14 p.).
  1997 - Professional publications
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) (18 p.). Berlin: Springer.
  1996 - Scholarly publications
Bodlaender, H.L. (1996). A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25, (pp. 1305-1317) (13 p.).
Bodlaender, H.L. & Kloks, T. (1996). Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms in Cognition, Informatics and Logic, 21, (pp. 358-402) (45 p.).
Bodlaender, H.L. & de Fluiter, B.L.E. (1996). On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied Mathematics, 71, (pp. 55-77) (23 p.).
Bodlaender, H.L. & de Fluiter, B.L.E. (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) (13 p.). Berlin: Springer.
Bodlaender, H.L. & de Fluiter, B.L.E. (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) (10 p.). Springer.
  1993 - Scholarly publications
Bodlaender, Hans L. (1993). A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth. Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing - STOC'93 (pp. 226-234) (9 p.). New York, NY, USA: ACM.
Bodlaender, H. & Kloks, T. (01.07.1993). A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. Journal of Algorithms in Cognition, Informatics and Logic, 15 (1), (pp. 160-172) (13 p.).
Bodlaender, H. L. (1993). A Tourist Guide through Treewidth. Acta Cybernetica, 11 (1--2), (pp. 1-21) (21 p.).
Kloks, T., Bodlaender, H., Müller, H. & Kratsch, D. (1993). Computing treewidth and minimum fill-in: All you need are the minimal separators. In Thomas Lengauer (Eds.), Algorithms—ESA '93 - First Annual European Symposium Bad Honnef, Germany September 30–October 2, 1993 Proceedings (pp. 260-271) (12 p.). Springer Berlin Heidelberg.
Bodlaender, Hans (1993). Kayles on special classes of graphs — An application of Sprague-Grundy theory. In Ernst W. Mayr (Eds.), Graph-Theoretic Concepts in Computer Science - 18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings (pp. 90-102) (13 p.). Springer Berlin Heidelberg.
  1992 - Scholarly publications
Bodlaender, Hans & Kloks, Ton (1992). A simple linear time algorithm for triangulating three-colored graphs. In Alain Finkel & Matthias Jantzen (Eds.), STACS 92 - 9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992 Proceedings (pp. 413-423) (11 p.). Springer Berlin Heidelberg.
Kloks, Ton & Bodlaender, Hans (1992). Approximating treewidth and pathwidth of some classes of perfect graphs. In Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki & Masafumi Yamashita (Eds.), Algorithms and Computation - Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings (pp. 116-125) (10 p.). Springer Berlin Heidelberg.
Bodlaender, Hans, Gilbert, John R., Hafsteinsson, Hjálmtýr & Kloks, Ton (1992). Approximating treewidth, pathwidth, and minimum elimination tree height. In Gunther Schmidt & Rudolf Berghammer (Eds.), Graph-Theoretic Concepts in Computer Science - 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings (pp. 1-12) (12 p.). Springer Berlin Heidelberg.
Bodlaender, Hans (1992). On disjoint cycles. In Gunther Schmidt & Rudolf Berghammer (Eds.), Graph-Theoretic Concepts in Computer Science (pp. 230-238) (9 p.). Springer Berlin Heidelberg.
Kloks, T. & Bodlaender, H. (1992). Testing superperfection of k-trees. In Otto Nurmi & Esko Ukkonen (Eds.), Algorithm Theory — SWAT '92 - Third Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings (pp. 292-303) (12 p.). Springer Berlin Heidelberg.
Bodlaender, Hans L. & Kratsch, Dieter (14.12.1992). The complexity of coloring games on perfect graphs. Theoretical Computer Science, 106 (2), (pp. 309-326) (18 p.).
Kant, Goos & Bodlaender, Hans (1992). Triangulating planar graphs while minimizing the maximum degree. In Otto Nurmi & Esko Ukkonen (Eds.), Algorithm Theory — SWAT '92 - Third Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings (pp. 258-271) (14 p.). Springer Berlin Heidelberg.
Bodlaender, Hans, Fellows, Mike R. & Warnow, Tandy J. (1992). Two strikes against perfect phylogeny. In W. Kuich (Eds.), Automata, Languages and Programming - 19th International Colloquium Wien, Austria, July 13–17, 1992 Proceedings (pp. 273-283) (11 p.). Springer Berlin Heidelberg.
  1991 - Scholarly publications
Bodlaender, Hans & Kloks, Ton (1991). Better algorithms for the pathwidth and treewidth of graphs. In Javier Leach Albert, Burkhard Monien & Mario Rodríguez Artalejo (Eds.), Automata, Languages and Programming - 18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings (pp. 544-555) (12 p.). Springer Berlin Heidelberg.
Bodlaender, Hans, Gonzalez, T. & Kloks, T. (1991). Complexity aspects of map compression. Data Compression Conference, DCC'91. (pp. 287-296). IEEE Computer Society.
Bodlaender, Han L. (30.04.1991). New lower bound techniques for distributed leader finding and other problems on rings of processors. Theoretical Computer Science, 81 (2), (pp. 237-256) (20 p.).
Bodlaender, Hans (1991). On the complexity of some coloring games. International Journal of Foundations of Computer Science, 02 (02), (pp. 133-147).
Bodlaender, Hans (1991). On the complexity of some coloring games. In Rolf H. Möhring (Eds.), Graph-Theoretic Concepts in Computer Science - 16th International Workshop WG '90 Berlin, Germany, June 20–22, 1990 Proceedings (pp. 30-40) (11 p.). Springer Berlin Heidelberg.
Kant, Goos & Bodlaender, Hans (1991). Planar graph augmentation problems - 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings. In Frank Dehne, Jörg-Rüdiger Sack & Nicola Santoro (Eds.), Algorithms and Data Structures (pp. 286-298) (13 p.). Springer Berlin Heidelberg.
Bodlaender, H. L. (01.02.1991). Some lower bound results for decentralized extrema-finding in rings of processors. Journal of Computer and System Sciences, 42 (1), (pp. 97-118) (22 p.).
  1990 - Scholarly publications
Bodlaender, Hans L. & Tel, Gerard (01.12.1990). Bit-optimal election in synchronous rings. Information Processing Letters, 36 (1), (pp. 53-56) (4 p.).
Bodlaender, H. L., Gritzmann, P., Klee, V. & Van Leeuwen, J. (01.06.1990). Computational complexity of norm-maximization. Combinatorica, 10 (2), (pp. 203-225) (23 p.).
Bodlaender, Hans (1990). Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. In Manfred Nagl (Eds.), Graph-Theoretic Concepts in Computer Science - 15th International Workshop WG '89 Castle Rolduc, The Netherlands, June 14–16, 1989 Proceedings (pp. 232-244). Springer.
Bodlaender, Hans L. (01.12.1990). Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms in Cognition, Informatics and Logic, 11 (4), (pp. 631-643) (13 p.).
Bodlaender, Hans L. (01.05.1990). The complexity of finding uniform emulations on paths and ring networks. Information and Computation, 86 (1), (pp. 87-106) (20 p.).
Bodlaender, Hans & Möhring, Rolf H. (1990). The pathwidth and treewidth of cographs. In John R. Gilbert & Rolf Karlsson (Eds.), SWAT 90 - 2nd Scandinavian Workshop on Algorithm Theory Bergen, Sweden, July 11–14, 1990 Proceedings (pp. 301-309) (9 p.). Springer Berlin Heidelberg.
  1989 - Scholarly publications
Bodlaender, Hans L. (08.05.1989). Achromatic number is NP-complete for cographs and interval graphs. Information Processing Letters, 31 (3), (pp. 135-138) (4 p.).
Beame, Paul W. & Bodlaender, Hans (1989). Distributed computing on transitive networks: The torus. In B. Monien & R. Cori (Eds.), STACS 89 - 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16–18, 1989 Proceedings (pp. 294-303) (10 p.). Springer Berlin Heidelberg.
Bodlaender, Hans (1989). NC-Algorithms for Graphs with Small Treewidth. In Jan van Leeuwen (Eds.), Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings. (pp. 1-10) (10 p.). Springer.
Bodlaender, Hans (1989). On linear time minor tests and depth first search. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack & Nicole Santoro (Eds.), Algorithms and Data Structures - Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings (pp. 577-590). Springer.
Bodlaender, Hans L. (01.02.1989). The classification of coverings of processor networks. Journal of Parallel and Distributed Computing, 6 (1), (pp. 166-182) (17 p.).
Bodlaender, Hans, Moran, Shlomo & Warmuth, Manfred K. (1989). The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. In J. Csirik, J. Demetrovics & F. Gécseg (Eds.), Fundamentals of Computation Theory - International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings (pp. 58-67). Springer.
  1988 - Scholarly publications
Bodlaender, Hans L. (13.05.1988). A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors. Information Processing Letters, 27 (6), (pp. 287-290) (4 p.).
Bodlaender, Hans (1988). Dynamic Programming on Graphs with Bounded Treewidth. In Timo Lepistö & Arto Salomaa (Eds.), 15th International Colloquium Tampere, Finland, July 11–15, 1988 Proceedings (pp. 105-118). Springer.
Bodlaender, Hans (1988). Polynomial algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. In Rolf Karlsson & Andrzej Lingas (Eds.), 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings (pp. 223) (232 p.). Springer.
Bodlaender, Hans (1988). Some Classes of Graphs with Bounded Treewidth. Bulletin of the EATCS (36), (pp. 116-125).
Bodlaender, Hans L. (26.10.1988). The complexity of finding uniform emulations on fixed graphs. Information Processing Letters, 29 (3), (pp. 137-141) (5 p.).
  1987 - Scholarly publications
Schoone, A.A., Bodlaender, Hans & van Leeuwen, Jan (1987). Diameter increase caused by edge deletion. Journal of Graph Theory, 11 (3).
Schoone, A.A., Bodlaender, Hans & van Leeuwen, Jan (1987). Improved diameter bounds for altered graphs. In Gottfried Tinhofer & Gunther Schmidt (Eds.), Proceedings 12th International Workshop on Graph Theoretic Concepts in Computer Science, WG'86 (pp. 227-236) (10 p.). Springer.
Bodlaender, Hans (1987). New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors - GI Jahrestagung 1987. In Manfred Paul (Eds.), GI - 17. Jahrestagung, Computerintegrierter Arbeitsplatz im Büro, München, 20.-23. Oktober 1987, Proceedings. (pp. 82) (88 p.). Springer.
  1986 - Scholarly publications
Bodlaender, Hans & van Leeuwen, Jan (1986). New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. In Burkhard Monien & G. Vidal-Naquet (Eds.), Proceedings 3rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 86 (pp. 119-129) (11 p.). Springer.
Bodlaender, H. L. & van Leeuwen, J. (01.12.1986). Simulation of large networks on smaller networks. Information and control, 71 (3), (pp. 143-180) (38 p.).
  1985 - Scholarly publications
Bodlaender, Hans & van Leeuwen, Jan (1985). Simulation of Large Networks on Smaller Networks. In Kurt Mehlhorn (Eds.), Proceedings 2nd Symposium of Theoretical Aspects of Computer Science (pp. 47-58). Springer.
^ top
Gegenereerd op 2017-09-26 10:58:56

My research focuses on Algorithms and Complexity. Many computational tasks for computers (and other computing devises) are hard, and time consuming. A central question is: how can we build methods (algorithms) that solve these tasks in an efficient way? For specific tasks, we ask: how hard are they? Are there fast algorithms, or are all algorithms necessarily slow? How much time is needed? And, how much other resources (e.g., memory for the computation, number of parallel processes, etc.)

I work and have worked on various topics in this field. Important themes are

  • Fixed parameter complexity. Suppose some parameter of our task is small: e.g., we want to solve a facility location problem (for example: find the optimal location of k hospitals on a map such that the maximum time to travel to a hospilal is as small as possible; with the map and k given), but the number of facilities to be placed (k) is small. Several tasks become much easier in such a case of a small parameter. The area of fixed parameter complexity analysis such cases and come with faster algorithms.
  • Kernelization: mathematical analysis of preprocessing. A common approach when solving a hard problem is, to apply preprocessing before applying computationally slow exact algorithms. The notion of kernelization makes a precise mathematical analysis of this: can we give a guarantee on the result of a `safe and sound' preprocessing method?
  • Treewidth and related notions. The notion of treewidth was introduced to give efficient algorithms for many problems on networks that are computationally hard in general, but become efficient if we have a certain representation of the input, termed a tree decomposition of small width. My work contains algorithms to find such representations, if existing, and (improved) methods to exploit these representations.

Completed projects

Project:
KERNELS 01.09.2009 to 31.08.2013
General project description
NWO project on Kernelization: Analysis of preprocessing of combinatorial problems 
Role Project Leader Funding
NWO grant
Project members UU
Gegenereerd op 2017-09-26 10:58:56

Algorithms (3rd year bachelor CS)
Algorithms and Networks (master CS)
Programme leader Master Programme Computing Science

Gegenereerd op 2017-09-26 10:58:56
Additional functions and activities

One day per week Professor Network Algorithms at TU Eindhoven

Member program councel Computer Science of the Lorentz Centre Leiden

Program leader Master Programme Computing Science, Utrecht University

Chairman steering committee WG, Workshop on Graph Theoretic Concepts in Computer Science

Chairman steering committee IPEC, International Colloquium on Parameterized and Exact Computation

Member steering committee ESA, European Symposium on Algorithms

Other committee work

Gegenereerd op 2017-09-26 10:58:56
Full name
prof. dr. H.L. Bodlaender Contact details
Buys Ballotgebouw

Princetonplein 5
Room BBL-503
3584 CC  UTRECHT
The Netherlands


Phone number (direct) +31 30 253 4409
Phone number (department) +31 30 253 9251
Postal address
Postbus 80.089
3508 TB    UTRECHT
The Netherlands
Availability
Mo Tue Wed Thu Fr
Morning
Afternoon
Gegenereerd op 2017-09-26 10:58:56
Last updated 07.02.2017