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 01271

Link Analysis and Visualization

( Jul 01 – Jul 06, 2001 )

Please use the following short url to reference this page:



The seminar is intended to introduce to each other researchers working on different aspects and applications of link analysis and visualization in order to strengthen the algorithmic foundations of this rapidly emerging, highly interdisciplinary, field.

Link analysis explores associations among entities of arbitrary type. It is increasingly recognized as a fruitful extension of categorical approaches to data analysis in a fast growing number of application domains. Example applications are the analysis of linkages on the Web (search engines, site maps), network traffic monitoring (Web caching, public transport), data mining (e-commerce, telecommunications services), social network analysis (social structures, policy making), text analysis (coreference, cocitation), decision support (financial markets, logistics), or fraud detection (money laundring, calling cards).

Typical objectives in these applications are the identification of central or bottleneck entities, structural patterns and trends, effective modifications, hidden or missing data, substructures, appropriate levels of aggregation, similiarities among data sets, etc., and visualiziation has proven crucial in assisting humans to comprehend complex relational structures and identify unexpected patterns.

Areas of research that are generally relevant are, of course, algorithmic graph theory and graph drawing. In addition, many of the methods used in link analysis have originally been developed in the context of social networks. Since many data sets are quite large and automated support is a necessity, we invited experts on algorithms and data structures for large graphs (external memory, implicit representation) and (graph) algorithm engineering as well. The list of invited participants, many of which have never met before, reflects these core competencies, both on the theoretical and applied side.

  • Vladimir Batagelj (University of Ljubljana, SI)
  • James Blythe (USC - Marina del Rey, US)
  • Ulrik Brandes (Universität Konstanz, DE) [dblp]
  • Steven R. Corman (Arizona State University - Tempe, US)
  • Sabine Cornelsen (Universität Konstanz, DE) [dblp]
  • Klaus Holzapfel (TU München, DE)
  • David Jensen (University of Massachusetts - Amherst, US)
  • Jeffrey Johnson (East Carolina University, US)
  • Michael Kaufmann (Universität Tübingen, DE) [dblp]
  • Stephen G. Kobourov (University of Arizona - Tucson, US) [dblp]
  • David Krackhardt (Carnegie Mellon University, US)
  • Lothar Krempel (MPI für Gesellschaftsforschung - Köln, DE) [dblp]
  • Giuseppe Liotta (University of Perugia, IT) [dblp]
  • Alberto Marchetti-Spaccamela (Sapienza University of Rome, IT) [dblp]
  • Cathleen McGrath (Loyola Marymount University, US)
  • Margaret Mitchell (Macquarie University, AU)
  • Rolf H. Möhring (TU Berlin, DE) [dblp]
  • Stefan Näher (Universität Trier, DE)
  • Marcus Raitner (Universität Passau, DE)
  • Marc Rittberger (Universität Konstanz, DE) [dblp]
  • Maja Ruby (DFKI - Kaiserslautern, DE)
  • Roberto Tamassia (Brown University - Providence, US)
  • Ioannis G. Tollis (FORTH - Heraklion, GR)
  • Dorothea Wagner (KIT - Karlsruher Institut für Technologie, DE) [dblp]