[DMANET] First Call for Papers - Graph Drawing

First Call for Papers – Graph Drawing 2014
22nd International Symposium on Graph Drawing
September 24-26, 2014 • Würzburg, Germany
http://gd2014.informatik.uni-wuerzburg.de/

Graph Drawing is concerned with the geometric representation of graphs
and networks and the 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
software engineering.

The International Symposium on Graph Drawing is the main annual event
in this area and will be hosted by the University of Würzburg from
September 24 to 26, 2014, in Würzburg, Germany. Researchers and
practitioners working on any aspect of graph drawing and network
visualization are invited to contribute papers and posters and to
participate in the symposium and the graph drawing contest.

IMPORTANT DATES

All deadlines are 23:59 GMT and fixed. There will be no extensions.

Paper submission deadline: June 13, 2014
Notification of paper acceptance: July 23
Poster submission deadline: August 19
Notification of poster acceptance: August 29
Final versions due: September 3
Contest submission deadline: September 22
Symposium on Graph Drawing: September 24-26

INVITED SPEAKERS

Oswin Aichholzer, TU Graz
Jean-Daniel Fekete, INRIA, Paris

PAPERS

Submitted papers must describe original research of theoretical or
practical significance to graph drawing and network visualization.
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 analysis of graph drawing algorithms
- Theory of geometric graphs
- Geometric computing
- Geometric and topological graph theory
- Optimization on graphs

Track 2: Experimental, applied, and network visualization aspects

This track is mainly devoted to the practical aspects of graph
drawing, such as the development of network 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, cartography, software engineering,
circuit design, business intelligence)
- Software systems for graph visualization
- The engineering of visualization systems and algorithms
- Experimental results in graph theory and graph algorithms
- Benchmarks and experimental analysis for graph visualization
systems and user interfaces
- Cognitive studies on graph drawing readability and user interaction
- Interfaces for interacting with graphs

All submissions must be formatted using the LATEX style file for the
conference series Lecture Notes in Computer Science (LNCS) provided by
Springer-Verlag. The margins and font size must not be
modified. Submissions that do not comply with this format risk being
rejected. Each submission may be up to 12 pages in length. 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 constrained and which the
reviewers may read at their own discretion.

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 two pages in the single-spaced LNCS
style). The abstract and poster must be submitted as a single pdf
document.

CONTEST

The graph drawing contest held in conjunction with the conference
traditionally begins after the initial paper submission deadline has
passed. Further details will be available on the conference website.

PUBLICATION

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
and Applications.

AWARD

To recognize the effort of participants to present their work in a
clear and elegant way, a best-presentation award will once again be
given this year.

PROGRAM COMMITTEE

Patrizio Angelini, Univ. Roma Tre
Daniel Archambault, Swansea Univ.
David Auber, LaBRI, Univ. Bordeaux
Michael Bekos, Nat. Tech. Univ. Athens
Anastasia Bezerianos, LRI-Univ. Paris-Sud
Franz Brandenburg, Univ. Passau
Erin Chambers, St. Louis Univ.
Stephan Diehl, Univ. Trier
Christian Duncan (co-chair), Quinnipiac Univ.
Tim Dwyer, Monash Univ.
David Eppstein, Univ. of California, Irvine
Emden Gansner, AT&T Research Labs
Michael Kaufmann, Univ. Tuebingen
Stephen Kobourov, Univ. of Arizona
Jan Kratochvíl, Charles Univ. Prague
Giuseppe Liotta, Univ. of Perugia
Maarten Löffler, Utrecht Univ.
Anna Lubiw, Univ. of Waterloo
Petra Mutzel, Univ. Dortmund
Lev Nachmanson, Microsoft Research
Antonios Symvonis (co-chair), Nat. Tech. Univ. Athens
Ioannis Tollis, Univ. of Crete
Dorothea Wagner, Karlsruhe Inst. Tech.
Hsu-Chun Yen, Nat. Taiwan Univ.

ORGANIZING COMMITTEE

Krzysztof Fleszar, Univ. of Würzburg
Philipp Kindermann, Univ. of Würzburg
Joachim Spoerhase, Univ. of Würzburg
Alexander Wolff (chair), Univ. of Würzburg

CONTEST COMMITTEE

Carsten Gutwenger (chair), TU Dortmund
Maarten Löffler, Utrecht Univ.
Lev Nachmanson, Microsoft Research
Ignaz Rutter, Karlsruhe Inst. Tech.


**********************************************************
*
* 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/
*
**********************************************************