| 2011 | Coloring Graphs without Short Cycles and Long Induced Paths. | Petr A. Golovach, Danil Paulusma, Jian Song |
| 2011 | Sub-computabilities. | Fabien Givors, Grgory Lafitte |
| 2011 | Functions That Preserve p-Randomness. | Stephen A. Fenner |
| 2011 | Principal Types for Nominal Theories. | Elliot Fairweather, Maribel Fernndez, Murdoch James Gabbay |
| 2011 | Edge-Matching Problems with Rotations. | Martin Ebbesen, Paul Fischer, Carsten Witt |
| 2011 | Virtual Substitution for SMT-Solving. | Florian Corzilius, Erika brahm |
| 2011 | Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
| 2011 | On Memoryless Quantitative Objectives. | Krishnendu Chatterjee, Laurent Doyen, Rohit Singh |
| 2011 | Specification Patterns and Proofs for Recursion through the Store. | Nathaniel Charlton, Bernhard Reus |
| 2011 | The Effect of Homogeneity on the Complexity of k-Anonymity. | Robert Bredereck, Andr Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | Polynomial Kernels for Proper Interval Completion and Related Problems. | Stphane Bessy, Anthony Perez |
| 2011 | Dag Realizations of Directed Degree Sequences. | Annabell Berger, Matthias Mller-Hannemann |
| 2011 | On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. | Jacques M. Bahi, Jean-Franois Couchot, Christophe Guyeux, Adrien Richard |
| 2011 | Reactive Turing Machines. | Jos C. M. Baeten, Bas Luttik, Paul van Tilburg |
| 2011 | Online Maximum k-Coverage. | Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos |
| 2009 | How to Guard the Guards Themselves. | Moti Yung |
| 2009 | 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs. | Rafal Witkowski |
| 2009 | Energy Complexity and Depth of Threshold Circuits. | Kei Uchizawa, Takao Nishizeki, Eiji Takimoto |
| 2009 | Reachability in | Thomas Thierauf, Fabian Wagner |
| 2009 | Equivalence of Deterministic Nested Word to Word Transducers. | Slawomir Staworko, Grgoire Laurence, Aurlien Lemay, Joachim Niehren |
| 2009 | NP-Completeness of | Sadish Sadasivam, Huaming Zhang |
| 2009 | Decision Version of the Road Coloring Problem Is NP-Complete. | Adam Roman |
| 2009 | Open Maps Bisimulations for Higher Dimensional Automata Models. | Elena S. Oshevskaya |
| 2009 | Small Weakly Universal Turing Machines. | Turlough Neary, Damien Woods |
| 2009 | Small-Space Analogues of Valiant's Classes. | Meena Mahajan, B. V. Raghavendra Rao |