Abstract is missing.
- Invited Talk: Symmetry and Computability in Anonymous NetworksEvangelos Kranakis. 1-16
- Optimal Distributed Algorithms in Unlabelled Tori and Chordal RingsBernard Mans. 17-31
- Computing on Anonymous Networks with Sense of DirectionPaola Flocchini, Alessandro Roncato. 32-46
- Good Fibrations and Other Construction Which Preserve Sense of DirectionPaolo Boldi, Sebastiano Vigna. 47-58
- Fault-Tolerant and Self-Stabilizing Ring OrientationJoffroy Beauquier, Oliver Debas, Synnöve Kekkonen-Moneta. 59-72
- Characterization of Networks Supporting Shortest-Path Interval Labeling SchemesLata Narayanan, Sunil M. Shende. 73-87
- Lower Bounds for Shortest Path Interval RoutingCyril Gavoille, Stephane Perennes. 88-103
- Interval Routing on ::::k::::-treesLata Narayanan, Naomi Nishimura. 104-118
- Boolean Routing on Cayley NetworksEvangelos Kranakis, Danny Krizanc. 119-124
- Boolean Routing on Cube NetworksMariana Kant-Antonescu. 125-140
- A Routing Algorithm for Networks Based on Distance-Hereditary TopologiesGabriele Di Stefano. 141-151
- Majority Voting, Coalitions and Monopolies in GraphsDavid Peleg. 152-169
- Tight Bounds on the Size of 2-MonopoliesJean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes. 170-179
- Spanners of Underlying Graphs of Iterated Line DigraphsRabah Harbane, Carles Padró. 180-194
- Exact Bandwith of Parallel-Processor NetworksPilar de la Torre, Clyde P. Kruskal. 195-209
- Full Access Networks of Small SizeEckehart Hotzel. 210-223
- Distributed Computation and Incremental Maintainance of 3-Edge-Connected ComponentsEsther Jennings, Lenka Motyckova. 224-240
- Emulating Networks by Bus Networks: Application to Trees and HypermeshesDominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau. 241-254
- Necklace-based Factorization of de Bruijn DigraphsPavel Tvrdík. 255-168
- Virtual Path Layout for Some Bounded Degree NetworksLadislav Stacho, Imrich Vrto. 269-178
- Systolic Gossip in Complete TreesAlessandro Roncato, Walter Unger. 279-291
- Efficient fault location with small riskAndrzej Pelc. 292-300
- On the Power of Local Information in Scheduling in Synchronous NetworksDerek Hing-leung Ngok, Shmuel Zaks. 301-312
- Distributed Anonymous Mobile RobotsIchiro Suzuki, Masafumi Yamashita. 313-330