2019-04-29: CFP: GD 2019, 27th Symposium on Graph Drawing and Network Visualization, Deadline June 10, 2019: Difference between revisions

From InfoVis:Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 139: Line 139:
* Tamara Mchedlidze, Karlsruhe Institute of Technology
* Tamara Mchedlidze, Karlsruhe Institute of Technology
* Ignaz Rutter, University of Passau
* Ignaz Rutter, University of Passau
[[Category: News]][[Category: 2019/04]]

Latest revision as of 10:49, 3 May 2019


                Call for Papers
                    GD 2019
       27th International Symposium on
   Graph Drawing and Network Visualization
   September 17-20, 2019 - Prague, Czech Republic
          https://kam.mff.cuni.cz/gd2019/

PDF version: https://kam.mff.cuni.cz/gd2019/callForPapers.pdf


New to the GD Applied Track: The authors of two selected papers in Track 2 will be invited to submit a substantially extended version of their work to IEEE Transactions on Visualization and Computer Graphics (TVCG).

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 25 years. Its focus is on combinatorial and algorithmic aspects of graph drawing as well as the design of network visualization systems and interfaces. GD 2019 will take place September 17-20, 2019, at the Floret conference center in Pruhonice near Prague, Czech Republic. 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

Papers:

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 described below. 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 and topological graph theory
  • Computational topology of graphs on surfaces
  • Geometric network design and optimization
  • Geometric computing

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 analysis
  • 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

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

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.

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

All submissions will be handled through EasyChair at the web site https://easychair.org/conferences/?conf=gd2019

Posters & Contest:

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 are provided on the contest web site.

       http://graphdrawing.de/contest2019/contest.html

Publication:

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. 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 the LNCS proceedings version (identical, except for possibly changed references to the appendix resp. the arXiv version) plus an optional clearly marked appendix. Subsequent submissions of revised versions of the paper to the arXiv (known as arXiv "replacements") are allowed. Failure to comply with these guidelines will impede the publication of the paper.

Each paper or poster must be presented at the conference by an author (barring 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 two selected papers in Track 2 will be invited to submit a substantially extended version of their work to IEEE Transactions on Visualization and Computer Graphics (TVCG).

Awards:

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

Important Dates:

  • Abstract submission deadline June 10 (23:59 PDT)
  • Paper submission deadline June 12 (23:59 PDT)
  • Notification of paper acceptance July 22
  • Poster submission deadline August 12 (23:59 PDT)
  • Notification of poster acceptance August 21
  • Final versions due August 26 (23:59 PDT)
  • Contest submission deadline September 5 (23:59 PDT)
  • Symposium September 17-20

Invited Speakers:

  • Giuseppe Di Battista, Roma Tre University, Italy
  • John T. Stasko, Georgia Institute of Technology, USA
  • Bartosz Walczak, Jagiellonian University, Poland


Program Committee:

  • Daniel Archambault (co-chair), Swansea University
  • David Auber, Université Bordeaux I
  • Benjamin Bach, The University of Edinburgh
  • Fabian Beck, University of Duisburg-Essen
  • Michael Bekos, University of Tübingen
  • Prosenjit Bose, Carleton University
  • Maike Buchin, Technical University of Dortmund
  • Nan Cao, Tongji University
  • Giordano Da Lozzo, Roma Tre University
  • Emilio Di Giacomo, University of Perugia
  • Tim Dwyer, Monash University
  • David Eppstein, University of California, Irvine
  • Yifan Hu, Yahoo!
  • Irina Kostitsyna, TU Eindhoven
  • Jan Kynčl, Charles University
  • Anna Lubiw, University of Waterloo
  • Maarten Löffler, Utrecht University
  • Kwan-Liu Ma, University of California, Davis
  • Silvia Miksch, Vienna University of Technology
  • Kazuo Misue, University of Tsukuba
  • Helen Purchase, University of Glasgow
  • Ignaz Rutter, University of Passau
  • Alexandru Telea, Utrecht University
  • Csaba Tóth (co-chair), California State University, Northridge
  • Torsten Ueckerdt, Karlsruhe Institute of Technology
  • Birgit Vogtenhuber, Graz University of Technology
  • Hsiang-Yun Wu, Vienna University of Technology

Organizing Committee:

  • Martin Balko, Charles University
  • Jiři Fiala (co-chair), Charles University
  • Anna Kotěšovcová, Charles University
  • Pavel Valtr (co-chair), Charles University

Contest Committee:

  • Philipp Kindermann (chair), University of Würzburg
  • Tamara Mchedlidze, Karlsruhe Institute of Technology
  • Ignaz Rutter, University of Passau