| 2012 | Characterizing Certain Topological Specifications. | Bernhard Heinemann |
| 2012 | Broadcast Domination on Block Graphs in Linear Time. | Pinar Heggernes, Sigve Hortemo Sther |
| 2012 | Finding Vertex-Surjective Graph Homomorphisms. | Petr A. Golovach, Bernard Lidick, Barnaby Martin, Danil Paulusma |
| 2012 | Satisfiability Thresholds beyond k -XORSAT. | Andreas Goerdt, Lutz Falke |
| 2012 | The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs. | Eli Fox-Epstein, Danny Krizanc |
| 2012 | Worst-Case Optimal Priority Queues via Extended Regular Counters. | Amr Elmasry, Jyrki Katajainen |
| 2012 | Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs. | Stefan Dobrev, Evangelos Kranakis, Oscar Morales-Ponce, Milan Plzk |
| 2012 | Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs. | Martin Dietzfelbinger, Michael Rink |
| 2012 | Bounded Synchronization Delay in Omega-Rational Expressions. | Volker Diekert, Manfred Kufleitner |
| 2012 | Computing All MOD-Functions Simultaneously. | Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin, Hiroki Morizumi |
| 2012 | A Lower Bound on Circuit Complexity of Vector Function in U 2. | Evgeny Demenkov |
| 2012 | Approximating Minimum Power Edge-Multi-Covers. | Nachshon Cohen, Zeev Nutov |
| 2012 | Checking Tests for Read-Once Functions over Arbitrary Bases. | Dmitry V. Chistikov |
| 2012 | News about Semiantichains and Unichain Coverings. | Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki |
| 2012 | The Complexity of Intersecting Finite Automata Having Few Final States. | Michael Blondin, Pierre McKenzie |
| 2012 | General Quantitative Specification Theories with Modalities. | Sebastian S. Bauer, Uli Fahrenberg, Axel Legay, Claus R. Thrane |
| 2012 | Resilient Quicksort and Selection. | Maxim A. Babenko, Ivan Pouzyrevsky |
| 2011 | Locally Decodable Codes. | Sergey Yekhanin |
| 2011 | Graphs of Bounded Treewidth Can Be Canonized in AC | Fabian Wagner |
| 2011 | Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition. | Alexander Tiskin |
| 2011 | Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs. | Kim Thang Nguyen |
| 2011 | Orbits of Linear Maps and Regular Languages. | Sergey P. Tarasov, Mikhail N. Vyalyi |
| 2011 | Almost | Jir Sma, Stanislav Zk |
| 2011 | Recent Results on Polynomial Identity Testing. | Amir Shpilka |
| 2011 | Kolmogorov Complexity as a Language. | Alexander Shen |