| 2002 | New Graph Classes of Bounded Clique-Width. | Andreas Brandstdt, Feodor F. Dragan, Hong-Oanh Le, Raffaele Mosca |
| 2002 | Cycles in Generalized Networks. | Franz-Josef Brandenburg |
| 2002 | Optimal Area Algorithm for Planar Polyline Drawings. | Nicolas Bonichon, Bertrand Le Sac, Mohamed Mosbah |
| 2002 | On the Minimum Size of a Contraction-Universal Tree. | Olivier Bodini |
| 2002 | DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. | Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger |
| 2002 | Maximum Cardinality Search for Computing Minimal Triangulations. | Anne Berry, Jean R. S. Blair, Pinar Heggernes |
| 2001 | Critical and Anticritical Edges in Perfect Graphs. | Annegret K. Wagler |
| 2001 | A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. | Antonio Puricella, Iain A. Stewart |
| 2001 | De Bruijn Graphs and DNA Graphs. | Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger |
| 2001 | The Complexity of the Matching-Cut Problem. | Maurizio Patrignani, Maurizio Pizzonia |
| 2001 | On Strong Menger-Connectivity of Star Graphs. | Eunseuk Oh, Jianer Chen |
| 2001 | On Stable Cutsets in Line Graphs. | Van Bang Le, Bert Randerath |
| 2001 | Complexity of Coloring Graphs without Forbidden Induced Subgraphs. | Daniel Krl, Jan Kratochvl, Zsolt Tuza, Gerhard J. Woeginger |
| 2001 | On Subfamilies of AT-Free Graphs. | Ekkehard Khler, Derek G. Corneil, Stephan Olariu, Lorna Stewart |
| 2001 | log n-Approximative NLC | jvind Johansson |
| 2001 | Invited Presentation: Data Management in Networks. | Friedhelm Meyer auf der Heide |
| 2001 | Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. | Clemens Grpl, Stefan Hougardy, Till Nierhoff, Hans Jrgen Prmel |
| 2001 | Small k-Dominating Sets in Planar Graphs with Applications. | Cyril Gavoille, David Peleg, Andr Raspaud, ric Sopena |
| 2001 | Multiple Hotlink Assignment. | Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth |
| 2001 | On the Monotonicity of Games Generated by Symmetric Submodular Functions. | Fedor V. Fomin, Dimitrios M. Thilikos |
| 2001 | Approximation of Pathwidth of Outerplanar Graphs. | Fedor V. Fomin, Hans L. Bodlaender |
| 2001 | Graph Subcolorings: Complexity and Algorithms. | Jir Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
| 2001 | On Star Coloring of Graphs. | Guillaume Fertin, Andr Raspaud, Bruce A. Reed |
| 2001 | (g, f)-Factorizations Orthogonal to k Subgraphs. | Haodi Feng |
| 2001 | How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. | Wolfgang Espelage, Frank Gurski, Egon Wanke |