Jonas Friemel, David Liedtke and Christian Scheffer

Efficient Shape Reconfiguration by Hybrid Programmable Matter

Hugo Akitaya, Sándor Fekete, Peter Kramer, Saba Molaei, Christian Rieck, Frederick Stock and Tobias Wallner

Sliding Squares in Parallel

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

Matthias Artmann 🎓, Andreas Padalkin and Christian Scheideler

On the Shape Containment Problem within the Amoebot Model with Reconfigurable Circuits

David Kirkpatrick and Paul Liu

Minimum-length coordinated motions for two convex centrally-symmetric robots

Kenneth Cheung, Irina Kostitsyna and Tom Peters

Assembly Order Planning for Modular Structures by Autonomous Multi-Robot Systems

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

Emeric Gioan and Yann Marin 🎓

Computation of the canonical tree decomposition of a rank-3 uniform oriented matroid into mutually avoiding parts

Jacobus Conradi and Anne Driemel

Finding Complex Patterns in Trajectory Data via Geometric Set Cover

Sergey Bereg, Jesús Capitán, José Miguel Díaz Bañez, José Manuel Higes López, Miguel Angel Pérez Cutiñoi, Vanesa Sánchez and Inmaculada Ventura

Optimal covering of rectangular grid graphs with tours of constrained length

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

Phillip Keldenich, Dominik Krupke and Jan Siemsen

Computing Optimal Solutions for Chromatic Art Gallery Problems

Anna Brötzner, Omrit Filtser, Bengt J. Nilsson, Christian Rieck and Christiane Schmidt

Segment Watchman Routes

Anna Brötzner 🎓, Bengt J. Nilsson and Christiane Schmidt

Two Watchmen’s Routes in Staircase Polygons

Nazanin Hadiniya, Mohammad Ghodsi and Wolfgang Mulzer

Guarding an Orthogonal Polygon with the minimum number of Sliding Cameras placed on the vertical edges

Vahideh Keikha, Maarten Löffler, Maria Saumell and Pavel Valtr

Guarding a 1.5D terrain with Imprecise Viewpoints

Michelle Reimann and Fabian Stehn

Romeo and Juliet have a dog - Shortest paths to visibility for three agents inside simple polygons

Thijs van der Horst 🎓, Marc van Kreveld, Tim Ophelders and Bettina Speckmann

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon

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

Ivor van der Hoog, Eva Rotenberg and Lasse Wulf

Discrete Fréchet Distance is Also Hard in Unweighted Planar Graphs

Marena Richter 🎓, Anne Driemel, Maike Buchin, Sampson Wong and Peyman Afshani

Property Testing of Curve Similarity

Florestan Brunck, Maarten Löffler and Rodrigo Silveira

A curve with rotation number one that is not universal for beacon routing

Evanthia Papadopoulou, Martin Suderland and Zeyu Wang

A collapse algorithm for farthest Voronoi diagrams in three dimensions

Evanthia Papadopoulou, Martin Suderland and Zeyu Wang

Voronoi Diagrams of Four Lines in Three Dimensions

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

Maike Buchin and Lea Thiel 🎓

Extending the contour tree distance to embedded graphs

Mats Bierwirth, Julia Hütte, Bettina Speckmann and Patrick Schnider

Bounds for k-centers of point sets under L∞-bottleneck distance

Wouter Meulemans, Kevin Verbeek and Jules Wulms

An Approximation Lower Bound for Topologically Stable Stateless Kinetic Euclidean MSTs

Miriam Goetze, Michael Hoffmann, Ignaz Rutter and Torsten Ueckerdt

Crossing Number of 3-Plane Drawings

Michael Hoffmann, Stefan Felsner, Till Miltzow, Shengzhe Wang, Emo Welzl, Hannah Rotzoll and Tomas Hruz

On Local and Global Crossing Numbers

Miriam Münch and Ignaz Rutter

Parameterized Algorithms for Crossing Number with Forbidden Topological Crossing Patterns

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

Maria Axenovich, Leon Kießle and Arsenii Sagdeev

Faces of maximal plane graphs without short cycles

Oswin Aichholzer and Joseph Dorfer 🎓

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets

Emil Toftegaard Gæde 🎓, Ivor van der Hoogh, Eva Rotenberg and Tord Stordalen

Dynamic Maintenance of a Learned Index

Maike Buchin and Jan Erik Swiadek 🎓

Valleys for Continuous Dynamic Time Warping

Sándor Fekete, Linda Kleist, Fabian Kollhoff, Chek-Manh Loi and Michael Perk

Approximation Algorithms for Lawn Mowing with Obstacles

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

Maxim Snoep, Bettina Speckmann and Kevin Verbeek

Polycube Segmentations via Dual Loops

Johanna Ockenfels, Yoshio Okamoto and Patrick Schnider

Chasing puppies on orthogonal straight-line plane graphs

Sándor Fekete, Rouven Kniep, Dominik Krupke and Michael Perk

