Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Within this website:
External resources:
Within this website:
External resources:
  • the dblp Computer Science Bibliography

Dagstuhl Seminar 05361

Algorithmic Aspects of Large and Complex Networks

( Sep 04 – Sep 09, 2005 )

Please use the following short url to reference this page:



Information systems like the internet, the World Wide Web, telecommunication networks, sensor networks, or peer-to-peer networks have reached a size and a dynamics that puts them beyond our ability to deploy them and to keep them functioning correctly through traditional algorithmic techniques. Their complexity arises from their growth and dynamics: They change their size and structure over time, large components may be modified deleted or replaced. Challenges for algorithms research include development of models for the dynamics of such systems, the design of decentralized, scalable and adaptive mechanisms for regulation and improvement, and the design, the analysis, and the experimental evaluation of algorithms for analyzing and optimizing such systems.

Today, networks play an important role in many areas of our society. Information acquisition and dissemination as well as the further growing mobility is based on the understanding and employment of such huge networks. Interesting relations between networks in areas like traffic and transport, politics and society make it promising to strengthen the joint effort to tackle them. Dealing with large networks is a big topic also in areas like physics, biology, and economy, with very different, mainly non-algorithmic methods and different optimization goals.

The seminar brought together 46 researchers from different European countries, Australia and USA. Most participants were from algorithms research, but several also came from other branches of Computer Science as well as from Physics and Biology. As in previous meetings there were not only scientific talks on results respectively ongoing research, but also fruitful and stimulating discussions.

The seminar also offered an opportunity to meet and intensify collaboration for resrachers involved in the DFG research cluster "Algorithmic Aspects of Large and Complex Networks" (DFG Schwerpunktprogramm 1126) and from the EU Integrated Project DELIS (Dynamically Evolving Large-scale Information Systems).

Schloss Dagstuhl and its staff provided a very convenient and stimulating environment. The seminar participants appreciated the cordial atmosphere which improved mutual understanding and inspiration. The organizers wish to thank all those who helped make the workshop a fruitful research experience.

  • Rudolf Ahlswede (Universität Bielefeld, DE)
  • Susanne Albers (Universität Freiburg, DE) [dblp]
  • H. Bast (MPI für Informatik - Saarbrücken, DE)
  • Vladimir Batagelj (University of Ljubljana, SI)
  • Mark Buchanan (Notre Dame de Courson, FR)
  • Geoffrey Canright (Telenor Research - Fornebu, NO)
  • Camil Demetrescu (Sapienza University of Rome, IT) [dblp]
  • Josep Diaz (UPC - Barcelona, ES)
  • Martin Dietzfelbinger (TU Ilmenau, DE) [dblp]
  • Thomas Erlebach (University of Leicester, GB) [dblp]
  • Sándor Fekete (TU Braunschweig, DE) [dblp]
  • Anja Feldmann (TU München, DE) [dblp]
  • Marco Gaertler (KIT - Karlsruher Institut für Technologie, DE)
  • David Hales (University of Bologna, IT)
  • Alexander Hall (ETH Zürich, CH)
  • Seok-Hee Hong (The University of Sydney, AU) [dblp]
  • Klaus Jansen (Universität Kiel, DE) [dblp]
  • Michael Kaufmann (Universität Tübingen, DE) [dblp]
  • Lefteris M. Kirousis (CTI & University of Patras, GR) [dblp]
  • Stephen G. Kobourov (University of Arizona - Tucson, US) [dblp]
  • Matthias Krause (Universität Mannheim, DE) [dblp]
  • Miroslaw Kutylowski (Wroclaw University of Technology, PL)
  • Giuseppe Liotta (University of Perugia, IT) [dblp]
  • Madhav Marathe (Virginia Polytechnic Institute - Blacksburg, US) [dblp]
  • Alberto Marchetti-Spaccamela (Sapienza University of Rome, IT) [dblp]
  • Kurt Mehlhorn (MPI für Informatik - Saarbrücken, DE) [dblp]
  • Ulrich Carsten Meyer (MPI für Informatik - Saarbrücken, DE) [dblp]
  • Friedhelm Meyer auf der Heide (Universität Paderborn, DE) [dblp]
  • Rolf H. Möhring (TU Berlin, DE) [dblp]
  • Burkhard Monien (Universität Paderborn, DE)
  • Matthias Müller-Hannemann (TU Darmstadt, DE) [dblp]
  • Rolf Niedermeier (Universität Jena, DE) [dblp]
  • Peter Sanders (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Christian Schindelhauer (Universität Paderborn, DE) [dblp]
  • Rüdiger Schultz (Universität Duisburg-Essen, DE)
  • Martin Skutella (TU Dortmund, DE) [dblp]
  • Christian Sohler (Universität Paderborn, DE) [dblp]
  • Paul Spirakis (CTI - Rion, GR) [dblp]
  • Anand Srivastav (Christian-Albrechts-Universität zu Kiel, DE) [dblp]
  • Panayiotis Tsaparas (University of Helsinki, FI)
  • Berthold Vöcking (RWTH Aachen, DE) [dblp]
  • Dorothea Wagner (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Rolf Wanka (Universität Erlangen-Nürnberg, DE) [dblp]
  • Ingo Wegener (TU Dortmund, DE)

Related Seminars
  • Dagstuhl Seminar 01381: Algorithmic Aspects of Large and Complex Networks (2001-09-16 - 2001-09-21) (Details)
  • Dagstuhl Seminar 03361: Algorithmic Aspects of Large and Complex Networks (2003-08-31 - 2003-09-05) (Details)