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 03361

Algorithmic Aspects of Large and Complex Networks

( Aug 31 – Sep 05, 2003 )

(Click in the middle of the image to enlarge)

Please use the following short url to reference this page:



One cornerstone of our modern society is the use of different kinds of networks. Our cities are connec-ted by a network of streets and railways, telecommunication networks including their wireless, mobile components, the internet, and the World Wide Web build the most important infrastructure for com-munication and information worldwide. Designing and managing such networks pose challenging algorithmic problems.
The second Dagstuhl Seminar on ’Algorithmic Aspects of Large and Complex Networks’ brought together 45 researchers (32 Germany, 4 USA, 3 Switzerland, 2 Italy, 1, Slowenia, 1, Poland, 1 Israel, 1 Greece) to discuss recent advances on a huge variety of network problems as described above. Most of the German participants were members of the corresponding DFG research cluster. The purpose of the workshop was to give the opportunity to exchange ideas between researchers working on different areas of complex networks. Interesting talks, fruitful discussions between researchers on different fields and with different background, and the wonderful working and living environment of Schloss Dagstuhl contributed to the success of the workshop. Below we give some examples for the topics considered at the workshop.

Traffic networks.

We discussed the modelling and computation of time tables for large traffic net-works. This included the computation of time tables for trains and airplanes as well as models for individual traffic.

Time dependent networks.

Related to the computation of time tables is the area of time dependent networks. Here we discussed network algorithms that solve variants of standard network problems ( e.g., shortest paths and network flow) on networks that change over time. Basic network services. One of the topics of the workshop was the question how to provide efficient basic services (e.g., routing) for large computer networks.

Mobile and wireless networks.

The design of algorithms for mobile ad hoc networks and sensor networks is one of the challenges at the beginning of the new century. Dangerous jobs (e.g., exploring contaminated terrain) may in future be performed by robots instead of humans. These robots will be connected by wireless ad hoc networks. We discussed models and algorithms for these kinds of networks.

  • Udo Adamy (ETH Zürich, CH)
  • Micah Adler (University of Massachusetts - Amherst, US)
  • Rudolf Ahlswede (Universität Bielefeld, DE)
  • Susanne Albers (Universität Freiburg, DE) [dblp]
  • Vladimir Batagelj (University of Ljubljana, SI)
  • Franz J. Brandenburg (Universität Passau, DE) [dblp]
  • Ulrik Brandes (Universität Konstanz, DE) [dblp]
  • Camil Demetrescu (Sapienza University of Rome, IT) [dblp]
  • Benjamin Doerr (Christian-Albrechts-Universität zu Kiel, DE) [dblp]
  • Ayse Funda Ergun (Simon Fraser University - Burnaby, CA)
  • Thomas Erlebach (University of Leicester, GB) [dblp]
  • Sándor Fekete (TU Braunschweig, DE) [dblp]
  • Ashish Goel (Stanford University, US) [dblp]
  • Horst W. Hamacher (TU Kaiserslautern, DE)
  • Riko Jacob (ETH Zürich, CH) [dblp]
  • Michael Kaufmann (Universität Tübingen, DE) [dblp]
  • Ekkehard Köhler (TU Berlin, DE) [dblp]
  • Piotr Krysta (TU Dortmund, DE) [dblp]
  • Miroslaw Kutylowski (Wroclaw University of Technology, PL)
  • Stefano Leonardi (Sapienza University of Rome, IT) [dblp]
  • Ulf Lorenz (Universität Paderborn, DE)
  • 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]
  • Matthias Müller-Hannemann (TU Darmstadt, DE) [dblp]
  • Harald Räcke (Universität Paderborn, DE) [dblp]
  • Adi Rosén (Technion - Haifa, IL) [dblp]
  • Peter Sanders (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Daniel Sawitzki (TU Dortmund, DE)
  • Christian Scheideler (Johns Hopkins University - Baltimore, US) [dblp]
  • Christian Schindelhauer (Universität Paderborn, DE) [dblp]
  • Anita Schöbel (Universität Göttingen, DE) [dblp]
  • Rüdiger Schultz (Universität Duisburg-Essen, DE)
  • Frank Schulz (KIT - Karlsruher Institut für Technologie, DE)
  • Jop Frederik Sibeyn (Martin-Luther-Universität Halle-Wittenberg, DE)
  • Martin Skutella (TU Dortmund, DE) [dblp]
  • Christian Sohler (Universität Paderborn, DE) [dblp]
  • Anand Srivastav (Christian-Albrechts-Universität zu Kiel, DE) [dblp]
  • Peter Tittmann (Hochschule Mittweida, DE) [dblp]
  • 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]
  • Egon Wanke (Heinrich-Heine-Universität Düsseldorf, DE)
  • Matthias Westermann (TU Dortmund, DE)
  • Christos Zaroliagis (CTI & University of Patras, GR) [dblp]

Related Seminars
  • Dagstuhl Seminar 01381: Algorithmic Aspects of Large and Complex Networks (2001-09-16 - 2001-09-21) (Details)
  • Dagstuhl Seminar 05361: Algorithmic Aspects of Large and Complex Networks (2005-09-04 - 2005-09-09) (Details)