| 2001 | k-Neighborhood Broadcasting. | Guillaume Fertin, Andr Raspaud |
| 2001 | The Client-Server 2-Spanner Problem with Applications to Network Design. | Michael Elkin, David Peleg |
| 2001 | Worst-case bounds for blind broadcasting in small-degree networks. | Peter Damaschke |
| 2001 | Interval Routing in Some Planar Quadrangulations. | Victor Chepoi, Alexis Rollin |
| 2001 | New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies. | Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos |
| 2001 | Group Mutual Exclusion in Token Rings. | Sbastien Cantarell, Ajoy Kumar Datta, Franck Petit, Vincent Villain |
| 2001 | Parallel Real-Time Complexity A Strong Infinite Hierarchy. | Stefan D. Bruda, Selim G. Akl |
| 2001 | Competitive Online Routing in Geometric Graphs. | Prosenjit Bose, Pat Morin |
| 2001 | Cycle Covering. | Jean-Claude Bermond, Lilian Chacon, David Coudert, Franois Tillerot |
| 2001 | Leader Election in Abelian Cayley Graphs. | Lali Barrire, Stefan Dobrev |
| 2000 | Lower bounds for hot-potato permutation routing on trees. | Alan Roberts, Antonios Symvonis, David R. Wood |
| 2000 | Congestion and dilation, similarities and differences: A survey. | Andr Raspaud, Ondrej Skora, Imrich Vrto |
| 2000 | A randomized leader election protocol for ad-hoc networks. | Koji Nakano, Stephan Olariu |
| 2000 | Termination detection and universal graph reconstruction. | Yves Mtivier, Gerard Tel |
| 2000 | An algorithmic definition of interval with applications to routing. | Fabrizio Luccio, Linda Pagli |
| 2000 | Optimal broadcast on parallel locality models. | Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping |
| 2000 | Construction of low-cost and low-diameter Steiner trees for multipoint groups. | Alexis Irlande, Jean-Claude Knig, Christian Laforest |
| 2000 | The 1.5-loop network and the mixed 1.5-loop network. | Frank K. Hwang, S. K. Chen |
| 2000 | Tracking causality in distributed systems: a suite of efficient protocols. | Jean-Michel Hlary, Giovanna Melideo, Michel Raynal |
| 2000 | Extremal bounds for probabilistic polling in graphs. | Yehuda Hassin, David Peleg |
| 2000 | Multiple message broadcasting in modified Kndel graph. | Hovhannes A. Harutyunyan |
| 2000 | Cooperative computing with fragmentable and mergeable groups. | Chryssis Georgiou, Alexander A. Shvartsman |
| 2000 | The compactness of adaptive routing tables. | Cyril Gavoille, Akka Zemmari |
| 2000 | On time versus size for monotone dynamic monopolies in regular topologies. | Paola Flocchini, Rastislav Kralovic, Alessandro Roncato, Peter Ruzicka, Nicola Santoro |
| 2000 | Self-stabilization with path algebra. | Bertrand Ducourthial, Sbastien Tixeuil |