| 2000 | Diameter of the Kndel Graph. | Guillaume Fertin, Andr Raspaud, Heiko Schrder, Ondrej Skora, Imrich Vrto |
| 2000 | Computing Input Multiplicity in Anonymous Synchronous Networks with Dynamic Faults. | Stefan Dobrev |
| 2000 | Update Networks and Their Routing Strategies. | Michael J. Dinneen, Bakhadyr Khoussainov |
| 2000 | Optimizing Cost Flows by Modifying Arc Costs and Capacities. | Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth |
| 2000 | Efficient Dispersion Algorithms for Geometric Intersection Graphs. | Peter Damaschke |
| 2000 | Networks with Small Stretch Number. | Serafino Cicerone, Gabriele Di Stefano |
| 2000 | Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. | Edson Cceres, Albert Chan, Frank K. H. A. Dehne, Giuseppe Prencipe |
| 2000 | Split-Perfect Graphs: Characterizations and Algorithmic Use. | Andreas Brandstdt, Van Bang Le |
| 2000 | Approximating the Treewidth of AT-Free Graphs. | Vincent Bouchitt, Ioan Todinca |
| 2000 | On the Space and Access Complexity of Computation DAGs. | Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto |
| 2000 | Traversing Directed Eulerian Mazes. | Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar |
| 2000 | New Spectral Lower Bounds on the Bisection Width of Graphs. | Sergei L. Bezrukov, Robert Elssser, Burkhard Monien, Robert Preis, Jean-Pierre Tillich |
| 2000 | Approximating Call-Scheduling Makespan in All-Optical Networks. | Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela |
| 1999 | Induced Matchings in Regular Graphs and Trees. | Michele Zito |
| 1999 | On Minimum Diameter Spanning Trees under Reload Costs. | Hans-Christoph Wirth, Jan Steffan |
| 1999 | An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs. | Koichi Wada, Yoriyuki Nagata, Wei Chen |
| 1999 | On the Nature of Structure and Its Identification. | Benno Stein, Oliver Niggemann |
| 1999 | Efficient Analysis of Graphs with Small Minimal Separators. | Konstantin Skodinis |
| 1999 | Informatica, Scoula, Communit: Uno Sguardo dall' Occhio del Ciclone. | Nicola Santoro |
| 1999 | Box-Rectangular Drawings of Plane Graphs. | Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki |
| 1999 | An Improved Algorithm for Finding Tree Decompositions of Small Width. | Ljubomir Perkovic, Bruce A. Reed |
| 1999 | Proximity-Preserving Labeling Schemes and Their Applications. | David Peleg |
| 1999 | Dihamiltonian Decomposition of Regular Graphs with Degree Three. | Jung-Heum Park, Hee-Chul Kim |
| 1999 | Triangulated Neighbourhoods in | Igor Parfenoff, Florian Roussel, Irena Rusu |
| 1999 | Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. | Sascha Ott |