| 2001 | (g, f)-Factorizations Orthogonal to k Subgraphs. Haodi Feng |
| 2001 | (k, +)-Distance-Hereditary Graphs. Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano |
| 2001 | A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness. Antonio Puricella, Iain A. Stewart |
| 2001 | Approximate Constrained Bipartite Edge Coloring. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano |
| 2001 | Approximation of Pathwidth of Outerplanar Graphs. Fedor V. Fomin, Hans L. Bodlaender |
| 2001 | Complexity of Coloring Graphs without Forbidden Induced Subgraphs. Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger |
| 2001 | Critical and Anticritical Edges in Perfect Graphs. Annegret K. Wagler |
| 2001 | De Bruijn Graphs and DNA Graphs. Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger |
| 2001 | Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. Sergei L. Bezrukov, Robert Elsässer |
| 2001 | Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. Feodor F. Dragan |
| 2001 | Graph Subcolorings: Complexity and Algorithms. Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
| 2001 | Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings Andreas Brandstädt, Van Bang Le |
| 2001 | How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. Wolfgang Espelage, Frank Gurski, Egon Wanke |
| 2001 | Invited Presentation: Data Management in Networks. Friedhelm Meyer auf der Heide |
| 2001 | Invited Presentation: Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces. Hans-Jürgen Bandelt |
| 2001 | Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel |
| 2001 | Maximum Clique Transversals. Maw-Shang Chang, Ton Kloks, Chuan-Min Lee |
| 2001 | Multiple Hotlink Assignment. Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth |
| 2001 | On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms. Jianer Chen, Iyad A. Kanj |
| 2001 | On Stable Cutsets in Line Graphs. Van Bang Le, Bert Randerath |
| 2001 | On Star Coloring of Graphs. Guillaume Fertin, André Raspaud, Bruce A. Reed |
| 2001 | On Strong Menger-Connectivity of Star Graphs. Eunseuk Oh, Jianer Chen |
| 2001 | On Subfamilies of AT-Free Graphs. Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart |
| 2001 | On the Monotonicity of Games Generated by Symmetric Submodular Functions. Fedor V. Fomin, Dimitrios M. Thilikos |
| 2001 | On the Relationship between Clique-Width and Treewidth. Derek G. Corneil, Udi Rotics |
| 2001 | On the Tree-Degree of Graphs. Maw-Shang Chang, Haiko Müller |
| 2001 | Planarity of the 2-Level Cactus Model. Sabine Cornelsen, Yefim Dinitz, Dorothea Wagner |
| 2001 | Small k-Dominating Sets in Planar Graphs with Applications. Cyril Gavoille, David Peleg, André Raspaud, Éric Sopena |
| 2001 | The Complexity of the Matching-Cut Problem. Maurizio Patrignani, Maurizio Pizzonia |
| 2001 | log n-Approximative NLC Öjvind Johansson |