Program



Monday, 19th October
 9:00 - 9:30 Registration, Welcome
9:30 -10:30 Tutorial 1
Fedor V. Fomin, Univ. Bergen, Norway
Graph Searching (slides)
 10:30 - 11:00 Coffee Break
 11:00 - 12:00 Tutorial 2
Nicola Santoro, Carleton University, Ottawa, Canada
Models for computational mobile entities (slides and slides2)
 12:00 - 14:00 Lunch
 14:00 - 15:00 Tutorial 3
Nicolas Nisse, Inria, Univ. Nice Sophia Antipolis, CNRS, I3S, France
Cops and Robber Games (slides)
 15:00 - 15:30 Coffee Break
 15:30 - 16:30
  • Andrzej Pelc, Université du Québec en Outaouais, Canada
    Rendezvous of communicating agents
  • Jérémie Chalopin, CNRS, LIF, Univ. Aix-Marseille, France
    Anonymous Graph Exploration with Binoculars
    (slides)


Tuesday, 20th October
 09:30 - 10:30
  • Anthony Bonato, Ryerson University, Toronto, Canada
    The game of Zombies and Survivors on graphs
  • Marcello Mamino, LIX, Ecole Polytechnique, Palaiseau, France
    On strategy recovery and mean payoff games (slides)
 10:30 - 11:00 Coffee Break
 11:00 - 12:00
 12:00 - 14:00 Lunch
 14:00 - 15:00
  • Klaus-Tycho Förster, Department Electrical Engineering, ETH, Zürich, Switzerland
    Lower and Upper bounds for Online Directed Graph Exploration (slides)
  • Sruti Gan Chaudhuri,Jadavpur University, Kolkata, West Bengal, India
    Gathering of Asynchronous Oblivious Mobile Agents in a Tree (slides)
 15:00 - 15:30 Coffee Break
 15:30 - 16:30
 16:30 - 18:00 Open Problems session (.pdf and slides)
 20:00 - Gala dinner (Menu)


Wednesday, 21th October
09:30 -10:30
  • Noa Agmon, Bar-Ilan University, Israel
    Strategic path planning for robots in adversarial environments
  • Guiseppe Prencipe, Dipartimento di Informatica, Università di Pisa, Italy
    The power of lights for autonomous mobile robots (slides)
 10:30 - 11:00 Coffee Break
11:00 - 12:30
  • Matthias Fugger, Vienna University of Technology, Austria
    Influence systems: the Hegselmann-Krause systems
  • Frédéric Simard, Laval University, Québec, Canada
    A Generalized Model of Games of Cops and Robbers with Randomness (slides)
  • Paul Hunter, Univ. Libre de Bruxelles, Belgium
    Quantitative Sabotage Games (slides)
Free Afternoon


Thursday, 22th October
 09:00 - 10:30
  • Anissa Lamani, Kyushu University, Japan
    Synchronization and oscillations in population protocols
  • Shantanu Das, LIF, Univ. Aix Marseille, France.
    Distributed Tasks for Mobile Robots with Energy Constraints (slides)
  • Koichi Wada, Faculty of Science and Engineering, HOSEI University, Tokyo, Japan
    A new model of mobile robots with lights and its computational power (slides)
 10:30 - 11:00 Coffee Break
 11:00 - 12:00
 12:00 - 14:00 Lunch
 14:00 - 15:00
  • Yukiko Yamauchi, Kyushu University, Japan
    Formation Problems for Synchronous Mobile Robots in the Three Dimensional Euclidean Space (slides)
  • Giovanni Viglietta, University of Ottawa, Canada
    Distributed Computing by Mobile Robots: Solving the Uniform Circle Formation Problem (slides)
 15:00 - 15:30 Coffee Break
 15:30 - 16:30
  • Christian Scheideler, University of Paderborn, Germany
    Leader election and shape formation with self-organizing programmable matter (slides)
  • Arnold Rosenberg, Northeastern University, Boston, USA
    Cellular ANTomata: Principles, Problems, and Progress (slides)
 16:30 - Open Problems session


Friday, 23th October
 09:30 - 10:30
  • Spyros Angelopoulos, LIP6, CNRS, Univ. Pierre et Marie Curie, Paris, France
    Further connections between ray searching and contract scheduling problems (slides)
  • Thomas Lidbetter, London School of Economics, UK
    The expanding search ratio of a graph (slides)
 10:30 - 11:00 Coffee Break
 11:00 - 11:30
  • Euripides Markou, University of Thessaly, Lamia, Greece
    Mobile Agents Rendezvous in Mesh-Networks, in spite of a Malicious Agent (slides)
End of the conference