Dagstuhl Seminar 10211
Flexible Network Design
( May 24 – May 28, 2010 )
(Click in the middle of the image to enlarge)
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/10211
Organizers
- Anupam Gupta (Carnegie Mellon University, US)
- Stefano Leonardi (Sapienza University of Rome, IT)
- Berthold Vöcking (RWTH Aachen, DE)
- Roger Wattenhofer (ETH Zürich, CH)
Contact
Schedule
Network design with its many variants is one of the most active research areas in theoretical computer science involving researchers from Algorithms and Complexity, Combinatorial Optimization, Distributed Computing and Algorithmic Game Theory. New problems in this area are arising as modern communication systems require a flexible and permanent adaptation of the network structure to highly dynamic access pattern especially in the context of mobile and adhoc networks. This brings many new aspects into network design such as flexible construction, dynamic scheduling of recources, adaptive bandwidth or spectrum assignment, and routing with respect to varying demands.
The goal of this seminar was to bring together experts from the several different communities above, and to give them the possibility to discuss recent advances, understand current trends, identify understudied areas, and formulate new directions for further investigation in this area. The seminar focussed on emergent problems in the area of flexible network design like online and oblivious network design, network design with game theoretic approaches, positioning in wireless sensor networks, and scheduling interfering signals in wireless networks.
The seminar provided an opportunity for information sharing and collaborations, and to identify new problems and areas for future collaboration. Indeed, to facilitate the exchange of ideas, some of the participants were requested to give overview talks or surveys of subjects of cross-cutting interest; this was complemented by shorter talks by other participants on specific research results.
- Vincenzo Bonifaci (MPI für Informatik - Saarbrücken, DE) [dblp]
- Artur Czumaj (University of Warwick - Coventry, GB) [dblp]
- Friedrich Eisenbrand (EPFL - Lausanne, CH) [dblp]
- Matthias Englert (University of Warwick - Coventry, GB) [dblp]
- Sándor Fekete (TU Braunschweig, DE) [dblp]
- Amos Fiat (Tel Aviv University, IL) [dblp]
- Naveen Garg (Indian Inst. of Technology - New Dehli, IN) [dblp]
- Fabrizio Grandoni (University of Rome "Tor Vergata", IT) [dblp]
- Anupam Gupta (Carnegie Mellon University, US) [dblp]
- Magnús M. Halldórsson (Reykjavik University, IS) [dblp]
- Martin Hoefer (RWTH Aachen, DE) [dblp]
- Thomas Kesselheim (RWTH Aachen, DE) [dblp]
- Jochen Könemann (University of Waterloo, CA) [dblp]
- Amit Kumar (Indian Inst. of Technology - New Dehli, IN) [dblp]
- Douglas Leith (NUI Maynooth, IE)
- Yishay Mansour (Tel Aviv University, IL) [dblp]
- Julian Mestre (MPI für Informatik - Saarbrücken, DE)
- Friedhelm Meyer auf der Heide (Universität Paderborn, DE) [dblp]
- Kamesh Munagala (Duke University - Durham, US) [dblp]
- Zeev Nutov (The Open University of Israel - Raanana, IL)
- Boaz Patt-Shamir (Tel Aviv University, IL) [dblp]
- Sriram V. Pemmaraju (University of Iowa - Iowa City, US) [dblp]
- Kirk Pruhs (University of Pittsburgh, US) [dblp]
- Harald Räcke (University of Warwick - Coventry, GB) [dblp]
- Heiko Röglin (Universität Bonn, DE) [dblp]
- Thomas Rothvoss (EPFL - Lausanne, CH) [dblp]
- Piotr Sankowski (Sapienza University of Rome, IT) [dblp]
- Guido Schäfer (CWI - Amsterdam, NL) [dblp]
- Christian Scheideler (Universität Paderborn, DE) [dblp]
- Mohit Singh (McGill University - Montreal, CA)
- Berthold Vöcking (RWTH Aachen, DE) [dblp]
- Markus Völker (KIT - Karlsruher Institut für Technologie, DE)
- Roger Wattenhofer (ETH Zürich, CH) [dblp]
Classification
- data structures
- algorithms
- complexity
- mobile computing
- networks
- optimization
- scheduling
Keywords
- algorithms and complexity
- combinatorial optimization
- distributed computing
- game theory
