| 2004 | Lexicographic Breadth First Search - A Survey. | Derek G. Corneil |
| 2004 | Edge-Connectivity Augmentation and Network Matrices. | Michele Conforti, Anna Galluccio, Guido Proietti |
| 2004 | Linear Kernels in Linear Time, or How to Save k Colors in O(n | Benny Chor, Mike Fellows, David W. Juedes |
| 2004 | Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. | Zhi-Zhong Chen, Tatsuie Tsukiji |
| 2004 | The Computational Complexity of the Minimum Weight Processor Assignment Problem. | Hajo Broersma, Danil Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger |
| 2004 | Efficient Computation of the Lovsz Theta Function for a Class of Circulant Graphs. | Valentin E. Brimkov, Reneta P. Barneva, Reinhard Klette, Joseph Straight |
| 2004 | Planar Graphs, via Well-Orderly Maps and Trees. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer |
| 2004 | On the Maximum Cardinality Search Lower Bound for Treewidth. | Hans L. Bodlaender, Arie M. C. A. Koster |
| 2004 | Core Stability of Minimum Coloring Games. | Thomas Bietenhader, Yoshio Okamoto |
| 2004 | Crossing Reduction in Circular Layouts. | Michael Baur, Ulrik Brandes |
| 2004 | A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. | Franz Baader |
| 2004 | A Stochastic Location Problem with Applications to Tele-diagnostic. | Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano |
| 2003 | Coloring Powers of Graphs of Bounded Clique-Width. | Ioan Todinca |
| 2003 | Matching, Edge-Colouring, and Dimers. | Alexander Schrijver |
| 2003 | Recognizing Bipolarizable and P 4-Simplicial Graphs. | Stavros D. Nikolopoulos, Leonidas Palios |
| 2003 | The Probabilistic Minimum Coloring Problem. | Ccile Murat, Vangelis Th. Paschos |
| 2003 | Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. | Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel |
| 2003 | The Complexity of Graph Contractions. | Asaf Levin, Danil Paulusma, Gerhard J. Woeginger |
| 2003 | Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. | Dieter Kratsch, Haiko Mller, Ioan Todinca |
| 2003 | Complexity of Hypergraph Coloring and Seidel's Switching. | Jan Kratochvl |
| 2003 | Short Cycles in Planar Graphs. | Lukasz Kowalik |
| 2003 | On the Recognition of General Partition Graphs. | Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Mller |
| 2003 | Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). | Carsten Gutwenger, Michael Jnger, Sebastian Leipert, Petra Mutzel, Merijam Percan, Ren Weiskircher |
| 2003 | Chordal Probe Graphs. | Martin Charles Golumbic, Marina Lipshteyn |
| 2003 | NCE Graph Grammars and Clique-Width. | Alexander Glikson, Johann A. Makowsky |