🏆 2024(1)
Best Paper Award
An O(n log n)-Time Approximation Scheme for Geometric Many-to-Many MatchingSayan BandyapadhyayJie Xue
Logging
🏆 2023(1)
Best Paper Award
Geometric Embeddability of Complexes Is ∃ℝ-CompleteMikkel AbrahamsenLinda KleistTillmann Miltzow
🏆 2022(1)
Best Paper Award
Chains, Koch Chains, and Point Sets with Many TriangulationsDaniel RutschmannManuel Wettstein
🏆 2021(1)
Best Paper Award
Lower Bounds for Semialgebraic Range Searching and Stabbing ProblemsPeyman AfshaniPingan Cheng
Search Algorithms