| 2016 | Algorithmic Statistics: Normal Objects and Universal Models. | Alexey Milovanov |
| 2016 | Sums of Read-Once Formulas: How Many Summands Suffice? | Meena Mahajan, Anuj Tawari |
| 2016 | Some Complete and Intermediate Polynomials in Algebraic Complexity Theory. | Meena Mahajan, Nitin Saurabh |
| 2016 | On High-Quality Synthesis. | Orna Kupferman |
| 2016 | The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy - (Extended Abstract). | Manfred Kufleitner, Jan Philipp Wchter |
| 2016 | Level Two of the Quantifier Alternation Hierarchy over Infinite Words. | Manfred Kufleitner, Tobias Walter |
| 2016 | On Slepian-Wolf Theorem with Interaction. | Alexander Kozachinskiy |
| 2016 | Graph Editing to a Given Degree Sequence. | Petr A. Golovach, George B. Mertzios |
| 2016 | On Approximating (Connected) 2-Edge Dominating Set by a Tree. | Toshihiro Fujito, Tomoaki Shimoda |
| 2016 | Affine Computation and Affine Automaton. | Alejandro Daz-Caro, Abuzer Yakaryilmaz |
| 2016 | Online Bounded Analysis. | Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin |
| 2016 | Compositional Design of Stochastic Timed Automata. | Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet |
| 2016 | Computing and Listing st-Paths in Public Transportation Networks. | Katerina Bhmov, Mats Mihalk, Tobias Prger, Gustavo Sacomoto, Marie-France Sagot |
| 2016 | Max-Closed Semilinear Constraint Satisfaction. | Manuel Bodirsky, Marcello Mamino |
| 2016 | Completing Partial Schedules for Open Shop with Unit Processing Times and Routing. | Ren van Bevern, Artem V. Pyatkin |
| 2016 | Parameterizing Edge Modification Problems Above Lower Bounds. | Ren van Bevern, Vincent Froese, Christian Komusiewicz |
| 2016 | The Next Whisky Bar. | Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer |
| 2016 | Algorithmic Decidability of Engel's Property for Automaton Groups. | Laurent Bartholdi |
| 2016 | Subclasses of Baxter Permutations Based on Pattern Avoidance. | Shankar Balachandran, Sajin Koroth |
| 2016 | Sensitivity Versus Certificate Complexity of Boolean Functions. | Andris Ambainis, Krisjanis Prusis, Jevgenijs Vihrovs |
| 2015 | Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems. | Florian Zuleger |
| 2015 | Delay Games with WMSO+U Winning Conditions. | Martin Zimmermann |
| 2015 | Circuit Complexity Meets Ontology-Based Data Access. | Vladimir V. Podolskii |
| 2015 | Rewriting Higher-Order Stack Trees. | Vincent Penelle |
| 2015 | On the Satisfiability of Quantum Circuits of Small Treewidth. | Mateus de Oliveira Oliveira |