CCCG 2025

CCCG 2025 - Accepted Papers

• Aaron T. Becker, Sándor P. Fekete, Jonas Friemel, Ramin Kosfeld, Peter Kramer, Harm Kube, Christian Rieck, Christian Scheffer, Arne Schmidt; Efficient Reconfiguration of Tile Arrangements by a Single Active Robot

• Gabriel Aldous, Seth Barber, Alper Ungor; On Super-Guarding Convex and Star-Shaped Polygons

• Anastasiia Tkachenko, Haitao Wang; Computing Maximum Cliques in Unit Disk Graphs

• Anna Brötzner, Bengt J. Nilsson, Christiane Schmidt; Multiple Watchman Routes in Staircase Polygons

• Arash Ahadi, Ahmad Biniaz, Mohammad Hashemi, Ali Nakhaeisharif; Guarding Polygons with Mutually Visible π-Guards

• Bubai Manna; Minimum Selective Subset on Some Graph Classes

• Chirag Kaudan, Amir Nayyeri; Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries

• David Alcántara, Francisco Criado, Francisco Santos; Covering Radii of 3-Zonotopes and the Shifted Lonely Runner Conjecture

• David Eppstein, Michael T. Goodrich, Abraham Illickan, Claire A. To; Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness

• David Eppstein; Decremental Greedy Polygons and Polyhedra Without Sharp Angles

• Donald Sheehy; Fast Approximate Lipschitz Extensions in Doubling Metrics

• Eduard Eiben, Iyad Kanj, Salman Parsa; Motion Planning of Disk and Rectangular Robots

• Elizabeth Munch, Elena Xinyi Wang, Carola Wenk; The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data

• Gang Liu, Haitao Wang; Minimum-Weight Half-plane Hitting Set

• Gill Barequet, Neal Madras, Johann Peters; On $t$-fold Totally-Concave Polyominoes

• Hong Duc Bui; Square Packing with Asymptotically Smallest Waste Only Needs Good Squares

• Hong Duc Bui; Straight-line Orthogonal Drawing of Complete Ternary Tree Requires $O(n^{1.032})$ Area

• Jared Coleman, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce; Optimal Delivery with a Faulty Drone

• Jonathan Perry, Benjamin Raichel; Hausdorff Edit Distance

• Jonathan Gabor, Aaron Williams, Reverse Rush Hour is NP-Complete

• Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Thomas C. Hull, Anna Lubiw, Jayson Lynch, Klara Mundilova, Chie Nara, Joseph O'Rourke, Frederick Stock, Josef Tkadlec, Ryuhei Uehara; Quasigeodesics on the Cube

• Hugo A. Akitaya, Matias Korman, Frederick Stock, Input-Sensitive Reconfiguration of Sliding Cubes

• Karim Abu Affash, Paz Carmi, Iliya Lisin; Approximating 2-Clique in Unit Disk Graphs

• Majid Mirzanezhad, Arash Rafiey; Approximate and Exact Geometric Generalized Minimum Spanning Trees

• Stephane Durocher, Myroslav Kryven, Tamara Mchedlidze; On Upward Planar Embeddings of Paths with Partially Fixed Vertices

• Ofek Gila, Michael Goodrich, Zahra Hadizadeh, Daniel Hirschberg, Shayan Taherijam; The Marco Polo Problem: A Combinatorial Approach to Geometric Localization

• Ofek Gila, Michael Goodrich, Zahra Hadizadeh, Daniel Hirschberg, Shayan Taherijam; The Rectilinear Marco Polo Problem

• Reymond Akpanya, Adi Rivkin, Frederick Stock; Inside-Out Dissections of Polygons and Polyhedra

• Rustem Kakimov, Xing Tan; On Upward Book Embeddability of DAGs

• Sharareh Alipour, Arash Ahadi, Kajal Baghestani; Improved Wake-Up Time for Euclidean Freeze-Tag Problems

• Shoon Mineyoshi, Kazuhisa Seto, Takashi Horiyama; On the Diameters of Reconfiguration Graphs and ZDD-Based BFS-Algorithm for Optimal Reconfiguration Problems of Optimal Ladder Lotteries

• Shuhao Tan, David Mount; Approximating Metric Depth Queries

• Stephane Durocher, Arman Heydari, J. Mark Keil, Debajyoti Mondal; Minimum Anchored Steiner Trees with Removable Obstacles

• Stephane Durocher, Sahar Lamey, Pak Ching Li,; Fault-Tolerant Euclidean k-Centres

• Steven van den Broek, Marc van Kreveld, Soeren Terziadis; Partitioning Colored Points into Monochromatic Islands is NP-Complete

• Taehoon Ahn, Sang Won Bae, Sang Duk Yoon; The Orthogonal Two-Line Center Problem

• Takeshi Yamada, Tom van der Zanden, Ryuhei Uehara; Puzzles are Hard Enough Just by Rotations

• Takumi Shiota, Yudai Enomoto, Masashi Gorobe, Takashi Horiyama, Tonan Kamata, Toshiki Saitoh, Ryuhei Uehara; The Number of Non-overlapping Unfoldings in Convex Polyhedra

• Tanmay Inamdar, Sounak Modak, Kushal Singanporia; PTAS for Stabbing Unit Squares and Variants

• Therese Biedl, Erin Chambers, Irina Kostitsyna, Günter Rote; Sweeping $x$-monotone pseudolines

• Thomas Schibler, Subhash Suri, Jie Xue; Approximation and Hardness of Polychromatic TSP

• Timothy Gomez, Robert Schweller, Tim Wylie; Covert Computation in the Prebuilt aTAM

•  Michael T. Goodrich, Vinesh Sridhar; Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations

• Matt Gibson-Lopez, Erik Krohn, Zhongxiu Yang; The VC-Dimension of Limited Visibility on the Boundary of a Simple Polygon