| 2003 | A Simple Linear Time LexBFS Cograph Recognition Algorithm. Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
| 2003 | An FPT Algorithm for Set Splitting. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond |
| 2003 | An Improved Upper Bound on the Crossing Number of the Hypercube. Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto |
| 2003 | Backbone Colorings for Networks. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
| 2003 | Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. Michael R. Fellows |
| 2003 | Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse |
| 2003 | Chordal Probe Graphs. Martin Charles Golumbic, Marina Lipshteyn |
| 2003 | Coloring Powers of Graphs of Bounded Clique-Width. Ioan Todinca |
| 2003 | Completely Connected Clustered Graphs. Sabine Cornelsen, Dorothea Wagner |
| 2003 | Complexity of Hypergraph Coloring and Seidel's Switching. Jan Kratochvíl |
| 2003 | Drawing Planar Graphs on a Curve. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath |
| 2003 | Erratum: Cycles in Generalized Networks. Franz-Josef Brandenburg |
| 2003 | Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. Dieter Kratsch, Haiko Müller, Ioan Todinca |
| 2003 | Generalized Parametric Multi-terminal Flows Problem. Pascal Berthomé, Madiagne Diallo, Afonso Ferreira |
| 2003 | Graph-Based Approaches to Software Watermarking. Christian S. Collberg, Stephen G. Kobourov, Edward Carter, Clark D. Thomborson |
| 2003 | Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers Hans L. Bodlaender |
| 2003 | Greedy Edge-Disjoint Paths in Complete Graphs. Paz Carmi, Thomas Erlebach, Yoshio Okamoto |
| 2003 | Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars. Simon M. Becker, Bernhard Westfechtel |
| 2003 | Matching, Edge-Colouring, and Dimers. Alexander Schrijver |
| 2003 | Minimum Flow Time Graph Ordering. Claudio Arbib, Michele Flammini, Fabrizio Marinelli |
| 2003 | NCE Graph Grammars and Clique-Width. Alexander Glikson, Johann A. Makowsky |
| 2003 | On the Recognition of General Partition Graphs. Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller |
| 2003 | Recognizing Bipolarizable and P 4-Simplicial Graphs. Stavros D. Nikolopoulos, Leonidas Palios |
| 2003 | Resource Allocation Problems in Multifiber WDM Tree Networks. Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos |
| 2003 | Searching Is Not Jumping. Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos |
| 2003 | Short Cycles in Planar Graphs. Lukasz Kowalik |
| 2003 | Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher |
| 2003 | The Complexity of Graph Contractions. Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
| 2003 | The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. Paul S. Bonsma |
| 2003 | The Minimum Degree Heuristic and the Minimal Triangulation Process. Anne Berry, Pinar Heggernes, Geneviève Simonet |
| 2003 | The Probabilistic Minimum Coloring Problem. Cécile Murat, Vangelis Th. Paschos |
| 2003 | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara |
| 2003 | Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel |
| 2003 | Tree-Partitions of k-Trees with Applications in Graph Layout. Vida Dujmovic, David R. Wood |