| 2017 | Hybrid VCSPs with Crisp and Valued Conservative Templates. | Rustem Takhanov |
| 2017 | Tight Approximation for Partial Vertex Cover with Hard Capacities. | Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, D. T. Lee |
| 2017 | Approximate Nearest Neighbors Search Without False Negatives For l_2 For c>sqrt{loglog{n}}. | Piotr Sankowski, Piotr Wygocki |
| 2017 | Complexity of Coloring Reconfiguration under Recolorability Constraints. | Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2017 | Fully Dynamic Connectivity Oracles under General Vertex Updates. | Kengo Nakamura |
| 2017 | Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. | Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama |
| 2017 | Fast Compressed Self-Indexes with Deterministic Linear-Time Construction. | J. Ian Munro, Gonzalo Navarro, Yakov Nekrich |
| 2017 | Jointly Stable Matchings. | Shuichi Miyazaki, Kazuya Okamoto |
| 2017 | Precedence-Constrained Min Sum Set Cover. | Jessica McClintock, Julin Mestre, Anthony Wirth |
| 2017 | Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs. | Giordano Da Lozzo, William E. Devanny, David Eppstein, Timothy Johnson |
| 2017 | Non-Crossing Geometric Steiner Arborescences. | Irina Kostitsyna, Bettina Speckmann, Kevin Verbeek |
| 2017 | Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. | Athanasios L. Konstantinidis, Charis Papadopoulos |
| 2017 | Improved Bounds for Online Dominating Sets of Trees. | Koji M. Kobayashi |
| 2017 | Optimal Matroid Partitioning Problems. | Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita |
| 2017 | Structural Parameters, Tight Bounds, and Approximation for (k, r)-Center. | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
| 2017 | Improved Algorithms for Scheduling Unsplittable Flows on Paths. | Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman |
| 2017 | Weighted Linear Matroid Parity. | Satoru Iwata |
| 2017 | Complexity of the Multi-Service Center Problem. | Takehiro Ito, Naonori Kakimura, Yusuke Kobayashi |
| 2017 | An Efficient Sum Query Algorithm for Distance-based Locally Dominating Functions. | Ziyun Huang, Jinhui Xu |
| 2017 | Settlement Fund Circulation Problem. | Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno |
| 2017 | On Directed Covering and Domination Problems. | Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono |
| 2017 | On-the-Fly Array Initialization in Less Space. | Torben Hagerup, Frank Kammer |
| 2017 | Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. | Michel Habib, Lalla Mouatadid |
| 2017 | Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons. | Joachim Gudmundsson, Rasmus Pagh |
| 2017 | Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. | Mordecai J. Golin, Hadi Khodabande, Bo Qin |