Accepted papers
EuroCG2024 - Booklet of abstracts 1. Suthee Ruangwises : Nondango is NP-Complete .
2. Thijs Beurskens An Interleaving Distance for Ordered Merge Trees .
3. Steven van den Broek Greedy Monochromatic Island Partitions .
4. Arjen Simons Hausdorff morphs with fewer components .
5. Gill Barequet, Noga Keren Adi Rivkin On Totally-Concave Polyominoes .
6. Hamid Beygi, Mohammad Mahini , Salman Qadami and Morteza Saghafian: Approximating Simplet Frequency Distribution for Simplicial Complexes .
7. Sandro Roch Coloring problems on arrangements of pseudolines .
8. Martin Balko , Anna Brötzner, Fabian Klute and Josef Tkadlec: Faces in Rectilinear Drawings of Complete Graphs .
9. Michaela Borzechowski A Universal Construction for Unique Sink Orientations .
10. Fernando Cortés Kühnast Counting Pseudoline Arrangements .
11. Michael Hoffmann, Tillmann Miltzow, Simon Weber and Lasse Wulf: Recognition of Unit Segment and Polyline Graphs is ER-Complete .
12. Sarita de Berg The Complexity of Geodesic Spanners using Steiner Points .
13. Waseem Akram Enumerating At Most k-Out Polygons .
14. Michael Etienne Van Huffel and Matteo Palo LITE: A Stable Framework for Lattice-Integrated Embedding of Topological Descriptors .
15. Sándor Fekete, Chek-Manh Loi Covering Geometric Sets with Lines .
16. José Miguel Díaz-Bañez, José Manuel Higes, Alina Kasiuk Covering line segments with drones: the minmax criterion .
17. Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou Bipartite Dichotomous Ordinal Graphs .
18. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta , Henk Meijer, Fabrizio Montecchiani and Steve Wismath: Bounds on the Edge-length Ratio of 2-outerplanar Graphs .
19. Frederik Brüning Simplified and Improved Bounds on the VC-Dimension for Elastic Distance Measures .
20. Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters Optimal In-Place Compaction of Sliding Cubes .
21. Andrea de Las Heras Parrilla Sibson's formula for higher order Voronoi diagrams .
22. Vincent Despré, Camille Lanuel Computing an $\varepsilon$-net of a closed hyperbolic surface .
23. Ivor van der Hoog, Fabian Klute, Irene Parada and Patrick Schnider : Barking dogs: A Fréchet distance variant for detour detection .
24. Takumi Shiota The Number of Non-overlapping Edge Unfoldings in Convex Regular-faced Polyhedra .
25. Carlos Alegría, Anna Brötzner, Bengt J. Nilsson, Christiane Schmidt and Carlos Seara : The Complexity of the Lower Envelope of Collections of Various Geometric Shapes .
26. Linda Kleist and Kai Kobbe Unit Interval Graphs & Maximum c-Independent Sets Maximizing the Number of Isolated Vertices .
27. Maarten Löffler, Tamara Mchedlidze, David Orden, Josef Tkadlec and Jules Wulms : Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4 .
28. Anna Schenfisch , Brittany Fasy and David Millman: Lower Bounding Minimal Faithful Sets of Verbose Persistence Diagrams .
29. Ji Hoon Chun, Christian Kipp and Sandro Roch: On exact covering with unit disks .
30. Jacobus Conradi Fast Approximations and Coresets for $(k,\ell)$-Median under Dynamic Time Warping .
31. Michael Hoffmann, Meghana M. Reddy and Shengzhe Wang On Maximal 3-Planar Graphs .
32. Todor Antić Star Forest Decompositions of Certain Geometric Graphs .
33. Jacobus Conradi, Anne Driemel and Benedikt Kolbe : Revisiting the Fréchet distance between piecewise smooth curves .
34. Bernd Gärtner, Fatime Rasiti and Patrick Schnider : Computing Enclosing Depth .
35. Andreas Padalkin Polylogartihmic Time Algorithms for Shortest Path Forests in Programmable Matter .
36. Andreas Padalkin Reconfiguration and Locomotion with Joint Movements in the Amoebot Model .
37. Lotte Blank Range Reporting for Time Series via Rectangle Stabbing .
38. Nathan van Beusekom, Max van Mulken Capturing the Shape of a Point Set with a Line-Segment .
39. Alexander Dobler Representing Hypergraphs by Point-Line Incidences .
40. Miriam Goetze Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs .
41. Ivor van der Hoog, Thijs van der Horst Faster and Deterministic Subtrajectory Clustering .
42. Alexander Natalchenko and Arsenii Sagdeev : Non-degenerate monochromatic triangles in the max-norm plane .
43. Sujoy Bhore, Martin Nöllenburg, Csaba Toth and Jules Wulms : Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time .
44. Erwin Glazenburg Robust Bichromatic Classification using Two Lines .
45. Thomas Depian Constrained One-Sided Boundary Labeling .
46. Sarita de Berg, Guillermo Esteban, Rodrigo Silveira and Frank Staals: Exact solutions to the Weighted Region Problem .
47. Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser and Leonidas Theocharous: Clustering with Few Disks to Minimize the Sum of Radii .
48. Jan Kynčl and Jan Soukup Extending simple monotone drawings .
49. Maike Buchin and Wolf Kißler Hardness and modifications of the weak graph distance .
50. Anna Brötzner The k-Transmitter Watchman Route Problem is NP-Complete Even in Histograms and Star-Shaped Polygons .
51. Mit Compgeom Group, Hugo Akitaya, Erik Demaine, Adam Hesterberg, Anna Lubiw, Jayson Lynch, Joseph O'Rourke , Frederick Stock and Josef Tkadlec: Deltahedral Domes over Equiangular Polygons .
52. Simon D. Fink, Matthias Pfretzschner Clustered Planarity Variants for Level Graphs .
53. Katharina Klost and Wolfgang Mulzer: Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs .
54. Oswin Aichholzer, Sergio Cabello , Viola Mészáros and Jan Soukup: Connected matchings .
55. Leonidas Theocharous A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R^2 .
56. Julia Katheder, Philipp Kindermann , Fabian Klute, Irene Parada and Ignaz Rutter: On k-Plane Insertion into Plane Drawings .
57. Sergio Cabello and Panos Giannopoulos : Delaunay Triangulation and Convex Polygons with Predictions .
58. Stephane Durocher, Myroslav Kryven , Fengy Liu, Amirhossein Mashghdoust and Ikaro Penha Costa: 2-Coloring Point Guards in a k-Guarded Polygon .
59. Oswin Aichholzer, Anna Brötzner Flips in Odd Matchings .
60. Evanthia Papadopoulou and Martin Suderland : A variant of backwards analysis applicable to order-dependent sets .
61. Nicolas Bousquet, Lucas De Meyer Reconfiguration of plane trees in convex geometric graphs .
62. Michael Kaufmann and Maria Eleni Pavlidi A note on mixed linear layouts of planar graphs .
63. Marena Richter Approximating the Fréchet Distance in Graphs with Low Highway Dimension .
64. Minas Dioletis, Ioannis Emiris, George Ioannakis, Evanthia Papadopoulou, Thomas Pappas, Panagiotis Repouskos, Panagiotis Rigas GeoCluster: A latent variable generative model for continuous space geometric clustering .
65. Kevin Buchin, Antonia Kalb Oriented dilation of undirected graphs .
66. Waseem Akram Pairwise Triangles Intersections in a Query Rectangle .
67. Annika Bonerath, Martin Nöllenburg, Soeren Terziadis , Markus Wallinger and Jules Wulms: On Orbital Labeling with Circular Contours .
Gold sponsors
Contributors
40th European Workshop on Computational Geometry (EuroCG2024)
