<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_ym19_1_1460978027696_14635">====================================================================</div><div id="yui_3_16_0_ym19_1_1460978027696_14636"><br id="yui_3_16_0_ym19_1_1460978027696_14637"></div><div id="yui_3_16_0_ym19_1_1460978027696_14638"> Call for Papers</div><div id="yui_3_16_0_ym19_1_1460978027696_14639"><br id="yui_3_16_0_ym19_1_1460978027696_14640"></div><div id="yui_3_16_0_ym19_1_1460978027696_14641"> GD 2016</div><div id="yui_3_16_0_ym19_1_1460978027696_14642"><br id="yui_3_16_0_ym19_1_1460978027696_14643"></div><div id="yui_3_16_0_ym19_1_1460978027696_14644"> 24th International Symposium on</div><div id="yui_3_16_0_ym19_1_1460978027696_14645"> Graph Drawing and Network Visualization</div><div id="yui_3_16_0_ym19_1_1460978027696_14646"><br id="yui_3_16_0_ym19_1_1460978027696_14647"></div><div id="yui_3_16_0_ym19_1_1460978027696_14648"> September 19-21, 2016 – Athens, Greece</div><div id="yui_3_16_0_ym19_1_1460978027696_14649"> http://algo.math.ntua.gr/~gd2016/</div><div id="yui_3_16_0_ym19_1_1460978027696_14650"><br id="yui_3_16_0_ym19_1_1460978027696_14651"></div><div id="yui_3_16_0_ym19_1_1460978027696_14652">====================================================================</div><div id="yui_3_16_0_ym19_1_1460978027696_14653"><br id="yui_3_16_0_ym19_1_1460978027696_14654"></div><div id="yui_3_16_0_ym19_1_1460978027696_14655">Graph Drawing is concerned with the geometric representation of graphs and</div><div id="yui_3_16_0_ym19_1_1460978027696_14656">constitutes the algorithmic core of Network Visualization. Graph Drawing and</div><div id="yui_3_16_0_ym19_1_1460978027696_14657">Network Visualization are motivated by applications where it is crucial to</div><div id="yui_3_16_0_ym19_1_1460978027696_14658">visually analyze and interact with relational datasets. Examples of such</div><div id="yui_3_16_0_ym19_1_1460978027696_14659">application areas include data science, social sciences, Web computing,</div><div id="yui_3_16_0_ym19_1_1460978027696_14660">information systems, biology, geography, business intelligence, information</div><div id="yui_3_16_0_ym19_1_1460978027696_14661">security and software engineering.</div><div id="yui_3_16_0_ym19_1_1460978027696_14662"><br id="yui_3_16_0_ym19_1_1460978027696_14663"></div><div id="yui_3_16_0_ym19_1_1460978027696_14664">GD has been the main annual event in this area for more than 20 years. Its</div><div id="yui_3_16_0_ym19_1_1460978027696_14665">focus is on combinatorial and algorithmic aspects of graph drawing as well as</div><div id="yui_3_16_0_ym19_1_1460978027696_14666">the design of network visualization systems and interfaces. GD 2016 will be</div><div id="yui_3_16_0_ym19_1_1460978027696_14667">hosted by the Institute of Communications and Computer Systems, an affiliate of</div><div id="yui_3_16_0_ym19_1_1460978027696_14668">the National Technical University of Athens from September 19 to 21, 2016 in</div><div id="yui_3_16_0_ym19_1_1460978027696_14669">Athens, Greece. Researchers and practitioners working on any aspect of graph</div><div id="yui_3_16_0_ym19_1_1460978027696_14670">drawing and network visualization are invited to contribute papers and posters</div><div id="yui_3_16_0_ym19_1_1460978027696_14671">and to participate in the symposium and the graph drawing contest.</div><div id="yui_3_16_0_ym19_1_1460978027696_14672"><br id="yui_3_16_0_ym19_1_1460978027696_14673"></div><div id="yui_3_16_0_ym19_1_1460978027696_14674">PAPERS</div><div id="yui_3_16_0_ym19_1_1460978027696_14675">------</div><div id="yui_3_16_0_ym19_1_1460978027696_14676"><br id="yui_3_16_0_ym19_1_1460978027696_14677"></div><div id="yui_3_16_0_ym19_1_1460978027696_14678">We invite authors to submit papers describing original research of theoretical</div><div id="yui_3_16_0_ym19_1_1460978027696_14679">or practical significance to graph drawing and network visualization. Regular</div><div id="yui_3_16_0_ym19_1_1460978027696_14680">papers must be submitted explicitly to one of two distinct tracks. Papers</div><div id="yui_3_16_0_ym19_1_1460978027696_14681">submitted to one track will not compete with papers submitted to the other</div><div id="yui_3_16_0_ym19_1_1460978027696_14682">track.</div><div id="yui_3_16_0_ym19_1_1460978027696_14683"><br id="yui_3_16_0_ym19_1_1460978027696_14684"></div><div id="yui_3_16_0_ym19_1_1460978027696_14685">Track 1: Combinatorial and algorithmic aspects</div><div id="yui_3_16_0_ym19_1_1460978027696_14686">----------------------------------------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14687"><br id="yui_3_16_0_ym19_1_1460978027696_14688"></div><div id="yui_3_16_0_ym19_1_1460978027696_14689">This track is mainly devoted to fundamental graph drawing advances, such as</div><div id="yui_3_16_0_ym19_1_1460978027696_14690">combinatorial aspects and algorithm design. The range of topics for this track</div><div id="yui_3_16_0_ym19_1_1460978027696_14691">includes (but is not limited to):</div><div id="yui_3_16_0_ym19_1_1460978027696_14692"><br id="yui_3_16_0_ym19_1_1460978027696_14693"></div><div id="yui_3_16_0_ym19_1_1460978027696_14694"><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14695">• Design and analysis of graph drawing algorithms<br id="yui_3_16_0_ym19_1_1460978027696_14696"></div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14697">• Geometric graph theory</div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14698">• Geometric computing</div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14699">• Planarity and topological graph theory</div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14700">• Optimization on graphs</div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14701"><br id="yui_3_16_0_ym19_1_1460978027696_14702"></div></div><div id="yui_3_16_0_ym19_1_1460978027696_14703">Track 2: Experimental, applied, and network visualization aspects</div><div id="yui_3_16_0_ym19_1_1460978027696_14704">-----------------------------------------------------------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14705"><br id="yui_3_16_0_ym19_1_1460978027696_14706"></div><div id="yui_3_16_0_ym19_1_1460978027696_14707">This track is mainly devoted to the practical aspects of graph drawing, such as</div><div id="yui_3_16_0_ym19_1_1460978027696_14708">the development of network visualization systems and interfaces in different</div><div id="yui_3_16_0_ym19_1_1460978027696_14709">application areas. The range of topics for this track includes (but is not</div><div id="yui_3_16_0_ym19_1_1460978027696_14710">limited to):</div><div id="yui_3_16_0_ym19_1_1460978027696_14711"><br id="yui_3_16_0_ym19_1_1460978027696_14712"></div><div id="yui_3_16_0_ym19_1_1460978027696_14713">• Visualization of graphs and networks in real world applications, including big data</div><div id="yui_3_16_0_ym19_1_1460978027696_14714">• Engineering of network visualization algorithms and systems</div><div id="yui_3_16_0_ym19_1_1460978027696_14715">• Experimental results in graph theory and algorithms</div><div id="yui_3_16_0_ym19_1_1460978027696_14716">• Benchmarks and experimental studies of network visualization systems and user interfaces</div><div id="yui_3_16_0_ym19_1_1460978027696_14717">• Cognitive studies on graph drawing readability and user interaction</div><div id="yui_3_16_0_ym19_1_1460978027696_14718">• Interfaces and methods for interacting with graphs</div><div id="yui_3_16_0_ym19_1_1460978027696_14719"><br id="yui_3_16_0_ym19_1_1460978027696_14720"></div><div id="yui_3_16_0_ym19_1_1460978027696_14721">Short papers</div><div id="yui_3_16_0_ym19_1_1460978027696_14722">------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14723"><br id="yui_3_16_0_ym19_1_1460978027696_14724"></div><div id="yui_3_16_0_ym19_1_1460978027696_14725">Besides regular papers in the two tracks above there will be a separate</div><div id="yui_3_16_0_ym19_1_1460978027696_14726">category for short papers. In this category it will be possible to submit</div><div id="yui_3_16_0_ym19_1_1460978027696_14727">theoretical contributions and applied papers of shorter length. Papers in this</div><div id="yui_3_16_0_ym19_1_1460978027696_14728">category will be assigned a shorter time for presentation during the conference.</div><div id="yui_3_16_0_ym19_1_1460978027696_14729"><br id="yui_3_16_0_ym19_1_1460978027696_14730"></div><div id="yui_3_16_0_ym19_1_1460978027696_14731">Demos</div><div id="yui_3_16_0_ym19_1_1460978027696_14732">-----</div><div id="yui_3_16_0_ym19_1_1460978027696_14733"><br id="yui_3_16_0_ym19_1_1460978027696_14734"></div><div id="yui_3_16_0_ym19_1_1460978027696_14735">Authors of applied regular and short papers will have the opportunity to show a</div><div id="yui_3_16_0_ym19_1_1460978027696_14736">demo of their software/system during the poster session.</div><div id="yui_3_16_0_ym19_1_1460978027696_14737"><br id="yui_3_16_0_ym19_1_1460978027696_14738"></div><div id="yui_3_16_0_ym19_1_1460978027696_14739">Submission format</div><div id="yui_3_16_0_ym19_1_1460978027696_14740">-----------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14741"><br id="yui_3_16_0_ym19_1_1460978027696_14742"></div><div id="yui_3_16_0_ym19_1_1460978027696_14743">All submissions must be formatted using the LaTeX style file for the conference</div><div id="yui_3_16_0_ym19_1_1460978027696_14744">series Lecture Notes in Computer Science (LNCS) provided by Springer. The</div><div id="yui_3_16_0_ym19_1_1460978027696_14745">default margins and fonts must not be modified. Submissions that do not comply</div><div id="yui_3_16_0_ym19_1_1460978027696_14746">with this format risk being rejected. The length of regular papers is limited</div><div id="yui_3_16_0_ym19_1_1460978027696_14747">to 12 pages (excluding references), while the length of short papers is limited</div><div id="yui_3_16_0_ym19_1_1460978027696_14748">to 6 pages (excluding references). The claims of the paper should be fully</div><div id="yui_3_16_0_ym19_1_1460978027696_14749">substantiated, including full proofs or appropriate experimental data. If this</div><div id="yui_3_16_0_ym19_1_1460978027696_14750">information does not fit within the page limits, the authors should include it</div><div id="yui_3_16_0_ym19_1_1460978027696_14751">in a clearly marked appendix, whose length is not constrained and which the</div><div id="yui_3_16_0_ym19_1_1460978027696_14752">reviewers may read at their own discretion.</div><div id="yui_3_16_0_ym19_1_1460978027696_14753"><br id="yui_3_16_0_ym19_1_1460978027696_14754"></div><div id="yui_3_16_0_ym19_1_1460978027696_14755">POSTERS</div><div id="yui_3_16_0_ym19_1_1460978027696_14756">-------</div><div id="yui_3_16_0_ym19_1_1460978027696_14757"><br id="yui_3_16_0_ym19_1_1460978027696_14758"></div><div id="yui_3_16_0_ym19_1_1460978027696_14759">Submissions of posters on graph drawing, network visualization, and related</div><div id="yui_3_16_0_ym19_1_1460978027696_14760">areas are also solicited. The poster session will provide a forum for the</div><div id="yui_3_16_0_ym19_1_1460978027696_14761">communication of late-breaking research results (which may also appear</div><div id="yui_3_16_0_ym19_1_1460978027696_14762">elsewhere) to the graph drawing community. Authors of posters should prepare an</div><div id="yui_3_16_0_ym19_1_1460978027696_14763">abstract (up to two pages in the LNCS style) that must be submitted together</div><div id="yui_3_16_0_ym19_1_1460978027696_14764">with the poster itself.</div><div id="yui_3_16_0_ym19_1_1460978027696_14765"><br id="yui_3_16_0_ym19_1_1460978027696_14766"></div><div id="yui_3_16_0_ym19_1_1460978027696_14767">CONTEST</div><div id="yui_3_16_0_ym19_1_1460978027696_14768">-------</div><div id="yui_3_16_0_ym19_1_1460978027696_14769"><br id="yui_3_16_0_ym19_1_1460978027696_14770"></div><div id="yui_3_16_0_ym19_1_1460978027696_14771">Details about the traditional Graph Drawing Contest held at the conference will</div><div id="yui_3_16_0_ym19_1_1460978027696_14772">be provided on the conference Web site.</div><div id="yui_3_16_0_ym19_1_1460978027696_14773"><br id="yui_3_16_0_ym19_1_1460978027696_14774"></div><div id="yui_3_16_0_ym19_1_1460978027696_14775">PUBLICATION</div><div id="yui_3_16_0_ym19_1_1460978027696_14776">-----------</div><div id="yui_3_16_0_ym19_1_1460978027696_14777"><br id="yui_3_16_0_ym19_1_1460978027696_14778"></div><div id="yui_3_16_0_ym19_1_1460978027696_14779">All accepted papers will appear in the conference proceedings, published by</div><div id="yui_3_16_0_ym19_1_1460978027696_14780">Springer in the Lecture Notes in Computer Science (LNCS) series and, following</div><div id="yui_3_16_0_ym19_1_1460978027696_14781">a green open access policy, as a conference index on the arXiv repository. The</div><div id="yui_3_16_0_ym19_1_1460978027696_14782">LNCS proceedings will be made freely accessible to the GD community upon</div><div id="yui_3_16_0_ym19_1_1460978027696_14783">publication and openly accessible to anyone after four years. The self-archived</div><div id="yui_3_16_0_ym19_1_1460978027696_14784">arXiv proceedings will provide immediate and unrestricted open access. Twelve</div><div id="yui_3_16_0_ym19_1_1460978027696_14785">pages (excluding references) will be allocated for regular papers and six pages</div><div id="yui_3_16_0_ym19_1_1460978027696_14786">(excluding references) for short papers. Upon submission of the camera-ready</div><div id="yui_3_16_0_ym19_1_1460978027696_14787">version of accepted papers, the identical paper (optionally including a clearly</div><div id="yui_3_16_0_ym19_1_1460978027696_14788">marked appendix) must be submitted to the arXiv repository and its arXiv</div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14789">identifier must be specified for inclusion in the conference index. For each </div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14790">paper, an author must register and present the paper at the conference (baring </div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14791">unforeseen circumstances) otherwise the paper will not be included in the </div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14792">proceedings.Abstracts of accepted posters will also appear in the conference </div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14793">proceedings (two pages), but will not be made available for indexing. Selected </div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14794">papers will be invited for submission to a special issue of the Journal of </div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14795">Graph Algorithms and Applications.</div><div id="yui_3_16_0_ym19_1_1460978027696_14796"><br id="yui_3_16_0_ym19_1_1460978027696_14797"></div><div id="yui_3_16_0_ym19_1_1460978027696_14798">AWARDS</div><div id="yui_3_16_0_ym19_1_1460978027696_14799">------</div><div id="yui_3_16_0_ym19_1_1460978027696_14800"><br id="yui_3_16_0_ym19_1_1460978027696_14801"></div><div id="yui_3_16_0_ym19_1_1460978027696_14802">For each of the two tracks, the Program Committee of GD 2016 will give a Best</div><div id="yui_3_16_0_ym19_1_1460978027696_14803">Paper Award. In addition, to recognize the effort of participants to present</div><div id="yui_3_16_0_ym19_1_1460978027696_14804">their work and to prepare their posters in a clear and elegant way, there will</div><div id="yui_3_16_0_ym19_1_1460978027696_14805">be a Best Presentation Award and a Best Poster Award voted on by the GD 2016</div><div id="yui_3_16_0_ym19_1_1460978027696_14806">attendees.</div><div id="yui_3_16_0_ym19_1_1460978027696_14807"><br id="yui_3_16_0_ym19_1_1460978027696_14808"></div><div id="yui_3_16_0_ym19_1_1460978027696_14809"><br id="yui_3_16_0_ym19_1_1460978027696_14810"></div><div id="yui_3_16_0_ym19_1_1460978027696_14811">IMPORTANT DATES</div><div id="yui_3_16_0_ym19_1_1460978027696_14812">---------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14813"><br id="yui_3_16_0_ym19_1_1460978027696_14814"></div><div id="yui_3_16_0_ym19_1_1460978027696_14815">Paper submission deadline June 12 (23:59 PDT)</div><div id="yui_3_16_0_ym19_1_1460978027696_14816">Notification of paper acceptance July 24</div><div id="yui_3_16_0_ym19_1_1460978027696_14817">Poster submission deadline August 17 (23:59 PDT)</div><div id="yui_3_16_0_ym19_1_1460978027696_14818">Notification of poster acceptance August 28</div><div id="yui_3_16_0_ym19_1_1460978027696_14819">Final versions due September 1</div><div id="yui_3_16_0_ym19_1_1460978027696_14820">Contest submission deadline September 11</div><div id="yui_3_16_0_ym19_1_1460978027696_14821">Symposium on Graph Drawing and Network Visualization September 19-21</div><div id="yui_3_16_0_ym19_1_1460978027696_14822"><br id="yui_3_16_0_ym19_1_1460978027696_14823"></div><div id="yui_3_16_0_ym19_1_1460978027696_14824">INVITED SPEAKERS</div><div id="yui_3_16_0_ym19_1_1460978027696_14825">----------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14826"><br id="yui_3_16_0_ym19_1_1460978027696_14827"></div><div id="yui_3_16_0_ym19_1_1460978027696_14828">Daniel Keim, University of Konstanz, DE</div><div id="yui_3_16_0_ym19_1_1460978027696_14829">Roger Wattenhofer, ETH Zurich, CH</div><div id="yui_3_16_0_ym19_1_1460978027696_14830"><br id="yui_3_16_0_ym19_1_1460978027696_14831"></div><div id="yui_3_16_0_ym19_1_1460978027696_14832">PROGRAM COMMITTEE</div><div id="yui_3_16_0_ym19_1_1460978027696_14833">-----------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14834"><br id="yui_3_16_0_ym19_1_1460978027696_14835"></div><div id="yui_3_16_0_ym19_1_1460978027696_14836">Patrizio Angelini, University of Tübingen, DE</div><div id="yui_3_16_0_ym19_1_1460978027696_14837">Therese Biedl, University of Waterloo, CA</div><div id="yui_3_16_0_ym19_1_1460978027696_14838">Walter Didimo, University of Perugia, IT</div><div id="yui_3_16_0_ym19_1_1460978027696_14839">Cody Dunne, IBM Watson Health, USA</div><div id="yui_3_16_0_ym19_1_1460978027696_14840">David Eppstein, UC Irvine, USA</div><div id="yui_3_16_0_ym19_1_1460978027696_14841">Jean-Daniel Fekete, INRIA, FR</div><div id="yui_3_16_0_ym19_1_1460978027696_14842">Stefan Felsner, TU Berlin, DE</div><div id="yui_3_16_0_ym19_1_1460978027696_14843">Radoslav Fulek, IST Austria, AT</div><div id="yui_3_16_0_ym19_1_1460978027696_14844">Emden Gansner, Google, USA</div><div id="yui_3_16_0_ym19_1_1460978027696_14845">Yifan Hu (co-chair), Yahoo Labs, USA</div><div id="yui_3_16_0_ym19_1_1460978027696_14846">Karsten Klein, Monash University, AU</div><div id="yui_3_16_0_ym19_1_1460978027696_14847">Stephen Kobourov, University of Arizona, USA</div><div id="yui_3_16_0_ym19_1_1460978027696_14848">Marc van Kreveld, Utrecht University, NL</div><div id="yui_3_16_0_ym19_1_1460978027696_14849">Jan Kynčl, Charles University Prague, CZ</div><div id="yui_3_16_0_ym19_1_1460978027696_14850">Kwan-Liu Ma, UC Davis, USA</div><div id="yui_3_16_0_ym19_1_1460978027696_14851">Tamara Mchedlidze, Karlsruhe Institute of Technology, DE</div><div id="yui_3_16_0_ym19_1_1460978027696_14852">Martin Nöllenburg (co-chair), TU Vienna, AT</div><div id="yui_3_16_0_ym19_1_1460978027696_14853">Stephen North, Infovisible, Oldwick, USA</div><div id="yui_3_16_0_ym19_1_1460978027696_14854">Maurizio Patrignani, Roma Tre University, IT</div><div id="yui_3_16_0_ym19_1_1460978027696_14855">Helen Purchase, University of Glasgow, UK</div><div id="yui_3_16_0_ym19_1_1460978027696_14856">Huamin Qu, HKUST, Hong Kong</div><div id="yui_3_16_0_ym19_1_1460978027696_14857">Günter Rote, FU Berlin, DE</div><div id="yui_3_16_0_ym19_1_1460978027696_14858">André Schulz, University of Hagen, DE</div><div id="yui_3_16_0_ym19_1_1460978027696_14859">Lei Shi, Chinese Academy of Science, CN</div><div id="yui_3_16_0_ym19_1_1460978027696_14860">Alexandru Telea, University of Groningen, NL</div><div id="yui_3_16_0_ym19_1_1460978027696_14861"><br id="yui_3_16_0_ym19_1_1460978027696_14862"></div><div id="yui_3_16_0_ym19_1_1460978027696_14863">ORGANIZING COMMITTEE</div><div id="yui_3_16_0_ym19_1_1460978027696_14864">--------------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14865"><br id="yui_3_16_0_ym19_1_1460978027696_14866"></div><div id="yui_3_16_0_ym19_1_1460978027696_14867">Kostas Karpouzis, National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_ym19_1_1460978027696_14868">Chrysanthi Raftopoulou, National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_ym19_1_1460978027696_14869">Antonios Symvonis (chair), National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_ym19_1_1460978027696_14870"><br id="yui_3_16_0_ym19_1_1460978027696_14871"></div><div id="yui_3_16_0_ym19_1_1460978027696_14872">CONTEST COMMITTEE</div><div id="yui_3_16_0_ym19_1_1460978027696_14873">-----------------</div><div id="yui_3_16_0_ym19_1_1460978027696_14874"><br id="yui_3_16_0_ym19_1_1460978027696_14875"></div><div id="yui_3_16_0_ym19_1_1460978027696_14876">Philipp Kindermann, University of Hagen, DE</div><div id="yui_3_16_0_ym19_1_1460978027696_14877">Maarten Löffler (chair), Utrecht University, NL</div><div id="yui_3_16_0_ym19_1_1460978027696_14878">Lev Nachmanson, Microsoft Research, USA</div><div dir="ltr" id="yui_3_16_0_ym19_1_1460978027696_14879">Ignaz Rutter, Karlsruhe Institute of Technology, DE</div></div></body></html>