| 2017 | Orthogonal Vectors Indexing. | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2017 | Dominance Product and High-Dimensional Closest Pair under L_infty. | Omer Gold, Micha Sharir |
| 2017 | Sorting with Recurrent Comparison Errors. | Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna |
| 2017 | Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. | Serge Gaspers, Joachim Gudmundsson, Julin Mestre, Stefan Rmmele |
| 2017 | On Structural Parameterizations of the Edge Disjoint Paths Problem. | Robert Ganian, Sebastian Ordyniak, Ramanujan Sridharan |
| 2017 | Embedding Graphs into Embedded Graphs. | Radoslav Fulek |
| 2017 | Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms. | Casper Benjamin Freksen, Kasper Green Larsen |
| 2017 | Conflict-Free Coloring of Intersection Graphs. | Sndor P. Fekete, Phillip Keldenich |
| 2017 | Succinct Color Searching in One Dimension. | Hicham El-Zein, J. Ian Munro, Yakov Nekrich |
| 2017 | Agnostically Learning Boolean Functions with Finite Polynomial Representation. | Ning Ding |
| 2017 | Temporal Hierarchical Clustering. | Tamal K. Dey, Alfred Rossi, Anastasios Sidiropoulos |
| 2017 | On Maximal Cliques with Connectivity Constraints in Directed Graphs. | Alessio Conte, Mamadou Moustapha Kant, Takeaki Uno, Kunihiro Wasa |
| 2017 | Study of a Combinatorial Game in Graphs Through Linear Programming. | Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stphane Prennes |
| 2017 | An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith |
| 2017 | Smart Contract Execution - the (+-)-Biased Ballot Problem. | Lin Chen, Lei Xu, Zhimin Gao, Nolan Shah, Yang Lu, Weidong Shi |
| 2017 | An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint. | Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang |
| 2017 | Routing on the Visibility Graph. | Prosenjit Bose, Matias Korman, Andr van Renssen, Sander Verdonschot |
| 2017 | On the Convergence Time of a Natural Dynamics for Linear Programming. | Vincenzo Bonifaci |
| 2017 | Independent Feedback Vertex Set for P_5-free Graphs. | Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Danil Paulusma |
| 2017 | Decomposing a Graph into Shortest Paths with Bounded Eccentricity. | Etienne Birmel, Fabien de Montgolfier, Lo Planche, Laurent Viennot |
| 2017 | An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. | Davide Bil, Feliciano Colella, Luciano Gual, Stefano Leucci, Guido Proietti |
| 2017 | Crossing Number for Graphs with Bounded~Pathwidth. | Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel |
| 2017 | A Simple Greedy Algorithm for Dynamic Graph Orientation. | Edvin Berglin, Gerth Stlting Brodal |
| 2017 | Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. | Mark de Berg, Tim Leijsen, Aleksandar Markovic, Andr van Renssen, Marcel Roeloffzen, Gerhard J. Woeginger |