Abstract is missing.
- Distributed Community Detection in Dynamic Graphs - (Extended Abstract)Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri. 1-12 [doi]
- Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the RingDavid Ilcinkas, Ahmed Mouhamadou Wade. 13-23 [doi]
- A Characterization of Dynamic Networks Where Consensus Is SolvableÉtienne Coulouma, Emmanuel Godard. 24-35 [doi]
- Self-adjusting Grid Networks to Minimize Expected Path LengthChen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker. 36-54 [doi]
- On Advice Complexity of the k-server Problem under Sparse MetricsSushmita Gupta, Shahin Kamali, Alejandro López-Ortiz. 55-67 [doi]
- Connected Surveillance GameFrédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, Ronan Pardo Soares. 68-79 [doi]
- Non-Additive Two-Option Ski RentalAmir Levi, Boaz Patt-Shamir. 80-91 [doi]
- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the TrieMarcin Bienkowski, Stefan Schmid. 92-103 [doi]
- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown DurationsGuy Even, Moti Medina. 104-115 [doi]
- Self-organizing Flows in Social NetworksNidhi Hegde, Laurent Massoulié, Laurent Viennot. 116-128 [doi]
- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom FiltersHugues Mercier, Emanuel Onica, Etienne Rivière, Pascal Felber. 129-140 [doi]
- Influence Diffusion in Social Networks under Time Window ConstraintsLuisa Gargano, Pavol Hell, Joseph G. Peters, Ugo Vaccaro. 141-152 [doi]
- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications - (Extended Abstract)Yves Métivier, John Michael Robson, Akka Zemmari. 153-164 [doi]
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource DiscoverySebastian Kniesburges, Andreas Koutsopoulos, Christian Scheideler. 165-176 [doi]
- Maintaining Balanced Trees for Structured Distributed Streaming SystemsFrédéric Giroire, Remigiusz Modrzejewski, Nicolas Nisse, Stéphane Pérennes. 177-188 [doi]
- Rendezvous of Two Robots with Constant MemoryPaola Flocchini, Nicola Santoro, Giovanni Viglietta, Masafumi Yamashita. 189-200 [doi]
- Pattern Formation by Mobile Robots with Limited VisibilityYukiko Yamauchi, Masafumi Yamashita. 201-212 [doi]
- Optimal Gathering of Oblivious Robots in Anonymous GraphsGabriele Di Stefano, Alfredo Navarra. 213-224 [doi]
- Probabilistic Connectivity Threshold for Directional Antenna Widths - (Extended Abstract)Hadassa Daltrophe, Shlomi Dolev, Zvi Lotker. 225-236 [doi]
- Broadcasting in Ad Hoc Multiple Access ChannelsLakshmi Anantharamu, Bogdan S. Chlebus. 237-248 [doi]
- Profit Maximization in Flex-Grid All-Optical NetworksMordechai Shalom, Prudence W. H. Wong, Shmuel Zaks. 249-260 [doi]
- Measuring the Impact of Adversarial Errors on Packet Scheduling StrategiesAntonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Joerg Widmer, Elli Zavou. 261-273 [doi]
- Optimal Buffer Management for 2-Frame Throughput MaximizationJun Kawahara, Koji Kobayashi. 274-285 [doi]
- Dynamically Maintaining Shortest Path Trees under Batches of UpdatesAnnalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti. 286-297 [doi]
- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement ProblemsMichel Raynal, Julien Stainer. 298-309 [doi]
- Steiner Problems with Limited Number of Branching NodesDimitri Watel, Marc-Antoine Weisser, Cédric Bentz, Dominique Barth. 310-321 [doi]
- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) GraphsDavide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti. 322-333 [doi]
- Maximum Distance Separable Codes Based on Circulant Cauchy MatricesChristian Schindelhauer, Christian Ortolf. 334-345 [doi]