| 2011 | Locally Injective Homomorphism to the Simple Weight Graphs. | Ondrej Blka, Bernard Lidick, Marek Tesar |
| 2011 | Edge Contractions in Subclasses of Chordal Graphs. | Rmy Belmonte, Pinar Heggernes, Pim van 't Hof |
| 2011 | Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. | Paul C. Bell, Prudence W. H. Wong |
| 2011 | Designing Algorithms with Limited Work Space. | Tetsuo Asano |
| 2011 | On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric. | Ernst Althaus, Joschka Kupilas, Rouven Naujoks |
| 2010 | Generating Internally Triconnected Rooted Plane Graphs. | Bingbing Zhuang, Hiroshi Nagamochi |
| 2010 | Community Structure in Large Complex Networks. | Liaoruo Wang, John E. Hopcroft |
| 2010 | Two-Layer Planarization Parameterized by Feedback Edge Set. | Johannes Uhlmann, Mathias Weller |
| 2010 | Algebraic Proofs over Noncommutative Formulas. | Iddo Tzameret |
| 2010 | The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. | Shang-Hua Teng |
| 2010 | Recovering Social Networks from Contagion Information. | Sucheta Soundarajan, John E. Hopcroft |
| 2010 | Closed Rectangle-of-Influence Drawings for Irreducible Triangulations. | Sadish Sadasivam, Huaming Zhang |
| 2010 | Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable. | Stefan Ratschan |
| 2010 | Simultaneity in Event Structures. | G. Michele Pinna, Andrea Saba |
| 2010 | An Automata-Theoretic Characterization of the Chomsky-Hierarchy. | Benedek Nagy |
| 2010 | A Visual Model of Computation. | Ian Mackie |
| 2010 | Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. | Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin |
| 2010 | The Complexity of Geometric Problems in High Dimension. | Christian Knauer |
| 2010 | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. | Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang |
| 2010 | A Note on the Testability of Ramsey's Class. | Charles Jordan, Thomas Zeugmann |
| 2010 | New Research Directions in the Information Age. | John E. Hopcroft |
| 2010 | Optimal Acceptors and Optimal Proof Systems. | Edward A. Hirsch |
| 2010 | Schnyder Greedy Routing Algorithm. | Xin He, Huaming Zhang |
| 2010 | Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. | Pinar Heggernes, Daniel Meister, Udi Rotics |
| 2010 | Incremental List Coloring of Graphs, Parameterized by Conservation. | Sepp Hartung, Rolf Niedermeier |