| 2010 | A Quartic Kernel for Pathwidth-One Vertex Deletion. Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
| 2010 | Algorithmic Barriers from Phase Transitions in Graphs. Dimitris Achlioptas |
| 2010 | Algorithmic Graph Minors and Bidimensionality. Erik D. Demaine |
| 2010 | Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. Petr A. Golovach, Dieter Kratsch, Jean-François Couturier |
| 2010 | Colouring Vertices of Triangle-Free Graphs. Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries |
| 2010 | Complexity Results for the Spanning Tree Congestion Problem. Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
| 2010 | Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
| 2010 | Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas |
| 2010 | Efficient Algorithms for Eulerian Extension. Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
| 2010 | Efficient Broadcasting in Random Power Law Networks. Robert Elsässer, Adrian Ogierman |
| 2010 | From Path Graphs to Directed Path Graphs. Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato |
| 2010 | Generalized Graph Clustering: Recognizing ( Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
| 2010 | Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers Dimitrios M. Thilikos |
| 2010 | Graphs that Admit Right Angle Crossing Drawings. Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth |
| 2010 | Graphs with Large Obstacle Numbers. Padmini Mukkamala, János Pach, Deniz Sariöz |
| 2010 | Kernelization Hardness of Connectivity Problems in Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
| 2010 | Lattices and Maximum Flow Algorithms in Planar Graphs. Jannik Matuschke, Britta Peis |
| 2010 | Measuring Indifference: Unit Interval Vertex Deletion. René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
| 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 |
| 2010 | Narrowing Down the Gap on the Complexity of Coloring Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
| 2010 | Network Exploration by Silent and Oblivious Robots. Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro |
| 2010 | On Stable Matchings and Flows. Tamás Fleiner |
| 2010 | On the Boolean-Width of a Graph: Structure and Applications. Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle |
| 2010 | On the Small Cycle Transversal of Planar Graphs. Ge Xia, Yong Zhang |
| 2010 | Parameterized Complexity of the Arc-Preserving Subsequence Problem. Dániel Marx, Ildikó Schlotter |
| 2010 | Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2010 | The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. Edyta Szymanska |
| 2010 | The Longest Path Problem is Polynomial on Cocomparability Graphs. Kyriaki Ioannidou, Stavros D. Nikolopoulos |
| 2010 | The Number of Bits Needed to Represent a Unit Disk Graph. Colin McDiarmid, Tobias Müller |
| 2010 | Uniform Sampling of Digraphs with a Fixed Degree Sequence. Annabell Berger, Matthias Müller-Hannemann |
| 2010 | max-cut and Containment Relations in Graphs. Marcin Kaminski |