News:2015-05-07: 2ndCFP: 23rd International Symposium on Graph Drawing and Network Visualization (GD 2015) (Deadline: 12 June 2015)

From InfoVis:Wiki
Jump to navigation Jump to search
GD 2015 - 23rd International Symposium on Graph Drawing and Network Visualization
September 24-26, 2015 - Los Angeles, CA, USA

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 social sciences, Internet and Web computing, information systems, computational biology, networking, VLSI circuit design, and software engineering.

The International Symposium on Graph Drawing has been the main annual event in this area for more than twenty years. This year the Steering Committee of GD decided to extend the name of the conference from the "International Symposium on Graph Drawing" to the "International Symposium on Graph Drawing and Network Visualization" in order to better emphasize the dual focus of the conference on combinatorial and algorithmic aspects as well as the design of network visualization systems and interfaces.

The conference will be hosted by the California State University at Northridge, in Los Angeles, CA, from September 24 to 26, 2015. 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.


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) the following:

  • Design and analysis of graph drawing algorithms
  • Theory of geometric graphs
  • 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) 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 network visualization
  • The engineering of visualization systems and algorithms
  • Experimental results in graph theory and graph algorithms
  • Benchmarks and experimental analysis for network visualization systems and user interfaces
  • Cognitive studies on graph drawing readability and user interaction
  • Interfaces for interacting with graphs

Notes and Demos

Besides the two tracks above there will be a separate category called "Notes and Demos". In this category it will be possible to submit theoretical contributions (notes) and applied papers (demos) of shorter length. Papers in this category will be assigned a shorter time for presentation during the conference. In addition, the authors of demo papers will have the opportunity to make 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 margins and font size 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, while the length of notes and demos is limited 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 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.


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.


Accepted papers (regular ones, notes and demos) will appear in the conference proceedings, published by Springer in the [Lecture Notes in Computer Science] series. Twelve pages will be allocated for regular papers and six for notes and demos. 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 2015 will give a Best Paper Award. In addition, to recognize the effort of participants to present their work in a clear and elegant way, there will be a Best Presentation Award voted on by the GD 2015 attendees.


Paper submission deadline June 12 (23:59 PDT)
Notification of paper acceptance July 22
Poster submission deadline August 18 (23:59 PDT)
Notification of poster acceptance August 28
Final versions due September 3
Contest submission deadline September 21
Symposium on Graph Drawing and Network Visualization September 24-26


Herbert Edelsbrunner, Institute of Science and Technology Austria
Kwan-Liu Ma, University of California at Davis


Carla Binucci, University of Perugia
Prosenjit K. Bose, Carleton University
Giuseppe Di Battista, Roma Tre University
Emilio Di Giacomo (co-chair), University of Perugia
Vida Dujmovic, University of Ottawa
Tim Dwyer, Monash University
Fabrizio Frati, Roma Tre University
Michael Goodrich, University of California, Irvine,
Natalie Henry Riche, Microsoft Research
Yifan Hu, Yahoo Labs
Michael Kaufmann, University of Tübingen
Andreas Kerren, Linnaeus University
Anna Lubiw (co-chair), Univeristy of Waterloo
Tamara Munzner, University of British Columbia
Martin Nöllenburg, Karlsruhe Institute of Technology
Stephen North, Infovisible LLC
Yoshio Okamoto, University of Electro-Communications
Ignaz Rutter, Karlsruhe Institute of Technology
Maria Saumell, University of West Bohemia
Marcus Schaefer, DePaul University
Heidrun Schumann, University of Rostock
Géza Tóth, Alfréd Rényi Institute of Mathematics
Jarke van Wijk, Eindhoven University of Technology
Alexander Wolff, University of Würzburg


Bernardo Ábrego, California State University at Northridge
Silvia Fernández, California State University at Northridge
Csaba D. Tóth (chair), California State University at Northridge


Philipp Kindermann, University of Würzburg
Maarten Löffler (chair), Utrecht University
Lev Nachmanson, Microsoft Research
Ignaz Rutter, Karlsruhe Institute of Technology