<html><head></head><body><div style="color:#000; background-color:#fff; font-family:Helvetica Neue-Light, Helvetica Neue Light, Helvetica Neue, Helvetica, Arial, Lucida Grande, Sans-Serif;font-size:16px"><div id="yui_3_16_0_1_1455383417824_2594" class="">====================================================================</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2693" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class=""> Call for Papers</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2697" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class=""> GD 2016</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2701" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class=""> 24th International Symposium on</div><div id="yui_3_16_0_1_1455383417824_2594" class=""> Graph Drawing and Network Visualization</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2706" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class=""> September 19-21, 2016 – Athens, Greece</div><div id="yui_3_16_0_1_1455383417824_2594" class=""> http://algo.math.ntua.gr/~gd2016/</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2711" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">====================================================================</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2715" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Graph Drawing is concerned with the geometric representation of graphs and</div><div id="yui_3_16_0_1_1455383417824_2594" class="">constitutes the algorithmic core of Network Visualization. Graph Drawing and</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Network Visualization are motivated by applications where it is crucial to</div><div id="yui_3_16_0_1_1455383417824_2594" class="">visually analyze and interact with relational datasets. Examples of such</div><div id="yui_3_16_0_1_1455383417824_2594" class="">application areas include data science, social sciences, Web computing,</div><div id="yui_3_16_0_1_1455383417824_2594" class="">information systems, biology, geography, business intelligence, information</div><div id="yui_3_16_0_1_1455383417824_2594" class="">security and software engineering.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2725" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">GD has been the main annual event in this area for more than 20 years. Its</div><div id="yui_3_16_0_1_1455383417824_2594" class="">focus is on combinatorial and algorithmic aspects of graph drawing as well as</div><div id="yui_3_16_0_1_1455383417824_2594" class="">the design of network visualization systems and interfaces. GD 2016 will be</div><div id="yui_3_16_0_1_1455383417824_2594" class="">hosted by the Institute of Communications and Computer Systems, an affiliate of</div><div id="yui_3_16_0_1_1455383417824_2594" class="">the National Technical University of Athens from September 19 to 21, 2016 in</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Athens, Greece. Researchers and practitioners working on any aspect of graph</div><div id="yui_3_16_0_1_1455383417824_2594" class="">drawing and network visualization are invited to contribute papers and posters</div><div id="yui_3_16_0_1_1455383417824_2594" class="">and to participate in the symposium and the graph drawing contest.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2736" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">PAPERS</div><div id="yui_3_16_0_1_1455383417824_2594" class="">------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2741" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">We invite authors to submit papers describing original research of theoretical</div><div id="yui_3_16_0_1_1455383417824_2594" class="">or practical significance to graph drawing and network visualization. Regular</div><div id="yui_3_16_0_1_1455383417824_2594" class="">papers must be submitted explicitly to one of two distinct tracks. Papers</div><div id="yui_3_16_0_1_1455383417824_2594" class="">submitted to one track will not compete with papers submitted to the other</div><div id="yui_3_16_0_1_1455383417824_2594" class="">track.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2749" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Track 1: Combinatorial and algorithmic aspects</div><div id="yui_3_16_0_1_1455383417824_2594" class="">----------------------------------------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2754" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">This track is mainly devoted to fundamental graph drawing advances, such as</div><div id="yui_3_16_0_1_1455383417824_2594" class="">combinatorial aspects and algorithm design. The range of topics for this track</div><div id="yui_3_16_0_1_1455383417824_2594" class="">includes (but is not limited to):</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2760" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Design and analysis of graph drawing algorithms</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Geometric graph theory</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Geometric computing</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Planarity and topological graph theory</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Optimization on graphs</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2768" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Track 2: Experimental, applied, and network visualization aspects</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-----------------------------------------------------------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2773" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">This track is mainly devoted to the practical aspects of graph drawing, such as</div><div id="yui_3_16_0_1_1455383417824_2594" class="">the development of network visualization systems and interfaces in different</div><div id="yui_3_16_0_1_1455383417824_2594" class="">application areas. The range of topics for this track includes (but is not</div><div id="yui_3_16_0_1_1455383417824_2594" class="">limited to):</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2780" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Visualization of graphs and networks in real world applications, including big data</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Engineering of network visualization algorithms and systems</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Experimental results in graph theory and algorithms</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Benchmarks and experimental studies of network visualization systems and user interfaces</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Cognitive studies on graph drawing readability and user interaction</div><div id="yui_3_16_0_1_1455383417824_2594" class="">• Interfaces and methods for interacting with graphs</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2789" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Short papers</div><div id="yui_3_16_0_1_1455383417824_2594" class="">------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2794" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Besides regular papers in the two tracks above there will be a separate</div><div id="yui_3_16_0_1_1455383417824_2594" class="">category for short papers. In this category it will be possible to submit</div><div id="yui_3_16_0_1_1455383417824_2594" class="">theoretical contributions and applied papers of shorter length. Papers in this</div><div id="yui_3_16_0_1_1455383417824_2594" class="">category will be assigned a shorter time for presentation during the conference.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2801" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Demos</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-----</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2806" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Authors of applied regular and short papers will have the opportunity to show a</div><div id="yui_3_16_0_1_1455383417824_2594" class="">demo of their software/system during the poster session.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2811" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Submission format</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-----------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2816" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">All submissions must be formatted using the LaTeX style file for the conference</div><div id="yui_3_16_0_1_1455383417824_2594" class="">series Lecture Notes in Computer Science (LNCS) provided by Springer. The</div><div id="yui_3_16_0_1_1455383417824_2594" class="">default margins and fonts must not be modified. Submissions that do not comply</div><div id="yui_3_16_0_1_1455383417824_2594" class="">with this format risk being rejected. The length of regular papers is limited</div><div id="yui_3_16_0_1_1455383417824_2594" class="">to 12 pages (excluding references), while the length of short papers is limited</div><div id="yui_3_16_0_1_1455383417824_2594" class="">to 6 pages (excluding references). The claims of the paper should be fully</div><div id="yui_3_16_0_1_1455383417824_2594" class="">substantiated, including full proofs or appropriate experimental data. If this</div><div id="yui_3_16_0_1_1455383417824_2594" class="">information does not fit within the page limits, the authors should include it</div><div id="yui_3_16_0_1_1455383417824_2594" class="">in a clearly marked appendix, whose length is not constrained and which the</div><div id="yui_3_16_0_1_1455383417824_2594" class="">reviewers may read at their own discretion.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2829" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">POSTERS</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2834" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Submissions of posters on graph drawing, network visualization, and related</div><div id="yui_3_16_0_1_1455383417824_2594" class="">areas are also solicited. The poster session will provide a forum for the</div><div id="yui_3_16_0_1_1455383417824_2594" class="">communication of late-breaking research results (which may also appear</div><div id="yui_3_16_0_1_1455383417824_2594" class="">elsewhere) to the graph drawing community. Authors of posters should prepare an</div><div id="yui_3_16_0_1_1455383417824_2594" class="">abstract (up to two pages in the LNCS style) that must be submitted together</div><div id="yui_3_16_0_1_1455383417824_2594" class="">with the poster itself.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2843" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">CONTEST</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2848" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Details about the traditional Graph Drawing Contest held at the conference will</div><div id="yui_3_16_0_1_1455383417824_2594" class="">be provided on the conference Web site.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2853" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">PUBLICATION</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-----------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2858" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">All accepted papers will appear in the conference proceedings, published by</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Springer in the Lecture Notes in Computer Science (LNCS) series and, following</div><div id="yui_3_16_0_1_1455383417824_2594" class="">a green open access policy, as a conference index on the arXiv repository. The</div><div id="yui_3_16_0_1_1455383417824_2594" class="">LNCS proceedings will be made freely accessible to the GD community upon</div><div id="yui_3_16_0_1_1455383417824_2594" class="">publication and openly accessible to anyone after four years. The self-archived</div><div id="yui_3_16_0_1_1455383417824_2594" class="">arXiv proceedings will provide immediate and unrestricted open access. Twelve</div><div id="yui_3_16_0_1_1455383417824_2594" class="">pages (excluding references) will be allocated for regular papers and six pages</div><div id="yui_3_16_0_1_1455383417824_2594" class="">(excluding references) for short papers. Upon submission of the camera-ready</div><div id="yui_3_16_0_1_1455383417824_2594" class="">version of accepted papers, the identical paper (optionally including a clearly</div><div id="yui_3_16_0_1_1455383417824_2594" class="">marked appendix) must be submitted to the arXiv repository and its arXiv</div><div id="yui_3_16_0_1_1455383417824_2594" class="">identifier must be specified for inclusion in the conference index. Abstracts</div><div id="yui_3_16_0_1_1455383417824_2594" class="">of accepted posters will also appear in the conference proceedings (two pages),</div><div id="yui_3_16_0_1_1455383417824_2594" class="">but will not be made available for indexing. Selected papers will be invited</div><div id="yui_3_16_0_1_1455383417824_2594" class="">for submission to a special issue of the Journal of Graph Algorithms and</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Applications.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2876" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">AWARDS</div><div id="yui_3_16_0_1_1455383417824_2594" class="">------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2881" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">For each of the two tracks, the Program Committee of GD 2016 will give a Best</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Paper Award. In addition, to recognize the effort of participants to present</div><div id="yui_3_16_0_1_1455383417824_2594" class="">their work and to prepare their posters in a clear and elegant way, there will</div><div id="yui_3_16_0_1_1455383417824_2594" class="">be a Best Presentation Award and a Best Poster Award voted on by the GD 2016</div><div id="yui_3_16_0_1_1455383417824_2594" class="">attendees.</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2889" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2892" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">IMPORTANT DATES</div><div id="yui_3_16_0_1_1455383417824_2594" class="">---------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2897" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Paper submission deadline June 12 (23:59 PDT)</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Notification of paper acceptance July 24</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Poster submission deadline August 17 (23:59 PDT)</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Notification of poster acceptance August 28</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Final versions due September 1</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Contest submission deadline September 11</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Symposium on Graph Drawing and Network Visualization September 19-21</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2907" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">INVITED SPEAKERS</div><div id="yui_3_16_0_1_1455383417824_2594" class="">----------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2912" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Daniel Keim, University of Konstanz, DE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Roger Wattenhofer, ETH Zurich, CH</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2917" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">PROGRAM COMMITTEE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-----------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2922" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Patrizio Angelini, University of Tübingen, DE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Therese Biedl, University of Waterloo, CA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Walter Didimo, University of Perugia, IT</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Cody Dunne, IBM Watson Health, USA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">David Eppstein, UC Irvine, USA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Jean-Daniel Fekete, INRIA, FR</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Stefan Felsner, TU Berlin, DE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Radoslav Fulek, IST Austria, AT</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Emden Gansner, Google, USA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Yifan Hu (co-chair), Yahoo Labs, USA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Karsten Klein, Monash University, AU</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Stephen Kobourov, University of Arizona, USA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Marc van Kreveld, Utrecht University, NL</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Jan Kynčl, Charles University Prague, CZ</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Kwan-Liu Ma, UC Davis, USA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Tamara Mchedlidze, Karlsruhe Institute of Technology, DE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Martin Nöllenburg (co-chair), TU Vienna, AT</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Stephen North, Infovisible, Oldwick, USA</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Maurizio Patrignani, Roma Tre University, IT</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Helen Purchase, University of Glasgow, UK</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Huamin Qu, HKUST, Hong Kong</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Günter Rote, FU Berlin, DE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">André Schulz, University of Hagen, DE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Lei Shi, Chinese Academy of Science, CN</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Alexandru Telea, University of Groningen, NL</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2950" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">ORGANIZING COMMITTEE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">--------------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2955" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Kostas Karpouzis, National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Chrysanthi Raftopoulou, National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Antonios Symvonis (chair), National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2961" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">CONTEST COMMITTEE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">-----------------</div><div id="yui_3_16_0_1_1455383417824_2594" class=""><br id="yui_3_16_0_1_1455383417824_2966" class=""></div><div id="yui_3_16_0_1_1455383417824_2594" class="">Philipp Kindermann, University of Hagen, DE</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Maarten Löffler (chair), Utrecht University, NL</div><div id="yui_3_16_0_1_1455383417824_2594" class="">Lev Nachmanson, Microsoft Research, USA</div><div id="yui_3_16_0_1_1455383417824_2594" dir="ltr" class="">Ignaz Rutter, Karlsruhe Institute of Technology, DE</div></div></body></html>