| 2012 | Reductions to the Set of Random Strings: The Resource-Bounded Case. | Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff |
| 2012 | A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree. | Tatsuya Akutsu, Takeyuki Tamura |
| 2012 | Unordered Constraint Satisfaction Games. | Lauri Ahlroth, Pekka Orponen |
| 2011 | New Parameterized Algorithms for the Edge Dominating Set Problem. | Mingyu Xiao, Ton Kloks, Sheung-Hung Poon |
| 2011 | New Proofs in Graph Minors. | Paul Wollan |
| 2011 | Linear Problem Kernels for Planar Graph Problems with Small Distance Property. | Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen |
| 2011 | Lower Bounds for Linear Decision Trees via an Energy Complexity Argument. | Kei Uchizawa, Eiji Takimoto |
| 2011 | Untimed Language Preservation in Timed Systems. | Ocan Sankur |
| 2011 | Generic Techniques to Round SDP Relaxations. | Prasad Raghavendra |
| 2011 | Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach. | Michal Pilipczuk |
| 2011 | Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence. | Kvin Perrot, Eric Rmila |
| 2011 | Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. | Christophe Paul, Anthony Perez, Stphan Thomass |
| 2011 | State Complexity of Operations on Input-Driven Pushdown Automata. | Alexander Okhotin, Kai Salomaa |
| 2011 | Periodicity Algorithms for Partial Words. | Florin Manea, Robert Mercas, Catalin Tiseanu |
| 2011 | Pushing for Weighted Tree Automata. | Andreas Maletti, Daniel Quernheim |
| 2011 | Compressed Word Problems for Inverse Monoids. | Markus Lohrey |
| 2011 | Symmetric Functions Capture General Functions. | Richard J. Lipton, Kenneth W. Regan, Atri Rudra |
| 2011 | Size and Computation of Injective Tree Automatic Presentations. | Dietrich Kuske, Thomas Weidner |
| 2011 | Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols. | Krzysztof Krzywdzinski, Katarzyna Rybarczyk |
| 2011 | Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions. | Andreas Krebs, Nutan Limaye, Srikanth Srinivasan |
| 2011 | Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions. | Vladimir Kolmogorov |
| 2011 | Some Variants of the Star Height Problem. | Daniel Kirsten |
| 2011 | Can Everybody Sit Closer to Their Friends Than Their Enemies? | Anne-Marie Kermarrec, Christopher Thraves |
| 2011 | On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono, Monika Steinov, Koichi Wada |
| 2011 | A Universally Defined Undecidable Unimodal Logic. | Edith Hemaspaandra, Henning Schnoor |