| 2011 | A Polynomial Time Algorithm for Bounded Directed Pathwidth. Hisao Tamaki |
| 2011 | Alternation Graphs. Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin |
| 2011 | Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. Katarína Cechlárová, Eva Jelínková |
| 2011 | Approximability of the Path-Distance-Width for AT-free Graphs. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki |
| 2011 | Characterizations of Deque and Queue Graphs. Christopher Auer, Andreas Gleißner |
| 2011 | Complexity of Splits Reconstruction for Low-Degree Trees. Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
| 2011 | Counting Independent Sets in Claw-Free Graphs. Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski |
| 2011 | Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. Andrew R. A. McGrae, Michele Zito |
| 2011 | Exact Algorithms for Kayles. Hans L. Bodlaender, Dieter Kratsch |
| 2011 | From Few Components to an Eulerian Graph by Adding Arcs. Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller |
| 2011 | Graph Classes with Structured Neighborhoods and Algorithmic Applications. Rémy Belmonte, Martin Vatshelle |
| 2011 | Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers Petr Kolman, Jan Kratochvíl |
| 2011 | Hanani-Tutte and Monotone Drawings. Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
| 2011 | Important Separators and Parameterized Algorithms. Dániel Marx |
| 2011 | Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. Toru Hasunuma, Hiroshi Nagamochi |
| 2011 | List Coloring in the Absence of a Linear Forest. Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
| 2011 | Maximum Independent Set in 2-Direction Outersegment Graphs. Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych |
| 2011 | On Collinear Sets in Straight-Line Drawings. Alexander Ravsky, Oleg Verbitsky |
| 2011 | On Computing an Optimal Semi-matching. Frantisek Galcík, Ján Katrenic, Gabriel Semanisin |
| 2011 | On Searching for Small Kochen-Specker Vector Systems. Felix Arends, Joël Ouaknine, Charles W. Wampler |
| 2011 | On the Complexity of Planar Covering of Small Graphs. Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec |
| 2011 | On the Independence Number of Graphs with Maximum Degree 3. Iyad A. Kanj, Fenghui Zhang |
| 2011 | Parameterized Complexity of Eulerian Deletion Problems. Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter |
| 2011 | Parameterized Two-Player Nash Equilibrium. Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström |
| 2011 | Planar k-Path in Subexponential Time and Polynomial Space. Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
| 2011 | Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs. Christine T. Cheng, Eric McDermid, Ichiro Suzuki |
| 2011 | Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. Steven Chaplick, Elad Cohen, Juraj Stacho |
| 2011 | Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
| 2011 | Split Clique Graph Complexity. Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
| 2011 | Structures and Hyperstructures in Metabolic Networks. Alberto Marchetti-Spaccamela |
| 2011 | The Cinderella Game on Holes and Anti-holes. Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger |