TOP
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
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 9620

Graph Algorithms and Applications

( May 13 – May 17, 1996 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/9620

Organizers
  • D. Wagner
  • R. Tamassia
  • T. Nishizeki




Motivation

In many fields of applications graphs or networks play an important role for understanding a concrete situation and modelling problems. The development of algorithms for communication problems, traffic optimization, scheduling or VLSI-design is for example based on graphs. Algorithmic graph theory is a classical area of research by now and has been rapidly expanding during the last three decades. Especially, the interplay between theory and application gave research in this area again and again new impetus.

While the complexity of today’s “real world” problems is increasing the design of “sophisticated” algorithms is an ambitious task. Numerous newly invented problems coming from new fields of applications have attracted the attention of researchers in algorithmic graph theory. But, in recent years also classical problems were studied again. For several fundamental graph problems efficient and simple algorithms were designed in view of the computer implementation of such algorithms.

This seminar was intended to bring together researchers from different areas in algorithmic graph theory. Particular emphasis was placed on applications, experimental research and aspects of the implementation of graph algorithms. The participants had the opportunity to exchange ideas and discuss new trends in algorithmic graph theory. Main topics of interest were efficient graph algorithms, graph drawing, algorithm animation with graphs, implementation of graph algorithms and applications in VLSI-design, traffic optimization, and CAD.

We had 36 participants from different European countries, Australia, USA, Canada, Japan and Taiwan. During the workshop 28 lectures have been presented and two software demonstrations. There was also an open-problem-session on Tuesday evening and a lively discussion on problems from different fields of application. Schloß Dagstuhl and its staff provided a very convenient and stimulating environment. All participants appreciated the cordial atmosphere. The organizers wish to thank all those who helped make the workshop a fruitful research experience.

Copyright

Participants
  • D. Wagner
  • R. Tamassia
  • T. Nishizeki

Related Seminars
  • Dagstuhl Seminar 98301: Graph Algorithms and Applications (1998-07-27 - 1998-07-31) (Details)