Accepted Papers

Métivier Yves, John Michael Robson and Akka Zemmari.
 Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications


Marcin Bienkowski and Stefan Schmid.
 Competitive FIB Aggregation: Online Ski Rental on the Trie


Dimitri Watel, Marc-Antoine Weisser, Cédric Bentz and Dominique Barth.

 Steiner Problems with Limited Number of Branching Nodes


Sebastian Kniesburges, Andreas Koutsopoulos and Christian Scheideler.
 A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery


Michel Raynal and Julien Stainer.

 Simultaneous Consensus vs Set Agreement: a Message-Passing Sensitive Hierarchy of Agreement Problems


Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale and Riccardo Silvestri.

 Distributed Community Detection in Dynamic Graphs


Jun Kawahara and Koji M. Kobayashi.
 Optimal Buffer Management for 2-Frame Throughput Maximization


Giovanni Viglietta, Paola Flocchini, Nicola Santoro and Masafumi Yamashita.

 Rendezvous of Two Robots with Constant Memory


Luisa Gargano, Pavol Hell, Joseph Peters and Ugo Vaccaro.
 Influence Diffusion in Social Networks under Time Window Constraints


Frédéric Giroire, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes and Ronan Soares.
 Connected Surveillance Game


Lakshmi Anantharamu and Bogdan Chlebus.
 Broadcasting in Ad Hoc Multiple Access Channels


Yukiko Yamauchi and Masafumi Yamashita.
 Pattern Formation by Mobile Robots with Limited Visibility
 

Frederic Giroire, Remigiusz Modrzejewski, Nicolas Nisse and Stephane Perennes.

 Maintaining Balanced Trees For Structured Distributed Streaming Systems


Hugues Mercier, Emanuel Onica, Etienne Rivière and Pascal Felber.
 Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters


Nidhi Hegde, Laurent Massoulié and Laurent Viennot.

 Self-Organizing Flows in Social Networks


David Ilcinkas and Ahmed Mouhamadou Wade.
 Exploration of the $T$-Interval-Connected Dynamic Graphs: the Case of the Ring

Hadassa Daltrophe, Shlomi Dolev and Zvi Lotker.
  Probabilistic Connectivity Threshold for Directional Antenna Widths


Etienne Coulouma and Emmanuel Godard.

 A Characterization of Dynamic Networks where Consensus is Solvable


Mordechai Shalom, Prudence W.H. Wong and Shmuel Zaks.
 Profit Maximization in Flex-Grid All-Optical Networks


Sushmita Gupta, Shahin Kamali and Alejandro López-Ortiz.
 On Advice Complexity of the k-server Problem under Sparse Metrics

Guy Even and Moti Medina.
 A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations


Davide Bilò, Luciano Gualà, Stefano Leucci and Guido Proietti.

 Exact and approximate algorithms for movement problems on (special classes of) graphs


Chen Avin, Michael Borokhovich, Bernhard Haeupler and Zvi Lotker.
 Self-Adjusting Grid Networks to Minimize Expected Path Length


Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci and Guido Proietti.
 Dynamically maintaining shortest path trees under batches of updates


Gabriele Di Stefano and Alfredo Navarra.

 Optimal Gathering of Oblivious Robots in Anonymous Graphs


Amir Levi and Boaz Patt-Shamir.
 Non-Additive Two-Option Ski Rental


Christian Schindelhauer and Christian Ortolf.

 Maximum Distance Separable Codes based on Circulant Cauchy Matrices


Antonio Fernandez Anta, Chryssis Georgiou, Dariusz Kowalski, Joerg Widmer and Elli Zavou.
 Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies