| 2006 | Regularity Problems for Visibly Pushdown Languages. | Vince Brny, Christof Lding, Olivier Serre |
| 2006 | Invariants of Automatic Presentations and Semi-synchronous Transductions. | Vince Brny |
| 2006 | Optimal Node Routing. | Yossi Azar, Yoel Chaiutin |
| 2006 | On Hypergraph and Graph Isomorphism with Bounded Color Classes. | Vikraman Arvind, Johannes Kbler |
| 2006 | Quantum Algorithms for Matching and Network Flows. | Andris Ambainis, Robert Spalek |
| 2006 | Energy-Efficient Algorithms for Flow Time Minimization. | Susanne Albers, Hiroshi Fujiwara |
| 2006 | Exact Price of Anarchy for Polynomial Congestion Games. | Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann |
| 2006 | Equivalence of F-Algebras and Cubic Forms. | Manindra Agrawal, Nitin Saxena |
| 2005 | Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics. | Carsten Witt |
| 2005 | Dynamic Complexity Theory Revisited. | Volker Weber, Thomas Schwentick |
| 2005 | How Common Can Be Universality for Cellular Automata?. | Guillaume Theyssier |
| 2005 | Counting in the Two Variable Guarded Logic with Transitivity. | Lidia Tendera |
| 2005 | Exact Quantum Algorithms for the Leader Election Problem. | Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto |
| 2005 | Algorithmics in Exponential Time. | Uwe Schning |
| 2005 | Packet Buffering: Randomization Beats Deterministic Algorithms. | Markus Schmidt |
| 2005 | Shortest Monotone Descent Path Problem in Polyhedral Terrain. | Sasanka Roy, Sandip Das, Subhas C. Nandy |
| 2005 | Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. | Eran Rom, Amnon Ta-Shma |
| 2005 | Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods. | Victor Poupet |
| 2005 | Automatic Presentations for Finitely Generated Groups. | Graham P. Oliver, Richard M. Thomas |
| 2005 | Kolmogorov-Loveland Randomness and Stochasticity. | Wolfgang Merkle, Joseph S. Miller, Andr Nies, Jan Reimann, Frank Stephan |
| 2005 | Computing Minimal Multi-homogeneous Bzout Numbers Is Hard. | Gregorio Malajovich, Klaus Meer |
| 2005 | Cost Sharing and Strategyproof Mechanisms for Set Cover Games. | Xiang-Yang Li, Zheng Sun, Weizhao Wang |
| 2005 | The Power of Commuting with Finite Sets of Words. | Michal Kunc |
| 2005 | Characterizing TC | Andreas Krebs, Klaus-Jrn Lange, Stephanie Reifferscheid |
| 2005 | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. | Telikepalli Kavitha, Kurt Mehlhorn |