| 2008 | Approximating the Metric TSP in Linear Time. | Davide Bil, Luca Forlizzi, Guido Proietti |
| 2008 | A Most General Edge Elimination Polynomial. | Ilya Averbouch, Benny Godlin, Johann A. Makowsky |
| 2007 | Pathwidth of Circular-Arc Graphs. | Karol Suchan, Ioan Todinca |
| 2007 | Graph Searching in a Crime Wave. | David Richerby, Dimitrios M. Thilikos |
| 2007 | Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. | Martin Pergel |
| 2007 | An Equivalent Version of the Caccetta-Hggkvist Conjecture in an Online Load Balancing Problem. | Angelo Monti, Paolo Penna, Riccardo Silvestri |
| 2007 | Characterization and Recognition of Digraphs of Bounded Kelly-width. | Daniel Meister, Jan Arne Telle, Martin Vatshelle |
| 2007 | A Characterisation of the Minimal Triangulations of Permutation Graphs. | Daniel Meister |
| 2007 | Monotonicity of Non-deterministic Graph Searching. | Frdric Mazoit, Nicolas Nisse |
| 2007 | Obtaining a Planar Graph by Vertex Deletion. | Dniel Marx, Ildik Schlotter |
| 2007 | Minimum-Weight Cycle Covers and Their Approximability. | Bodo Manthey |
| 2007 | Tree-Width and Optimization in Bounded Degree Graphs. | Vadim V. Lozin, Martin Milanic |
| 2007 | Proper Helly Circular-Arc Graphs. | Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter |
| 2007 | NLC-2 Graph Recognition and Isomorphism. | Vincent Limouzy, Fabien de Montgolfier, Michal Rao |
| 2007 | Characterisations and Linear-Time Recognition of Probe Cographs. | Van Bang Le, H. N. de Ridder |
| 2007 | Approximation Algorithms for Geometric Intersection Graphs. | Klaus Jansen |
| 2007 | The Complexity of Bottleneck Labeled Graph Problems. | Refael Hassin, Jrme Monnot, Danny Segev |
| 2007 | A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. | Torben Hagerup |
| 2007 | Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. | Matthias Hagen |
| 2007 | The Clique-Width of Tree-Power and Leaf-Power Graphs. | Frank Gurski, Egon Wanke |
| 2007 | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. | Petr A. Golovach, Jan Kratochvl |
| 2007 | On Restrictions of Balanced 2-Interval Graphs. | Philippe Gambette, Stphane Vialette |
| 2007 | On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. | Fabrizio Frati |
| 2007 | Mixed Search Number and Linear-Width of Interval and Split Graphs. | Fedor V. Fomin, Pinar Heggernes, Rodica Mihai |
| 2007 | On the Number of | Stefan Felsner, Florian Zickfeld |