| 2009 | Local Algorithms for Edge Colorings in UDGs. | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
| 2009 | The k-Disjoint Paths Problem on Chordal Graphs. | Frank Kammer, Torsten Tholey |
| 2009 | Finding Induced Paths of Given Parity in Claw-Free Graphs. | Pim van 't Hof, Marcin Kaminski, Danil Paulusma |
| 2009 | An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. | Torben Hagerup |
| 2009 | On Module-Composed Graphs. | Frank Gurski, Egon Wanke |
| 2009 | Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract). | Stphane Grumbach, Zhilin Wu |
| 2009 | Connected Feedback Vertex Set in Planar Graphs. | Alexander Grigoriev, Ren Sitters |
| 2009 | Parameterized Complexity of Generalized Domination Problems. | Petr A. Golovach, Jan Kratochvl, Ondrej Such |
| 2009 | Sub-coloring and Hypo-coloring Interval Graphs. | Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman |
| 2009 | An Exact Algorithm for Minimum Distortion Embedding. | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
| 2009 | Exact and Parameterized Algorithms for Max Internal Spanning Tree. | Henning Fernau, Serge Gaspers, Daniel Raible |
| 2009 | The Parameterized Complexity of Some Minimum Label Problems. | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
| 2009 | Graph-Theoretic Solutions to Computational Geometry Problems. | David Eppstein |
| 2009 | Algorithms for Classes of Graphs with Bounded Expansion. | Zdenek Dvork, Daniel Krl |
| 2009 | Fully Dynamic Representations of Interval Graphs. | Christophe Crespelle |
| 2009 | Low-Port Tree Representations. | Shiri Chechik, David Peleg |
| 2009 | Maximum Series-Parallel Subgraph. | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul |
| 2009 | Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Danil Paulusma |
| 2009 | A Graph Polynomial Arising from Community Structure (Extended Abstract). | Ilya Averbouch, Johann A. Makowsky, Peter Tittmann |
| 2008 | Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. | Andreas Wiese, Evangelos Kranakis |
| 2008 | A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. | Siamak Tazari, Matthias Mller-Hannemann |
| 2008 | Searching for a Visible, Lazy Fugitive. | David Richerby, Dimitrios M. Thilikos |
| 2008 | From a Circular-Arc Model to a Proper Circular-Arc Model. | Yahav Nussbaum |
| 2008 | Fast Robber in Planar Graphs. | Nicolas Nisse, Karol Suchan |
| 2008 | Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. | Xavier Muoz, Ignasi Sau |