| 2017 | Improved Approximate Rips Filtrations with Shifted Integer Lattices. | Aruni Choudhary, Michael Kerber, Sharath Raghvendra |
| 2017 | On the Complexity of Bounded Context Switching. | Peter Chini, Jonathan Kolberg, Andreas Krebs, Roland Meyer, Prakash Saivasan |
| 2017 | Stability and Recovery for Independence Systems. | Vaggos Chatziafratis, Tim Roughgarden, Jan Vondrk |
| 2017 | Faster Approximate Diameter and Distance Oracles in Planar Graphs. | Timothy M. Chan, Dimitrios Skrepetos |
| 2017 | Online Submodular Maximization Problem with Vector Packing Constraint. | T.-H. Hubert Chan, Shaofeng H.-C. Jiang, Zhihao Gavin Tang, Xiaowei Wu |
| 2017 | Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary. | Benjamin A. Burton, Erin W. Chambers, Marc J. van Kreveld, Wouter Meulemans, Tim Ophelders, Bettina Speckmann |
| 2017 | Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. | Niv Buchbinder, Danny Segev, Yevgeny Tkach |
| 2017 | Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees. | Gerth Stlting Brodal, Konstantinos Mampentzidis |
| 2017 | Sampling Geometric Inhomogeneous Random Graphs in Linear Time. | Karl Bringmann, Ralph Keusch, Johannes Lengler |
| 2017 | Exploring the Tractability of the Capped Hose Model. | Thomas Bosman, Neil Olver |
| 2017 | Tight Lower Bounds for the Complexity of Multicoloring. | Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
| 2017 | On the Impact of Singleton Strategies in Congestion Games. | Vittorio Bil, Cosimo Vinci |
| 2017 | Fast Dynamic Arrays. | Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Grtz |
| 2017 | Improved Algorithm for Dynamic b-Matching. | Sayan Bhattacharya, Manoj Gupta, Divyarthi Mohan |
| 2017 | Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. | Stphane Bessy, Marin Bougeret, Jocelyn Thiebaut |
| 2017 | The Directed Disjoint Shortest Paths Problem. | Kristf Brczi, Yusuke Kobayashi |
| 2017 | A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs. | Amariah Becker, Philip N. Klein, David Saulpic |
| 2017 | Modeling and Engineering Constrained Shortest Path Algorithms for Battery Electric Vehicles. | Moritz Baum, Julian Dibbelt, Dorothea Wagner, Tobias Zndorf |
| 2017 | Online Bin Packing with Cardinality Constraints Resolved. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin |
| 2017 | In-Place Parallel Super Scalar Samplesort (IPSSSSo). | Michael Axtmann, Sascha Witt, Daniel Ferizovic, Peter Sanders |
| 2017 | Combinatorics of Local Search: An Optimal 4-Local Hall's Theorem for Planar Graphs. | Daniel Antunes, Claire Mathieu, Nabil H. Mustafa |
| 2017 | Tight Bounds for Online Coloring of Basic Graph Classes. | Susanne Albers, Sebastian Schraink |
| 2017 | Randomized Contractions for Multiobjective Minimum Cuts. | Hassene Aissi, Ali Ridha Mahjoub, R. Ravi |
| 2017 | Output Sensitive Algorithms for Approximate Incidences and Their Applications. | Dror Aiger, Haim Kaplan, Micha Sharir |
| 2017 | Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. | Pankaj K. Agarwal, Natan Rubin, Micha Sharir |