The slots are 20 minutes for SoCG and 15 minutes for CG:YRF. Please plan with a talk length of 18 minutes for SoCG and 13 minutes for CG:YRF, allowing 2 minutes for questions, discussion, and the change of speaker.

SoCG student speakers are labeled with . A link for submitting feedback on SoCG student presentations will be added here later. Your feedback will be used to determine the SoCG Best Student Presentation Award. Thank you in advance!

• Monday, 23 June 2025

  Time
  15:00-19:00	Registration

• Tuesday, 24 June 2025

  Time
  09:00-09:10	Opening (Room A)
  09:10-09:40	SoCG Best Paper (Room A) Timothy M. Chan and Isaac M. Hair A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation Chair: Haitao Wang
  09:40-10:00	Fast-Forward Session for CG:YRF (Room A) Chair: ???
  10:00-10:25	Coffee Break
  10:25-11:25	SoCG Session 1A (Room B) Chair: Kristóf Huszár			SoCG Session 1B (Room C) Chair: Chih-Hung Liu
  10:25-10:45	Tao Hou, Salman Parsa, and Bei Wang Tracking the Persistence of Harmonic Chains: Barcode and Stability			John Iacono and Yakov Nekrich Incremental Planar Nearest Neighbor Queries with Optimal Query Time
  10:45-11:05	Oliver Chubet, Kirk Gardner, and Donald Sheehy A Theory of Sub-Barcodes			Zihang Wu, Martin G. Herold, Danupon Nanongkai, Joachim Spoerhase, and Nithin Varma Sublinear Data Structure for Nearest Neighbor in Ultra High Dimensions
  11:05-11:25	Dustin L Arendt, Matthew Broussard, Bala Krishnamoorthy, Nathaniel Saul, and Amber Thrall Steinhaus Filtration and Stable Paths in the Mapper			Sarita de Berg and Frank Staals Nearest Neighbor Searching in a Dynamic Simple Polygon
  11:25-11:30	Short Break
  11:30-12:30	SoCG Session 2A (Room B) Chair: Jie Xue			SoCG Session 2B (Room C) Chair: Jeff Phillips
  11:30-11:50	Eduard Eiben, Robert Ganian, Iyad Kanj, and M. S. Ramanujan A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots			Karthik C. S., Euiwoong Lee, Yuval Rabani, Chris Schwiegelshohn, and Samson Zhou On Approximability of ℓ22 Min-Sum Clustering
  11:50-12:10	Pankaj K Agarwal, Mark de Berg, Benjamin Holmgren, Alex Steiger, and Martijn Struijs Optimal Motion Planning for Two Square Robots in a Rectilinear Environment			Ivor van der Hoog, Lara Ost, Eva Rotenberg, and Daniel Rutschmann Efficient Greedy Discrete Subtrajectory Clustering
  12:10-12:30	Mikkel Abrahamsen, Kevin Buchin, Maike Buchin, Linda Kleist, Maarten Löffler, Lena Schlipf, Andre Schulz, and Jack Stade Reconfiguration of Unit Squares and Disks: PSPACE-Hardness in Simple Settings			Sang Won Bae, Nicolau Oliver, and Evanthia Papadopoulou Higher-Order Color Voronoi Diagrams and the Colorful Clarkson-Shor Framework
  12:30-13:50	Lunch Break
  13:50-14:15	SoCG Best Student Paper (Room A) Ángel Javier Alonso A Sparse Multicover Bifiltration of Linear Size Chair: Oswin Aichholzer
  14:15-14:20	Short Break
  14:20-15:40	SoCG Session 3A (Room B) Chair: Jonathan Spreer			SoCG Session 3B (Room C) Chair: Hsien-Chih Chang
  14:20-14:40	Édouard Bonnet and Kristóf Huszár On the Twin-Width of Smooth Manifolds			Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth, and Sujoy Bhore Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
  14:40-15:00	Dominique Attali, Mattéo Clémot, Bianca Boeira Dornelas, and André Lieutier When Alpha-Complexes Collapse onto Codimension-1 Submanifolds			Antonia Kalb, Kevin Buchin; Anil Maheshwari, Saeed Odak, Carolin Rehs, Michiel Smid, and Sampson Wong Computing Oriented Spanners and Their Dilation
  15:00-15:20	Rhuaidi Antonio Burke, Benjamin Burton, and Jonathan Spreer Small triangulations of 4-manifolds: Introducing the 4-manifold census			Kevin Buchin, Carolin Rehs, and Torben Scheele Geometric Spanners of Bounded Tree-Width
  15:20-15:40	Colleen Delaney, Clément Maria, and Eric Samperton An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number			Robert Krauthgamer and Nir Petruschka Lipschitz Decompositions of Finite ℓp Metrics
  15:40–16:00	Coffee Break
  16:00–17:45	CG:YRF Session A (Room A) Chair: ???		CG:YRF Session B (Room B) Chair: ???		CG:YRF Session C (Room C) Chair: ???
  16:00-16:15	??? ???		??? ???		??? ???
  16:15-16:30	??? ???		??? ???		??? ???
  16:30-16:45	??? ???		??? ???		??? ???
  16:45-17:00	??? ???		??? ???		??? ???
  17:00-17:15	??? ???		??? ???		??? ???
  17:15-17:30	??? ???		??? ???		??? ???
  17:30-17:45	??? ???		??? ???		??? ???
  18:00-19:00	Discussion Forum

