CALL for PAPERS and DEMOS

                               GRAPH DRAWING '95

                    Passau, Germany, September 20 - 22, 1995


Graph Drawing '95 (GD '95) will be held at the University of Passau,
Passau, Germany, September 20 - 22, 1995. The symposium is a forum for
researchers, practitioners, developers and users working on all aspects of
graph drawing. The aim is to present recent research results, to
demonstrate systems for graph drawing and to explore directions for future
research and new applications. It is anticipated that the symposium will
further collaborative efforts between computer scientists, mathematicians,
and applied researchers, both from academia and industry.

GD '95 follows the GD '94 DIMACS Workshop in Princeton, the GD '93 ALCOM
Workshop in Paris and the GD '92 Work Meeting in Rome.


Scope:

Graph drawing addresses the problem of visualizing structural information.
More specifically it is concerned with the construction of geometric
representations of abstract graphs and networks. The automatic generation
of drawings of graphs has important applications in key computer science
technologies such as database design, software engineering, VLSI and
network design and visual interfaces and also in engineering, chemistry and
biology. The range of issues being investigated in graph drawing includes
algorithms, graph theory, order theory, graphic languages, applications and
practical systems.

A great deal of research in graph drawing is motivated by applications to
systems for viewing and interacting with graphs. The interaction between
theoretical advances and implemented solutions is an important part of the
area of graph drawing.


Call for Papers:

Papers describing original research and surveys addressing open problems
and new applications are being sought. Topics of interest include but are
not limited to:


 o    Algorithms, models, and techniques for drawing graphs, such as
      partitioning, layering, orientation, planarization, dynamic layout
      restructuring, graph grammars and declarative specifications.
 o    Drawing algorithms for specific classes of graphs, such as trees,
      planar graphs and order digraphs.
 o    Applications of graph drawing in other areas such as software
      visualization, user interfaces, database queries, information browsers
      and computer aided instruction.
 o    Concepts for visualizations of structural information.
 o    Tools and systems for graph drawing.
 o    Geometric graph theory; 2- and 3-dimensional representations of
      graphs and hypergraphs by geometric relations, such as visibility,
      proximity, intersection and inclusion.
 o    Topological graph theory; combinatorial issues, such as planarity,
      orientations and orders.


Call for Demos:

Submissions of demos are solicited. Areas of interest include, but are not
limited to:

 o    Mathematical visualization of graphs.
 o    Novel graph-based software visualization and software engineering
      applications.
 o    Database visualization with graphs and hypergraphs.
 o    Programming environments for graphs and their layouts.
 o    Algorithm animation with graphs.
 o    User interfaces for viewing graphs, e.g., interactive exploration of
      large graphs and presentation of dynamic graphs.

Program Committee:
        Franz J. Brandenburg chair (Univ. Passau, Germany), 
        Peter Eades (Univ. Newcastle, Australia), 
        J"urgen Ebert (Univ. Koblenz, Germany),
        Michael Kaufmann (Univ. T"ubingen, Germany), 
        Jan Kratochv'il (Charles Univ., Prague,  Czech Republic), 
        Anna Lubiw, (Univ. Waterloo, Canada),  
        Joe Marks (Mitsubishi Electric Research Labs, USA), 
        Kozo Sugiyama (Fujitsu Labs. Ltd., Japan),
        Roberto Tamassia (Brown Univ., USA),
        Ioannis G. Tollis (Univ. Texas at Dallas, USA)

Submission of Papers and Demos:

The program committee invites submissions of papers (6 - 12 page extended
abstract) and demos (2 - 6 page abstract, descriptive screen dumps, and a
list of hardware needed).  Submissions by email (in LaTeX, postscript or
plain text) or hard copy (10 copies) should be sent to the chairman of the
program committee

  Prof. Dr. Franz J. Brandenburg
  Lehrstuhl f"ur Informatik 
  Universit"at Passau
  94030 Passau, Germany 
  gd95@informatik.uni-passau.de

The deadline for submissions is June 1, 1995.  Notification of
acceptance or rejection will be done by email before July 15, 1995.
Camera-ready copies are due at the workshop. Accepted papers and
descriptions of accepted demos will be published in the proceedings of
GD '95, which will appear in the series Lecture Notes in Computer Science of
Springer Verlag.

Information for participants:

Passau is a sightworthy town in the south-east of Germany. It is famous for
its three rivers (Danube, Inn and Ilz) and its historic old town with the
world's largest church organ in the Stephans Dom.

Passau is easily reachable by train; 2 h from Munich or Nuremberg, 3 h from
Vienna and 4.5 h from Frankfurt. By car it takes 2 h to Salzburg and 3 h to
Prague.

For further information about Graph Drawing '95 contact the chairman by
email at gd95@informatik.uni-passau.de or see
http://www.uni-passau.de/gd95.html.