Algorithms

Filter
Conference contribution

Search results

  • 2025

    The Algorithm Experience at Primary Schools: An Experience Report

    Löffler, M., 2025, Creative Mathematical Sciences Communication - 7th International Conference, CMSC 2024, Proceedings. Fernau, H., Staub, J. & Schwank, I. (eds.). Springer, p. 104-114 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 15229 LNCS).

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

    Open Access
    File
  • 2024

    Adaptive Path Planning for Reaching an Uncertain Set of Targets in a Fruit Tree

    Kroneman, W., Valente, J. & Van Der Stappen, A. F., 29 Jul 2024, 13th International Workshop on Robot Motion and Control, RoMoCo 2024 - Proceedings. Institute of Electrical and Electronics Engineers Inc., p. 111-116 6 p. (13th International Workshop on Robot Motion and Control, RoMoCo 2024 - Proceedings).

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

    Open Access
    File

  • 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

  • BOLD: Knowledge Graph Exploration and Analysis Platform

    Dmitriev, E., Chekol, M. W. & Schaefer, M. T., 18 Mar 2024, Advances in Database Technology - EDBT. 3 ed. OpenProceedings.org, p. 814-817 4 p. (Advances in Database Technology - EDBT; vol. 27, no. 3).

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

    Open Access
    File

  • Brief Announcement: Collision Detection for Modular Robots – It Is Easy to Cause Collisions and Hard to Avoid Them

    Gupta, S., van Kreveld, M., Michail, O. & Padalkin, A., Jun 2024, 3rd Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2024. Casteigts, A. & Kuhn, F. (eds.). Dagstuhl Publishing, 5 p. 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 292).

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

    Open Access
    File

  • Capturing the Shape of a Point Set with a Line Segment

    van Beusekom, N., van Kreveld, M., van Mulken, M., Roeloffzen, M., Speckmann, B. & Wulms, J., Aug 2024, 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024. Kralovic, R. & Kucera, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18 p. 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 306).

    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

  • Competitive Searching over Terrains

    de Berg, S., van Beusekom, N., van Mulken, M., Verbeek, K. & Wulms, J., 6 Mar 2024, LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, 2024, Proceedings. Soto, J. A. & Wiese, A. (eds.). Springer, p. 254-269 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14578 LNCS).

    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

  • Computational Geometry Concept Videos: A Dual-Use Project in Education and Outreach

    Haagsman, M., Löffler, M. & Wenk, C., Jun 2024, 40th International Symposium on Computational Geometry, SoCG 2024. Mulzer, W. & Phillips, J. M. (eds.). Dagstuhl Publishing, 4 p. 88. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

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

    Open Access
    File

  • 'Do you have Time for a Quick Call?': Exploring Remote and Hybrid Requirements Engineering Practices and Challenges in Industry

    Li, Z. S., Ly, D., Nagel, L., Arony, N. N. & Damian, D., 21 Aug 2024, Proceedings - 32nd IEEE International Requirements Engineering Conference, RE 2024. Liebel, G., Hadar, I. & Spoletini, P. (eds.). IEEE, p. 43-54 12 p. (Proceedings of the IEEE International Conference on Requirements Engineering).

    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

  • Faster Fréchet Distance Approximation Through Truncated Smoothing

    van der Horst, T. & Ophelders, T., 6 Jun 2024, 40th International Symposium on Computational Geometry (SoCG 2024). Mulzer, W. & Phillips, J. M. (eds.). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, p. 63:1-63:15 15 p. 63. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

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

    Open Access
    File

  • Fine-Grained Complexity of Earth Mover’s Distance Under Translation

    Bringmann, K., Staals, F., Węgrzycki, K. & van Wordragen, G., Jun 2024, 40th International Symposium on Computational Geometry, SoCG 2024. Mulzer, W. & Phillips, J. M. (eds.). Dagstuhl Publishing, 17 p. 25. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 293).

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

    Open Access
    File

  • Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs

    van der Hoog, I., Nusser, A., Rotenberg, E. & Staals, F., 23 Aug 2024, 49th International Symposium on Mathematical Foundations of Computer Science, MFCS 2024. Kralovic, R. & Kucera, A. (eds.). Dagstuhl Publishing, 17 p. 63. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 306).

    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

  • Large Language Models and the Extended Church-Turing Thesis

    Wiedermann, J. & van Leeuwen, J., 11 Sept 2024, Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024). Manea, F. & Pighizzini, G. (eds.). Göttingen, p. 198-213 16 p. (Electronic Proceedings in Theoretical Computer Science; vol. 407).

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

    Open Access

  • Optimal In-Place Compaction of Sliding Cubes

    Kostitsyna, I., Ophelders, T., Parada, I., Peters, T., Sonke, W. & Speckmann, B., Jun 2024, 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Dagstuhl Publishing, 14 p. 31. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 294).

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

    Open Access
    File

  • Robust Bichromatic Classification Using Two Lines

    Glazenburg, E., van der Horst, T., Peters, T., Speckmann, B. & Staals, F., 4 Dec 2024, 35th International Symposium on Algorithms and Computation (ISAAC 2024). Mestre, J. & Wirth, A. (eds.). Dagstuhl Publishing, p. 33:1-33:14 14 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 322).

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

    Open Access
    File

  • 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

  • Strict Upward Planar Grid Drawings of Binary Trees with Minimal Area

    Löffler, M., 28 Oct 2024, 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024. Felsner, S. & Klein, K. (eds.). Dagstuhl Publishing, 3 p. 47. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 320).

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

    Open Access
    File

  • String Graph with Cop Number 4

    Durocher, S., Kryven, M. & Löffler, M., 28 Oct 2024, 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024. Felsner, S. & Klein, K. (eds.). Dagstuhl Publishing, 3 p. 53. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 320).

    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

    A fast two-stage approach for multi-goal path planning in a fruit tree

    Kroneman, W., Valente, J. & van der Stappen, A. F., 4 Jul 2023, Proceedings of the IEEE International Conference on Robotics and Automation. IEEE, p. 1586-1593

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

    Open Access
    File

  • A Subquadratic nε-approximation for the Continuous Fréchet Distance

    van der Horst, T., van Kreveld, M., Ophelders, T. & Speckmann, B., 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 1759-1776 18 p. (Proceedings; vol. 2023-January).

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

    Open Access
    File

  • 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

  • Drawing Reeb Graphs

    Chambers, E. W., Fasy, B. T., Sereshgi, E. H., Löffler, M. & Percival, S., 2023, Proc. 31st Symposium on Graph Drawing.

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

  • Effect Graph: Effect Relation Extraction for Explanation Generation

    Karnstedt-Hulpus, I., Kobbe, J. & Stuckenschmidt, H., 13 Jun 2023, Proceedings of the 1st Workshop on Natural Language Reasoning and Structured Explanations (NLRSE). Dalvi Mishra, B., Durrett, G., Jansen, P., Neves Ribeiro, D. & Wei, J. (eds.). Toronto: Association for Computational Linguistics, p. 116-127 12 p.

    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

  • Geometric Embeddability of Complexes Is ∃R-Complete

    Abrahamsen, M., Kleist, L. & Miltzow, T., 1 Jun 2023, 39th International Symposium on Computational Geometry, SoCG 2023: SoCG 2023, June 12-15, 2023, Dallas, Texas, USA. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, p. 1:1-1:19 19 p. (Leibniz International Proceedings in Informatic; vol. 258).

    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

  • SAR-UNet: Small Attention Residual UNet for Explainable Nowcasting Tasks

    Renault, M. & Mehrkanoon, S., 2 Aug 2023, IJCNN 2023 - International Joint Conference on Neural Networks, Proceedings. IEEE, (Proceedings of the International Joint Conference on Neural Networks; vol. 2023-June).

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

    Open Access
    File

  • Scheduling Electric Buses with Stochastic Driving Times

    de Bruin, P., van den Akker, M., Hoogeveen, H. & van Kooten Niekerk, M., Sept 2023, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023). Frigioni, D. & Schiewe, P. (eds.). Dagstuhl, Germany: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, p. 14:1-14:19 19 p. 14. (OpenAccess Series in Informatics; vol. 115).

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

    Open Access
    File

  • Shortest Paths in Portalgons

    Löffler, M., Ophelders, T., Silveira, R. I. & Staals, F., 1 Jun 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Dagstuhl Publishing, 48. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 258).

    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 Complexity of Geodesic Spanners

    Berg, S. D., Kreveld, M. V. & Staals, F., 1 Jun 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Vol. 258. p. 16:1-16:16 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 258).

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

    Open Access
    File

  • The Influence of Dimensions on the Complexity of Computing Decision Trees

    Kobourov, S. G., Löffler, M., Montecchiani, F., Pilipczuk, M., Rutter, I., Seidel, R., Sorge, M. & Wulms, J., 7 Feb 2023, AAAI'23/IAAI'23/EAAI'23: Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence. Williams, B., Chen, Y. & Neville, J. (eds.). AAAI Press, p. 8343-8350 8 p.

    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

    AA-TransUNet: Attention Augmented TransUNet For Nowcasting Tasks

    Yang, Y. & Mehrkanoon, S., 2022, 2022 International Joint Conference on Neural Networks, IJCNN 2022 - Proceedings. IEEE, (Proceedings of the International Joint Conference on Neural Networks; vol. 2022-July).

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

    Open Access
    File

  • Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams

    de Kogel, L., van Kreveld, M. & Vermeulen, J. L., 2022, 30th Annual European Symposium on Algorithms (ESA 2022). Dagstuhl Publishing, 16 p.

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

    Open Access
    File