• Wednesday, 25 June 2025

  Time
  09:00-10:00	Invited Talk: Meirav Zehavi (Ben-Gurion University of the Negev) - Parameterized Computational Geometry: Visibility Problems, Geometric Intersection Graphs and Graph Drawing (Room A) Chair: Haitao Wang
  10:00-10:10	Short Break
  10:10–11:10	SoCG Session 4A (Room B) Chair: Michael Hoffmann			SoCG Session 4B (Room C) Chair: Francis Lazarus
  10:10-10:30	Klaus Jansen, Debajyoti Kar, Arindam Khan, K. V. N. Sreenivas, and Malte Tutas Improved Approximation Algorithms for Three-Dimensional Knapsack			Dmitriy Morozov and Primoz Skraba Persistent (Co)Homology in Matrix Multiplication Time
  10:30-10:50	Karl Bringmann, Kasper Green Larsen, André Nusser, Eva Rotenberg, and Yanheng Wang Approximating Klee’s Measure Problem and a Lower Bound for Union Volume Estimation			Luis Scoccola and Dmitriy Morozov Computing Betti Tables and Minimal Presentations of Zero-Dimensional Persistent Homology
  10:50-11:10	Subhash Suri, Jie Xue, Xiongxin Yang, and Jiumu Zhu Dynamic Maximum Depth of Geometric Objects			Magnus B. Botnan and Lies Beers Extremal Betti Numbers and Persistence in Flag Complexes
  11:10-11:40	Coffee Break
  11:40–12:40	SoCG Session 5A (Room B) Chair: Shakhar Smorodinsky			SoCG Session 5B (Room C) Chair: Siu-Wing Cheng
  11:40-12:00	J. Mark Keil and Debajyoti Mondal The Maximum Clique Problem in a Disk Graph Made Easy			Shion Fukuzawa, Michael Goodrich, and Sandy Irani Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction
  12:00-12:20	Thomas Bläsius, Jean-Pierre von der Heydt, Sándor Kisfaludi-Bak, Marcus Wilhelm, and Geert van Wordragen Structure and Independence in Hyperbolic Uniform Disk Graphs			Peyman Afshani, Frank Staals, and Yakov Nekrich Convexity Helps Iterated Search in 3D
  12:20-12:40	Timothy M. Chan, Chaya Keller, and Shakhar Smorodinsky On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects			Attila Jung and Dömötör Pálvölgyi k-Dimensional Transversals for Fat Convex Sets
  12:40-14:10	Lunch Break
  14:10-15:30	SoCG Session 6A (Room B) Chair: Jie Gao			SoCG Session 6B (Room C) Chair: Takeshi Tokuyama
  14:10-14:30	Herbert Edelsbrunner, Alexey Garber, and Morteza Saghafian On Spheres with k Points Inside			Helena Bergold, Lukas Egeling, and Hung Hoang Signotopes with Few Plus Signs
  14:30-14:50	James Davies, Agelos Georgakopoulos, Meike Hatzel, and Rose McCarty Strongly Sublinear Separators and Bounded Asymptotic Dimension for Sphere Intersection Graphs			Abhibhav Garg, Rafael Oliveira, and Akash Kumar Sengupta Uniform Bounds on Product Sylvester-Gallai Configurations
  14:50-15:10	Andrew Suk and Ethan White A Note on the No-(d+2)-on-a-Sphere Problem			Elizaveta Streltsova and Uli Wagner Levels in Arrangements: Linear Relations, the g-Matrix, and Applications to Crossing Numbers
  15:10-15:30	Jeff Erickson and Christian Howard Shelling and Sinking Graphs on the Sphere			Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, and Rebeka Raffay The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles
  15:30-15:50	Coffee Break
  15:50-16:40	CG:MEDIA (Room A)			15:50-17:50	Combinatorial Structures in Geometric Topology (Room B)
  15:50-16:00	Auguste Gezalyan, Nithin Parepally, Klint Faber, Adam Martinson, Aniruddh Mutnuru, Mihil Sreenilayam, Ryan Parker, Aram Zaprosyan, and David Mount French Onion Soup, Ipelets for Points and Polygons			15:50-16:50	Satoshi Murai An Introduction into Stanley Reisner Theory
  16:00-16:10	Simon D. Fink and Dominik Peters Incremental and Interactive PQ- and PC-trees
  16:10-16:20	Auguste Gezalyan, Nithin Parepally, Megan Hunleth, Sarah Hwang, Lucy Wang, Olya Golovatskaia, Carmen Day, and Hridhaan Banerjee Software for the Thompson and Funk Polygonal Geometry
  16:20-16:30	Uml Modular Robotics Group, Hugo Akitaya, Andrew Clements, Sam Downey, Jonathan Eisenbies, Saba Molaei, Soham Samanta, Gabriel Shahrouzi, and Frederick Stock Finding Shortest Reconfiguration Sequences for Modular Robots
  16:30-16:40	Matthias Artmann, Tobias Maurer, Andreas Padalkin, Daniel Warner, and Christian Scheideler AmoebotSim 2.0: A Visual Simulation Environment for the Amoebot Model with Reconfigurable Circuits and Joint Movements
  16:40-17:40	CG:SHOP (Room A)			16:50-17:50	Anastasiia Tsvietkova Algorithmic Knot Theory
  	Sándor Fekete: Welcome and Overview Brief contributions: Team Obtuse Terminators (4th overall, 3rd in junior): Andreas Kalavas, Nikolaos Chatzis, Andreas Charalampopoulos, and Marina Kontalexi Team KITriangle (3rd overall, 2nd in junior): Niccolò Rigi-Luperti and Leonie Wahl Presentations: Team Gwamegi (2nd overall, 1st in junior): Taehoon Ahn, Jaegun Lee, Byeonguk Kang, and Hwi Kim: Incremental algorithm and local search for minimum non-obtuse triangulations Team Naughty NOTers (1st overall): Mikkel Abrahamsen, Florestan Brunck, Jacobus Conradi, Benedikt Kolb and André Nusser: Computing non-obtuse triangulations with few Steiner points Questions and Discussion Award Ceremony Outlook: The Challenge Problem 2026
  17:50-19:20	Business Meeting
  19:30-	Dinner

