| 1 | Sándor P. Fekete, Jonas Friemel, Peter Kramer, Jan-Marc Reinhardt, Christian Rieck and Christian Scheffer | Tilt Automata: Gathering Particles With Uniform External Control |
| 2 | Thijs Beurskens, Tim Ophelders, Bettina Speckmann and Kevin Verbeek | Locally Correct Interleavings between Merge Trees |
| 3 | Maxim Snoep, Stevie-Ray Janssen, Bettina Speckmann and Kevin Verbeek | Multi-Block Grids via Polycubes |
| 4 | Gill Barequet and Tom Feldman | Counting d-Dimensional Polycubes, Revisited |
| 5 | Takuto Nakai and Shuya Bundo | A 44-Point Configuration Not Coverable by Disjoint Unit Disks |
| 6 | Sabine Cornelsen, Jan Kratochvíl, Miriam Münch, Giacomo Ortali, Alexandra Weinberger and Alexander Wolff | Grounded String Representations of Series-Parallel Graphs without Transitive Edges |
| 7 | Emilio Di Giacomo, Carolina Haase, Philipp Kindermann and Giuseppe Liotta | Planar Convex Obstacle Number of Trees |
| 8 | Franz Brandenburg | General Visibility Graphs |
| 9 | Lotte Blank | Fréchet Distance in the Imbalanced Case |
| 10 | Sarita de Berg, Jacobus Conradi, Ivor van der Hoog and Eva Rotenberg | Solving the Contiguous Art Gallery Problem using Few Starting Points |
| 11 | Oswin Aichholzer, Helena Bergold, Simon D. Fink, Maarten Löffler, Patrick Schnider and Josef Tkadlec | Garment numbers of bi-colored point sets in the plane |
| 12 | Lucas Meijer, Arnaud de Mesmay, Till Miltzow, Marcus Schaefer and Jack Stade | Devil’s Games and QR: Continuous Games complete for the First-Order Theory of the Reals. |
| 13 | Sandro M. Roch | Signotopes Induce Unique Source Orientations on Grids |
| 14 | Oswin Aichholzer, Joseph Dorfer, Peter Kramer, Christian Rieck and Birgit Vogtenhuber | Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees |
| 15 | Miriam Goetze, Michael Kaufmann and Soeren Terziadis | On t-colorable k-plane drawings |
| 16 | Vincent Delecroix, Oscar Fontaine and Francis Lazarus | On the Computation of Schrijver’s Kernels |
| 17 | Carolina Haase, Giuseppe Liotta, Maarten Löffler, Fabrizio Montecchiani, Alessandra Tappini and Soeren Terziadis | The Witness Unit Disk Representability Problem |
| 18 | Sándor Fekete, Kai Kobbe, Dominik Krupke, Joseph Mitchell, Christian Rieck and Christian Scheffer | Guarding Offices with Maximum Dispersion |
| 19 | Hugo A. Akitaya, Joseph Dorfer, Peter Kramer, Christian Rieck, Gabriel Shahrouzi and Frederick Stock | Sliding Cubes in Parallel |
| 20 | Yılmaz Arslanoğlu | Undirected TSP as a Constrained GSTP Variant |
| 21 | Anna Hofer, Joachim Orthaber, Birgit Vogtenhuber and Alexandra Weinberger | Small Empty Cycles in Simple Drawings of K_n |
| 22 | Eliel Ingervo and Sándor Kisfaludi-Bak | Recognizing Subgraphs of Regular Tilings |
| 23 | Elena Farahbakhsh Touli, Ingrid Hotz and Talha Bin Masood | Towards Computing Average Merge Tree Based on the Interleaving Distance |
| 24 | Andrea de Las Heras-Parrilla, Clemens Huemer and Javier Tejel | On quadrilaterals in higher order Voronoi diagrams |
| 25 | Sofia Brenner, Linda Kleist, Torsten Mütze, Christian Rieck and Francesco Verciani | Disproving two conjectures on the Hamiltonicity of Venn diagrams |
| 26 | Erin Chambers, Christopher Fillmore, Shankha Shubhra Mukherjee, Rohit Roy, Elizabeth Stephenson and Mathijs Wintraecken | Bouquet : A Visualization Tool for Symmetry Sets and Vineyards |
| 27 | Nathalie Aubrun, Manon Blanc and Olivier Bournez | The Domino Problem is Decidable for Robust Tilesets |
| 28 | Sándor Fekete, Malte Hoffmann, Chek-Manh Loi and Michael Perk | Drone Air Traffic Control: Tracking a Set of Moving Objects with Minimal Power |
| 29 | Sándor Fekete, Prahlad Kasthurirangan, Phillip Keldenich, Fabian Kolhoff, Chek-Manh Loi and Michael Perk | Line Segment Visibility in Simple Polygons: Exact, Robust, Scalable Computation and Applications |
| 30 | Patrizio Angelini, Michael Bekos, Luca Grilli and Aikaterini Maria Ntasiou | Ordinal Geometric Thickness of Complete and Complete Bipartite Graphs |
| 31 | Lucas Meijer, Till Miltzow, Subhasree Patro and Thekla Hamm | Oracle Separations for RPH |
| 32 | Jonathan Højlev, Simon D. Fink and Eva Rotenberg | Dynamic Level Planarity Testing |
| 33 | Sándor P. Fekete, Jonas Friemel, Prahlad Narasimhan Kasthurirangan, Ramin Kosfeld, Christian Scheffer and Arne Schmidt | Partitioning a Tile Arrangement for Construction by a Team of Robots |
| 34 | Havard Bjerkevik, Joseph Dorfer, Linda Kleist, Torsten Ueckerdt and Birgit Vogtenhuber | Flipping Non-crossing Spanning Trees is NP-Hard |
| 35 | Anna Brötzner, Kien C. Huynh, Christiane Schmidt and Frederick Stock | The Chromatic Dispersive Art Gallery Problem in Polyominoes |
| 36 | Tim Gerlach, Benjamin Hennies and Linda Kleist | Online Packing of Orthogonal Polygons |
| 37 | Linda Kleist and Lena Scherzer | Approximating Triangle Covers of Polygons |
| 38 | Matthijs Ebbens, Jie Lu and Alexander Munteanu | A Framework for Dimension Reduction for Curves |
| 39 | Anna Brötzner, Bengt J. Nilsson and Christiane Schmidt | Improved Approximation of Two Watchmen’s Routes in Simple Polygons |
| 40 | Koki Furukawa | Simplex volumes in hyperplane arrangements |
| 41 | Alexandra Weinberger and Ji Zeng | What induces plane structures in complete graph drawings? |
| 42 | Stefan Felsner | Antipodal Pairs and Crossing Numbers of Complete Graphs |
| 43 | Ivor van der Hoog, Eva Rotenberg and Frederikke Uldahl | Fréchet Distance for paths in a d-dimensional grid graphs |
| 44 | Emilio Di Giacomo, Giuseppe Liotta, Daniel Perz and Morteza Saghafian | The Euclidean Minimum Spanning Tree Extension Problem (and its Approximation) |
| 45 | Maarten Löffler and Ids de Vlas | Graph Tile Connectability with Turn Tiles |
| 46 | Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Johanne M. Vistisen and Sampson Wong | Dynamic (1 + ε)-Spanner in Disk Intersection Graphs |
| 47 | Sebastian Angrick, Kevin Buchin, Geri Gokaj and Marvin Künnemann | Computing $L_\infty$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness |
| 48 | Kevin Buchin, Jacobus Conradi, Sariel Har-Peled, Antonia Kalb, Abhiruk Lahiri, Lukas Plätz, Carolin Rehs and Sampson Wong | On Small Pair Decompositions for Point Sets: Hardness and the 1D case |
| 49 | Sofia Brenner, Petr Gregor, Torsten Mütze and Francesco Verciani | On minimum Venn diagrams |
| 50 | Benedikt Hahn, Torsten Ueckerdt and Birgit Vogtenhuber | Edge Densities of Drawings of Graphs with One Forbidden Cell |
| 51 | Eunjin Oh and Hyeonjun Shin | Fully Scalable MPC Algorithms for WSPD in Euclidean Spaces |
| 52 | Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst and Tim Ophelders | Computing the Fréchet Distance When Just One Curve is c-Packed: A Simple Almost-Tight Algorithm |
| 53 | Cameron Strachan and Konrad Swanepoel | The number of occurrences of the two smallest distances |
| 54 | Anna Brötzner, Bengt J. Nilsson and Christiane Schmidt | Approximating the Minmax Three-Visiting Routes for m Treasures in a Simple Polygon |
| 55 | Thomas C. Van Dijk, Erwin Glazenburg, Wouter Meulemans, Anna Schenfisch and Arjen Simons | Point Set Transformations using Given Groups |
| 56 | Kevin Buchin, Carolin Rehs and Torben Scheele | On (Directed) Width-Parameters of Geometric Spanners |
| 57 | Gábor Damásdi | Explicit High-Chromatic Hypergraphs Realized by Axis-Parallel Rectangles |
| 58 | Mark de Berg, Bart M. P. Jansen and Jeroen S.K. Lamme | Star-Based Separators for Intersection Graphs of c-Colored Pseudo-Segments |
| 59 | Maike Buchin, Wolf Kißler and Fabian Kubon | Rupture-Isolation for the Weak Graph Distance |
| 60 | Thijs van der Horst, Maarten Löffler, Tim Ophelders and Tom Peters | Reconfiguration of Squares Using a Constant Number of Moves Each |
| 61 | Thomas Depian and Frank Sommer | Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii |
| 62 | Alexander Firbas | The Parameterized Complexity of Geometric 1-Planarity |
| 63 | David P. Bourne, Thomas O. Gallouët, Quentin Mérigot and Andrea Natale | Semi-discrete convex order and Laguerre tessellation fitting |
| 64 | Stephen Kobourov, William Lenhart, Guiseppe Liotta, Daniel Perz, Pavel Valtr and Johannes Zink | Simultaneous Embedding of Two Paths on the Grid |
| 65 | Sándor Kisfaludi-Bak, Tze-Yang Poon and Geert van Wordragen | Shortest Paths, Convexity, and Treewidth in Regular Hyperbolic Tilings |
| 66 | Suthee Ruangwises | Wataridori is NP-Complete |
| 67 | Raphaël Tinarrage | Simplicial Approximation to CW Complexes with Spherical Delaunay Triangulations |
| 68 | Jette Gutzeit, Kalani Kistler, Tim Ophelders and Anna Schenfisch | Which Vertical Graphs are Non VPHT Reconstructible? |
| 69 | Ekaterina Ivshina, Galit Anikeeva and Ling Zhou | Doughnut or Mickey Mouse? Detecting Toroidal Structure in Data through Persistent Cup-Length |
| 70 | Stefan Huber, Kristóf Huszár, Michael Kerber and Martin Uray | Topologically Stable Hough Transform |
| 71 | Aleksa Džuklevski | A convex σ-morphic protoset exists |
| 72 | Justin Dallant | Lower Bounding the Number of Triangulations as a Function of the Convex Hull Size |
| 73 | Oswin Aichholzer, Katharina Klost, Kristin Knorr, Viola Mészáros and Josef Tkadlec | Geometric Give and Take |
| 74 | Peyman Afshani, Boris Aronov, Kevin Buchin, Maike Buchin, Otfried Cheong, Katharina Klost, Carolin Rehs and Günter Rote | Compatible triangulations of simple polygons |
| 75 | Michael Hoffmann, Julia Oppermann, Rosna Paul, Jonathan Rollin and Alexandra Weinberger | Simple Topological Thickness |
| 76 | Saeed Odak, Jonathan Rollin and Torben Scheele | On the Pathwidth of 2-Layer k-Matching-Planar Graphs |
| 77 | Arun Kumar Das, Vít Jelínek, Jan Kynčl, Martin Pergel, Felix Schröder, Peter Stumpf and Pavel Valtr | High Beer Index Implies Big Hollow Triangles |
| 78 | Yan Alves Radtke | On the Surjectivity of a Map by Kapranov and Voevodsky in four Dimensions |
| 79 | Robert Barish and Tetsuo Shibuya | Partitioning the boundary of an art gallery with visibility polygons |
| 80 | Antonia Kalb, Kevin Buchin and Prosenjit Bose | Fault-Tolerance and Oriented Dilation of the Greedy Triangulation |
| 81 | Egor Bakaev, Florestan Brunck and Amir Yehudayoff | Approximation Depth of Convex Polytopes |
| 82 | Sanghwa Han and Eunjin Oh | Range Counting Oracles for Extent problems |
| 83 | Todor Antić, Morteza Saghafian, Maria Saumell, Felix Schröder, Josef Tkadlec and Pavel Valtr | How many times can two minimum spanning trees cross? |
| 84 | Prosenjit Bose, Guillermo Esteban, David Orden, Rodrigo Silveira and Tyler Tuttle | On geodesic disks enclosing many points |
| 85 | Alexandra Wesolek and Lisa Kudlik | Centered flips of non-crossing, perfect matchings |
| 86 | Alexander Dobler, Siddharth Gupta, Philipp Kindermann, Fabrizio Montecchiani and Martin Nöllenburg | The Complexity of Extending Storylines with Minimum Local Crossing Number |
| 87 | Eliška Červenková and Jan Kratochvil | On the edge surplus of 1-planar unit distance graphs over matchstick graphs |
| 88 | Stefan Huber and Dominik Kaaser | Finding Patient Zero via Low-Dimensional Geometric Embeddings |
| 89 | Víctor Franco-Sánchez, Alex Herrero and Rodrigo I. Silveira | On the solvability of Shortest Descending Paths |
| 90 | Maarten Dankers, Thomas C. Van Dijk and Kevin Verbeek | An FPT Algorithm for Maximum k × k Square Packing Parameterized by Remaining Space |
| 91 | Thijs Beurskens, Marc van Kreveld, Frank Staals and Jules Wulms | Exploring Mixedness of Bichromatic Point Sets |
| 92 | Pakapim Eua-Anant, Papangkorn Apinyanon, Thunyatorn Jirachaisri, Nantapong Ruangsuksriwong and Suthee Ruangwises | NP-Completeness Proofs of All or Nothing, Water Walk, and Remembered Length Using the T-Metacell Framework |
| 93 | John Iacono, Yakov Nekrich and Martin P. Seybold | Incremental k-lowest planes and planar k-nearest neighbor with optimal query time |
| 94 | Todor Antić, Niloufar Fuladi, Anna Margarethe Limbach and Pavel Valtr | On rectilinear drawings of the hypercube |
