| 2003 | Drawing Planar Graphs on a Curve. | Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath |
| 2003 | Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. | Michael R. Fellows |
| 2003 | An Improved Upper Bound on the Crossing Number of the Hypercube. | Lurbio Faria, Celina M. H. de Figueiredo, Ondrej Skora, Imrich Vrto |
| 2003 | Resource Allocation Problems in Multifiber WDM Tree Networks. | Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos |
| 2003 | Tree-Partitions of k-Trees with Applications in Graph Layout. | Vida Dujmovic, David R. Wood |
| 2003 | An FPT Algorithm for Set Splitting. | Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond |
| 2003 | Completely Connected Clustered Graphs. | Sabine Cornelsen, Dorothea Wagner |
| 2003 | Graph-Based Approaches to Software Watermarking. | Christian S. Collberg, Stephen G. Kobourov, Edward Carter, Clark D. Thomborson |
| 2003 | Greedy Edge-Disjoint Paths in Complete Graphs. | Paz Carmi, Thomas Erlebach, Yoshio Okamoto |
| 2003 | Backbone Colorings for Networks. | Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger |
| 2003 | A Simple Linear Time LexBFS Cograph Recognition Algorithm. | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
| 2003 | Tree Spanners for Bipartite Graphs and Probe Interval Graphs. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Van Bang Le, Ryuhei Uehara |
| 2003 | Erratum: Cycles in Generalized Networks. | Franz-Josef Brandenburg |
| 2003 | The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. | Paul S. Bonsma |
| 2003 | Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse |
| 2003 | Generalized Parametric Multi-terminal Flows Problem. | Pascal Berthom, Madiagne Diallo, Afonso Ferreira |
| 2003 | The Minimum Degree Heuristic and the Minimal Triangulation Process. | Anne Berry, Pinar Heggernes, Genevive Simonet |
| 2003 | Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars. | Simon M. Becker, Bernhard Westfechtel |
| 2003 | Searching Is Not Jumping. | Lali Barrire, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos |
| 2003 | Minimum Flow Time Graph Ordering. | Claudio Arbib, Michele Flammini, Fabrizio Marinelli |
| 2002 | Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. | Rolf Wanka |
| 2002 | Connected and Loosely Connected List Homomorphisms. | Narayan Vikas |
| 2002 | Two Counterexamples in Graph Drawing. | Ondrej Skora, Lszl A. Szkely, Imrich Vrto |
| 2002 | Cluster Graph Modification Problems. | Ron Shamir, Roded Sharan, Dekel Tsur |
| 2002 | Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. | Md. Saidur Rahman, Takao Nishizeki |