Accepted papers

A preliminary version of the booklet of abstracts.

1. Kevin Buchin, Antonia Kalb, Anil Maheshwari, Michiel Smid, Carolin Rehs, Sampson Wong and Saeed Odak. Computing Oriented Spanners and their Dilation.
   
2. Oswin Aichholzer and Joseph Dorfer. A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets.
   
3. Kevin Buchin, Carolin Rehs and Torben Scheele. Geometric spanners of bounded tree-width.
   
4. Thijs van der Horst, Marc van Kreveld, Tim Ophelders and Bettina Speckmann. The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon.
   
5. Hugo Akitaya, Sándor Fekete, Peter Kramer, Saba Molaei, Christian Rieck, Frederick Stock and Tobias Wallner. Sliding Squares in Parallel.
   
6. Aaron Becker, Sándor Fekete, Mariem Guitouni, Chek-Manh Loi and Michael Perk. Multi-Covering a Point Set by m Disks with Minimum Total Area.
   
7. Sándor Fekete, Phillip Keldenich and Michael Perk. Exact Algorithms for Minimum Dilation Triangulation.
   
8. Sándor Fekete, Rouven Kniep, Dominik Krupke and Michael Perk. A Branch-and-Bound Algorithm for the Traveling Salesman Problem with Neighborhoods.
   
9. Sándor Fekete, Dominik Krupke, Christian Rieck, Arne Schmidt and Tobias Wallner. Getting Better All the Time? Harmonic and Cumulative Traveling Salesman Problems.
   
10. Sándor Fekete, Linda Kleist, Fabian Kollhoff, Chek-Manh Loi and Michael Perk. Approximation Algorithms for Lawn Mowing with Obstacles.
    
11. Aaron Becker, Sándor Fekete, Jonas Friemel, Ramin Kosfeld, Peter Kramer, Harm Kube, Christian Rieck, Christian Scheffer and Arne Schmidt. Moving Matter: Efficient Reconfiguration of Tile Arrangements by a Single Active Robot.
    
12. Alexander Dobler and Jakob Roithinger. Layered Graph Drawing with Few Gaps and Few Crossings.
    
13. Eliot Robson, Jack Spalding-Jamieson and Da Wei Zheng. The Analytic Arc Cover Problem and its Applications to Contiguous Art Gallery, Polygon Separation, and Shape Carving.
    
14. Jonas Friemel, David Liedtke and Christian Scheffer. Efficient Shape Reconfiguration by Hybrid Programmable Matter.
    
15. Phillip Keldenich, Dominik Krupke and Jan Siemsen. Computing Optimal Solutions for Chromatic Art Gallery Problems.
    
16. John Iacono and Yakov Nekrich. Incremental Planar Nearest Neighbor Queries with Optimal Query Time.
    
17. Oswin Aichholzer, Joseph Dorfer and Birgit Vogtenhuber. Flipping Plane Spanning Trees Compatibly.
    
18. Günter Rote. NumPSLA — An experimental research tool for pseudoline arrangements and order types.
    
19. Catarina Avelino, Hoi Ping Luk and Altino Santos. Dihedral f-Tilings of the Sphere Induced by the Möbius Triangle (2,3,4).
    
20. Benjamin Aram Berendsohn, Hwi Kim and László Kozma. Balanced TSP partitioning.
    
21. Florestan Brunck. On the Non-locality of Edge-Insertions.
    
22. Javier Perera-Lago, Álvaro Torras-Casas, Jérôme Guzzi and Rocio Gonzalez-Diaz. The Induced Matching Distance: A Novel Topological Metric with Applications in Robotics.
    
23. Katharina Klost, Marc van Kreveld, Daniel Perz, Günter Rote and Josef Tkadlec. Minimum spanning blob-trees.
    
24. Michael A. Bekos, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Luca Grilli, Maria Eleni Pavlidi, Alessandra Tappini and Alexandra Weinberger. Defective Linear Layouts of Graphs.
    
25. Maria Axenovich, Leon Kießle and Arsenii Sagdeev. Faces of maximal plane graphs without short cycles.
    
26. Tim Ophelders and Anna Schenfisch. An Order for Higher-Dimensional Simplex Sweeps.
    
