| 2015 | On the Complexity of Speed Scaling. | Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato |
| 2015 | On the Complexity of Hub Labeling (Extended Abstract). | Maxim A. Babenko, Andrew V. Goldberg, Haim Kaplan, Ruslan Savchenko, Mathias Weller |
| 2015 | An Algebraic Proof of the Real Number PCP Theorem. | Martijn Baartse, Klaus Meer |
| 2015 | Stochastization of Weighted Automata. | Guy Avni, Orna Kupferman |
| 2015 | On the Complexity of Noncommutative Polynomial Factorization. | Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar |
| 2015 | On Tinhofer's Linear Programming Approach to Isomorphism Testing. | Vikraman Arvind, Johannes Kbler, Gaurav Rattan, Oleg Verbitsky |
| 2015 | Dual VP Classes. | Eric Allender, Anna Gl, Ian Mertz |
| 2015 | When Are Prime Formulae Characteristic? | Luca Aceto, Dario Della Monica, Ignacio Fbregas, Anna Inglfsdttir |
| 2015 | Near-Optimal Asymmetric Binary Matrix Partitions. | Fidaa Abed, Ioannis Caragiannis, Alexandros A. Voudouris |
| 2015 | Uniform Generation in Trace Monoids. | Samy Abbes, Jean Mairesse |
| 2014 | The Dynamic Descriptive Complexity of k-Clique. | Thomas Zeume |
| 2014 | Choiceless Polynomial Time on Structures with Small Abelian Colour Classes. | Faried Abu Zaid, Erich Grdel, Martin Grohe, Wied Pakusa |
| 2014 | Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems. | Michal Wrona |
| 2014 | A Unifying Approach for Multistack Pushdown Automata. | Salvatore La Torre, Margherita Napoli, Gennaro Parlato |
| 2014 | Approximation Algorithms for Bounded Color Matchings via Convex Decompositions. | Georgios Stamoulis |
| 2014 | What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure? | Christian Sohler |
| 2014 | A Pumping Lemma for Two-Way Finite Transducers. | Tim Smith |
| 2014 | On Infinite Words Determined by Indexed Languages. | Tim Smith |
| 2014 | Communication Complexity Theory: Thirty-Five Years of Set Disjointness. | Alexander A. Sherstov |
| 2014 | Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). | Hadas Shachnai, Ariella Voloshin, Shmuel Zaks |
| 2014 | The Two Queries Assumption and Arthur-Merlin Classes. | Vyas Ram Selvam |
| 2014 | Tight Bounds for Complementing Parity Automata. | Sven Schewe, Thomas Varghese |
| 2014 | Determinising Parity Automata. | Sven Schewe, Thomas Varghese |
| 2014 | A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures. | Abhisekh Sankaran, Bharat Adsul, Supratik Chakraborty |
| 2014 | Existence of Secure Equilibrium in Multi-player Games with Perfect Information. | Julie De Pril, Jnos Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze |