Abstract is missing.
- Energy Consumption in Radio Networks: Selfish Agents and Rewarding MechanismsChristoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri. 1-16
- Election and Rendezvous in Fully Anonymous Systems with Sense of DirectionLali Barrière, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro. 17-32
- Bounds for Frequency Estimation of Packet StreamsProsenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang. 33-42
- Approximate Multicommodity Flow for WDM Networks DesignMohamed Bouklit, David Coudert, Jean-François Lalande, Christophe Paul, Hervé Rivano. 43-56
- The Cost of Concurrent, Low-Contention Read-Modify-WriteCostas Busch, Marios Mavronicolas, Paul G. Spirakis. 57-72
- Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free GraphsFrancesc Comellas, Guillaume Fertin, André Raspaud. 73-87
- Communication Properties of Cycle Prefix DigraphsFrancesc Comellas, Margarida Mitjana. 89-99
- The Broadcast Assignment ProblemChristian Destré, Christian Laforest, Sandrine Vial. 101-116
- The Do-All Problem with Byzantine Processor FailuresAntonio Fernández, Chryssis Georgiou. 117-132
- On Routing of Wavebands for Gossiping in All-Optical Paths and CyclesMichele Flammini, Alfredo Navarra, Andrzej Proskurowski. 133-145
- Interval Routing in Reliability NetworksCyril Gavoille, Martin Nehéz. 147-162
- Polynomial-Time Computable Backup Tables for Shortest-Path RoutingHiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro. 163-177
- Instability of Networks with Quasi-Static Link CapacitiesDimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis. 179-194
- Time of Radio BroadcastingDariusz R. Kowalski, Andrzej Pelc. 195-210
- Broadcasting with Many Faulty LinksRastislav Kralovic, Richard Královic, Peter Ruzicka. 211-222
- Tracking Users in Cellular Networks using Timing InformationEvangelos Kranakis, Danny Krizanc, Sunil M. Shende. 223-234
- Minimum Feedback Vertex Set in Pyramid and Mesh of Trees NetworksFlaminia L. Luccio. 235-247
- Distributed site partitioningRicardo Marcelín-Jiménez. 249-257
- A uniform randomized election in treesYves Métivier, Nasser Saheb-Djahromi, Akka Zemmari. 259-274
- Optimal Oblivious Routing On D-Dimensional MeshesAndre Osterloh. 275-290
- Single-Write Safe Consensus using Constrained InputsMatthieu Roy, Achour Mostéfaoui. 291-306