| 2002 | On the Recognition of P | Stavros D. Nikolopoulos, Leonidas Palios |
| 2002 | The Forest Wrapping Problem on Outerplanar Graphs. | Isabella Lari, Federica Ricca, Andrea Scozzari |
| 2002 | Online Call Admission in Optical Networks with Larger Demands. | Sven Oliver Krumke, Diana Poensgen |
| 2002 | Budgeted Maximum Graph Coverage. | Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth |
| 2002 | On the b-Chromatic Number of Graphs. | Jan Kratochvl, Zsolt Tuza, Margit Voigt |
| 2002 | A Multi-scale Algorithm for the Linear Arrangement Problem. | Yehuda Koren, David Harel |
| 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 | Complexity of Some Infinite Games Played on Finite Graphs. | Hajime Ishihara, Bakhadyr Khoussainov |
| 2002 | Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. | Edith Hemaspaandra, Jrg Rothe, Holger Spakowski |
| 2002 | Facets of the Directed Acyclic Graph Layering Polytope. | Patrick Healy, Nikola S. Nikolov |
| 2002 | Completely Independent Spanning Trees in Maximal Planar Graphs. | Toru Hasunuma |
| 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 | The Complexity of Approximating the Oriented Diameter of Chordal Graphs. | Fedor V. Fomin, Martn Matamala, Ivan Rapaport |
| 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 | Safe Reduction Rules for Weighted Treewidth. | Frank van den Eijkhof, Hans L. Bodlaender |
| 2002 | Complexity of Pattern Coloring of Cycle Systems. | Zdenek Dvork, Jan Kra, Daniel Krl, Ondrej Pangrc |
| 2002 | An Additive Stretched Routing Scheme for Chordal Graphs. | Yon Dourisboure |
| 2002 | A New 3-Color Criterion for Planar Graphs. | Krzysztof Diks, Lukasz Kowalik, Maciej Kurowski |
| 2002 | The Complexity of Restrictive H-Coloring. | Josep Daz, Maria J. Serna, Dimitrios M. Thilikos |
| 2002 | Weighted Node Coloring: When Stable Sets Are Expensive. | Marc Demange, Dominique de Werra, Jrme Monnot, Vangelis Th. Paschos |
| 2002 | Algorithms and Models for the On-Line Vertex-Covering. | Marc Demange, Vangelis Th. Paschos |
| 2002 | On the Complexity of (k, l)-Graph Sandwich Problems. | Simone Dantas, Celina M. H. de Figueiredo, Lurbio Faria |
| 2002 | Search in Indecomposable Graphs. | Alain Cournier |
| 2002 | More about Subcolorings. | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |