| 2018 | Deterministic Treasure Hunt in the Plane with Angular Hints. | Sbastien Bouchard, Yoann Dieudonn, Andrzej Pelc, Franck Petit |
| 2018 | Coresets for Fuzzy K-Means with Applications. | Johannes Blmer, Sascha Brauer, Kathrin Bujna |
| 2018 | Counting Connected Subgraphs with Maximum-Degree-Aware Sieving. | Andreas Bjrklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto |
| 2018 | Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm. | Andreas Bjrklund, Thore Husfeldt |
| 2018 | Exploiting Sparsity for Bipartite Hamiltonicity. | Andreas Bjrklund |
| 2018 | Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. | Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, Saket Saurabh |
| 2018 | A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners. | Davide Bil, Kleitos Papadopoulos |
| 2018 | Almost Optimal Algorithms for Diameter-Optimally Augmenting Trees. | Davide Bil |
| 2018 | An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. | Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2018 | On Counting Oracles for Path Problems. | Ivona Bezkov, Andrew Searns |
| 2018 | An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. | Matthias Bentert, Alexander Dittmann, Leon Kellerhals, Andr Nichterlein, Rolf Niedermeier |
| 2018 | Approximate Query Processing over Static Sets and Sliding Windows. | Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare |
| 2018 | Algorithmic Channel Design. | Georgia Avarikioti, Yuyi Wang, Roger Wattenhofer |
| 2018 | Partially Walking a Polygon. | Franz Aurenhammer, Michael Steinkogler, Rolf Klein |
| 2018 | Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain. | Elena Arseneva, Man-Kwun Chiu, Matias Korman, Aleksandar Markovic, Yoshio Okamoto, Aurlien Ooms, Andr van Renssen, Marcel Roeloffzen |
| 2018 | Beyond-Planarity: Turn-Type Results for Non-Planar Bipartite Graphs. | Patrizio Angelini, Michael A. Bekos, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt |
| 2018 | New and Improved Algorithms for Unordered Tree Inclusion. | Tatsuya Akutsu, Jesper Jansson, Ruiming Li, Atsuhiro Takasu, Takeyuki Tamura |
| 2018 | Improved Algorithms for the Shortest Vector Problem and the Closest Vector Problem in the Infinity Norm. | Divesh Aggarwal, Priyanka Mukhopadhyay |
| 2018 | Approximate Minimum-Weight Matching with Outliers Under Translation. | Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Gnter Rote, Micha Sharir, Allen Xiao |
| 2018 | Data-Compression for Parametrized Counting Problems on Sparse Graphs. | Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos |
| 2018 | Reconstructing Phylogenetic Tree From Multipartite Quartet System. | Hiroshi Hirai, Yuni Iwamasa |
| 2017 | Envy-free Matchings with Lower Quotas. | Yu Yokoi |
| 2017 | A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. | Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang |
| 2017 | Front Matter, Table of Contents, Preface, External Reviewers. | |
| 2017 | Computational Philosophy: On Fairness in Automated Decision Making. | Suresh Venkatasubramanian |