| 0 | -- | 0 | Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit. Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds |
| 0 | -- | 0 | Shay Solomon, Nicole Wein. Improved Dynamic Graph Coloring |
| 0 | -- | 0 | Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda. Structure Learning of H-Colorings |
| 0 | -- | 0 | Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim. Clustering in Hypergraphs to Minimize Average Edge Service Time |
| 0 | -- | 0 | André Berger, László Kozma 0002, Matthias Mnich, Roland Vincze. Time- and Space-optimal Algorithm for the Many-visits TSP |
| 0 | -- | 0 | Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking. An Improved Isomorphism Test for Bounded-tree-width Graphs |
| 0 | -- | 0 | Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir. Tight Bounds on Online Checkpointing Algorithms |
| 0 | -- | 0 | Rodrigo S. V. Martins, Daniel Panario, Claudio M. Qureshi, Eric Schmutz. Periods of Iterations of Functions with Restricted Preimage Sizes |
| 0 | -- | 0 | Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda. Random Walks on Small World Networks |
| 0 | -- | 0 | Ágnes Cseh, Tamás Fleiner. The Complexity of Cake Cutting with Unequal Shares |
| 0 | -- | 0 | Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond. Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants |
| 0 | -- | 0 | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms |
| 0 | -- | 0 | Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen. Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces |
| 0 | -- | 0 | Antonios Antoniadis, Krzysztof Fleszar 0001, Ruben Hoeksma, Kevin Schewior. A PTAS for Euclidean TSP with Hyperplane Neighborhoods |