| 2007 | Complexity and Approximation Results for the Connected Vertex Cover Problem. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2007 | How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. | Frederic Dorn |
| 2007 | Segmenting Strings Homogeneously Via Trees. | Peter Damaschke |
| 2007 | Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. | Bruno Courcelle, Mamadou Moustapha Kant |
| 2007 | The 3-Steiner Root Problem. | Maw-Shang Chang, Ming-Tat Ko |
| 2007 | Mixing 3-Colourings in Bipartite Graphs. | Luis Cereceda, Jan van den Heuvel, Matthew Johnson |
| 2007 | Recognizing Bipartite Tolerance Graphs in Linear Time. | Arthur H. Busch, Garth Isaak |
| 2007 | On Finding Graph Clusterings with Maximum Modularity. | Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Grke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner |
| 2006 | Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. | Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier |
| 2006 | Vertex Coloring of Comparability+ | Yasuhiko Takenaga, Kenichi Higashide |
| 2006 | Minimal Proper Interval Completions. | Ivan Rapaport, Karol Suchan, Ioan Todinca |
| 2006 | Generation of Graphs with Bounded Branchwidth. | Christophe Paul, Andrzej Proskurowski, Jan Arne Telle |
| 2006 | A Fully Dynamic Algorithm for the Recognition of | Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos |
| 2006 | Chordal Deletion Is Fixed-Parameter Tractable. | Dniel Marx |
| 2006 | Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions. | Bodo Manthey |
| 2006 | Computing Graph Polynomials on Graphs of Bounded Clique-Width. | Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin |
| 2006 | Improved Edge-Coloring with Three Colors. | Lukasz Kowalik |
| 2006 | Divide-and-Color. | Joachim Kneis, Daniel Mlle, Stefan Richter, Peter Rossmanith |
| 2006 | A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators. | Christian Knauer, Andreas Spillner |
| 2006 | Listing Chordal Graphs and Interval Graphs. | Masashi Kiyomi, Shuji Kijima, Takeaki Uno |
| 2006 | Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. | Haim Kaplan, Yahav Nussbaum |
| 2006 | Convex Drawings of Graphs with Non-convex Boundary. | Seok-Hee Hong, Hiroshi Nagamochi |
| 2006 | Strip Graphs: Recognition and Scheduling. | Magns M. Halldrsson, Ragnar K. Karlsson |
| 2006 | How to Sell a Graph: Guidelines for Graph Retailers. | Alexander Grigoriev, Joyce van Loon, Ren Sitters, Marc Uetz |
| 2006 | Finding Intersection Models of Weakly Chordal Graphs. | Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |