| 2006 | Bounded Arboricity to Determine the Local Structure of Sparse Graphs. | Gaurav Goel, Jens Gustedt |
| 2006 | Simultaneous Graph Embeddings with Fixed Edges. | Elisabeth Gassner, Michael Jnger, Merijam Percan, Marcus Schaefer, Michael Schulz |
| 2006 | A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs. | Serge Gaspers, Mathieu Liedloff |
| 2006 | Monotony Properties of Connected Visible Graph Searching. | Pierre Fraigniaud, Nicolas Nisse |
| 2006 | Generalised Dualities and Finite Maximal Antichains. | Jan Foniok, Jaroslav Nesetril, Claude Tardif |
| 2006 | Approximating the Traffic Grooming Problem in Tree and Star Networks. | Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks |
| 2006 | Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy. | Jir Fiala, Jan Kratochvl |
| 2006 | An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. | Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell |
| 2006 | Circular-Perfect Concave-Round Graphs. | Sylvain Coulonges |
| 2006 | Partitioned Probe Comparability Graphs. | David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
| 2006 | Graph Labelings Derived from Models in Distributed Computing. | Jrmie Chalopin, Danil Paulusma |
| 2006 | Treewidth: Characterizations, Applications, and Computations. | Hans L. Bodlaender |
| 2006 | Flexible Matchings. | Mikls Bartha, Mikls Krsz |
| 2006 | Clique Graph Recognition Is NP-Complete. | Liliana Alcn, Lurbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez |
| 2005 | Finding Disjoint Paths on Directed Acyclic Graphs. | Torsten Tholey |
| 2005 | Approximating Rank-Width and Clique-Width Quickly. | Sang-il Oum |
| 2005 | Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs. | Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara |
| 2005 | Recognizing HHDS-Free Graphs. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2005 | Adding an Edge in a Cograph. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2005 | Generating Colored Trees. | Shin-Ichi Nakano, Takeaki Uno |
| 2005 | Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. | Daniel Meister |
| 2005 | Algebraic Operations on PQ Trees and Modular Decomposition Trees. | Ross M. McConnell, Fabien de Montgolfier |
| 2005 | Roman Domination over Some Graph Classes. | Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
| 2005 | On Stable Cutsets in Claw-Free Graphs and Planar Graphs. | Van Bang Le, Raffaele Mosca, Haiko Mller |
| 2005 | Approximation Algorithms for Unit Disk Graphs. | Erik Jan van Leeuwen |