18th International Symposium
G R A P H D R A W I N G
(GD 2010)
21-24 September, 2010 - Konstanz, Germany
http://www.graphdrawing.org/gd2010/
=======================================================================
submission deadline: June 7, 2010 - notification: July 23, 2010
=======================================================================
Graph Drawing is concerned with the geometric representation of graphs
and networks and is motivated by those applications where it is crucial
to visualize structural information as graphs.
Since graph drawing methods form the algorithmic core of network
visualization, bridging the gap between theoretical advances and
implemented solutions is an important aspect of the conference.
Indeed, advances in graph drawing are important in several technological
areas such as Web computing, e-commerce, VLSI circuit design,
information systems, software engineering, computational cartography,
visual interfaces, bioinformatics, and networking.
Researchers and practitioners working on any aspect of graph drawing
are invited to contribute and participate.
The range of topics includes, but is not limited to:
• visualization of networks from application areas such as the
life sciences, social sciences, geography, engineering,
business intelligence, or communications
• software systems for graph visualization
• interfaces for interacting with graphs
• graph drawing algorithms
• geometric graphs
• planarity and topological graph theory
• graph theory and optimization on graphs
Invited Speakers:
-----------------
Peter Eades, University of Sydney, Australia
Carsten Thomassen, Technical University of Denmark, Lyngby, Denmark
Call for Papers:
----------------
Authors are invited to submit papers describing original research of
theoretical or practical significance to graph drawing, including
demonstrations of software systems. Papers may be either long (up to
12 pages) or short (up to 6 pages), using single-spaced LNCS style. The
claims made in submissions should be fully substantiated, including full
proofs, appropriate experimental data, or system descriptions. If this
information will not fit within the page limits, authors may include
a clearly marked appendix that will be read at the discretion of the
reviewers.
Accepted submissions will be published in the conference proceedings,
which will be included in the Lecture Notes in Computer Science series
of Springer.
Selected papers will be invited for submission to a special issue of
the Journal of Graph Algorithms and Applications.
Call for Posters:
-----------------
Submissions of posters on graph drawing and related areas are also
solicited. The poster session will provide a forum for the communication
of late-breaking research results (which may also appear elsewhere) to
the graph drawing community. Posters should be accompanied by an abstract
(up to 2 pages); abstracts of accepted posters will be included in the
conference proceedings.
Graph Drawing Contest:
----------------------
Following the tradition of previous conferences, a graph drawing contest
will be held. Details about the contest will be provided on the conference
Web site.
Important Dates
---------------
Paper submission: June 7
Notification of acceptance: July 23
Poster submission: August 16
Final versions due: September 10
Contest submission: September 17
Symposium: September 21-24, 2010
Committees:
-----------
Contest Christian Duncan (Louisiana Tech)
Carsten Gutwenger (TU Dortmund)
Lev Nachmanson (Microsoft)
Georg Sander (IBM, chair)
Organization Melanie Badent
Ulrik Brandes (co-chair)
Sabine Cornelsen (co-chair)
Martin Mader
Barbara Pampel
=======================================================================
Gold Sponsors: Tom Sawyer Software, yWorks
Silver Sponsor: Microsoft Research
Contributors: EADS, Siemens
=======================================================================
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************