| 2011 | Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. | Steven Chaplick, Elad Cohen, Juraj Stacho |
| 2011 | Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. | Katarna Cechlrov, Eva Jelnkov |
| 2011 | Exact Algorithms for Kayles. | Hans L. Bodlaender, Dieter Kratsch |
| 2011 | The Cinderella Game on Holes and Anti-holes. | Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger |
| 2011 | On the Complexity of Planar Covering of Small Graphs. | Ondrej Blka, Jozef Jirsek, Pavel Klavk, Martin Tancer, Jan Volec |
| 2011 | Graph Classes with Structured Neighborhoods and Algorithmic Applications. | Rmy Belmonte, Martin Vatshelle |
| 2011 | Characterizations of Deque and Queue Graphs. | Christopher Auer, Andreas Gleiner |
| 2011 | On Searching for Small Kochen-Specker Vector Systems. | Felix Arends, Jol Ouaknine, Charles W. Wampler |
| 2011 | Split Clique Graph Complexity. | Liliana Alcn, Lurbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
| 2010 | On the Small Cycle Transversal of Planar Graphs. | Ge Xia, Yong Zhang |
| 2010 | The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. | Edyta Szymanska |
| 2010 | A Quartic Kernel for Pathwidth-One Vertex Deletion. | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
| 2010 | Complexity Results for the Spanning Tree Congestion Problem. | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
| 2010 | Graphs with Large Obstacle Numbers. | Padmini Mukkamala, Jnos Pach, Deniz Sariz |
| 2010 | The Number of Bits Needed to Represent a Unit Disk Graph. | Colin McDiarmid, Tobias Mller |
| 2010 | Lattices and Maximum Flow Algorithms in Planar Graphs. | Jannik Matuschke, Britta Peis |
| 2010 | Parameterized Complexity of the Arc-Preserving Subsequence Problem. | Dniel Marx, Ildik Schlotter |
| 2010 | Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2010 | max-cut and Containment Relations in Graphs. | Marcin Kaminski |
| 2010 | The Longest Path Problem is Polynomial on Cocomparability Graphs. | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
| 2010 | Generalized Graph Clustering: Recognizing ( | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
| 2010 | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
| 2010 | Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. | Petr A. Golovach, Dieter Kratsch, Jean-Franois Couturier |
| 2010 | On Stable Matchings and Flows. | Tams Fleiner |
| 2010 | Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. | Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |