Algorithms

  • AddressShow on map

    Groene Loper 5, Metaforum

    5612 AP Eindhoven

    Netherlands

  • Postal addressShow on map

    P.O. Box 513, Department of Mathematics and Computer Science

    5600 MB Eindhoven

    Netherlands

Filter
Conference contribution

Search results

  • 2025

    Polycubes via Dual Loops

    Snoep, M., Speckmann, B. & Verbeek, K. A. B., 2025, Proceedings of the 2025 SIAM International Meshing Roundtable. Si, H., Shepherd, K. M. & Zhang, Y. J. (eds.). Society for Industrial and Applied Mathematics (SIAM), p. 72-84 13 p.

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

  • Relating Interleaving and Fréchet Distances via Ordered Merge Trees

    Beurskens, T. P. J., Ophelders, T. A. E., Speckmann, B. & Verbeek, K. A. B., 15 Jan 2025, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Azar, Y. & Panigrahi, D. (eds.). Society for Industrial and Applied Mathematics (SIAM), p. 5027-5050 24 p.

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

    1 Citation (Scopus)

  • Visual Complexity of Point Set Mappings

    Meulemans, W., Simons, A. (Corresponding author) & Verbeek, K. A. B., 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, Bratislava, Slovak Republic, January 20–23, 2025, Proceedings, Part II. Královič, R. & Kůrková, V. (eds.). Cham: Springer, p. 157-171 15 p. (Lecture Notes in Computer Science (LNCS); vol. 15539).

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

  • 2024

    A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ²

    Aronov, B., de Berg, M. & Theocharous, L., 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. 9:1-9:15 15 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 293).

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

    Open Access
    File
    8 Downloads (Pure)

  • A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon

    de Berg, M. & Theocharous, L., 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. 16:1-16:16 16 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 293).

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

    Open Access
    File
    2 Downloads (Pure)

  • Approval-based committee voting in practice: a case study of (over-) representation in the Polkadot blockchain

    Boehmer, N., Brill, M., Cevallos, A., Gehrlein, J., Sánchez-Fernández, L. & Schmidt-Kraepelin, U., 24 Mar 2024, Proceedings of the 38th AAAI Conference on Artificial Intelligence. Wooldridge, M., Dy, J. & Natarajan, S. (eds.). AAAI Press, p. 9519-9527 9 p. (Proceedings of the AAAI Conference on Artificial Intelligence; vol. 38, no. 9).

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

    Open Access
    File
    2 Citations (Scopus)
    72 Downloads (Pure)

  • Boundary Labeling in a Circular Orbit

    Bonerath, A., Nöllenburg, M., Terziadis, S., Wallinger, M. & Wulms, J., 28 Oct 2024, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Felsner, S. & Klein, K. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 22:1-22:17 17 p. 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 320).

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

    Open Access
    File
    15 Downloads (Pure)

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

    van Beusekom, N., van Kreveld, M., van Mulken, M. J. M., Roeloffzen, M. J. M., Speckmann, B. & Wulms, J. J. H. M., 23 Aug 2024, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Královič, R. & Kučera, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 26:1-26:18 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
    39 Downloads (Pure)

  • 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.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 2:1-2:15 15 p. 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
    1 Citation (Scopus)
    15 Downloads (Pure)

  • Competitive Searching over Terrains

    de Berg, S., van Beusekom, N. (Corresponding author), van Mulken, M., Verbeek, K. & Wulms, J., 6 Mar 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.). Cham: Springer, p. 254-269 16 p. (Lecture Notes in Computer Science (LNCS); vol. 14578).

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

    Open Access
    File
    1 Citation (Scopus)
    16 Downloads (Pure)

  • Constrained Boundary Labeling

    Depian, T., Nöllenburg, M., Terziadis, S. & Wallinger, M., 4 Dec 2024, 35th International Symposium on Algorithms and Computation (ISAAC 2024). Mestre, J. & Wirth, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 26:1-26:16 16 p. 26. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 322).

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

    Open Access
    File
    1 Citation (Scopus)
    30 Downloads (Pure)

  • Contextual Matrix Orderings for Graph Collections

    van Beusekom, N., Meulemans, W. & Speckmann, B., 3 Jun 2024, 2024 IEEE 17th Pacific Visualization Conference, PacificVis 2024. Institute of Electrical and Electronics Engineers, p. 182-191 10 p. 10541441

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

    Open Access
    File
    1 Citation (Scopus)
    20 Downloads (Pure)

  • Faster Fréchet Distance Approximation Through Truncated Smoothing

    van der Horst, T. & Ophelders, T. A. E., 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
    1 Citation (Scopus)
    1 Downloads (Pure)

  • Fixed-Parameter Tractable Certified Algorithms for Covering and Dominating in Planar Graphs and Beyond

    Bumpus, B. M., Jansen, B. M. P. & Venne, J., 31 May 2024, 19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 19:1-19:16 16 p. 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 294).

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

    Open Access
    File
    5 Downloads (Pure)

  • Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time

    Bhore, S., Nöllenburg, M., Tóth, C. D. & Wulms, J. J. H. M., 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. 19:1-19:16 16 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 293).

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

    Open Access
    File
    3 Citations (Scopus)
    3 Downloads (Pure)

  • Graph Drawing Contest Report

    Di Bartolomeo, S., Klute, F., Mondal, D. & Wulms, J., 28 Oct 2024, 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Felsner, S. & Klein, K. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 41:1-41:13 13 p. 41. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 320).

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

    Open Access
    File
    13 Downloads (Pure)

  • How Small Can Faithful Sets Be? Ordering Topological Descriptors

    Fasy, B. T., Millman, D. L. & Schenfisch, A., 2024, Proceedings of the 36th Canadian Conference on Computational Geometry (CCCG 2024) Brock University, St. Catharines, Canada, Brock University July 17 - 19, 2024. p. 257-269

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

    Open Access
    File
    19 Downloads (Pure)

  • Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations

    Bougeret, M., Jansen, B. M. P. & Sau, I., 2 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 für Informatik, p. 33:1-33:20 20 p. 33. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 297).

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

    Open Access
    File
    1 Downloads (Pure)

  • Map-Matching Queries Under Fréchet Distance on Low-Density Spanners

    Buchin, K., Buchin, M., Gudmundsson, J., Popov, A. & Wong, S., 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. 27:1-27:15 15 p. 27. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 293).

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

    Open Access
    File
    1 Citation (Scopus)
    3 Downloads (Pure)

  • Minimizing Corners in Colored Rectilinear Grids

    Depian, T., Dobler, A., Kern, C. & Wulms, J. (Corresponding author), 29 Feb 2024, WALCOM: Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings. Uehara, R., Yamanaka, K. & Yen, H.-C. (eds.). Singapore: Springer, p. 134-148 15 p. (Lecture Notes in Computer Science (LNCS); vol. 14549).

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

    Open Access
    File
    93 Downloads (Pure)

  • Monotone Randomized Apportionment

    Correa, J., Gölz, P., Schmidt-Kraepelin, U., Tucker-Foltz, J. & Verdugo, V., 17 Dec 2024, EC '24: Proceedings of the 25th ACM Conference on Economics and Computation. Association for Computing Machinery, Inc., 1 p.

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

    Open Access
    File
    10 Downloads (Pure)

  • Optimal In-Place Compaction of Sliding Cubes

    Kostitsyna, I., Ophelders, T. A. E., Parada, I., Peters, T., Sonke, W. M. & Speckmann, B., 6 Jun 2024, 40th International Symposium on Computational Geometry (SoCG 2024). Mulzer, W. & Philips, J. M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 89:1-89:4 4 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 293).

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

    Open Access
    File
    9 Downloads (Pure)

  • Optimal In-Place Compaction of Sliding Cubes

    Kostitsyna, I., Ophelders, T. A. E., Parada, I., Peters, T., Sonke, W. M. & Speckmann, B., 31 May 2024, 19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 31:1-31:14 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
    9 Downloads (Pure)

  • Optimizing Symbol Visibility Through Displacement

    Gärtner, B., Kalani, V., M. Reddy, M., Meulemans, W., Speckmann, B. & Stojaković, M., 31 May 2024, 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024). Bodlaender, H. L. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 24:2-24:16 16 p. 24. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 294).

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

    Open Access
    File
    1 Downloads (Pure)

  • Preprocessing to Reduce the Search Space for Odd Cycle Transversal

    Jansen, B. M. P., Mizutani, Y., Sullivan, B. D. & Verhaegh, R. F. A., 5 Dec 2024, 19th International Symposium on Parameterized and Exact Computation, IPEC 2024. Bonnet, É. & Rzążewski, P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 18 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 321).

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

    Open Access
    File
    5 Downloads (Pure)

  • Project-fair and truthful mechanisms for budget aggregation

    Freeman, R. & Schmidt-Kraepelin, U., 24 Mar 2024, Proceedings of the AAAI Conference on Artificial Intelligence. Wooldridge, M., Dy, J. & Natarajan, S. (eds.). 9 ed. AAAI Press, Vol. 38. p. 9704-9712 9 p.

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

    Open Access
    File
    1 Citation (Scopus)
    11 Downloads (Pure)

  • 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.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 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
    13 Downloads (Pure)

  • Scalable Harmonious Simplification of Isolines

    van den Broek, S. W., Meulemans, W., Reimer, A. W. & Speckmann, B., 9 Sept 2024, 16th International Conference on Spatial Information Theory (COSIT 2024). Adams, B., Griffin, A. L., Scheider, S. & McKenzie, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 8:1-8:20 20 p. 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 315).

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

    Open Access
    File
    15 Downloads (Pure)

  • Search-Space Reduction via Essential Vertices Revisited: Vertex Multicut and Cograph Deletion

    Jansen, B. M. P. & Verhaegh, R. F. A., 31 May 2024, 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024. Bodlaender, H. L. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 28:1-28:17 17 p. 28. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 294).

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

    Open Access
    File
    1 Citation (Scopus)
    11 Downloads (Pure)

  • Stable and Dynamic Minimum Cuts

    de Berg, M., López Martínez, A. (Corresponding author) & Spieksma, F., 29 Feb 2024, WALCOM : Algorithms and Computation: 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings. Uehara, R., Yamanaka, K. & Yen, H.-C. (eds.). Singapore: Springer, p. 273-287 15 p. (Lecture Notes in Computer Science (LNCS); vol. 14549).

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

    Open Access
    File
    2 Downloads (Pure)

  • Steiner Tree Parameterized by Multiway Cut and Even Less

    Jansen, B. M. P. & Swennenhuis, C. M. F., 23 Sept 2024, 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 76:1-76:16 16 p. 76. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 308).

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

    Open Access
    File
    18 Downloads (Pure)

  • Synopses for Summarizing Spatial Data Streams

    Kiezebrink, J. J. E., Punter, W. R., Papapetrou, O. & Verbeek, K. A. B., 11 Nov 2024, Proceedings 28th International Conference on Extending Database Technology, Proceedings, EDBT 2025: Barcelona, Spain, March 25-March 28. OpenProceedings.org, p. 284-296 13 p. (Advances in Database Technology; vol. 28, no. 2).

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

    Open Access
    File
    12 Downloads (Pure)

  • The Algorithmic Complexity of the Paired Matching Problem

    Verhaegh, R. F. A. (Corresponding author), Feb 2024, Graphs and Combinatorial Optimization: from Theory to Applications: CTW 2023, Garmisch-Partenkirchen, Germany, June 20–22. Brieden, A., Pickl, S. & Siegle, M. (eds.). Springer Nature, p. 1-13 13 p. (AIRO Springer Series; vol. 13).

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

  • The Complexity of Geodesic Spanners Using Steiner Points

    de Berg, S., Ophelders, T. A. E., Parada, I., Staals, F. & Wulms, J. J. H. M., 4 Dec 2024, 35th International Symposium on Algorithms and Computation (ISAAC 2024). Mestre, J. & Wirth , A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 25:1-25:15 15 p. (Leibniz International Proceedings in Informatics, LIPcs; vol. 322).

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

    Open Access
    File

  • The PACE 2024 Parameterized Algorithms and Computational Experiments Challenge: One-Sided Crossing Minimization

    Kindermann, P., Klute, F. & Terziadis, S., 5 Dec 2024, 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). Bonnet, É. & Rzążewski, P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 26:1-26:20 20 p. 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 321).

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

    Open Access
    File
    33 Downloads (Pure)

  • Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth

    Jansen, B. M. P., Khazaliya, L. (Corresponding author), Kindermann, P., Liotta, G., Montecchiani, F. & Simonov, K., 6 Jan 2024, Graph Drawing and Network Visualization: 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20–22, 2023, Revised Selected Papers, Part II. Bekos, M. A. & Chimani, M. (eds.). Springer, p. 203-217 15 p. (Lecture Notes in Computer Science (LNCS); vol. 14466).

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

    Open Access
    File
    2 Citations (Scopus)
    6 Downloads (Pure)

  • Weighted envy-freeness for submodular valuations

    Montanari, L., Schmidt-Kraepelin, U., Suksompong, W. & Teh, N., 24 Mar 2024, Proceedings of the 38th AAAI Conference on Artificial Intelligence. Wooldridge, M., Dy, J. & Natarajan, S. (eds.). AAAI Press, p. 9865-9873 9 p. (Proceedings of the AAAI Conference on Artificial Intelligence; vol. 38, no. 9).

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

    Open Access
    File
    5 Citations (Scopus)
    2 Downloads (Pure)
  • 2023

    5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size.

    Jansen, B. M. P., de Kroon, J. J. H. & Wlodarczyk, M., Sept 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 66. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 274).

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

    Open Access
    3 Citations (Scopus)

  • Anonymous and Copy-Robust Delegations for Liquid Democracy

    Utke, M. & Schmidt-Kraepelin, U., 2023, Proceedings of the 37th Conference on Neural Information Processing Systems, NeurIPS 2023. Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M. & Levine, S. (eds.). Neural information processing systems foundation, 23 p. (Advances in Neural Information Processing Systems; vol. 36).

    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. J., Ophelders, T. & Speckmann, B., 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics (SIAM), p. 1759-1776 18 p.

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

  • Clustering in Polygonal Domains

    de Berg, M. T., Biabani, L., Monemizadeh, M. & Theocharous, L., 28 Nov 2023, 34th International Symposium on Algorithms and Computation (ISAAC 2023). Iwata, S. & Kakimura, N. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 23:1-23:15 15 p. 23. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 283).

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

    Open Access
    File
    6 Downloads (Pure)

  • Data-Spatial Layouts for Grid Maps

    van Beusekom, N., Meulemans, W., Speckmann, B. & Wood, J., 7 Sept 2023, 12th International Conference on Geographic Information Science (GIScience 2023). Beecham, R., Long, J. A., Smith, D., Zhao, Q. & Wise, S. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 10:1-10:17 17 p. 10. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 277).

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

    Open Access
    File
    1 Citation (Scopus)
    21 Downloads (Pure)

  • Density Approximation for Moving Groups

    van Mulken, M. J. M. (Corresponding author), Speckmann, B. & Verbeek, K. A. B., 28 Jul 2023, Algorithms and Data Structures: 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings. Morin, P. & Suri, S. (eds.). Cham: Springer, p. 675-688 14 p. (Lecture Notes in Computer Science (LNCS); vol. 14079).

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

    Open Access
    File
    1 Citation (Scopus)
    3 Downloads (Pure)

  • Fast Reconfiguration for Programmable Matter

    Kostitsyna, I., Peters, T. & Speckmann, B., 5 Oct 2023, 37th International Symposium on Distributed Computing (DISC 2023). Oshman, R. (ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 27:1-27:21 21 p. 27. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 281).

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

    Open Access
    File
    2 Citations (Scopus)
    1 Downloads (Pure)

  • Finding Diverse Minimum s-t Cuts

    de Berg, M. T., López Martínez, A. & Spieksma, F. C. R., 28 Nov 2023, 34th International Symposium on Algorithms and Computation (ISAAC 2023). Iwata, S. & Kakimura, N. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 24:1-24:17 17 p. 24. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 283).

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

    Open Access
    File
    1 Citation (Scopus)
    2 Downloads (Pure)

  • Geometric TSP on sets

    Alkema, H. Y. & de Berg, M. T., 28 Nov 2023, 34th International Symposium on Algorithms and Computation (ISAAC 2023). Iwata, S. & Kakimura, N. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 6:1-6:19 19 p. 6. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 283).

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

    Open Access
    File
    3 Downloads (Pure)

  • Graph Drawing Contest Report

    Kindermann, P., Klute, F., Mchedlidze, T. & Meulemans, W. (Corresponding author), 19 Jan 2023, Graph Drawing and Network Visualization: 30th International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers. Angelini, P. & von Hanxleden, R. (eds.). Cham: Springer, p. 459-470 12 p. (Lecture Notes in Computer Science (LNCS); vol. 13764).

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

    Open Access
    File
    1 Downloads (Pure)

  • Improved Bounds for Discrete Voronoi Games

    de Berg, M. (Corresponding author) & van Wordragen, G., 28 Jul 2023, Algorithms and Data Structures: 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings. Morin, P. & Suri, S. (eds.). Springer, p. 291-308 18 p. (Lecture Notes in Computer Science (LNCS); vol. 14079).

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

    Open Access
    File
    9 Downloads (Pure)

  • Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions

    Jansen, B. M. P. & van der Steenhoven, B., 13 Dec 2023, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023. Misra, N. & Wahlström, M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 27:1-27:15 15 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 285).

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

    Open Access
    File
    2 Citations (Scopus)

  • Morphing Planar Graph Drawings Through 3D

    Buchin, K., Evans, W. S., Frati, F., Kostitsyna, I., Löffler, M., Ophelders, T. & Wolff, A., 2023, SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Proceedings. Gasieniec, L. (ed.). Springer, p. 80-95 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13878 LNCS).

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

    Open Access
    2 Citations (Scopus)