| 2018 | A New and Improved Algorithm for Online Bin Packing. | Jnos Balogh, Jzsef Bksi, Gyrgy Dsa, Leah Epstein, Asaf Levin |
| 2018 | On the Worst-Case Complexity of TimSort. | Nicolas Auger, Vincent Jug, Cyril Nicaud, Carine Pivoteau |
| 2018 | Approximate Convex Intersection Detection with Applications to Width and Minkowski Sums. | Sunil Arya, Guilherme Dias da Fonseca, David M. Mount |
| 2018 | Two-Dimensional Maximal Repetitions. | Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol |
| 2018 | Algorithms for Inverse Optimization Problems. | Sara Ahmadian, Umang Bhaskar, Laura Sanit, Chaitanya Swamy |
| 2018 | Algorithmic Building Blocks for Asymmetric Memories. | Yan Gu, Yihan Sun, Guy E. Blelloch |
| 2018 | A Polynomial Kernel for Diamond-Free Editing. | Yixin Cao, Ashutosh Rai, R. B. Sandeep, Junjie Ye |
| 2017 | Front Matter, Table of Contents, Preface, Programm Commitees, External Reviewers. | |
| 2017 | Sketching for Geometric Problems (Invited Talk). | David P. Woodruff |
| 2017 | Maxent-Stress Optimization of 3D Biomolecular Models. | Michael Wegner, Oskar Taubert, Alexander Schug, Henning Meyerhenke |
| 2017 | Exponential Lower Bounds for History-Based Simplex Pivot Rules on Abstract Cubes. | Antonis Thomas |
| 2017 | Positive-Instance Driven Dynamic Programming for Treewidth. | Hisao Tamaki |
| 2017 | A Space-Optimal Grammar Compression. | Yoshimasa Takabatake, Tomohiro I, Hiroshi Sakamoto |
| 2017 | New Abilities and Limitations of Spectral Graph Bisection. | Martin R. Schuster, Maciej Liskiewicz |
| 2017 | K-Dominance in Multidimensional Data: Theory and Applications. | Thomas Schibler, Subhash Suri |
| 2017 | Clustering in Hypergraphs to Minimize Average Edge Service Time. | Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim |
| 2017 | Counting Restricted Homomorphisms via Mbius Inversion over Matroid Lattices. | Marc Roth |
| 2017 | Prize-Collecting TSP with a Budget Constraint. | Alice Paul, Daniel Freund, Aaron M. Ferber, David B. Shmoys, David P. Williamson |
| 2017 | On the Tree Augmentation Problem. | Zeev Nutov |
| 2017 | Benchmark Graphs for Practical Graph Isomorphism. | Daniel Neuen, Pascal Schweitzer |
| 2017 | Subexponential Parameterized Algorithms for Graphs of Polynomial Growth. | Dniel Marx, Marcin Pilipczuk |
| 2017 | Dynamic Space Efficient Hashing. | Tobias Maier, Peter Sanders |
| 2017 | A Linear-Time Parameterized Algorithm for Node Unique Label Cover. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh |
| 2017 | Computing Maximum Agreement Forests without Cluster Partitioning is Folly. | Zhijiang Li, Norbert Zeh |
| 2017 | Local Search Algorithms for Maximum Carpool Matching. | Gilad Kutiel, Dror Rawitz |