| 2011 | A Coinductive Calculus for Asynchronous Side-Effecting Processes. Sergey Goncharov, Lutz Schröder |
| 2011 | A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. Gregory Z. Gutin, Mark Jones, Anders Yeo |
| 2011 | Almost Transparent Short Proofs for NPℝ. Klaus Meer |
| 2011 | Coloring Graphs without Short Cycles and Long Induced Paths. Petr A. Golovach, Daniël Paulusma, Jian Song |
| 2011 | Computational Randomness from Generalized Hardcore Sets. Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai |
| 2011 | Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension. Ludwig Staiger |
| 2011 | Dag Realizations of Directed Degree Sequences. Annabell Berger, Matthias Müller-Hannemann |
| 2011 | Data Reduction for Graph Coloring Problems. Bart M. P. Jansen, Stefan Kratsch |
| 2011 | Edge-Matching Problems with Rotations. Martin Ebbesen, Paul Fischer, Carsten Witt |
| 2011 | Enumeration of Minimal Dominating Sets and Variants. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine |
| 2011 | Functions That Preserve p-Randomness. Stephen A. Fenner |
| 2011 | Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings Olaf Owe, Martin Steffen, Jan Arne Telle |
| 2011 | Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
| 2011 | Hunting Distributed Malware with the κ-Calculus. Mila Dalla Preda, Cinzia Di Giusto |
| 2011 | Impugning Randomness, Convincingly. Yuri Gurevich |
| 2011 | Kernelization: An Overview. Daniel Lokshtanov |
| 2011 | LIFO-Search on Digraphs: A Searching Game for Cycle-Rank. Paul Hunter |
| 2011 | Modifying the Upper Bound on the Length of Minimal Synchronizing Word. A. N. Trahtman |
| 2011 | On Memoryless Quantitative Objectives. Krishnendu Chatterjee, Laurent Doyen, Rohit Singh |
| 2011 | On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux, Adrien Richard |
| 2011 | On the Optimal Compression of Sets in PSPACE. Marius Zimand |
| 2011 | Online Maximum k-Coverage. Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos |
| 2011 | Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger |
| 2011 | Polynomial Kernels for Proper Interval Completion and Related Problems. Stéphane Bessy, Anthony Perez |
| 2011 | Principal Types for Nominal Theories. Elliot Fairweather, Maribel Fernández, Murdoch James Gabbay |
| 2011 | Reactive Turing Machines. Jos C. M. Baeten, Bas Luttik, Paul van Tilburg |
| 2011 | Specification Patterns and Proofs for Recursion through the Store. Nathaniel Charlton, Bernhard Reus |
| 2011 | Sub-computabilities. Fabien Givors, Grégory Lafitte |
| 2011 | Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. Guillaume Malod |
| 2011 | The Effect of Homogeneity on the Complexity of k-Anonymity. Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip |
| 2011 | The Rewriting Logic Semantics Project: A Progress Report. José Meseguer, Grigore Rosu |
| 2011 | Virtual Substitution for SMT-Solving. Florian Corzilius, Erika Ábrahám |