Sub Algorithms and Complexity

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

  • A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints

    Nederlof, J., Swennenhuis, C. M. F. & Wȩgrzycki, K., 2025, Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025. Society for Industrial and Applied Mathematics, p. 535-552 18 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 1).

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

  • Faster Algorithms on Linear Delta-Matroids

    Koana, T. & Wahlström, M., 24 Feb 2025, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025. Beyersdorff, O., Pilipczuk, M., Pimentel, E. & Thang, N. K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 62. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 327).

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

    Open Access
    File

  • Faster Edge Coloring by Partition Sieving

    Akmal, S. & Koana, T., 24 Feb 2025, 42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025. Beyersdorff, O., Pilipczuk, M., Pimentel, E. & Thang, N. K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 327).

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

    Open Access
    File

  • Online Busy Time Scheduling with Untrusted Prediction

    van de Bovenkamp, R. & Liu, A. H. H., 16 Feb 2025, SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Proceedings. Královič, R. & Kůrková, V. (eds.). Springer, p. 324-336 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 15539 LNCS).

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

  • Open Problems and Recent Developments on a Complexity Framework for Forbidden Subgraphs

    van Leeuwen, E. J., 2025, SOFSEM 2025: Theory and Practice of Computer Science - 50th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2025, Proceedings. Královič, R. & Kůrková, V. (eds.). Springer Science and Business Media Deutschland GmbH, p. 8-20 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 15538 LNCS).

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

  • Recognition of Unit Segment and Polyline Graphs is ∃R-Complete

    Hoffmann, M., Miltzow, T., Weber, S. & Wulf, L., 22 Jan 2025, Graph-Theoretic Concepts in Computer Science - 50th International Workshop, WG 2024, Revised Selected Papers. Kráľ, D. & Milanič, M. (eds.). Springer, p. 266-281 16 p. (Lecture Notes in Computer Science; vol. 14760).

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

  • The Complexity of Diameter on H-free Graphs

    Oostveen, J. J., Paulusma, D. & van Leeuwen, E. J., 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. 444-459 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

    Another Hamiltonian Cycle in Bipartite Pfaffian Graphs

    Björklund, A., Kaski, P. & Nederlof, J., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

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

    Open Access
    File

  • A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K4-Minor

    Groenland, C., Nederlof, J. & Koana, T., 5 Dec 2024, 19th International Symposium on Parameterized and Exact Computation, IPEC 2024. Bonnet, E. & Rzazewski, P. (eds.). Dagstuhl Publishing, 12. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 321).

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

    Open Access
    File

  • Clustering with Few Disks to Minimize the Sum of Radii

    Abrahamsen, M., de Berg, S., Meijer, L., Nusser, A. & Theocharous, L., Jun 2024, 40th International Symposium on Computational Geometry, SoCG 2024. Mulzer, W. & Phillips, J. M. (eds.). Dagstuhl Publishing, 2. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

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

    Open Access
    File

  • 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

  • Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs

    Lozin, V., Martin, B., Pandey, S., Paulusma, D., Siggers, M., Smith, S. & van Leeuwen, E. J., 4 Dec 2024, 35th International Symposium on Algorithms and Computation, ISAAC 2024, December 8-11, 2024, Sydney, Australia. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Vol. 322. p. 47:1-47:18

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

    Open Access
    File

  • Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs

    Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S. & van Leeuwen, E. J., 2024, 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, p. 29:1-29:17 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 294).

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

    Open Access
    File

  • Exact and Parameterized Algorithms for Choosability

    Bliznets, I. & Nederlof, J., 2024, SOFSEM 2024: Theory and Practice of Computer Science - 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, Proceedings. Fernau, H., Gaspers, S. & Klasing, R. (eds.). Springer, p. 111-124 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14519 LNCS).

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

    Open Access
    File

  • Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four

    Kaznatcheev, A. & Van Marle, M., Aug 2024, 30th International Conference on Principles and Practice of Constraint Programming, CP 2024. Shaw, P. (ed.). Dagstuhl Publishing, 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 307).

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

    Open Access
    File

  • Geometric Thickness of Multigraphs is ∃R-Complete

    Förster, H., Kindermann, P., Miltzow, T., Parada, I., Terziadis, S. & Vogtenhuber, B., 2024, LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I. Soto, J. A. & Wiese, A. (eds.). Springer, p. 336-349 14 p. (Lecture Notes in Computer Science; vol. 14578).

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

  • Separator Theorem and Algorithms for Planar Hyperbolic Graphs

    Kisfaludi-Bak, S., Masarìkovà, J., van Leeuwen, E. J., Walczak, B. & Wegrzycki, K., 2024, 40th International Symposium on Computational Geometry, SoCG 2024. Mulzer, W. & Phillips, J. M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, p. 67:1-67:17 67. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

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

    Open Access
    File

  • Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs

    Koana, T., Purohit, N. & Simonov, K., 5 Dec 2024, 19th International Symposium on Parameterized and Exact Computation, IPEC 2024. Bonnet, E. & Rzazewski, P. (eds.). Dagstuhl Publishing, 10. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 321).

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

    Open Access
    File

  • Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain

    de Berg, S., Miltzow, T. & Staals, F., Jun 2024, 40th International Symposium on Computational Geometry, SoCG 2024. Mulzer, W. & Phillips, J. M. (eds.). Dagstuhl Publishing, p. 17:1-17:16 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

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

    Open Access
    File

  • Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters

    Groenland, C., Mannens, I., Nederlof, J., Piecyk, M. & Rzążewski, P., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 77. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).

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

    Open Access
    File
  • 2023

    Complexity Framework for Forbidden Subgraphs {III:}: When Problems Are Tractable on Subcubic Graphs

    Johnson, M., Martin, B., Pandey, S., Paulusma, D., Smith, S. & van Leeuwen, E. J., 21 Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023: MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. Leroux, J., Lombardy, S. & Peleg, D. (eds.). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, p. 57:1-57:15 57. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).

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

    Open Access
    File

  • Computing Subset Vertex Covers in H-Free Graphs

    Brettell, N., Oostveen, J., Pandey, S., Paulusma, D. & van Leeuwen, E. J., 21 Sept 2023, Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings. Springer, p. 88-102 (Lecture Notes in Computer Science; vol. 14292).

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

    Open Access
    File

  • Enumeration of Minimal Tropical Connected Sets

    Bliznets, I., Sagunov, D. & Tagin, E., 25 Apr 2023, Algorithms and Complexity - 13th International Conference, CIAC 2023, Proceedings. Mavronicolas, M. (ed.). p. 127-141 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13898 LNCS).

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

    Open Access
    File

  • MaxCut Above Guarantee

    Bliznets, I. & Epifanov, V., 21 Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leroux, J., Lombardy, S. & Peleg, D. (eds.). Dagstuhl Publishing, 14 p. 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).

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

    Open Access
    File

  • 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

  • Polynomial-Time Approximation of Independent Set Parameterized by Treewidth

    Chalermsook, P., Fomin, F. V., Hamm, T., Korhonen, T., Nederlof, J. & Orgo, L., Sept 2023, 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. Gørtz, I. L., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Vol. 274. p. 33:1-33:13 33. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

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

    Open Access
    File

  • Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

    Bergougnoux, B., Chekan, V., Ganian, R., Kanté, M. M., Mnich, M., Oum, S.-I., Pilipczuk, M. & van Leeuwen, E. J., Sept 2023, 31st Annual European Symposium on Algorithms, ESA 2023: ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, p. 18:1-18:18 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

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

    Open Access
    File

  • Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth

    Bergougnoux, B., Chekan, V., Ganian, R., Kanté, M. M., Mnich, M., Oum, S.-I., Pilipczuk, M. & van Leeuwen, E. J., 30 Aug 2023, 31st Annual European Symposium on Algorithms, {ESA} 2023, September 4-6, 2023, Amsterdam, The Netherlands. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Vol. 274. p. 18:1-18:18 (LIPIcs).

    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

  • The Power of Amortization on Scheduling with Explorable Uncertainty

    Liu, A., Liu, F.-H., Wong, P. W. H. & Zhang, X.-O., 22 Dec 2023, Approximation and Online Algorithms. Springer, 14 p.

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

    Open Access
    File

  • Tight Lower Bounds for Problems Parameterized by Rank-Width

    Bergougnoux, B., Korhonen, T. & Nederlof, J., 1 Mar 2023, 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023. Berenbrink, P., Bouyer, P., Dawar, A. & Kanté, M. M. (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Vol. 254. p. 11:1-11:17 11. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 254).

    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

    Few Induced Disjoint Paths for H-Free Graphs

    Martin, B., Paulusma, D., Smith, S. & van Leeuwen, E. J., 2022, Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers. Ljubić, I., Barahona, F., Dey, S. S. & Mahjoub, A. R. (eds.). Springer, p. 89-101 13 p. (Lecture Notes in Computer Science; vol. 13526).

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

    Open Access
    File

  • 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

  • Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs

    Martin, B., Paulusma, D., Smith, S. & van Leeuwen, E. J., 2022, Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tubingen, Germany, June 22-24, 2022, Revised Selected Papers. Bekos, M. A. & Kaufmann, M. (eds.). Springer, p. 398-411 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

  • Isolation Schemes for Problems on Decomposable Graphs

    Nederlof, J., Pilipczuk, M., Swennenhuis, C. M. F. & Wegrzycki, K., 2022, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Berenbrink, P. & Monmege, B. (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, p. 50:1-50:20 (Leibniz International Proceedings in Informatics; vol. 219).

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

    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 Streaming Algorithms for Geometric Independent Set and Clique

    Oostveen, J., Klute, F. & Bhore, S., 21 Oct 2022, Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings. Chalermsook, P. & Laekhanukit, B. (eds.). 1 ed. Cham: Springer, p. 211-224 14 p. (Lecture Notes in Computer Science ; vol. 13538 ).

    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 Complexity of Streaming Diameter and Connectivity Problems

    Oostveen, J. J. & Leeuwen, E. J. V., 1 Dec 2022, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Dell, H. & Nederlof, J. (eds.). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, p. 24:1-24:16 16 p. 24. (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 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

  • Planar Multiway Cut with Terminals on Few Faces

    Pandey, S. & van Leeuwen, E. J., 2022, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. SIAM, p. 2032-2063 32 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

  • The Parameterized Complexity of the Survivable Network Design Problem

    Feldmann, A. E., Mukherjee, A. & van Leeuwen, E. J., 2022, Symposium on Simplicity in Algorithms (SOSA): 5th Symposium on Simplicity in Algorithms, SOSA@SODA 2022, Virtual Conference, January 10-11, 2022. Bringmann, K. & Chan, T. (eds.). SIAM, p. 37-56 20 p.

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

    Open Access
    File

  • The Power of Amortized Recourse for Online Graph Problems

    Liu, A. & Toole-Charignon, J., 21 Oct 2022, Approximation and Online Algorithms: 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8–9, 2022, Proceedings. Chalermsook, P. & Laekhanukit, B. (eds.). 1 ed. Cham: Springer, p. 134–153 20 p. (Lecture Notes in Computer Science; vol. 13538).

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

    Open Access
    File

  • Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth

    Groenland, C., Mannens, I., Nederlof, J. & Szilágyi, K., 2022, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, p. 36:1--36:20 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 219).

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

    Open Access
    File