A Branch-and-Bound Algorithm for the Traveling Salesman Problem with Neighborhoods

Sándor Fekete, Dominik Krupke, Christian Rieck, Arne Schmidt and Tobias Wallner

Getting Better All the Time? Harmonic and Cumulative Traveling Salesman Problems

Benjamin Aram Berendsohn, Hwi Kim and László Kozma

Balanced TSP partitioning

Catarina Avelino, Hoi Ping Luk and Altino Santos

Dihedral f-Tilings of the Sphere Induced by the Möbius Triangle (2,3,4)

Andrea de Las Heras Parrilla, David Flores-Peñaloza, Clemens Huemer and David Orden

Containment results on points and spheres

Helena Bergold, Arun Kumar Das, Robert Lauff, Felix Schröder, Manfred Scheucher and Marie Diana Sieper

On Triangular Separation of Bichromatic Point Sets

Tim Ophelders and Anna Schenfisch

An Order for Higher-Dimensional Simplex Sweeps

Boris Aronov, Sang Won Bae, Otfried Cheong, David Eppstein, Christian Knauer and Raimund Seidel

Better Late Than Never: the Cmoplexity of Arrangements of Polyhedra

Jean Cardinal, Xavier Goaoc and Sarah Wajsbrot 🎓

Hitting Affine Families of Polyhedra, with Applications to Robust Optimization

Édouard Bonnet and Kristóf Huszár

On the Twin-Width of Smooth Manifolds

Marguerite Bin 🎓

A fractional Helly theorem for set systems with slowly growing homological shatter function

Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak and Robert Scheffler

Partially Ordered Hamiltonian Paths of Grid Graphs

John Iacono and Yakov Nekrich

Incremental Planar Nearest Neighbor Queries with Optimal Query Time

Erwin Glazenburg and Frank Staals

Strictly output sensitive color frequency reporting

Katharina Klost, Kristin Knorr and Wolfgang Mulzer

A Robust Algorithm for Finding Triangles in Disk Graphs

Alexander Baumann, Katharina Klost, Kristin Knorr and Wolfgang Mulzer

Dynamic Balanced Clique Separators for Disk Graphs

Yan Alves Radtke, Balázs Keszegh and Robert Lauff

On Triangles in Colored Pseudoline Arrangements

Justin Dallant

Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem

Michael Wilhelmi

Mutations and Euclideaness in pseudosphere arrangements

Günter Rote

NumPSLA — An experimental research tool for pseudoline arrangements and order types

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

Johann Hartleb, Marie Schmidt, Samuel Wolf 🎓 and Alexander Wolff

Visualization of Event Graphs for Train Schedules

Thijs Beurskens, Steven van den Broek, Arjen Simons, Willem Sonke, Kevin Verbeek, Tim Ophelders, Michael Hoffmann and Bettina Speckmann

ParkView: Visualizing Monotone Interleavings

Annika Bonerath, William Evans, Jan-Henrik Haunert, David Kirkpatrick and Stephen Kobourov

Disc Placement for Dynamic Bubble Charts

Kevin Buchin, Antonia Kalb, Anil Maheshwari, Michiel Smid, Carolin Rehs, Sampson Wong and Saeed Odak

Computing Oriented Spanners and their Dilation

Kevin Buchin, Carolin Rehs and Torben Scheele

Geometric spanners of bounded tree-width

Sándor Fekete, Phillip Keldenich and Michael Perk

Exact Algorithms for Minimum Dilation Triangulation

Oswin Aichholzer, Joseph Dorfer 🎓 and Birgit Vogtenhuber

Flipping Plane Spanning Trees Compatibly

Carla Binucci, Fabrizio Montecchiani, Daniel Perz and Alessandra Tappini

Flipping Matchings is Hard

Florestan Brunck

On the Non-locality of Edge-Insertions

Steven van den Broek, Marc van Kreveld, Wouter Meulemans and Arjen Simons 🎓

Minimizing Vertical Length in Linked Bar Charts

Thomas Depian, Carolina Haase, Martin Nöllenburg and André Schulz

On Planar Unit-Length Linear Linkages in Polygonal Domains

Patricia Bachmann, Anna Brötzner, Miriam Goetze, Philipp Kindermann, Matthias Pfretzschner and Soeren Terziadis

Saturated Drawings of Geometric Thickness k

Marco Ricci, Jonathan Rollin, André Schulz and Alexandra Weinberger

On plane cycles in geometric multipartite graphs

Alexander Dobler 🎓 and Jakob Roithinger

Layered Graph Drawing with Few Gaps and Few Crossings

Katharina Klost, Marc van Kreveld, Daniel Perz, Günter Rote and Josef Tkadlec

Minimum spanning blob-trees

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

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

Eliška Červenková

Construction of 1-planar unit distance graphs with more edges than matchstick graphs

Petr Chmel and Vít Jelínek.

Representing Graphs by Unions of Line Segments