Dagstuhl-Seminar 01381
Algorithmic Aspects of Large and Complex Networks
( 16. Sep – 21. Sep, 2001 )
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/01381
Organisatoren
- Micah Adler (University of Massachusetts - Amherst, US)
- Friedhelm Meyer auf der Heide (Universität Paderborn, DE)
- Dorothea Wagner (KIT - Karlsruher Institut für Technologie, DE)
Kontakt
Large and complex networks play a central role in a variety of todays and future technologies. Communication, information broadcast, and mobile information systems, as well as political and social acting is modeled in terms of such networks. In order to analyze them, the algorithmic aspects of methods to explore them and to derive necessary new information from them have to be understood thoroughly. Scientists from Computer Science, Mathematics, Electrical Engineering and Humanities use these networks, but apply different methods to solve their specific problems.
The Dagstuhl seminar on "Algorithmic Aspects of Large and Complex Networks," scheduled for September 16-21, 2001, is intended to bring together many of the leading scientists from the different areas to start an exchange of expertise in the field of algorithmic aspects of large and complex networks.
- Rudolf Ahlswede (Universität Bielefeld, DE)
- Susanne Albers (Universität Freiburg, DE) [dblp]
- Andreas Brandstädt (Universität Rostock, DE) [dblp]
- Leslie Ann Goldberg (University of Warwick - Coventry, GB) [dblp]
- Sven Grothklags (Universität Paderborn, DE)
- Horst W. Hamacher (TU Kaiserslautern, DE)
- Klaus Jansen (Universität Kiel, DE) [dblp]
- Michael Kaufmann (Universität Tübingen, DE) [dblp]
- Georg Kliewer (Universität Paderborn, DE)
- Spyros Kontogiannis (University of Ioannina, GR)
- Matthias Krause (Universität Mannheim, DE) [dblp]
- Piotr Krysta (TU Dortmund, 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]
- Stefan Näher (Universität Trier, DE)
- Mike S. Paterson (University of Warwick - Coventry, GB) [dblp]
- Tobias Polzin (MPI für Informatik - Saarbrücken, DE)
- André Pönitz (Hochschule Mittweida, DE)
- Peter Sanders (KIT - Karlsruher Institut für Technologie, DE) [dblp]
- Rüdiger Schultz (Universität Duisburg-Essen, DE)
- Jop Frederik Sibeyn (Martin-Luther-Universität Halle-Wittenberg, DE)
- Christian Sohler (Universität Paderborn, DE) [dblp]
- Anand Srivastav (Christian-Albrechts-Universität zu Kiel, DE) [dblp]
- Peter Tittmann (Hochschule Mittweida, DE) [dblp]
- Siavash Vahdati Daneshmand (Universität Mannheim, DE)
- 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)
- Thomas Willhalm (KIT - Karlsruher Institut für Technologie, DE) [dblp]
- Philipp Woelfel (University of Toronto, CA) [dblp]
- Uwe Zimmermann (TU Braunschweig, DE)
