Program

(The full ALGO 2013 schedule can be found on the ALGO website.)


  • Thursday, September 5, 2013

    • 8:30 - Registration

    9:00 - IPEC Keynote. Exact Complexity and Satisfiability.
    Ramamohan Paturi, EATCS-IPEC Nerode Prize 2013,
    California Institute for Telecommunications & Information Technology.

    10:00 - Coffee break

    10:30 - Welcome to ALGOSENSORS

    10:32 - Opening talk: Giuseppe Prencipe. Autonomous Mobile Robots: A Distributed Computing Perspective.

    11:20 - Gianlorenzo D'Angelo, Alfredo Navarra, Daniele Diodati, Cristina M. Pinotti. Approximation Bounds for the Minimum k-Storage Problem.

    11:45 - Amir Bannoura, Christian Ortolf, Christian Schindelhauer, Leonhard Reindl. The Wake Up Dominating Set Problem.

    12:10 - Lunch

    13:45 - ATMOS Keynote. Modeling and Optimizing Traffic Networks.
    Tobias Harks, Maastricht University.

    14:45 - Short break

    15:00 - Gokarna Sharma, Costas Busch. Optimal Nearest Neighbor Queries in Sensor Networks.

    15:25 - Laszlo Blazovics, Tamas Lukovszki. Fast Localized Sensor Self-Deployment for Focused Coverage.

    15:50 - Antonio Fernandez Anta, Dariusz Kowalski, Miguel A. Mosteiro, Prudence W.H. Wong. Station Assignment with Applications to Sensing.

    16:15 - Coffee break

    16:45 - Matias Korman, Maarten Löffler, Rodrigo Silveira, Darren Strash. On the Complexity of Barrier Resilience for Fat Regions.

    17:10 - Sebastian Abshoff, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali, Friedhelm Meyer Auf der Heide. Token Dissemination in Geometric Dynamic Networks.

    17:35 - Giuseppe Antonio Di Luna, Silvia Bonomi, Ioannis Chatzigiannakis, Roberto Baldoni. Counting in Anonymous Dynamic Networks: An Experimental Perspective.

    18:00 - Short break

    18:10 - Business meeting


  • Friday, September 6, 2013

    • 8:30 - Registration

    9:00 - ALGOSENSORS Keynote. Modeling reality algorithmically: The case of wireless communication.
    Magnús M. Halldórsson, Reykjavik University.

    10:00 - Coffee break

    10:30 - Jérémie Chalopin, Shantanu Das, Matus Mihalak, Paolo Penna, Peter Widmayer. Data-Delivery by Energy-Constrained Mobile Robots.

    10:55 - Giovanni Viglietta. Rendezvous of two Robots with Visible Bits.

    11:20 - Eduardo Mesa-Barrameda, Shantanu Das, Nicola Santoro. Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes.

    11:45 - Davide Bilň, Yann Disser, Luciano Gualŕ, Matus Mihalak, Guido Proietti, Peter Widmayer. Polygon-constrained Motion Planning Problems.

    12:10 - Lunch

    13:45 - WAOA Keynote. New Approaches for Approximating TSP.
    Ola Svensson, EPFL.

    14:45 - Short break

    15:00 - Fabian Fuchs, Dorothea Wagner. On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model.

    15:25 - Simon Burgess, Yubin Kuang, Johannes Wendeberg, Kalle Ĺström, Christian Schindelhauer. Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration using Far Field Approximation.

    15:50 - Matthias Függer, Alexander Kößler, Thomas Nowak, Ulrich Schmid, Martin Zeiner. The Effect of Forgetting on the Performance of a Synchronizer.

    16:15 - Coffee break

    16:45 - Aaron Becker, Erik Demaine, Sándor Fekete, Golnaz Habibi, James McLurkin. Reconfiguring Massive Particle Swarms with Limited, Global Control.

    17:10 - Tigran Tonoyan. Conflict Graphs and the Capacity of the Mean Power Scheme.

    17:35 - Christine Markarian, Michael Schubert, Friedhelm Meyer Auf der Heide. Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.

    18:00 - Avery Miller. On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks.