| 2010 | Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers Christophe Paul, Michel Habib |
| 2009 | A Graph Polynomial Arising from Community Structure (Extended Abstract). Ilya Averbouch, Johann A. Makowsky, Peter Tittmann |
| 2009 | A New Intersection Model and Improved Algorithms for Tolerance Graphs. George B. Mertzios, Ignasi Sau, Shmuel Zaks |
| 2009 | Algorithms for Classes of Graphs with Bounded Expansion. Zdenek Dvorák, Daniel Král |
| 2009 | An Algorithmic Study of Switch Graphs. Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger |
| 2009 | An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. Torben Hagerup |
| 2009 | An Exact Algorithm for Minimum Distortion Embedding. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2009 | Chordal Digraphs. Daniel Meister, Jan Arne Telle |
| 2009 | Connected Feedback Vertex Set in Planar Graphs. Alexander Grigoriev, René Sitters |
| 2009 | Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno |
| 2009 | Cycles, Paths, Connectivity and Diameter in Distance Graphs. Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
| 2009 | Directed Rank-Width and Displit Decomposition. Mamadou Moustapha Kanté, Michaël Rao |
| 2009 | Distance Stephan Kreutzer, Sebastian Ordyniak |
| 2009 | Exact and Parameterized Algorithms for Max Internal Spanning Tree. Henning Fernau, Serge Gaspers, Daniel Raible |
| 2009 | Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma |
| 2009 | Finding Induced Paths of Given Parity in Claw-Free Graphs. Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
| 2009 | Fully Dynamic Representations of Interval Graphs. Christophe Crespelle |
| 2009 | Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. Zhentao Li, Ignasi Sau |
| 2009 | Graph-Theoretic Solutions to Computational Geometry Problems. David Eppstein |
| 2009 | Hardness Results and Efficient Algorithms for Graph Powers. Van Bang Le, Nguyen Ngoc Tuy |
| 2009 | Injective Oriented Colourings. Gary MacGillivray, André Raspaud, Jacobus Swarts |
| 2009 | Local Algorithms for Edge Colorings in UDGs. Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
| 2009 | Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract). Stéphane Grumbach, Zhilin Wu |
| 2009 | Low-Port Tree Representations. Shiri Chechik, David Peleg |
| 2009 | Maximum Series-Parallel Subgraph. Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul |
| 2009 | On Module-Composed Graphs. Frank Gurski, Egon Wanke |
| 2009 | Parameterized Complexity of Generalized Domination Problems. Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý |
| 2009 | Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). Shimon Shrem, Michal Stern, Martin Charles Golumbic |
| 2009 | Sub-coloring and Hypo-coloring Interval Graphs. Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman |
| 2009 | The Parameterized Complexity of Some Minimum Label Problems. Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
| 2009 | The k-Disjoint Paths Problem on Chordal Graphs. Frank Kammer, Torsten Tholey |