21st International Symposium on Graph Drawing
September 23--25, 2013 · Bordeaux, France
Graph Drawing is concerned with the geometric representation of graphs
and networks, and algorithmic methods for visualizing them. It is
motivated by applications where it is crucial to visually analyze and
interact with relational datasets. Examples of such application areas
include social sciences, Internet and Web computing, information
systems, computational biology, networking, VLSI circuit design, and
The International Symposium on Graph Drawing is the main annual event
in this area and will take place from September 23 to 25, 2013, in
Bordeaux, France. Researchers and practitioners working on any aspect
of graph drawing are invited to contribute papers and posters, and to
participate in the symposium and the graph drawing contest.
All deadlines are 23:59 CEST and fixed. There will be no extensions.
Paper submission deadline: June 9, 2013
Notification of paper acceptance: July 20
Poster submission deadline: August 20
Notification of poster acceptance: August 30
Final versions due: September 4
Contest submission deadline: September 20
Symposium on Graph Drawing: September 23-25, 2013
Joe Marks, Upfront Analytics
Tamara Munzner, UBC
Emo Welzl, ETH Zurich
Submitted papers must describe original
research of theoretical or practical significance to graph drawing.
Each paper must be submitted explicitly to one of two distinct tracks.
Papers submitted to one track will not compete with papers submitted
to the other track.
Track 1: Combinatorial and algorithmic aspects
This track is mainly devoted to fundamental graph drawing advances,
such as combinatorial aspects and algorithm design. The range of
topics for this track includes (but is not limited to) the following:
* Design and experimentation of graph drawing algorithms,
* Theory of geometric graphs,
* Geometric computing,
* Planarity and topological graph theory,
* Optimization on graphs.
Track 2: Visualization systems and interfaces
This track is mainly devoted to practical aspects of graph drawing,
such as the development of graph visualization systems and interfaces
in different application areas. The range of topics for this track
includes (but is not limited to) the following:
* Visualization of graphs and networks in application areas (e.g.,
social sciences, biology, geography, software engineering, circuit
design, business intelligence),
* Software systems for graph visualization,
* Interfaces for interacting with graphs,
* Benchmarks and experimental analysis for graph visualization systems
and user interfaces,
* Cognitive studies on graph drawing readability and user interaction.
All submissions must be formatted using the LaTeX style file for the
conference series Lecture Notes in Computer Science (LNCS) provided by
Springer-Verlag. Margins and font size must not be modified.
Submissions that do not comply with this format risk being rejected.
Each submission may be either long (up to 12 pages) or short (up to 6
pages). The claims of the paper should be fully substantiated,
including full proofs or appropriate experimental data. If this
information does not fit within the page limits, the authors should
include it in a clearly marked appendix, whose length is not
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 two pages in the single-spaced LNCS
style). Abstract and poster must be submitted as a single pdf
During the conference there will be a graph drawing contest -- further
details will be available on the conference Web site.
Accepted papers and abstracts of accepted posters will appear in the
conference proceedings, published by Springer-Verlag in the series
Lecture Notes in Computer Science. Selected papers will be invited
for submission to a special issue of the Journal of Graph Algorithms
To recognize the effort of participants to present their work in a
clear and elegant way, a best-presentation award will be given this
year for the first time.
Therese Biedl Univ. Waterloo
Ulrik Brandes Univ. Konstanz
Emilio Di Giacomo Univ. degli Studi di Perugia
Vida Dujmović Carleton Univ.
William Evans Univ. British Columbia
Stefan Felsner Tech. Univ. Berlin
Fabrizio Frati Univ. Sydney
Yifan Hu AT&T Labs Research
Christophe Hurter École Nat. de l'Aviation Civile
Andreas Kerren Linnaeus Univ.
William Lenhart Williams College
Martin Nöllenburg Karlsruhe Inst. Tech.
János Pach EPFL
Helen Purchase Univ. Glasgow
Falk Schreiber Univ. Halle
Andreas Spillner Univ. Greifswald
Antonios Symvonis National Tech. Univ. Athens
Alexandru Telea Univ. Groningen
Csaba Tóth Univ. Calgary
Frank van Ham IBM Software Group
Sue Whitesides Univ. Victoria
Stephen Wismath (co-chair) Univ. Lethbridge
Alexander Wolff (co-chair) Univ. Würzburg
David Auber (chair), Romain Bourqui, Guy Melançon, Bruno Pinaud:
Univ. of Bordeaux I
Christian Duncan Quinnipiac Univ.
Lev Nachmanson Microsoft Research
Carsten Gutwenger (chair) TU Dortmund
Georg Sander IBM
* Contributions to be spread via DMANET are submitted to
* 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)