| 2017 | Optimal Query Time for Encoding Range Majority. | Pawel Gawrychowski, Patrick K. Nicholson |
| 2017 | When Can Graph Hyperbolicity Be Computed in Linear Time? | Till Fluschnik, Christian Komusiewicz, George B. Mertzios, Andr Nichterlein, Rolf Niedermeier, Nimrod Talmon |
| 2017 | Fast and Compact Planar Embeddings. | Leo Ferres, Jos Fuentes-Seplveda, Travis Gagie, Meng He, Gonzalo Navarro |
| 2017 | Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density. | Sndor P. Fekete, Sebastian Morr, Christian Scheffer |
| 2017 | Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space. | Marcel Ehrhardt, Wolfgang Mulzer |
| 2017 | Improved Distance Sensitivity Oracles via Tree Partitioning. | Ran Duan, Tianyi Zhang |
| 2017 | Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity. | Ran Duan, Le Zhang |
| 2017 | Capacitated Center Problems with Two-Sided Bounds and Outliers. | Hu Ding, Lunjia Hu, Lingxiao Huang, Jian Li |
| 2017 | Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. | Erik D. Demaine, Quanquan C. Liu |
| 2017 | Modular Circulation and Applications to Traffic Management. | Philip Dasler, David M. Mount |
| 2017 | The Complexity of Drawing Graphs on Few Lines and Few Planes. | Steven Chaplick, Krzysztof Fleszar, Fabian Lipp, Alexander Ravsky, Oleg Verbitsky, Alexander Wolff |
| 2017 | All-Pairs Shortest Paths in Geometric Intersection Graphs. | Timothy M. Chan, Dimitrios Skrepetos |
| 2017 | Minimizing the Continuous Diameter When Augmenting a Tree with a Shortcut. | Jean-Lou De Carufel, Carsten Grimm, Stefan Schirra, Michiel H. M. Smid |
| 2017 | Balanced Line Separators of Unit Disk Graphs. | Paz Carmi, Man-Kwun Chiu, Matthew J. Katz, Matias Korman, Yoshio Okamoto, Andr van Renssen, Marcel Roeloffzen, Taichi Shiitada, Shakhar Smorodinsky |
| 2017 | Approximating Small Balanced Vertex Separators in Almost Linear Time. | Sebastian Brandt, Roger Wattenhofer |
| 2017 | Relaxing the Irrevocability Requirement for Online Graph Algorithms. | Joan Boyar, Lene M. Favrholdt, Michal Kotrbck, Kim S. Larsen |
| 2017 | Local Routing in Spanners Based on WSPDs. | Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmovic, Frdrik Paradis |
| 2017 | Maximum Plane Trees in Multipartite Geometric Graphs. | Ahmad Biniaz, Prosenjit Bose, Kimberly Crosbie, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Michiel H. M. Smid |
| 2017 | The I/O Complexity of Strassen's Matrix Multiplication with Recomputation. | Gianfranco Bilardi, Lorenzo De Stefani |
| 2017 | A Deterministic Algorithm for Online Steiner Tree Leasing. | Marcin Bienkowski, Artur Kraska, Pawel Schmidt |
| 2017 | Splitting B_2 -VPG Graphs into Outer-String and Co-Comparability Graphs. | Therese Biedl, Martin Derka |
| 2017 | A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. | Therese Biedl, Philippe Demontigny |
| 2017 | Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. | Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2017 | An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. | Benjamin Bergougnoux, Mamadou Moustapha Kant, O-joung Kwon |
| 2017 | The Homogeneous Broadcast Problem in Narrow and Wide Strips. | Mark de Berg, Hans L. Bodlaender, Sndor Kisfaludi-Bak |