| 2017 | Timed Network Games. | Guy Avni, Shibashis Guha, Orna Kupferman |
| 2017 | On the Upward/Downward Closures of Petri Nets. | Mohamed Faouzi Atig, Roland Meyer, Sebastian Muskalla, Prakash Saivasan |
| 2017 | Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. | Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja |
| 2017 | Better Complexity Bounds for Cost Register Automata. | Eric Allender, Andreas Krebs, Pierre McKenzie |
| 2017 | New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. | Eric Allender, Shuichi Hirahara |
| 2017 | Complexity of Restricted Variants of Skolem and Related Problems. | S. Akshay, Nikhil Balaji, Nikhil Vyas |
| 2017 | Fine-Grained Complexity of Rainbow Coloring and its Variants. | Akanksha Agrawal |
| 2017 | The Quantum Monad on Relational Structures. | Samson Abramsky, Rui Soares Barbosa, Nadish de Silva, Octavio Zapata |
| 2017 | A Formal Semantics of Influence in Bayesian Reasoning. | Bart Jacobs, Fabio Zanasi |
| 2017 | Two-Planar Graphs Are Quasiplanar. | Michael Hoffmann, Csaba D. Tth |
| 2016 | An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. | Mingyu Xiao, Shaowei Kou |
| 2016 | Front Matter, Foreword, Conference Organization, External Reviewers, Table of Contents. | |
| 2016 | RNA-Folding - From Hardness to Algorithms. | Virginia Vassilevska Williams |
| 2016 | Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs. | Kenjiro Takazawa |
| 2016 | The Ground-Set-Cost Budgeted Maximum Coverage Problem. | Irving van Heuven van Staereling, Bart de Keijzer, Guido Schfer |
| 2016 | Transducer-Based Rewriting Games for Active XML. | Martin Schuster |
| 2016 | Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. | Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama |
| 2016 | Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable. | Matthieu Rosenfeld |
| 2016 | Structural Control in Weighted Voting Games. | Anja Rey, Jrg Rothe |
| 2016 | Symbolic Lookaheads for Bottom-up Parsing. | Paola Quaglia |
| 2016 | On the Complexity of Branching Games with Regular Conditions. | Marcin Przybylko, Michal Skrzypczak |
| 2016 | Vector Reachability Problem in SL(2, Z). | Igor Potapov, Pavel Semukhin |
| 2016 | The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics. | Thomas Place, Marc Zeitoun |
| 2016 | Supplementarity is Necessary for Quantum Diagram Reasoning. | Simon Perdrix, Quanlong Wang |
| 2016 | Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. | Anurag Pandey, Nitin Saxena, Amit Sinhababu |