Program
Tuesday 12.03.2024
Wednesday 13.03.2024
08:30-09:00 Registration 09:00-10:00 Invited Talk: Xavier Goaoc (session Chair: C. Papadopoulos)Intersection patterns of geometric set systems 10:00-10:40 Fast Forward S1, S2, S3 10:40-11:15 Coffee Break 11:15-12:45 Session S1.A (room A, 6 talks, sponsored by yWorks, session Chair: P. Kindermann)11:15-11:30 Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta , Henk Meijer, Fabrizio Montecchiani and Steve Wismath: Bounds on the Edge-length Ratio of 2-outerplanar Graphs .
11:30-11:45 Simon D. Fink, Matthias Pfretzschner Clustered Planarity Variants for Level Graphs .
11:45-12:00 Alexander Dobler Representing Hypergraphs by Point-Line Incidences .
12:00-12:15 Michael Hoffmann, Meghana M. Reddy and Shengzhe Wang On Maximal 3-Planar Graphs .
12:15-12:30 Martin Balko , Anna Brötzner, Fabian Klute and Josef Tkadlec: Faces in Rectilinear Drawings of Complete Graphs .
12:30-12:45 Jan Kynčl and Jan Soukup Extending simple monotone drawings .
11:15-12:45 Session S1.B (room B, 6 talks, session Chair: F. Staals)11:15-11:30 Jacobus Conradi, Anne Driemel and Benedikt Kolbe : Revisiting the Fréchet distance between piecewise smooth curves .
11:30-11:45 Ivor van der Hoog, Fabian Klute, Irene Parada and Patrick Schnider : Barking dogs: A Fréchet distance variant for detour detection .
11:45-12:00 Marena Richter Approximating the Fréchet Distance in Graphs with Low Highway Dimension .
12:00-12:15 Arjen Simons Hausdorff morphs with fewer components .
12:15-12:30 Frederik Brüning Simplified and Improved Bounds on the VC-Dimension for Elastic Distance Measures .
12:30-12:45 Thijs Beurskens An Interleaving Distance for Ordered Merge Trees .
12:45-14:15 Lunch Break 14:15-15:30 Session S2.A (room A, 5 talks, session Chair: G. Liotta)14:15-14:30 Thomas Depian Constrained One-Sided Boundary Labeling .
14:30-14:45 Annika Bonerath, Martin Nöllenburg, Soeren Terziadis , Markus Wallinger and Jules Wulms: On Orbital Labeling with Circular Contours .
14:45-15:00 Sarita de Berg, Guillermo Esteban, Rodrigo Silveira and Frank Staals: Exact solutions to the Weighted Region Problem .
15:00-15:15 Michael Etienne Van Huffel and Matteo Palo LITE: A Stable Framework for Lattice-Integrated Embedding of Topological Descriptors .
15:15-15:30 Bernd Gärtner, Fatime Rasiti and Patrick Schnider : Computing Enclosing Depth .
14:15-15:30 Session S2.B (room B, 5 talks, session Chair: M. Balko)14:15-14:30 Nicolas Bousquet, Lucas De Meyer Reconfiguration of plane trees in convex geometric graphs .
14:30-14:45 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 .
14:45-15:00 Andreas Padalkin Reconfiguration and Locomotion with Joint Movements in the Amoebot Model .
15:00-15:15 Nathan van Beusekom, Max van Mulken Capturing the Shape of a Point Set with a Line-Segment .
15:15-15:30 Irina Kostitsyna, Tim Ophelders, Irene Parada, Tom Peters Optimal In-Place Compaction of Sliding Cubes .
15:30-16:00 Coffee Break 16:00-17:30 Session S3.A (room A, 6 talks, session Chair: R. Silveira)16:00-16:15 Kevin Buchin, Antonia Kalb Oriented dilation of undirected graphs .
16:15-16:30 Katharina Klost and Wolfgang Mulzer: Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs .
16:30-16:45 Andrea de Las Heras Parrilla Sibson's formula for higher order Voronoi diagrams .
16:45-17:00 Erwin Glazenburg Robust Bichromatic Classification using Two Lines .
17:00-17:15 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 .
17:15-17:30 Waseem Akram and Katsuhisa Yamanaka: Enumerating At Most k-Out Polygons .
16:00-17:30 Session S3.B (room B, 6 talks, session Chair: J. Wulms)16:00-16:15 Suthee Ruangwises : Nondango is NP-Complete .
16:15-16:30 Michael Hoffmann, Tillmann Miltzow, Simon Weber Recognition of Unit Segment and Polyline Graphs is ER-Complete .
16:30-16:45 Anna Brötzner The k-Transmitter Watchman Route Problem is NP-Complete Even in Histograms and Star-Shaped Polygons .
16:45-17:00 Maike Buchin and Wolf Kißler Hardness and modifications of the weak graph distance .
17:00-17:15 Anna Schenfisch , Brittany Fasy and David Millman: Lower Bounding Minimal Faithful Sets of Verbose Persistence Diagrams .
17:15-17:30 Sarita de Berg The Complexity of Geodesic Spanners using Steiner Points .
17:30-18:15 Business Meeting (room A, session Chairs: M. A. Bekos, C. Papadopoulos)
Thursday 14.03.2024
09:00-10:00 Invited Talk: Walter Didimo (session Chair: M. A. Bekos)Orthogonal Graph Drawings and the Bend Minimization Problem 10:00-10:25 Fast Forward Session S4, S5, S6 10:25-11:00 Coffee Break 11:00-11:45 Session S4.A (room A, 3 talks, session Chair: S. Terziadis)11:00-11:15 Sandro Roch Coloring problems on arrangements of pseudolines .
11:15-11:30 Fernando Cortés Kühnast Counting Pseudoline Arrangements .
11:30-11:45 Jacobus Conradi Fast Approximations and Coresets for $(k,\ell)$-Median under Dynamic Time Warping .
11:00-11:45 Session S4.B (room B, 3 talks, session Chair: M. Kryven)11:00-11:15 Sándor Fekete, Chek-Manh Loi Covering Geometric Sets with Lines .
11:15-11:30 José Miguel Díaz-Bañez, José Manuel Higes, Alina Kasiuk Covering line segments with drones: the minmax criterion .
11:30-11:45 Ji Hoon Chun, Christian Kipp and Sandro Roch: On exact covering with unit disks .
11:45-12:00 Short Break 12:00-12:45 Session S5.A (room A, 3 talks, session Chair: J. O'Rourke)12:00-12:15 Gill Barequet, Noga Keren Adi Rivkin On Totally-Concave Polyominoes .
12:15-12:30 Hamid Beygi, Mohammad Mahini , Salman Qadami and Morteza Saghafian: Approximating Simplet Frequency Distribution for Simplicial Complexes .
12:30-12:45 Michaela Borzechowski A Universal Construction for Unique Sink Orientations .
12:00-12:45 Session S5.B (room B, 3 talks, session Chair: L. Palios)12:00-12:15 Alexander Natalchenko and Arsenii Sagdeev : Non-degenerate monochromatic triangles in the max-norm plane .
12:15-12:30 Steven van den Broek Greedy Monochromatic Island Partitions .
12:30-12:45 Stephane Durocher, Myroslav Kryven , Fengy Liu, Amirhossein Mashghdoust and Ikaro Penha Costa: 2-Coloring Point Guards in a k-Guarded Polygon .
12:45-14:15 Lunch Break 14:15-15:30 Session S6.A (room A, 5 talks, session Chair: T. Ophelders)14:15-14:30 Oswin Aichholzer, Sergio Cabello , Viola Mészáros and Jan Soukup: Connected matchings .
14:30-14:45 Vincent Despré, Camille Lanuel Computing an $\varepsilon$-net of a closed hyperbolic surface .
14:45-15:00 Lotte Blank Range Reporting for Time Series via Rectangle Stabbing .
15:00-15:15 Sergio Cabello and Panos Giannopoulos : Delaunay Triangulation and Convex Polygons with Predictions .
15:15-15:30 Waseem Akram Pairwise Triangles Intersections in a Query Rectangle .
14:15-15:30 Session S6.B (room B, 5 talks, session Chair: B. Speckmann)14:15-14:30 Maarten Löffler, Tamara Mchedlidze, David Orden, Josef Tkadlec and Jules Wulms : Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4 .
14:30-14:45 Oswin Aichholzer, Anna Brötzner Flips in Odd Matchings .
14:45-15:00 Todor Antić Star Forest Decompositions of Certain Geometric Graphs .
15:00-15:15 Andreas Padalkin Polylogartihmic Time Algorithms for Shortest Path Forests in Programmable Matter .
15:15-15:30 Evanthia Papadopoulou and Martin Suderland : A variant of backwards analysis applicable to order-dependent sets .
16:15-18:00 Guided tour at the old castle and visit at the silversmithing museum 18:00-20:00 Free time (Suggestion: Take the boat and go to the island, if weather allows)20:00-22:00 Social Dinner at Alou Gia Alou
Friday 15.03.2024
09:00-10:00 Invited Talk: Ioannis Emiris (session Chair: E. Papadopoulou)Algebraic and combinatorial bounds on the embedding number of distance graphs 10:00-10:15 Fast Forward Session S7, S8 10:15-10:45 Coffee Break 10:45-11:45 Session S7.A (room A, 4 talks, session Chair: S. D. Fink)10:45-11:00 Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou Bipartite Dichotomous Ordinal Graphs .
11:00-11:15 Julia Katheder, Philipp Kindermann , Fabian Klute, Irene Parada and Ignaz Rutter: On k-Plane Insertion into Plane Drawings .
11:15-11:30 Michael Kaufmann and Maria Eleni Pavlidi A note on mixed linear layouts of planar graphs .
11:30-11:45 Miriam Goetze Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs .
10:45-11:45 Session S7.B (room B, 4 talks, session Chair: A. Weinberger)10:45-11:00 Sujoy Bhore, Martin Nöllenburg, Csaba Toth and Jules Wulms : Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time .
11:00-11:15 Linda Kleist and Kai Kobbe Unit Interval Graphs & Maximum c-Independent Sets Maximizing the Number of Isolated Vertices .
11:15-11:30 Leonidas Theocharous A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R^2 .
11:30-11:45 Takumi Shiota The Number of Non-overlapping Edge Unfoldings in Convex Regular-faced Polyhedra .
11:45-12:00 Short Break 12:00-12:45 Session S8 (room A, 3 talks, session Chair: B. Kolbe)12:00-12:15 Ivor van der Hoog, Thijs van der Horst Faster and Deterministic Subtrajectory Clustering .
12:15-12:30 Mikkel Abrahamsen, Sarita de Berg, Lucas Meijer, André Nusser and Leonidas Theocharous: Clustering with Few Disks to Minimize the Sum of Radii .
12:30-12:45 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 .
12:45-13:00 Closing (room A)13:00-14:30 Lunch Break
Gold sponsors
Contributors
40th European Workshop on Computational Geometry (EuroCG2024)
