| 2011 | The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree. | Markus Blser, Radu Curticapean |
| 2011 | Verifying Proofs in Constant Depth. | Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer |
| 2011 | Faster Coupon Collecting via Replication with Applications in Gossiping. | Petra Berenbrink, Robert Elssser, Tom Friedetzky, Lars Nagel, Thomas Sauerwald |
| 2011 | Quantitative Refinement for Weighted Modal Transition Systems. | Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus R. Thrane |
| 2011 | Adhesivity Is Not Enough: Local Church-Rosser Revisited. | Paolo Baldan, Fabio Gadducci, Pawel Sobocinski |
| 2011 | The Least-Core of Threshold Network Flow Games. | Yoram Bachrach |
| 2011 | Nearest Neighbor Search in High-Dimensional Spaces. | Alexandr Andoni |
| 2010 | Impossibility of Independence Amplification in Kolmogorov Complexity Theory. | Marius Zimand |
| 2010 | Counting Dependent and Independent Strings. | Marius Zimand |
| 2010 | Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds. | Kenya Ueno |
| 2010 | Faster Approximation Schemes and Parameterized Algorithms on | Siamak Tazari |
| 2010 | Enumeration of the Monomials of a Polynomial and Related Complexity Classes. | Yann Strozecki |
| 2010 | Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. | Philippe Schnoebelen |
| 2010 | Parity Games with Partial Information Played on Graphs of Bounded Complexity. | Bernd Puchala, Roman Rabinovich |
| 2010 | Asynchronous Omega-Regular Games with Partial Information. | Bernd Puchala |
| 2010 | Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). | M. Praveen |
| 2010 | The Complexity of Finding Reset Words in Finite Automata. | Jrg Olschewski, Michael Ummels |
| 2010 | Unambiguous Finite Automata over a Unary Alphabet. | Alexander Okhotin |
| 2010 | Do We Really Understand the Crossing Numbers? | Bojan Mohar |
| 2010 | Solving minones-2-sat as Fast as vertex cover. | Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Raman, Bal Sri Shankar |
| 2010 | Harnessing ML | Giulio Manzonetto, Paolo Tranquilli |
| 2010 | Two Variables and Two Successors. | Amaldev Manuel |
| 2010 | Meta-Envy-Free Cake-Cutting Protocols. | Yoshifumi Manabe, Tatsuaki Okamoto |
| 2010 | Algorithmic Lower Bounds for Problems on Decomposable Graphs. | Daniel Lokshtanov |
| 2010 | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. | Stefan Kratsch, Dniel Marx, Magnus Wahlstrm |