| 2023 | General Space-Time Tradeoffs via Relational Queries. | Shaleen Deep, Xiao Hu, Paraschos Koutris |
| 2023 | Classification via Two-Way Comparisons (Extended Abstract). | Marek Chrobak, Neal E. Young |
| 2023 | Efficient k-Center Algorithms for Planar Points in Convex Position. | Jongmin Choi, Jaegun Lee, Hee-Kap Ahn |
| 2023 | Hardness of Graph-Structured Algebraic and Symbolic Problems. | Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang |
| 2023 | Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. | Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth |
| 2023 | From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. | Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk |
| 2023 | On Length-Sensitive Frchet Similarity. | Kevin Buchin, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Carola Wenk |
| 2023 | Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. | Gerth Stlting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning |
| 2023 | Online Interval Scheduling with Predictions. | Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen |
| 2023 | Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. | Prosenjit Bose, Anthony D'Angelo, Stephane Durocher |
| 2023 | Finding Diameter-Reducing Shortcuts in Trees. | Davide Bil, Luciano Gual, Stefano Leucci, Luca Pep Sciarria |
| 2023 | Compact Distance Oracles with Large Sensitivity and Low Stretch. | Davide Bil, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | Improved Bounds for Discrete Voronoi Games. | Mark de Berg, Geert van Wordragen |
| 2023 | Online Minimum Spanning Trees with Weight Predictions. | Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen |
| 2023 | Tight Approximation Algorithms for Ordered Covering. | Jatin Batra, Syamantak Das, Agastya Vibhuti Jha |
| 2023 | Dominator Coloring and CD Coloring in Almost Cluster Graphs. | Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman |
| 2023 | A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. | Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi |
| 2023 | Socially Fair Matching: Exact and Approximation Algorithms. | Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov |
| 2023 | Online TSP with Known Locations. | Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris |
| 2023 | Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. | Jlia Baligcs, Yann Disser, Farehe Soheil, David Weckbecker |
| 2023 | Faster Algorithms for Cycle Hitting Problems on Disk Graphs. | Shinwoo An, Kyungjin Cho, Eunjin Oh |
| 2023 | The Mutual Visibility Problem for Fat Robots. | Rusul J. Alsaedi, Joachim Gudmundsson, Andr van Renssen |
| 2023 | Geometric Spanning Trees Minimizing the Wiener Index. | A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell |
| 2021 | Reverse Shortest Path Problem for Unit-Disk Graphs. | Haitao Wang, Yiming Zhao |
| 2021 | A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). | Joe Sawada, Aaron Williams |