27. Michelle Reimann and Fabian Stehn. Romeo and Juliet have a dog - Shortest paths to visibility for three agents inside simple polygons.
    
28. Carla Binucci, Fabrizio Montecchiani, Daniel Perz and Alessandra Tappini. Flipping Matchings is Hard.
    
29. Thijs Beurskens, Steven van den Broek, Arjen Simons, Willem Sonke, Kevin Verbeek, Tim Ophelders, Michael Hoffmann and Bettina Speckmann. ParkView: Visualizing Monotone Interleavings.
    
30. Evanthia Papadopoulou, Martin Suderland and Zeyu Wang. A collapse algorithm for farthest Voronoi diagrams in three dimensions.
    
31. Andrea de Las Heras Parrilla, David Flores-Peñaloza, Clemens Huemer and David Orden. Containment results on points and spheres.
    
32. Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak and Robert Scheffler. Partially Ordered Hamiltonian Paths of Grid Graphs.
    
33. Anna Brötzner, Omrit Filtser, Bengt J. Nilsson, Christian Rieck and Christiane Schmidt. Segment Watchman Routes.
    
34. Anna Brötzner, Bengt J. Nilsson and Christiane Schmidt. Two Watchmen’s Routes in Staircase Polygons.
    
35. Kenneth Cheung, Irina Kostitsyna and Tom Peters. Assembly Order Planning for Modular Structures by Autonomous Multi-Robot Systems.
    
36. Patricia Bachmann, Anna Brötzner, Miriam Goetze, Philipp Kindermann, Matthias Pfretzschner and Soeren Terziadis. Saturated Drawings of Geometric Thickness k.
    
37. Patrizio Angelini, Carla Binucci, Giuseppe Di Battista, Emilio Di Giacomo, Walter Didimo, Fabrizio Grosso, Giacomo Ortali and Ioannis G. Tollis. Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces.
    
38. Lotte Blank, Jacobus Conradi, Anne Driemel, Benedikt Kolbe, André Nusser and Marena Richter. Transforming Dogs on the Line: On the Fréchet Distance Under Translation in 1D.
    
39. Vahideh Keikha, Maarten Löffler, Maria Saumell and Pavel Valtr. Guarding a 1.5D terrain with Imprecise Viewpoints.
    
40. Evanthia Papadopoulou, Martin Suderland and Zeyu Wang. On the Voronoi Diagrams of Four Lines in Three Dimensions.
    
41. Eliška Červenková. Construction of 1-planar unit distance graphs with more edges than matchstick graphs.
    
42. Michael Hoffmann, Stefan Felsner, Till Miltzow, Shengzhe Wang, Emo Welzl, Hannah Rotzoll and Tomas Hruz. On Local and Global Crossing Numbers.
    
43. Steven van den Broek, Marc van Kreveld, Wouter Meulemans and Arjen Simons. Minimizing Vertical Length in Linked Bar Charts.
    
44. Maike Buchin and Lea Thiel. Extending the contour tree distance to embedded graphs.
    
45. Emil Toftegaard Gæde, Ivor van der Hoogh, Eva Rotenberg and Tord Stordalen. Dynamic Maintenance of a Learned Index.
    
46. Matthias Artmann, Andreas Padalkin and Christian Scheideler. On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits.
    
47. Marco Ricci, Jonathan Rollin, André Schulz and Alexandra Weinberger. On plane cycles in geometric multipartite graphs.
    
48. Peyman Afshani, Maike Buchin, Anne Driemel,Marena Richter and Sampson Wong. Property Testing of Curve Similarity.
    
49. Jacobus Conradi and Anne Driemel. Finding Complex Patterns in Trajectory Data via Geometric Set Cover.
    
50. Thomas Depian, Simon D. Fink, Boris Klemz, Robert Ganian, Martin Nöllenburg and Marie Diana Sieper. Partial Level Planarity Parameterized by the Size of the Missing Graph.
    
51. Mats Bierwirth, Julia Hütte, Bettina Speckmann and Patrick Schnider. Bounds for k-centers of point sets under L∞-bottleneck distance.
    
52. Michael Wilhelmi. Mutations and Euclideaness in pseudosphere arrangements.
    
