We invite authors to submit papers describing original research of theoretical or practical significance to graph drawing and network visualization. Regular papers 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):
- Design and analysis of graph drawing algorithms
- Geometric graph theory
- Geometric computing
- Planarity 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):
- Visualization of graphs and networks in real world applications, including big data
- Engineering of network visualization algorithms and systems
- Experimental results in graph theory and algorithms
- Benchmarks and experimental studies of network visualization systems and user interfaces
- Cognitive studies on graph drawing readability and user interaction
- Interfaces and methods for interacting with graphs
Besides regular papers in the two tracks above there will be a separate category for short papers. In this category it will be possible to submit theoretical contributions and applied papers of shorter length. Papers in this category will be assigned a shorter time for presentation during the conference.
Authors of applied regular and short papers will have the opportunity to show a demo of their software/system during the poster session.
All submissions must be formatted using the LaTeX style file for the conference series Lecture Notes in Computer Science (LNCS) provided by Springer. The default margins and fonts must not be modified. Submissions that do not comply with this format risk being rejected. The length of regular papers is limited to 12 pages (excluding references), while the length of short papers is limited to 6 pages (excluding references). 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.
Submissions of posters on graph drawing, network visualization, 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. Authors of posters should prepare an abstract (up to two pages in the LNCS style) that must be submitted together with the poster itself.
All accepted papers will appear in the conference proceedings, published by Springer in the Lecture Notes in Computer Science (LNCS) series and, following a green open access policy, as a conference index on the arXiv repository. The LNCS proceedings will be made freely accessible to the GD community upon publication and openly accessible to anyone after four years. The self-archived arXiv proceedings will provide immediate and unrestricted open access. Twelve pages (excluding references) will be allocated for regular papers and six pages (excluding references) for short papers. Upon submission of the camera-ready version of accepted papers, the identical paper (optionally including a clearly marked appendix) must be submitted to the arXiv repository and its arXiv identifier must be specified for inclusion in the conference index. For each paper, an author must register and present the paper at the conference (baring unforeseen circumstances) otherwise the paper will not be included in the proceedings. Abstracts of accepted posters will also appear in the conference proceedings (two pages), but will not be made available for indexing. Selected papers will be invited for submission to a special issue of the Journal of Graph Algorithms and Applications.
For each of the two tracks, the Program Committee of GD 2016 will give a Best Paper Award. In addition, to recognize the effort of participants to present their work and to prepare their posters in a clear and elegant way, there will be a Best Presentation Award and a Best Poster Award voted on by the GD 2016 attendees.
All deadlines are 23:59 PDT and fixed. There will be no extensions.
|Paper submission deadline:||June 12, 2016 (updates possible until June 14)|
|Notification of paper acceptance:||July 24, 2016|
|Poster submission deadline:||August 17, 2016|
|Notification of poster acceptance:||August 28, 2016|
|Early registration deadline:||August 30, 2016|
|Final versions due:||September 1, 2016|
|Contest submission deadline:||September 11, 2016|
|Symposium:||September 19-21, 2016|