• Thursday, 26 June 2025

  Time
  09:00-10:00	Invited Talk: Tomohiro Tachi (The University of Tokyo) - Computational Origami for Art, Science, and Industry (Room A) Chair: Oswin Aichholzer
  10:00-10:10	Short Break
  10:10–11:10	SoCG Session 7A (Room B) Chair: Sang Won Bae			SoCG Session 7B (Room C) Chair: Maarten Löffler
  10:10-10:30	Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, and Jiaheng Wang Rapid Mixing of the Flip Chain over Non-Crossing Spanning Trees			Yasuaki Kobayashi, Yuto Okada, and Alexander Wolff Recognizing 2-Layer and Outer k-Planar Graphs
  10:30-10:50	Martin Balko and Jineon Baek The Erdős-Szekeres Conjecture Revisited			Thomas Schibler, Subhash Suri, and Jie Xue Embedding Graphs as Euclidean kNN-Graphs
  10:50-11:10	David Eppstein Non-Euclidean Erdős–Anning Theorems			Matthias Bentert, Fedor Fomin, Petr A. Golovach, M. S. Ramanujan, and Saket Saurabh When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
  11:10-11:40	Coffee Break
  11:40–12:40	SoCG Session 8A (Room B) Chair: Takeshi Tokuyama			SoCG Session 8B (Room C) Chair: Tim Ophelders
  11:40-12:00	Tamal K. Dey, Jan Jendrysiak, and Michael Kerber Decomposing Multiparameter Persistence Modules			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 or Scaling in 1D
  12:00-12:20	Donghan Kim, Woojin Kim, and Wonjun Lee Super-Polynomial Growth of the Generalized Persistence Diagram			Sariel Har-Peled, Benjamin Raichel, and Eliot Robson The Fréchet Distance Unleashed: Approximating a Dog with a Frog
  12:20-12:40	Mathieu Carrière, Seunghyun Kim, and Woojin Kim Sparsification of the Generalized Persistence Diagrams for Scalability through Gradient Descent			Siu-Wing Cheng, Haoqiang Huang, and Le Jiang Simplification of Trajectory Streams
  12:40-14:10	Lunch Break
  14:10–15:30	SoCG Session 9A (Room B) Chair: Sujoy Bhore			SoCG Session 9B (Room C) Chair: Francis Lazarus
  14:10-14:30	Jack Stade The Point-Boundary Art Gallery Problem is ∃R-hard			John Hershberger Snap Rounding: A Cautionary Tale
  14:30-14:50	Ahmad Biniaz, Anil Maheshwari, Magnus Christian Ring Merrild, Joseph Mitchell, Saeed Odak, Valentin Polishchuk, Eliot W. Robson, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Tom Shermer, Rolf Svenning, Jack Spalding-Jamieson, and Da Wei Zheng Polynomial-Time Algorithms for Contiguous Art Gallery and Related Problems			Luca Castelli Aleardi, Eric Fusy, Jyh-Chwen KO, and Razvan Stefan Puscasu Computation of Toroidal Schnyder Woods Made Simple and Fast: From Theory to Practice
  14:50-15:10	Benyamin Ghaseminia and Mohammad R. Salavatipour A PTAS for TSP with Neighbourhoods Over Parallel Line Segments			Tim Ophelders, Anna Schenfisch, Willem Sonke, and Bettina Speckmann Computing Geomorphologically Salient Networks via Discrete Morse Theory
  15:10-15:30	Erik Demaine and Stefan Langerman Tiling with Three Polygons is Undecidable			Sándor Fekete, Phillip Keldenich, and Michael Perk Exact Algorithms for Minimum Dilation Triangulation
  15:30-15:50	Coffee Break
  15:50-18:50	Computational Geometry Washa-Washa (Room A)	Geometric and Topological Graph Theory (Room B)			Computational Polyhedral Geometry (Room C)
  15:50-17:20	Connecting Artifacts Talk and Discussions Asao Tokolo Erik Demaine Tomohiro Tachi	15:50-16:05	Atsuyuki Miyashita Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem		15:50-16:35	Skip Jordan Projections, Redundancy and Parallelism in lrslib
  		16:05-16:20	Yuta Inoue Three-edge-coloring cubic graphs on the torus
  		16:20-16:35	Kengo Enami Embeddings of a graph into a surface with different weak chromatic numbers
  		16:40-16:55	Yoshio Okamoto Rerouting curves on the plane and other surfaces		16:35-17:00	Akiyoshi Tsuchiya Codegree of stable set polytopes
  		16:55-17:25	Solomon Lo Minors of non-hamiltonian graphs		17:00-17:25	Germain Poullot The length of coherent monotone paths on polytopes admits a central limit theorem
  17:20-18:50	Networking "Washawasha"	17:30-17:45	Masuda Atsunori Minors and subdivisions in optimal 1-embedded graphs		17:35-18:20	Yue Ren Nonarchimedean optimization
  		17:45-18:00	Kenta Noguchi Face sizes and the connectivity of the dual
  		18:05-18:20	Henry Adams Nonexistence of Borsuk graph homomorphisms
  		18:20-18:50	Sean Dewar Erdős distance theory on graphs		18:20-18:45	Günter Rote Computing optimal lattice polygons

