| 2007 | A Characterisation of the Minimal Triangulations of Permutation Graphs. Daniel Meister |
| 2007 | A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs. Torben Hagerup |
| 2007 | An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. Angelo Monti, Paolo Penna, Riccardo Silvestri |
| 2007 | Approximation Algorithms for Geometric Intersection Graphs. Klaus Jansen |
| 2007 | Characterisations and Linear-Time Recognition of Probe Cographs. Van Bang Le, H. N. de Ridder |
| 2007 | Characterization and Recognition of Digraphs of Bounded Kelly-width. Daniel Meister, Jan Arne Telle, Martin Vatshelle |
| 2007 | Complexity and Approximation Results for the Connected Vertex Cover Problem. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
| 2007 | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs. Petr A. Golovach, Jan Kratochvíl |
| 2007 | Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. Bruno Courcelle, Mamadou Moustapha Kanté |
| 2007 | Graph Searching in a Crime Wave. David Richerby, Dimitrios M. Thilikos |
| 2007 | Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers Andreas Brandstädt, Dieter Kratsch, Haiko Müller |
| 2007 | How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. Frederic Dorn |
| 2007 | Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. Matthias Hagen |
| 2007 | Minimum-Weight Cycle Covers and Their Approximability. Bodo Manthey |
| 2007 | Mixed Search Number and Linear-Width of Interval and Split Graphs. Fedor V. Fomin, Pinar Heggernes, Rodica Mihai |
| 2007 | Mixing 3-Colourings in Bipartite Graphs. Luis Cereceda, Jan van den Heuvel, Matthew Johnson |
| 2007 | Monotonicity of Non-deterministic Graph Searching. Frédéric Mazoit, Nicolas Nisse |
| 2007 | NLC-2 Graph Recognition and Isomorphism. Vincent Limouzy, Fabien de Montgolfier, Michaël Rao |
| 2007 | Obtaining a Planar Graph by Vertex Deletion. Dániel Marx, Ildikó Schlotter |
| 2007 | On Finding Graph Clusterings with Maximum Modularity. Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner |
| 2007 | On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Fabrizio Frati |
| 2007 | On Restrictions of Balanced 2-Interval Graphs. Philippe Gambette, Stéphane Vialette |
| 2007 | On the Number of Stefan Felsner, Florian Zickfeld |
| 2007 | Pathwidth of Circular-Arc Graphs. Karol Suchan, Ioan Todinca |
| 2007 | Proper Helly Circular-Arc Graphs. Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter |
| 2007 | Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. Martin Pergel |
| 2007 | Recognizing Bipartite Tolerance Graphs in Linear Time. Arthur H. Busch, Garth Isaak |
| 2007 | Segmenting Strings Homogeneously Via Trees. Peter Damaschke |
| 2007 | The 3-Steiner Root Problem. Maw-Shang Chang, Ming-Tat Ko |
| 2007 | The Clique-Width of Tree-Power and Leaf-Power Graphs. Frank Gurski, Egon Wanke |
| 2007 | The Complexity of Bottleneck Labeled Graph Problems. Refael Hassin, Jérôme Monnot, Danny Segev |
| 2007 | Tree-Width and Optimization in Bounded Degree Graphs. Vadim V. Lozin, Martin Milanic |