Monday, June 7
- 17.00 Registration
- 19.30 Welcome Reception
Tuesday, June 8
- 9.00 Openning
- 9.15 invited talk
- Communication Complexity: From Two-party to Multiparty
Eyal Kushilevitz (Technion)
- 10.15 Coffee Break
- 10.45 Session 1
- Distributed Weighted Stable Marriage Problem
Nir Amira, Zvi Lotker and Ran Giladi (Ben Gurion U.)
- Traffic Grooming in Star Networks via Matching Techniques
Ignasi Sau (Technion), Mordechai Shalom (Tel Hai College), and Shmuel Zaks (Technion)
- Event Extent Estimation
Marcin Bienkowski (U. Wroclaw), Leszek Gasieniec (U. Liverpool), Marek Klonowski, Miroslaw Korzeniowski (Wroclaw U. of Technology) and Stefan Schmid (TU Berlin &Telekom Labs)
- 12.15 Lunch
- 15.00 Session 2
- Asynchronous deterministic rendezvous in bounded terrains
Jurek Czyzowicz (U. Québec), David Ilcinkas (LaBRI, CNRS, & U. Bordeaux), Arnaud Labourel (LaBRI & U. Bordeaux 1 ) and Andrzej Pelc (U. Québec)
- Space-Optimal Rendezvous of Mobile Agents in Asynchronous Trees
Daisuke Baba (Osaka U.), Tomoko Izumi (Ritsumeikan U.), Fukuhito Ooshita, Hirotsugu Kakugawa and Toshimitsu Masuzawa (Osaka U.)
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
Tomoko Izumi (Ritsumeikan U.), Taisuke Izumi (Nagoya Institute of Technology), Sayaka Kamei (Hiroshima U.) and Fukuhito Ooshita (Osaka U.)
- 16.30 Coffee Break
- 17.00 Free time
- 19.30 Dinner
Wednesday 9
- 9.00 Session 3
- Average Long-Lived Memoryless Consensus: The Three-Value Case
Ivan Rapaport (U. Chile) and Eric Rémila (U. Lyon)
- Algorithms For Extracting Timeliness Graphs
Stéphane Devismes (VERIMAG), Carole Delporte-Gallet, Hugues Fauconnier
(LIAFA & Paris VII) and Mikel Larrea (U. Basque Country)
- Distributed tree comparison with nodes of limited memory
Emanuele Fusco (Sapienza U. Rome), Andrzej Pelc (U. Québec)
- 10.30 Coffee Break
- 11.00 Excursion and Conference Dinner
Thursday 10
- 9.00 Session 4
- Periodic Data Retrieval Problem in Rings Containing a Malicious Host
Rastislav Kralovic, Stanislav Miklík (Comenius U.)
- A continuous, local strategy for constructing a short chain of mobile robots
Bastian Degener, Barbara Kempkes, Peter Kling and Friedhelm Meyer auf der Heide (Heinz Nixdorf Institute)
- Multipath Spanners
Cyril Gavoille, Quentin Godfroy (U. Bordeaux) and Laurent Viennot (INRIA & U. Paris 7)
- 10.30 Coffee Break
- 11.00 Session 5
- On the impact of local taxes in a set cover game
Bruno Escoffier (Lamsade & U. Paris Dauphine), Laurent Gourves (Lamsade) and Jerome Monnot (U. Paris Dauphine)
- Towards Network Games with Social Preferences
Petr Kuznetsov and Stefan Schmid (TU Berlin & Telekom Laboratories)
- 12.00 Lunch
- 15.00 Session 6
- Strong Orientations of Planar Graphs with Bounded Stretch Factor
Evangelos Kranakis, Oscar Morales Ponce (Carleton U.), Ladislav Stacho (Simon Fraser U.)
- Maximum Interference of Random Sensors on a Line
Evangelos Kranakis (Carleton U.), Danny Krizanc (Wesleyan U.), Lata Narayanan (Concordia U.) and Ladislav Stacho (Simon Fraser U.)
- 16.00 Coffee Break
- 16.30 Free time
Friday 11
- 9.00 Session 7
- Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
Anissa Lamani, Maria Gradinariu Potop-Butucaru and Sebastien Tixeuil (U. Pierre & Marie Curie - Paris 6)
- A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
Masoud Khosravani and Michael Dinneen (U. Auckland)
- Fast algorithms for min independent dominating set
Bourgeois Nicolas, Bruno Escoffier and Vangelis Paschos (LAMSADE & U.Paris-Dauphine)
- 10.30 Closing
- 12.00 Lunch