• Friday, 27 June 2025

  Time
  09:00-10:20	SoCG Session 10A (Room B) Chair: Yoshio Okamoto			SoCG Session 10B (Room C) Chair: Patrick Schnider
  09:00-09:20	Marzieh Eidi and Sayan Mukherjee Higher Order Bipartiteness vs Bi-Partitioning in Simplicial Complexes			Michael Hoffmann, Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, and Antonios Symvonis Geometric Realizations of Dichotomous Ordinal Graphs
  09:20-09:40	Sharath Raghvendra, Pouyan Shirzadian, and Rachita Sowle Geometric Bipartite Matching Based Exact Algorithms for Server Problems			Jacob Fox, Janos Pach, and Andrew Suk Immersions and Albertson's Conjecture
  09:40-10:00	Anne Driemel, Morteza Monemizadeh, Eunjin Oh, Frank Staals, and David P. Woodruff Range Counting Oracles for Geometric Problems			Arnold Filtser On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
  10:00-10:20	Pankaj K Agarwal, Boris Aronov, Olivier Devillers, Christian Knauer, and Guillaume Moroz A Subquadratic Algorithm for Computing the L1-Distance between Two Terrains			Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari, Michiel Smid, Shakhar Smorodinsky, and Milos Stojakovic Polychromatic Coloring of Tuples in Hypergraphs
  10:20-10:50	Coffee Break
  10:50-12:10	SoCG Session 11A (Room B) Chair: Birgit Vogtenhuber			SoCG Session 11B (Room C) Chair: Bei Wang
  10:50-11:10	Therese Biedl, Éric Colin de Verdière, Fabrizio Frati, Anna Lubiw, and Günter Rote Finding a Shortest Curve that Separates Few Objects from Many			Corentin Lunel, Arnaud de Mesmay, and Jonathan Spreer Hard Diagrams of Split Links
  11:10-11:30	Shinwoo An, Eunjin Oh, and Jie Xue Single-Source Shortest Path Problem in Weighted Disk Graphs			Alexander He, Eric Sedgwick, and Jonathan Spreer Certifying that a Knot is Composite
  11:30-11:50	Timothy M. Chan and Zhengcheng Huang Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique			Tamal K. Dey, Tao Hou, and Dmitriy Morozov Apex Representatives
  11:50-12:10	Édouard Bonnet and Paweł Rzążewski An 11/6-Approximation Algorithm for Vertex Cover on String Graphs			Lara Ost, Sebastiano Cultrera di Montesano, and Herbert Edelsbrunner Banana Trees for the Persistence in Time Series Experimentally
  12:10–12:15	Short Break
  12:15-13:10	Awards Ceremony and Closing (Room A)
  12:15-12:25	???: Test of Time Award Announcement
  12:25-12:35	???: Test of Time Award Winner Comments
  12:35-12:40	???: Best Student Presentation Award Announcement
  12:40-12:50	???: Closing Words
  12:50–14:10	Lunch Break
  14:10-17:10	Combinatorial Structures in Geometric Topology (Room B)		Uncertainty in Computational Geometry (Room C)
  14:10-15:00	Hidetoshi Masai Renormalized Volume of Hyperbolic 3-manifolds		14:10-??:00	??? ???
  15:00-15:50	Stephan Tillmann Shortest Loops on Convex Projective Surfaces		??:??-??:00	??? ???
  15:50-16:20	Eric Samperton TQFT Invariants of 3-manifolds		??:??-??:00	??? ???
  16:20-16:50	Clément Maria Computational Hardness of Quantum 3-manifold Invariants		??:??-??:00	??? ???
  16:50-17:10	Manuel Radons The Topology of Poetry		??:??-??:00	??? ???
  ??:??–??:??	Closing