Program

Link to conference program (updated).

Proceedings

Link to conference proceedings/abstracts.

Information Booklet

Link to conference information booklet including program.

List of Accepted Papers

Mathijs Wintraecken. Bounds on the angle between tangent spaces and the metric distortion for $C^2$ manifolds with given positive reach.
Man Kwun Chiu and Matias Korman. High Dimensional Consistent Digital Segments
Sergey Bereg, Luis Evaristo Caraballo de La Cruz, José Miguel Díaz Báñez and Mario A Lopez. Computing the k-resilience of a Synchronized Multi-Robot System
Márton Naszódi, Leonardo Martínez-Sandoval and Shakhar Smorodinsky. Bounding a global red-blue proportion using local conditions
Thomas Schibler and Subhash Suri. K-Dominance in Multidimensional Data
Franz Brandenburg. Compact 1-Bend RAC Drawings of 1-Planar Graphs
Mikkel Abrahamsen, Kevin Buchin, Mark De Berg, Mehran Mehr and Ali D. Mehrabi. Minimum Perimeter-Sum Partitions in the Plane
Tobias Andersson Granberg, Tatiana Polishchuk and Christiane Schmidt. A Novel MIP-based Airspace Sectorization for TMAs
Christian Scheffer, Sándor Fekete, Phillip Keldenich, Erik Demaine and Henk Meijer. Parallel Motion Planning: Coordinating a Swarm of Labeled Robots with Bounded Stretch
Victor Alvarez, Sándor Fekete and Arne Schmidt. Computing Triangulations with Minimum Stabbing Number
Sándor Fekete and Dominik Krupke. Covering Tours with Turn Cost: Variants, Approximation and Practical Solution
Stefan Felsner and Manfred Scheucher. Triangles in Arrangements of Pseudocircles
Gill Barequet and Yufei Zheng. Formulae Enumerating Polyominoes by both Area and Perimeter
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr and Ali D. Mehrabi. Range-Clustering Queries
Haim Kaplan, Wolfgang Mulzer, Liam Roditty and Paul Seiferth. Finding Triangles and Computing the Girth in Disk Graphs
Mark De Berg, Tim Leijssen, André van Renssen, Marcel Roeloffzen, Aleksandar Markovic and Gerhard J. Woeginger. A Lower Bound for the Dynamic Conflict-Free Coloring of Intervals with Respect to Points
Tillmann Miltzow, Anna Adamaszek and Mikkel Abrahamsen. Irrational Guards are Sometimes Needed
Tillmann Miltzow, Linda Kleist and Paweł Rzążewski. Is Area Universality $\forall \exists \mathbb{R}$-complete?
Bengt J. Nilsson and Eli Packer. Weighted Discrete Surveillance Tours in Simple Polygons
Csaba Biro, Edouard Bonnet, Daniel Marx, Tillmann Miltzow and Paweł Rzążewski. Fine-grained complexity of coloring unit disks and balls
Carlos Seara and Alexander Pilz. Convex Quadrangulations of Bichromatic Point Sets
Oswin Aichholzer, Lukas Andritsch, Karin Baur and Birgit Vogtenhuber. Perfect k-colored matchings and k+2-gonal tilings
Mark de Berg, Sándor Kisfaludi-Bak and Gerhard J. Woeginger. On the Dominating Set Problem in Intersection Graphs
Marc Van Kreveld. Competitive Analysis of the Pokemon Go Search Problem
Sándor Fekete, Christian Rieck and Christian Scheffer. On the Traveling Salesman Problem in Solid Grid Graphs
Leon Sering. A Combinatorial Upper Bound on the Length of Twang Cascades
Sunil Arya, Guilherme D. Da Fonseca and David Mount. Near-Optimal eps-Kernel Construction and Related Problems
Sándor Fekete and Phillip Keldenich. Conflict-free coloring of intersection graphs
Georgios Samaras, Ioannis Psarros, Georgia Avarikioti and Ioannis Emiris. Practical linear-space Approximate Near Neighbors in high dimension
Michael Biro and Christiane Schmidt. Computational complexity and bounds for Norinori and LITS
Vincent Despré and Francis Lazarus. Computing the Geometric Intersection Number of Curves
Yago Diez, Matias Korman, André van Renssen, Marcel Roeloffzen and Frank Staals. Kinetic All-Pairs Shortest Path in a Simple Polygon
Stefan Funke and Sabine Storandt. Parametrized Runtimes for Ball Tournaments
Mikkel Abrahamsen, Mark de Berg, Kevin Buchin, Mehran Mehr and Ali D. Mehrabi. A Generic Method for Finding Coresets for Clustering Problems
Benjamin Niedermann, Martin Nöllenburg and Ignaz Rutter. Radial Contour Labeling with Straight Leaders
Alexandre Rok and Bartosz Walczak. Coloring curves that cross a fixed curve
Maarten Kleinhans, Marc Van Kreveld, Tim Ophelders, Willem Sonke, Bettina Speckmann and Kevin Verbeek. Computing representative networks for braided rivers
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms and Noam Solomon. Subquadratic Algorithms for Algebraic Generalizations of 3SUM
Lukas Barth, Benjamin Niedermann, Ignaz Rutter and Matthias Wolf. Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani and Ignaz Rutter. On the Relationship between k-Planar and k-Quasi Planar Graphs
Maike Buchin, Stef Sijben and Carola Wenk. Distance Measures for Embedded Graphs
Johan van de Koppel, Maarten Löffler and Tim Ophelders. Computing Wave Impact in Self-Organised Mussel Beds
Tamara Mchedlidze, Marcel Radermacher and Ignaz Rutter. Aligned Drawings of Planar Graphs
Patrick Schnider. A generalization of crossing families
Jonas Cleve and Wolfgang Mulzer. An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant Workspace Model
Fabian Klute and Martin Nöllenburg. Minimizing crossings in constrained two-sided circular graph layouts
Marcel Ehrhardt and Wolfgang Mulzer. Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space
Herman Haverkort, David Kübel, Elmar Langetepe and Barbara Schwarzwald. How to play hot and cold on a line
Stefan Felsner and Alexander Pilz. Arrangements of Approaching Pseudo-Lines
Boris Klemz and Günter Rote. Ordered Level Planarity and Geodesic Planarity
Martin Held and Stefan de Lorenzo. On the Generation of Spiral Paths Within Planar Shapes
John Iacono, Elena Khramtcova and Stefan Langerman. Searching edges in the overlap of two plane graphs
Prosenjit Bose, Irina Kostitsyna and Stefan Langerman. Self-approaching paths in simple polygons
Martin Held and Peter Palfrader. Straight Skeletons of Monotone Surfaces in Three-Space
A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi and Dibyayan Chakraborty. Bottleneck Bichromatic Full Steiner Trees
Oscar Iglesias-Valiño and Francisco Santos. Classification of empty lattice 4-simplices
Irina Kostitsyna, Bettina Speckmann and Kevin Verbeek. Non-crossing drawings of multiple geometric Steiner arborescences
Mikkel Abrahamsen, Jacob Holm, Eva Rotenberg and Christian Wulff-Nilsen. Best Laid Plans of Lions and Men
Anna Lubiw, Zuzana Masárová and Uli Wagner. A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
Kevin Buchin, Erin Chambers, Tim Ophelders and Bettina Speckmann. Frechet Isotopies to Monotone Curves
Maarten Löffler, Jun Luo and Rodrigo Silveira. Geomasking through Perturbation, or Counting Points in Circles
Carlos Alegría-Galicia, David Orden, Carlos Seara and Jorge Urrutia. Illuminating polygons by edge-aligned floodlights of uniform angle (Brocard illumination)
Robert Gmyr, Irina Kostitsyna, Fabian Kuhn, Christian Scheideler and Thim Strothmann. Forming Tile Shapes with a Single Robot
Bahareh Banyassady and Wolfgang Mulzer. A Simple Analysis of Rabin's Algorithm for Finding Closest Pairs
Daniel Gonçalves and Lucas Isenmann. Dushnik-Miller dimension of TD-Delaunay complexes
Helmut Alt and Nadja Scharf. Polynomial Time Approximation Schemes for Circle Packing Problems
Jean Cardinal and Udo Hoffmann. Convex allowable sequences
Vahideh Keikha, Maarten Löffler and Ali Mohades. Largest and Smallest Area Triangles on a Given Set of Imprecise Points