53. Johanna Ockenfels, Yoshio Okamoto and Patrick Schnider. Chasing puppies on orthogonal straight-line plane graphs.
    
54. Yan Alves Radtke, Balázs Keszegh and Robert Lauff. On Triangles in Colored Pseudoline Arrangements.
    
55. Thomas Depian, Carolina Haase, Martin Nöllenburg and André Schulz. On Planar Unit-Length Linear Linkages in Polygonal Domains.
    
56. Miriam Goetze, Michael Hoffmann, Ignaz Rutter and Torsten Ueckerdt. Crossing Number of 3-Plane Drawings.
    
57. Maxim Snoep, Bettina Speckmann and Kevin Verbeek. Polycube Segmentations via Dual Loops.
    
58. Sergey Bereg, Jesús Capitán, José Miguel Díaz Bañez, José Manuel Higes López, Miguel Angel Pérez Cutiño, Vanesa Sánchez and Inmaculada Ventura. Optimal covering of rectangular grid graphs with tours of constrained length.
    
59. Thomas C. van Dijk, Wolf Kißler, Lukas Plätz, Marena Richter and Jonathan Rollin. On the Spectrum from Convex to Connected r-gather on Graphs.
    
60. Jean Cardinal, Xavier Goaoc and Sarah Wajsbrot. Hitting Affine Families of Polyhedra, with Applications to Robust Optimization.
    
61. Helena Bergold, Arun Kumar Das, Robert Lauff, Felix Schröder, Manfred Scheucher and Marie Diana Sieper. On Triangular Separation of Bichromatic Point Sets.
    
62. Boris Aronov, Sang Won Bae, Otfried Cheong, David Eppstein, Christian Knauer and Raimund Seidel. Better Late Than Never: the Complexity of Arrangements of Polyhedra.
    
63. David Kirkpatrick and Paul Liu. Minimum-length coordinated motions for two convex centrally-symmetric robots.
    
64. Erwin Glazenburg and Frank Staals. Strictly output sensitive color frequency reporting.
    
65. Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen Kobourov and Johannes Zink. Visualizing Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees and Cacti.
    
66. Ivor van der Hoog, Eva Rotenberg and Lasse Wulf. Discrete Fréchet Distance is Also Hard in Unweighted Planar Graphs.
    
67. Édouard Bonnet and Kristóf Huszár. On the Twin-Width of Smooth Manifolds.
    
68. Wouter Meulemans, Kevin Verbeek and Jules Wulms. An Approximation Lower Bound for Topologically Stable Stateless Kinetic Euclidean MSTs.
    
69. Annika Bonerath, William Evans, Jan-Henrik Haunert, David Kirkpatrick and Stephen Kobourov. Disc Placement for Dynamic Bubble Charts.
    
70. Miriam Münch and Ignaz Rutter. Parameterized Algorithms for Crossing Number with Forbidden Topological Crossing Patterns.
    
71. Emeric Gioan and Yann Marin. Computation of the canonical tree decomposition of a set of points in the plane into mutually avoiding parts.
    
72. Maike Buchin and Jan Erik Swiadek. Valleys for Continuous Dynamic Time Warping.
    
73. Petr Chmel and Vít Jelínek. Representing Graphs by Unions of Line Segments.
    
74. Nazanin Hadiniya, Mohammad Ghodsi and Wolfgang Mulzer. Guarding an Orthogonal Polygon with the minimum number of Sliding Cameras placed on the vertical edges.
    
75. Katharina Klost, Kristin Knorr and Wolfgang Mulzer. A Robust Algorithm for Finding Triangles in Disk Graphs.
    
76. Justin Dallant. Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem.
    
77. Marguerite Bin. A fractional Helly theorem for set systems with slowly growing homological shatter function.
    
78. Johann Hartleb, Marie Schmidt, Samuel Wolf and Alexander Wolff. Visualization of Event Graphs for Train Schedules.
    
79. Alexander Baumann, Katharina Klost, Kristin Knorr and Wolfgang Mulzer. Dynamic Balanced Clique Separators for Disk Graphs.
    
80. Florestan Brunck, Maarten Löffler and Rodrigo Silveira. A curve with rotation number one that is not universal for beacon routing.