| 2017 | Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. | Suman K. Bera, Amit Chakrabarti |
| 2017 | Energy-Efficient Delivery by Heterogeneous Mobile Agents. | Andreas Brtschi, Jrmie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna |
| 2017 | Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. | Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, Andr van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein |
| 2017 | What Can Be Verified Locally?. | Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti |
| 2017 | Parameterized Complexity of Small Weight Automorphisms. | Vikraman Arvind, Johannes Kbler, Sebastian Kuhnert, Jacobo Torn |
| 2017 | The Operator Approach to Entropy Games. | Marianne Akian, Stphane Gaubert, Julien Grand-Clment, Jrmie Guillaud |
| 2017 | Split Contraction: The Untold Story. | Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi |
| 2017 | Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. | Lin Chen, Dniel Marx, Deshi Ye, Guochuan Zhang |
| 2017 | Set Membership with Non-Adaptive Bit Probes. | Mohit Garg, Jaikumar Radhakrishnan |
| 2017 | Minkowski Games. | Stphane Le Roux, Arno Pauly, Jean-Franois Raskin |
| 2016 | Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents. | |
| 2016 | Fine-Grained Algorithms and Complexity (Invited Talk). | Virginia Vassilevska Williams |
| 2016 | Improved Approximation Algorithms for Balanced Partitioning Problems. | Harald Rcke, Richard Stotz |
| 2016 | On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. | Michal Pilipczuk, Marcin Wrochna |
| 2016 | Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. | Mateus de Oliveira Oliveira |
| 2016 | Polynomial Kernels for Deletion to Classes of Acyclic Digraphs. | Matthias Mnich, Erik Jan van Leeuwen |
| 2016 | Algorithmic Statistics, Prediction and Machine Learning. | Alexey Milovanov |
| 2016 | Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties. | Filip Mazowiecki, Cristian Riveros |
| 2016 | Efficient Enumeration of Solutions Produced by Closure Operations. | Arnaud Mary, Yann Strozecki |
| 2016 | FPTAS for Hardcore and Ising Models on Hypergraphs. | Pinyan Lu, Kuan Yang, Chihao Zhang |
| 2016 | Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk). | Carsten Lutz |
| 2016 | Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. | Markus Lohrey, Georg Zetzsche |
| 2016 | Ideal Decompositions for Vector Addition Systems (Invited Talk). | Jrme Leroux, Sylvain Schmitz |
| 2016 | Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments. | Mithilesh Kumar, Daniel Lokshtanov |
| 2016 | Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. | Raghav Kulkarni, Supartha Podder |