HALT

Helsinki Algorithms & Theory

3 papers at SoCG 2024

SoCG is the leading conference in computational geometry. We have got 3 papers with coauthors from Helsinki in SoCG 2024, and all papers are already freely available on arXiv:

A Quadtree, a Steiner Spanner, and Approximate Nearest Neighbours in Hyperbolic Space · S. Kisfaludi-Bak (Aalto) and G. van Wordragen (Aalto)

We solve dynamic approximate nearest neighbors in hyperbolic space with guarantees similar to Euclidean solutions. The solution is built upon our dynamic Steiner spanners.

Separator Theorem and Algorithms for Planar Hyperbolic Graphs · S. Kisfaludi-Bak (Aalto), J. Masaříková (Warsaw), E. J. van Leeuwen (Utrecht), B. Walczak (Jagiellonian), K. Węgrzycki (Saarland)

We prove that planar Gromov-hyperbolic graphs (where all metric triangles are thin) have a separator that is either a single geodesic path or cycle. This yields near-linear FPTASes for Independent Set and TSP.

Fine-Grained Complexity of Earth Mover's Distance under Translation · K. Bringmann (Saarland), F. Staals (Utrecht), K. Węgrzycki (Saarland), G. van Wordragen (Aalto)

Earth Mover's Distance under Translation is the minimum length of a perfect matching between a point set and a translation of another point set. We give algorithms with (nearly) matching fine-grained lower bounds in every dimension.