Hans Bodlaender HL

View Scopus Profile

Hans Bodlaender

prof. dr.

 https://orcid.org/0000-0002-9297-3330
Filter
Conference contribution

Search results

  • 2025

    Approximation Algorithms for Treewidth, Pathwidth, and Treedepth—A Short Survey

    Bodlaender, H. L., 2025, Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Revised Selected Papers. Kráľ, D. & Milanič, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 3-18 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14760 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • XNLP-Hardness of Parameterized Problems on Planar Graphs

    Bodlaender, H. L. & Szilágyi, K., 2025, Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Revised Selected Papers. Kráľ, D. & Milanič, M. (eds.). Springer Science and Business Media Deutschland GmbH, p. 107-120 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14760 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • 2024

    Complexity Framework for Forbidden Subgraphs {IV:} The Steiner Forest Problem

    Bodlaender, H. L., Johnson, M. S., Martin, B., Oostveen, J., Pandey, S., Paulusma, D., Smith, S. & van Leeuwen, E. J., 22 Jun 2024, Combinatorial Algorithms - 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1-3, 2024, Proceedings. Springer, p. 206-217 (Lecture Notes in Computer Science; vol. 14764).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2023

    Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters

    Bodlaender, H. L., Groenland, C. & Pilipczuk, M., Jul 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 20 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 261).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • The Parameterised Complexity Of Integer Multicommodity Flow

    Mannens, I., Oostveen, J., van Leeuwen, E. J., Pandey, S. & Bodlaender, H. L., 13 Dec 2023, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Misra, N. & Wahlström, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, p. 91-109 6. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 285).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Treewidth Is NP-Complete on Cubic Graphs

    Bodlaender, H. L., Bonnet, É., Jaffke, L., Knop, D., Lima, P. T., Milanic, M., Ordyniak, S., Pandey, S. & Suchý, O., 2023, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023. Misra, N. & Wahlström, M. (eds.). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Vol. 285. p. 7:1-7:13 13 p. 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 285).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2022

    From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability

    Bodlaender, H. L., 22 Feb 2022, WALCOM: Algorithms and Computation: 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022, Proceedings. Mutzel, P., Rahman, M. S. & Slamin (eds.). 1 ed. Cham: Springer, p. 15-25 11 p. (Lecture Notes in Computer Science; vol. 13174 ).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

    Open Access
    File

  • List Colouring Trees in Logarithmic Space

    Bodlaender, H. L., Groenland, C. & Jacob, H., 1 Sept 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 24:1-24:15 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 244).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • On the Complexity of Problems on Tree-Structured Graphs

    Bodlaender, H. L., Groenland, C., Jacob, H., Pilipczuk, M. & Pilipczuk, M., 1 Dec 2022, 17th International Symposium on Parameterized and Exact Computation, IPEC 2022. Dell, H. & Nederlof, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 6:1-6:17 17 p. 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 249).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • On the Parameterized Complexity of Computing Tree-Partitions

    Bodlaender, H. L., Groenland, C. & Jacob, H., 1 Dec 2022, 17th International Symposium on Parameterized and Exact Computation, IPEC 2022. Dell, H. & Nederlof, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 7:1-7:20 20 p. 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 249).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Parameterized Completeness Results for Bayesian Inference

    Bodlaender, H. L., Donselaar, N. & Kwisthout, J., 19 Sept 2022, International Conference on Probabilistic Graphical Models, PGM 2022, 5-7 October 2022, Almería, Spain. Salmerón, A. & Rumí, R. (eds.). PMLR, Vol. 186. p. 145-156 12 p. (Proceedings of Machine Learning Research).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space

    Bodlaender, H. L., Groenland, C., Nederlof, J. & Swennenhuis, C. M. F., 2022, Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE, p. 193-204 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Problems Hard for Treewidth but Easy for Stable Gonality

    Bodlaender, H. L., Cornelissen, G. & Wegen, M. V. D., 1 Oct 2022, Graph-Theoretic Concepts in Computer Science: 48th International Workshop, WG 2022, Tübingen, Germany, June 22–24, 2022, Revised Selected Papers. Bekos, M. A. & Kaufmann, M. (eds.). 1 ed. Springer, p. 84-97 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13453 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

    Bodlaender, H. L., Groenland, C., Jacob, H., Jaffke, L. & Lima, P. T., 1 Dec 2022, 17th International Symposium on Parameterized and Exact Computation, IPEC 2022. Dell, H. & Nederlof, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 8:1-8:18 18 p. 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 249).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2021

    Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes

    Saitoh, T., Yoshinaka, R. & Bodlaender, H. L., 31 Jan 2021, WALCOM: Algorithms and Computation: 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings. Uehara, R., Hong, S.-H. & Nandy, S. C. (eds.). 1 ed. Cham: Springer, p. 142-153 12 p. (Lecture Notes in Computer Science ; vol. 12635 ).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Parameterized complexities of dominating and independent set reconfiguration

    Bodlaender, H. L., Groenland, C. & Swennenhuis, C. M. F., 1 Nov 2021, 16th International Symposium on Parameterized and Exact Computation, IPEC 2021. Golovach, P. A. & Zehavi, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 9:1-9:16 16 p. 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 214).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation

    Bodlaender, H. L., 2021, Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Revised Selected Papers. Kowalik, L., Pilipczuk, M. & Rzazewski, P. (eds.). Springer, p. 15-27 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12911 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2020

    Constructing Tree Decompositions of Graphs with Bounded Gonality

    Bodlaender, H. L., Bruyn, J. V. D. D., Gijswijt, D. & Smit, H., 2020, Computing and Combinatorics: 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings. Kim, D., Uma, R. N., Cai, Z. & Lee, D. H. (eds.). Cham: Springer, p. 384-396 13 p. ( Lecture Notes in Computer Science ; vol. 12273).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Hedonic Seat Arrangement Problems

    Bodlaender, H. L., Hanaka, T., Jaffke, L., Ono, H., Otachi, Y. & Zanden, T. C. V. D., 2020, AAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems. Seghrouchni, A. E. F., Sukthankar, G., An, B. & Yorke-Smith, N. (eds.). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems, p. 1777-1779 3 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Knot Diagrams of Treewidth Two

    Bodlaender, H. L., Burton, B., Fomin, F. V. & Grigoriev, A., 16 Oct 2020, Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers. Adler, I. & Müller, H. (eds.). 1 ed. Cham: Springer, p. 80-91 12 p. (Lecture Notes in Computer Science; vol. 12301 )(Theoretical Computer Science and General Issues book sub series).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Parameterized Complexity of Scheduling Chains of Jobs with Delays

    Bodlaender, H. L. & Wegen, M. V. D., 2020, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Cao, Y. & Pilipczuk, M. (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, p. 4:1-4:15 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 180).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Steiner Trees for Hereditary Graph Classes

    Bodlaender, H. L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D. & van Leeuwen, E. J., 2020, LATIN 2020: Theoretical Informatics - 14th Latin American Symposium 2021, Proceedings. Kohayakawa, Y. & Miyazawa, F. K. (eds.). Springer, p. 613-624 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12118 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Typical Sequences Revisited: Computing Width Parameters of Graphs

    Bodlaender, H. L., Jaffke, L. & Telle, J. A., 10 Mar 2020, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France. Paul, C. & Bläser, M. (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Vol. 154. p. 57:1-57:16 16 p. (LIPIcs).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2019

    Parameterized complexity of conflict-free graph coloring

    Bodlaender, H. L., Kolay, S. & Pieterse, A., 1 Jan 2019, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings. Friggstad, Z., Salavatipour, M. R. & Sack, J.-R. (eds.). Springer, p. 168-180 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11646 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Stable Divisorial Gonality is in NP

    Bodlaender, H. L., Wegen, M. V. D. & Zanden, T. C. V. D., 2019, SOFSEM 2019: Theory and Practice of Computer Science: 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings. Catania, B., Královič, R., Nawrocki, J. & Pighizzini, G. (eds.). Springer, p. 81-93 13 p. (Lecture Notes in Computer Science; vol. 11376).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Subgraph Isomorphism on Graph Classes that Exclude a Substructure

    Bodlaender, H. L., Hanaka, T., Okamoto, Y., Otachi, Y. & van der Zanden, T. C., 1 Jan 2019, Algorithms and complexity: 11th International Conference, CIAC 2019 Rome, Italy, May 27-29, 2019, Proceedings. Heggernes, P. (ed.). Cham: Springer, p. 87-98 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11485 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2018

    An ETH-Tight Exact Algorithm for Euclidean TSP

    Berg, M. D., Bodlaender, H. L., Kisfaludi-Bak, S. & Kolay, S., 2018, Proceedings 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018. IEEE, p. 450-461 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • On the exact complexity of polyomino packing

    Bodlaender, H. L. & Van Der Zanden, T. C., 1 Jun 2018, 9th International Conference on Fun with Algorithms, FUN 2018. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 9:1-9:10 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 100).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Recognizing hyperelliptic graphs in polynomial time

    Bodewes, J. M., Bodlaender, H. L., Cornelissen, G. & van der Wegen, M., 1 Jan 2018, Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Proceedings. Springer, p. 52-64 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11159 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2017

    A faster parameterized algorithm for pseudoforest deletion

    Bodlaender, H. L., Ono, H. & Otachi, Y., 1 Feb 2017, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 63. 7

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Computing Treewidth on the GPU

    van der Zanden, T. C. & Bodlaender, H. L., 2017, Proceedings of the 12th International Symposium on Parameterisiert and Exact Computation (IPEC 2017). Dagstuhl Publishing, (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Cut and Count and representative sets on branch decompositions

    Pino, W. J. A., Bodlaender, H. L. & Van Rooij, J. M. M., 1 Feb 2017, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 63. 27

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Improved lower bounds for graph embedding problems

    Bodlaender, H. L. & Van Der Zanden, T. C., 2017, Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings. Springer, p. 92-103 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10236 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • On the maximum weight minimal separator

    Hanaka, T., Bodlaender, H. L., Van Der Zanden, T. C. & Ono, H., 2017, Theory and Applications of Models of Computation: 14th Annual Conference, TAMC 2017, Proceedings. Springer, p. 304-318 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10185 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • The homogeneous broadcast problem in narrow and wide strips

    de Berg, M., Bodlaender, H. L. & Kisfaludi-Bak, S., 2017, Algorithms and Data Structures: 15th International Symposium, WADS 2017, Proceedings. Springer, p. 289-300 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10389 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2016

    Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity

    Bodlaender, H. L., Ono, H. & Otachi, Y., 1 Dec 2016, 27th International Symposium on Algorithms and Computation (ISAAC 2016). Hong, S.-H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 20:1-20:12 12 p. (Leibniz International Proceedings in Informatics; vol. 64).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Robust recoverable path using backup nodes

    van den Akker, M., Bodlaender, H. L., van Dijk, T. C., Hoogeveen, J. & van Ommeren, E., 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, Vol. 9587. p. 95-106 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9587).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Subexponential Time Algorithms for Embedding H-Minor Free Graphs

    Bodlaender, H., Nederlof, J. & van der Zanden, T., 2016, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Ioannis Chatzigiannakis Michael Mitzenmacher, Y. R. & Sangiorgi, D. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Vol. 55. p. 1-14 14 p. 9. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2015

    Definability equals recognizability for κ-outerplanar graphs

    Jaffke, L. & Bodlaender, H. L., 1 Nov 2015, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 43. p. 176-186 11 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Practical algorithms for linear boolean-width

    Ten Brinke, C. B., Van Houten, F. J. P. & Bodlaender, H. L., 1 Nov 2015, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 43. p. 187-198 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • PSPACE-completeness of Bloxorz and of games with 2-buttons

    Van Der Zanden, T. C. & Bodlaender, H. L., 2015, Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Paschos , V. T. & Widmayer, P. (eds.). Springer, p. 403-415 13 p. (Lecture Notes in Computer Science; vol. 9079).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Subexponential time algorithms for finding small tree and path decompositions

    Bodlaender, H. L. & Nederlof, J., 2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, Vol. 9294. p. 179-190 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9294).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
  • 2014

    Provisional Propagation for Verifying Monotonicity of Bayesian Networks

    Rietbergen, M., van der Gaag, L. & Bodlaender, H., 2014, ECAI 2014 - 21st European Conference on Artificial Intelligence. Schaub, T., Friedrich, G. & O. Sullivan, B. (eds.). IOS Press, p. 759-764 (Frontiers in Artificial Intelligence and Applications; vol. 263).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • 2013

    An O(c^k n) 5-Approximation Algorithm for Treewidth

    Bodlaender, H. L., Drange, P. G., Dregi, M. S., Fomin, F. V., Lokshtanov, D. & Pilipczuk, M., 2013, 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013. IEEE, p. 499-508 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth

    Bodlaender, H. L., Cygan, M., Kratsch, S. & Nederlof, J., 2013, Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Fomin, F. V., Freivalds, F., Kwiatkowska, M. Z. & Peleg, D. (eds.). Springer, p. 196-207 12 p. (Lecture Notes in Computer Science; vol. 7965).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File

  • Fixed-Parameter Tractability and Characterizations of Small Special Treewidth

    Bodlaender, H. L., Kratsch, S. & Kreuzen, S., 2013, Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Brandstädt, A., Jansen, K. & Reischuk, R. (eds.). Springer, p. 88-99 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions

    Fafianie, S., Bodlaender, H. L. & Kratsch, S., 2013, Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers.. Gutin, G. & Szeider, S. (eds.). Springer, p. 321-334 14 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • The Fine Details of Fast Dynamic Programming over Tree Decompositions

    Bodlaender, H. L., Bonsma, P. & Lokshtanov, D., 2013, Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. Gutin, G. & Szeider, S. (eds.). Springer, p. 41-53 13 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • 2012

    Fixed-Parameter Tractability of Treewidth and Pathwidth

    Bodlaender, H. L., 2012, The Multivariate Algorithmic Revolution and Beyond. Bodlaender, H. L., Downey, R. G., Fomin, F. V. & Marx, D. (eds.). Springer, p. 196-227 32 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

  • Kernel Bounds for Path and Cycle Problems

    Bodlaender, H. L., Jansen, B. M. P. & Kratsch, S., 2012, Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers. Marx, D. & Rossmanith, P. (eds.). Springer, p. 145-158 14 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review