| 2023 | Improved Approximation for Two-Dimensional Vector Multiple Knapsack. | Tomer Cohen, Ariel Kulik, Hadas Shachnai |
| 2023 | FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set. | Huairui Chu, Bingkai Lin |
| 2023 | Distance Queries over Dynamic Interval Graphs. | Jingbang Chen, Meng He, J. Ian Munro, Richard Peng, Kaiyu Wu, Daniel J. Zhang |
| 2023 | Matrix Completion: Approximating the Minimum Diameter. | Diptarka Chakraborty, Sanjana Dey |
| 2023 | Fast Convolutions for Near-Convex Sequences. | Cornelius Brand, Alexandra Lassota |
| 2023 | An FPT Algorithm for Splitting a Necklace Among Two Thieves. | Michaela Borzechowski, Patrick Schnider, Simon Weber |
| 2023 | Improved Guarantees for the a Priori TSP. | Jannis Blauth, Meike Neuwohner, Luise Puhlmann, Jens Vygen |
| 2023 | Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. | Benjamin Bergougnoux, Jakub Gajarsk, Grzegorz Guspiel, Petr Hlinen, Filip Pokrvka, Marek Sokolowski |
| 2023 | Finding Diverse Minimum s-t Cuts. | Mark de Berg, Andrs Lpez Martnez, Frits C. R. Spieksma |
| 2023 | Clustering in Polygonal Domains. | Mark de Berg, Leyla Biabani, Morteza Monemizadeh, Leonidas Theocharous |
| 2023 | Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares. | Gabriel Bathie, Tomasz Kociumaka, Tatiana Starikovskaya |
| 2023 | Non-Clairvoyant Makespan Minimization Scheduling with Predictions. | Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual |
| 2023 | Depth-Three Circuits for Inner Product and Majority Functions. | Kazuyuki Amano |
| 2023 | Geometric TSP on Sets. | Henk Alkema, Mark de Berg |
| 2023 | Realizability of Free Spaces of Curves. | Hugo A. Akitaya, Maike Buchin, Majid Mirzanezhad, Leonie Ryvkin, Carola Wenk |
| 2023 | Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. | Jungho Ahn, Jinha Kim, O-joung Kwon |
| 2023 | k-Universality of Regular Languages. | Duncan Adamson, Pamela Fleischmann, Annika Huch, Tore Ko, Florin Manea, Dirk Nowotka |
| 2023 | A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees. | Shuai Shao, Stanislav Zivn |
| 2023 | An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-Free Two-Edge-Cover. | Yusuke Kobayashi, Takashi Noguchi |
| 2023 | Reconfiguration of the Union of Arborescences. | Yusuke Kobayashi, Ryoga Mahara, Tams Schwarcz |
| 2023 | Substring Complexity in Sublinear Space. | Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis |
| 2023 | New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. | Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm |
| 2023 | Faithful Graph Drawing (Invited Talk). | Seok-Hee Hong |
| 2022 | Parameterized Approximation Algorithms for TSP. | Jianqi Zhou, Peihua Li, Jiong Guo |
| 2022 | Front Matter, Table of Contents, Preface, Conference Organization. | |