2017-03-01: Call for Papers: Graph Drawing and Network Visualization GD 2017 (Deadline: June 11, 2017): Difference between revisions

From InfoVis:Wiki
Jump to navigation Jump to search
(Added GD2017 CFP)
No edit summary
Line 201: Line 201:
* Maarten Löffler (chair), Utrecht University, NL
* Maarten Löffler (chair), Utrecht University, NL
* Ignaz Rutter, Karlsruhe Institute of Technology, DE
* Ignaz Rutter, Karlsruhe Institute of Technology, DE

Latest revision as of 11:03, 15 June 2018

                Call for Papers
                    GD 2017
       25th International Symposium on
   Graph Drawing and Network Visualization
    September 25-27, 2017 - Boston, MA, U.S.A.

PDF version: https://gd2017.ccis.northeastern.edu/files/2017/02/GD2017-CFP.pdf

Graph Drawing is concerned with the geometric representation of graphs and constitutes the algorithmic core of Network Visualization. Graph Drawing and Network Visualization are motivated by applications where it is crucial to visually analyze and interact with relational datasets. Examples of such application areas include data science, social sciences, Web computing, information systems, biology, geography, business intelligence, information security and software engineering.

GD has been the main annual event in this area for more than 20 years. Its focus is on combinatorial and algorithmic aspects of graph drawing as well as the design of network visualization systems and interfaces. GD 2017 will take place September 25-27, 2017 at the Northeastern University in Boston, Massachusetts, USA. Researchers and practitioners working on any aspects of graph drawing and network visualization are invited to contribute papers and posters and to participate in the symposium and the graph drawing contest.


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

Short papers

In addition to the above two tracks, there will be a separate category for short papers, describing theoretical or applied contributions of shorter length. Papers in this category will be assigned a shorter time for presentation during the conference.


Authors of applied papers will have the opportunity to show a demo of their software/system during the poster session.

Submission format

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; in particular, the use of packages such as times.sty is not allowed. Submissions that do not comply with this format risk rejection without consideration of their merits. 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 solicited. The poster session will provide a forum for the communication of late-breaking research results (which may also appear elsewhere) to the GD community. Authors of posters should prepare an abstract (up to 2 pages in the LNCS style) that must be submitted together with the poster itself.


Details about the traditional Graph Drawing Contest held at the conference will be provided on the conference Web site.


All accepted papers (including the two-page poster abstracts) will appear in the conference proceedings, published by Springer in the Lecture Notes in Computer Science (LNCS) series. Twelve pages (excluding references) will be allocated for regular papers and six pages (excluding references) for short papers. The LNCS proceedings will be made freely accessible to the GD community upon publication and openly accessible to anyone after four years.

Authors will be required to submit their accepted papers to the arXiv repository, in order to provide immediate and unrestricted open access to them. The self-archived arXiv papers shall consist of an identical copy of the LNCS proceedings plus an optional clearly marked appendix, possibly containing a long version of the entire paper or proofs that have been omitted from the main text. Subsequent submissions of different versions of the paper to the arXiv (known as arXiv ``replacements’’) are allowed. Upon submission of the camera-ready version of an accepted paper, the authors will be required to specify the arXiv identifier associated with the paper for inclusion in a conference index, which will be also published in the ArXiv repository. Failure to comply with these guidelines will impede the publication of the paper.

Each paper must be presented at the conference by an author (baring unforeseen circumstances), otherwise the paper will not be included in the proceedings. Should any visa restriction prevent an author from attending the conference and presenting a paper, he/she will be given ways to participate and give the talk via electronic means.

Selected papers from both tracks will be invited for submission to a special issue of the Journal of Graph Algorithms and Applications (JGAA). The authors of the best paper in Track 2 will be invited to submit a substantially extended and enhanced version of their work to IEEE Transactions on Visualization and Computer Graphics (TVCG).


For each of the two tracks, the Program Committee of GD 2017 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 2017 attendees.


  • Paper submission deadline: June 11 (23:59 PDT) – Updates possible until June 13 (23:59 PDT)
  • Notification of paper acceptance: July 28
  • Poster submission deadline: August 17 (23:59 PDT)
  • Notification of poster acceptance: August 28
  • Final versions due: September 3
  • Contest submission deadline: September 13
  • Symposium: September 25-27


  • Timothy M. Chan, University of Illinois at Urbana-Champaign, USA
  • TBA


  • Daniel Archambault, Swansea University, GB
  • Benjamin Bach, University of Edinburgh, GB
  • Fabian Beck, Universität Duisburg-Essen, DE
  • Michael Bekos, Universität Tübingen, DE
  • Therese Biedl, University of Waterloo, CA
  • Giordano Da Lozzo, UC Irvine, US
  • Vida Dujmović, University of Ottawa, CA
  • Stephane Durocher, University of Manitoba, CA
  • Tim Dwyer, Monash University, AU
  • Fabrizio Frati (co-chair), Università Roma Tre, IT
  • Martin Gronemann, Universität zu Köln, DE
  • John Alexis Guerra Gómez, Universidad de los Andes, CO
  • Michael Hoffmann, ETH Zürich, CH
  • Yifan Hu, Yahoo Research, US
  • Takayuki Itoh, Ochanomizu University, JP
  • Anna Lubiw, University of Waterloo, CA
  • Kwan-Liu Ma (co-chair), UC Davis, US
  • Fabrizio Montecchiani, Università degli Studi di Perugia, IT
  • Martin Nöllenburg, Technische Universität Wien, AT
  • Arnaud Sallaberry, LIRMM, FR
  • Andrew Suk, University of Illinois at Chicago, US
  • Antonios Symvonis, National Technical University of Athens, GR
  • Ioannis Tollis, University of Crete, GR
  • Csaba Tóth, California State University Northridge, US
  • Alexander Wolff, Universität Würzburg, DE
  • Jian Zhao, FX Palo Alto Laboratory, US


  • Cody Dunne (co-chair), Northeastern University, US
  • Alan Keahey (co-chair), Conversant, US


  • Philipp Kindermann, Universität Würzburg, DE
  • Maarten Löffler (chair), Utrecht University, NL
  • Ignaz Rutter, Karlsruhe Institute of Technology, DE