| 2002 | A Multi-scale Algorithm for the Linear Arrangement Problem. Yehuda Koren, David Harel |
| 2002 | A New 3-Color Criterion for Planar Graphs. Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski |
| 2002 | Algorithms and Models for the On-Line Vertex-Covering. Marc Demange, Vangelis Th. Paschos |
| 2002 | An Additive Stretched Routing Scheme for Chordal Graphs. Yon Dourisboure |
| 2002 | Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. Rolf Wanka |
| 2002 | Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. Md. Saidur Rahman, Takao Nishizeki |
| 2002 | Budgeted Maximum Graph Coverage. Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth |
| 2002 | Cluster Graph Modification Problems. Ron Shamir, Roded Sharan, Dekel Tsur |
| 2002 | Completely Independent Spanning Trees in Maximal Planar Graphs. Toru Hasunuma |
| 2002 | Complexity of Pattern Coloring of Cycle Systems. Zdenek Dvorák, Jan Kára, Daniel Král, Ondrej Pangrác |
| 2002 | Complexity of Some Infinite Games Played on Finite Graphs. Hajime Ishihara, Bakhadyr Khoussainov |
| 2002 | Connected and Loosely Connected List Homomorphisms. Narayan Vikas |
| 2002 | Cycles in Generalized Networks. Franz-Josef Brandenburg |
| 2002 | DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger |
| 2002 | Facets of the Directed Acyclic Graph Layering Polytope. Patrick Healy, Nikola S. Nikolov |
| 2002 | Generalized H-Coloring and H-Covering of Trees. Jirí Fiala, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle |
| 2002 | Graph Separator Algorithms: A Refined Analysis. Henning Fernau |
| 2002 | Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers Ludek Kucera |
| 2002 | Maximum Cardinality Search for Computing Minimal Triangulations. Anne Berry, Jean R. S. Blair, Pinar Heggernes |
| 2002 | More about Subcolorings. Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
| 2002 | New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs. Ton Kloks, Chuan-Min Lee, Jiping Liu |
| 2002 | New Graph Classes of Bounded Clique-Width. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca |
| 2002 | On the Complexity of (k, l)-Graph Sandwich Problems. Simone Dantas, Celina M. H. de Figueiredo, Luérbio Faria |
| 2002 | On the Minimum Size of a Contraction-Universal Tree. Olivier Bodini |
| 2002 | On the Recognition of P Stavros D. Nikolopoulos, Leonidas Palios |
| 2002 | On the b-Chromatic Number of Graphs. Jan Kratochvíl, Zsolt Tuza, Margit Voigt |
| 2002 | Online Call Admission in Optical Networks with Larger Demands. Sven Oliver Krumke, Diana Poensgen |
| 2002 | Optimal Area Algorithm for Planar Polyline Drawings. Nicolas Bonichon, Bertrand Le Saëc, Mohamed Mosbah |
| 2002 | Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis |
| 2002 | Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski |
| 2002 | Safe Reduction Rules for Weighted Treewidth. Frank van den Eijkhof, Hans L. Bodlaender |
| 2002 | Search in Indecomposable Graphs. Alain Cournier |
| 2002 | The Complexity of Approximating the Oriented Diameter of Chordal Graphs. Fedor V. Fomin, Martín Matamala, Ivan Rapaport |
| 2002 | The Complexity of Restrictive H-Coloring. Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos |
| 2002 | The Forest Wrapping Problem on Outerplanar Graphs. Isabella Lari, Federica Ricca, Andrea Scozzari |
| 2002 | Two Counterexamples in Graph Drawing. Ondrej Sýkora, László A. Székely, Imrich Vrto |
| 2002 | Weighted Node Coloring: When Stable Sets Are Expensive. Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos |