- Thursday March 8
- 9:30-10:00 Welcome
- 10:00-11:00 Christian Scheideler,
Scheduling and routing in wireless and adversarial networks, Abstract, Slides
- 11:00-11:30 Coffee Break
- 11:30-12:30 Alberto Marchetti Spaccamela,
Data aggregation in sensor networks, Abstract, Slides
- 12:30-13:00 Gennaro Cordasco,
IC-Scheduling Theory: A New Scheduling Paradigm for Internet-Based Computing
Abstract, Slides
- 13:15-14:30 Lunch
- 14:30-15:30 Euripides Bampis,
Truthfulness and approximation for a classical scheduling problem, Abstract
- 15:30-16:00 Ulrich Schwarz,
Scheduling on unreliable machines, Abstract, Slides
- 16:00-16:30 Coffee Break
- 16:30-17:00 Florian Schoppmann,
Incentive-Compatible Cost-Sharing Mechanism Design -- Collectors' Happiness
Abstract
- 17:00-17:30 Ignasi Sau Valls,
Packet routing problems on plane grids, Abstract, Slides
- 17:30-18:30 Susanne Albers,
Energy-Efficient Algorithms, Abstract, Slides
- Friday March 9
- 10:00-11:00 Denis Trystram,
Scheduling with reservations, Abstract, Slides
- 11:00-11:30 Coffee Break
- 11:30-12:00 Klaus Jansen,
New approximability results for 2-dimensional packing problems, Abstract, Slides
- 12:00-12:30 Florian Diedrich,
Applications of the Mixed Packing and Covering Problem, Abstract, Slides
- 12:30-13:00 Luca Moscardelli
An exponential improvement on the MST heuristic for the Minimum Energy Broadcasting
problem, Abstract, Slides
- 13:00-14:30 Lunch
- 14:30-15:00 Panagiota N. Panagopoulou,
Selfish load balancing under partial knowledge, Abstract, Slides
- 15:00-15:30 Juan Antonio Gónzalez,
A Hyper-heuristic for scheduling independent jobs in Computational Grids,
Abstract, Slides
- 15:30-16:00 Karsten Tiemann,
Congestion Games with Shifted Latency Functions, Abstract, Slides