<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 tabindex="0" style="outline: none 0px; display: table; width: 843px; box-sizing: border-box; padding-top: 12px; padding-left: 0px; font-family: 'Helvetica Neue', 'Segoe UI', Helvetica, Arial, 'Lucida Grande', sans-serif; font-size: 13px;" id="yui_3_16_0_ym19_1_1465088390980_3264"><div style="display: table-cell; width: auto; word-wrap: break-word; word-break: break-word;" id="yui_3_16_0_ym19_1_1465088390980_3265"><div id="yui_3_16_0_ym19_1_1465088390980_3266"><div id="yui_3_16_0_ym19_1_1465088390980_3267"><div style="font-family: 'Helvetica Neue-Light', 'Helvetica Neue Light', 'Helvetica Neue', Helvetica, Arial, 'Lucida Grande', sans-serif; font-size: 16px;" id="yui_3_16_0_ym19_1_1465088390980_3268"><div id="yui_3_16_0_ym19_1_1465088390980_3269">====================================================================</div><div id="yui_3_16_0_ym19_1_1465088390980_3270"><br id="yui_3_16_0_ym19_1_1465088390980_3271"></div><div id="yui_3_16_0_ym19_1_1465088390980_3272"> Call for Papers</div><div id="yui_3_16_0_ym19_1_1465088390980_3273"><br id="yui_3_16_0_ym19_1_1465088390980_3274"></div><div id="yui_3_16_0_ym19_1_1465088390980_3275"> GD 2016</div><div id="yui_3_16_0_ym19_1_1465088390980_3276"><br id="yui_3_16_0_ym19_1_1465088390980_3277"></div><div id="yui_3_16_0_ym19_1_1465088390980_3278"> 24th International Symposium on</div><div id="yui_3_16_0_ym19_1_1465088390980_3279"> Graph Drawing and Network Visualization</div><div id="yui_3_16_0_ym19_1_1465088390980_3280"><br id="yui_3_16_0_ym19_1_1465088390980_3281"></div><div id="yui_3_16_0_ym19_1_1465088390980_3282"> September 19-21, 2016 – Athens, Greece</div><div id="yui_3_16_0_ym19_1_1465088390980_3283"> http://algo.math.ntua.gr/~gd2016/</div><div id="yui_3_16_0_ym19_1_1465088390980_3284"><br id="yui_3_16_0_ym19_1_1465088390980_3285"></div><div id="yui_3_16_0_ym19_1_1465088390980_3286">====================================================================</div><div id="yui_3_16_0_ym19_1_1465088390980_3287"><br id="yui_3_16_0_ym19_1_1465088390980_3288"></div><div id="yui_3_16_0_ym19_1_1465088390980_3289">Graph Drawing is concerned with the geometric representation of graphs and</div><div id="yui_3_16_0_ym19_1_1465088390980_3290">constitutes the algorithmic core of Network Visualization. Graph Drawing and</div><div id="yui_3_16_0_ym19_1_1465088390980_3291">Network Visualization are motivated by applications where it is crucial to</div><div id="yui_3_16_0_ym19_1_1465088390980_3292">visually analyze and interact with relational datasets. Examples of such</div><div id="yui_3_16_0_ym19_1_1465088390980_3293">application areas include data science, social sciences, Web computing,</div><div id="yui_3_16_0_ym19_1_1465088390980_3294">information systems, biology, geography, business intelligence, information</div><div id="yui_3_16_0_ym19_1_1465088390980_3295">security and software engineering.</div><div id="yui_3_16_0_ym19_1_1465088390980_3296"><br id="yui_3_16_0_ym19_1_1465088390980_3297"></div><div id="yui_3_16_0_ym19_1_1465088390980_3298">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_1465088390980_3299">focus is on combinatorial and algorithmic aspects of graph drawing as well as</div><div id="yui_3_16_0_ym19_1_1465088390980_3300">the design of network visualization systems and interfaces. GD 2016 will be</div><div id="yui_3_16_0_ym19_1_1465088390980_3301">hosted by the Institute of Communications and Computer Systems, an affiliate of</div><div id="yui_3_16_0_ym19_1_1465088390980_3302">the National Technical University of Athens from September 19 to 21, 2016 in</div><div id="yui_3_16_0_ym19_1_1465088390980_3303">Athens, Greece. Researchers and practitioners working on any aspect of graph</div><div id="yui_3_16_0_ym19_1_1465088390980_3304">drawing and network visualization are invited to contribute papers and posters</div><div id="yui_3_16_0_ym19_1_1465088390980_3305">and to participate in the symposium and the graph drawing contest.</div><div id="yui_3_16_0_ym19_1_1465088390980_3306"><br id="yui_3_16_0_ym19_1_1465088390980_3307"></div><div id="yui_3_16_0_ym19_1_1465088390980_3308">PAPERS</div><div id="yui_3_16_0_ym19_1_1465088390980_3309">------</div><div id="yui_3_16_0_ym19_1_1465088390980_3310"><br id="yui_3_16_0_ym19_1_1465088390980_3311"></div><div id="yui_3_16_0_ym19_1_1465088390980_3312">We invite authors to submit papers describing original research of theoretical</div><div id="yui_3_16_0_ym19_1_1465088390980_3313">or practical significance to graph drawing and network visualization. Regular</div><div id="yui_3_16_0_ym19_1_1465088390980_3314">papers must be submitted explicitly to one of two distinct tracks. Papers</div><div id="yui_3_16_0_ym19_1_1465088390980_3315">submitted to one track will not compete with papers submitted to the other</div><div id="yui_3_16_0_ym19_1_1465088390980_3316">track.</div><div id="yui_3_16_0_ym19_1_1465088390980_3317"><br id="yui_3_16_0_ym19_1_1465088390980_3318"></div><div id="yui_3_16_0_ym19_1_1465088390980_3319">Track 1: Combinatorial and algorithmic aspects</div><div id="yui_3_16_0_ym19_1_1465088390980_3320">----------------------------------------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3321"><br id="yui_3_16_0_ym19_1_1465088390980_3322"></div><div id="yui_3_16_0_ym19_1_1465088390980_3323">This track is mainly devoted to fundamental graph drawing advances, such as</div><div id="yui_3_16_0_ym19_1_1465088390980_3324">combinatorial aspects and algorithm design. The range of topics for this track</div><div id="yui_3_16_0_ym19_1_1465088390980_3325">includes (but is not limited to):</div><div id="yui_3_16_0_ym19_1_1465088390980_3326"><br id="yui_3_16_0_ym19_1_1465088390980_3327"></div><div id="yui_3_16_0_ym19_1_1465088390980_3328"><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3329">• Design and analysis of graph drawing algorithms<br id="yui_3_16_0_ym19_1_1465088390980_3330"></div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3331">• Geometric graph theory</div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3332">• Geometric computing</div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3333">• Planarity and topological graph theory</div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3334">• Optimization on graphs</div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3335"><br id="yui_3_16_0_ym19_1_1465088390980_3336"></div></div><div id="yui_3_16_0_ym19_1_1465088390980_3337">Track 2: Experimental, applied, and network visualization aspects</div><div id="yui_3_16_0_ym19_1_1465088390980_3338">-----------------------------------------------------------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3339"><br id="yui_3_16_0_ym19_1_1465088390980_3340"></div><div id="yui_3_16_0_ym19_1_1465088390980_3341">This track is mainly devoted to the practical aspects of graph drawing, such as</div><div id="yui_3_16_0_ym19_1_1465088390980_3342">the development of network visualization systems and interfaces in different</div><div id="yui_3_16_0_ym19_1_1465088390980_3343">application areas. The range of topics for this track includes (but is not</div><div id="yui_3_16_0_ym19_1_1465088390980_3344">limited to):</div><div id="yui_3_16_0_ym19_1_1465088390980_3345"><br id="yui_3_16_0_ym19_1_1465088390980_3346"></div><div id="yui_3_16_0_ym19_1_1465088390980_3347">• Visualization of graphs and networks in real world applications, including big data</div><div id="yui_3_16_0_ym19_1_1465088390980_3348">• Engineering of network visualization algorithms and systems</div><div id="yui_3_16_0_ym19_1_1465088390980_3349">• Experimental results in graph theory and algorithms</div><div id="yui_3_16_0_ym19_1_1465088390980_3350">• Benchmarks and experimental studies of network visualization systems and user interfaces</div><div id="yui_3_16_0_ym19_1_1465088390980_3351">• Cognitive studies on graph drawing readability and user interaction</div><div id="yui_3_16_0_ym19_1_1465088390980_3352">• Interfaces and methods for interacting with graphs</div><div id="yui_3_16_0_ym19_1_1465088390980_3353"><br id="yui_3_16_0_ym19_1_1465088390980_3354"></div><div id="yui_3_16_0_ym19_1_1465088390980_3355">Short papers</div><div id="yui_3_16_0_ym19_1_1465088390980_3356">------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3357"><br id="yui_3_16_0_ym19_1_1465088390980_3358"></div><div id="yui_3_16_0_ym19_1_1465088390980_3359">Besides regular papers in the two tracks above there will be a separate</div><div id="yui_3_16_0_ym19_1_1465088390980_3360">category for short papers. In this category it will be possible to submit</div><div id="yui_3_16_0_ym19_1_1465088390980_3361">theoretical contributions and applied papers of shorter length. Papers in this</div><div id="yui_3_16_0_ym19_1_1465088390980_3362">category will be assigned a shorter time for presentation during the conference.</div><div id="yui_3_16_0_ym19_1_1465088390980_3363"><br id="yui_3_16_0_ym19_1_1465088390980_3364"></div><div id="yui_3_16_0_ym19_1_1465088390980_3365">Demos</div><div id="yui_3_16_0_ym19_1_1465088390980_3366">-----</div><div id="yui_3_16_0_ym19_1_1465088390980_3367"><br id="yui_3_16_0_ym19_1_1465088390980_3368"></div><div id="yui_3_16_0_ym19_1_1465088390980_3369">Authors of applied regular and short papers will have the opportunity to show a</div><div id="yui_3_16_0_ym19_1_1465088390980_3370">demo of their software/system during the poster session.</div><div id="yui_3_16_0_ym19_1_1465088390980_3371"><br id="yui_3_16_0_ym19_1_1465088390980_3372"></div><div id="yui_3_16_0_ym19_1_1465088390980_3373">Submission format</div><div id="yui_3_16_0_ym19_1_1465088390980_3374">-----------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3375"><br id="yui_3_16_0_ym19_1_1465088390980_3376"></div><div id="yui_3_16_0_ym19_1_1465088390980_3377">All submissions must be formatted using the LaTeX style file for the conference</div><div id="yui_3_16_0_ym19_1_1465088390980_3378">series Lecture Notes in Computer Science (LNCS) provided by Springer. The</div><div id="yui_3_16_0_ym19_1_1465088390980_3379">default margins and fonts must not be modified. Submissions that do not comply</div><div id="yui_3_16_0_ym19_1_1465088390980_3380">with this format risk being rejected. The length of regular papers is limited</div><div id="yui_3_16_0_ym19_1_1465088390980_3381">to 12 pages (excluding references), while the length of short papers is limited</div><div id="yui_3_16_0_ym19_1_1465088390980_3382">to 6 pages (excluding references). The claims of the paper should be fully</div><div id="yui_3_16_0_ym19_1_1465088390980_3383">substantiated, including full proofs or appropriate experimental data. If this</div><div id="yui_3_16_0_ym19_1_1465088390980_3384">information does not fit within the page limits, the authors should include it</div><div id="yui_3_16_0_ym19_1_1465088390980_3385">in a clearly marked appendix, whose length is not constrained and which the</div><div id="yui_3_16_0_ym19_1_1465088390980_3386">reviewers may read at their own discretion.</div><div id="yui_3_16_0_ym19_1_1465088390980_3387"><br id="yui_3_16_0_ym19_1_1465088390980_3388"></div><div id="yui_3_16_0_ym19_1_1465088390980_3389">POSTERS</div><div id="yui_3_16_0_ym19_1_1465088390980_3390">-------</div><div id="yui_3_16_0_ym19_1_1465088390980_3391"><br id="yui_3_16_0_ym19_1_1465088390980_3392"></div><div id="yui_3_16_0_ym19_1_1465088390980_3393">Submissions of posters on graph drawing, network visualization, and related</div><div id="yui_3_16_0_ym19_1_1465088390980_3394">areas are also solicited. The poster session will provide a forum for the</div><div id="yui_3_16_0_ym19_1_1465088390980_3395">communication of late-breaking research results (which may also appear</div><div id="yui_3_16_0_ym19_1_1465088390980_3396">elsewhere) to the graph drawing community. Authors of posters should prepare an</div><div id="yui_3_16_0_ym19_1_1465088390980_3397">abstract (up to two pages in the LNCS style) that must be submitted together</div><div id="yui_3_16_0_ym19_1_1465088390980_3398">with the poster itself.</div><div id="yui_3_16_0_ym19_1_1465088390980_3399"><br id="yui_3_16_0_ym19_1_1465088390980_3400"></div><div id="yui_3_16_0_ym19_1_1465088390980_3401">CONTEST</div><div id="yui_3_16_0_ym19_1_1465088390980_3402">-------</div><div id="yui_3_16_0_ym19_1_1465088390980_3403"><br id="yui_3_16_0_ym19_1_1465088390980_3404"></div><div id="yui_3_16_0_ym19_1_1465088390980_3405">Details about the traditional Graph Drawing Contest held at the conference will</div><div id="yui_3_16_0_ym19_1_1465088390980_3406">be provided on the conference Web site.</div><div id="yui_3_16_0_ym19_1_1465088390980_3407"><br id="yui_3_16_0_ym19_1_1465088390980_3408"></div><div id="yui_3_16_0_ym19_1_1465088390980_3409">PUBLICATION</div><div id="yui_3_16_0_ym19_1_1465088390980_3410">-----------</div><div id="yui_3_16_0_ym19_1_1465088390980_3411"><br id="yui_3_16_0_ym19_1_1465088390980_3412"></div><div id="yui_3_16_0_ym19_1_1465088390980_3413">All accepted papers will appear in the conference proceedings, published by</div><div id="yui_3_16_0_ym19_1_1465088390980_3414">Springer in the Lecture Notes in Computer Science (LNCS) series and, following</div><div id="yui_3_16_0_ym19_1_1465088390980_3415">a green open access policy, as a conference index on the arXiv repository. The</div><div id="yui_3_16_0_ym19_1_1465088390980_3416">LNCS proceedings will be made freely accessible to the GD community upon</div><div id="yui_3_16_0_ym19_1_1465088390980_3417">publication and openly accessible to anyone after four years. The self-archived</div><div id="yui_3_16_0_ym19_1_1465088390980_3418">arXiv proceedings will provide immediate and unrestricted open access. Twelve</div><div id="yui_3_16_0_ym19_1_1465088390980_3419">pages (excluding references) will be allocated for regular papers and six pages</div><div id="yui_3_16_0_ym19_1_1465088390980_3420">(excluding references) for short papers. Upon submission of the camera-ready</div><div id="yui_3_16_0_ym19_1_1465088390980_3421">version of accepted papers, the identical paper (optionally including a clearly</div><div id="yui_3_16_0_ym19_1_1465088390980_3422">marked appendix) must be submitted to the arXiv repository and its arXiv</div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3423">identifier must be specified for inclusion in the conference index. For each </div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3424">paper, an author must register and present the paper at the conference (baring </div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3425">unforeseen circumstances) otherwise the paper will not be included in the </div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3426">proceedings.Abstracts of accepted posters will also appear in the conference </div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3427">proceedings (two pages), but will not be made available for indexing. Selected </div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3428">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_1465088390980_3429">Graph Algorithms and Applications.</div><div id="yui_3_16_0_ym19_1_1465088390980_3430"><br id="yui_3_16_0_ym19_1_1465088390980_3431"></div><div id="yui_3_16_0_ym19_1_1465088390980_3432">AWARDS</div><div id="yui_3_16_0_ym19_1_1465088390980_3433">------</div><div id="yui_3_16_0_ym19_1_1465088390980_3434"><br id="yui_3_16_0_ym19_1_1465088390980_3435"></div><div id="yui_3_16_0_ym19_1_1465088390980_3436">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_1465088390980_3437">Paper Award. In addition, to recognize the effort of participants to present</div><div id="yui_3_16_0_ym19_1_1465088390980_3438">their work and to prepare their posters in a clear and elegant way, there will</div><div id="yui_3_16_0_ym19_1_1465088390980_3439">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_1465088390980_3440">attendees.</div><div id="yui_3_16_0_ym19_1_1465088390980_3441"><br id="yui_3_16_0_ym19_1_1465088390980_3442"></div><div id="yui_3_16_0_ym19_1_1465088390980_3443"><br id="yui_3_16_0_ym19_1_1465088390980_3444"></div><div id="yui_3_16_0_ym19_1_1465088390980_3445">IMPORTANT DATES</div><div id="yui_3_16_0_ym19_1_1465088390980_3446">---------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3447"><br id="yui_3_16_0_ym19_1_1465088390980_3448"></div><div id="yui_3_16_0_ym19_1_1465088390980_3449">Paper submission deadline June 12 (23:59 PDT)</div><div id="yui_3_16_0_ym19_1_1465088390980_3450">Notification of paper acceptance July 24</div><div id="yui_3_16_0_ym19_1_1465088390980_3451">Poster submission deadline August 17 (23:59 PDT)</div><div id="yui_3_16_0_ym19_1_1465088390980_3452">Notification of poster acceptance August 28</div><div id="yui_3_16_0_ym19_1_1465088390980_3453">Final versions due September 1</div><div id="yui_3_16_0_ym19_1_1465088390980_3454">Contest submission deadline September 11</div><div id="yui_3_16_0_ym19_1_1465088390980_3455">Symposium on Graph Drawing and Network Visualization September 19-21</div><div id="yui_3_16_0_ym19_1_1465088390980_3456"><br id="yui_3_16_0_ym19_1_1465088390980_3457"></div><div id="yui_3_16_0_ym19_1_1465088390980_3458">INVITED SPEAKERS</div><div id="yui_3_16_0_ym19_1_1465088390980_3459">----------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3460"><br id="yui_3_16_0_ym19_1_1465088390980_3461"></div><div id="yui_3_16_0_ym19_1_1465088390980_3462">Daniel Keim, University of Konstanz, DE</div><div id="yui_3_16_0_ym19_1_1465088390980_3463">Roger Wattenhofer, ETH Zurich, CH</div><div id="yui_3_16_0_ym19_1_1465088390980_3464"><br id="yui_3_16_0_ym19_1_1465088390980_3465"></div><div id="yui_3_16_0_ym19_1_1465088390980_3466">PROGRAM COMMITTEE</div><div id="yui_3_16_0_ym19_1_1465088390980_3467">-----------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3468"><br id="yui_3_16_0_ym19_1_1465088390980_3469"></div><div id="yui_3_16_0_ym19_1_1465088390980_3470">Patrizio Angelini, University of Tübingen, DE</div><div id="yui_3_16_0_ym19_1_1465088390980_3471">Therese Biedl, University of Waterloo, CA</div><div id="yui_3_16_0_ym19_1_1465088390980_3472">Walter Didimo, University of Perugia, IT</div><div id="yui_3_16_0_ym19_1_1465088390980_3473">Cody Dunne, IBM Watson Health, USA</div><div id="yui_3_16_0_ym19_1_1465088390980_3474">David Eppstein, UC Irvine, USA</div><div id="yui_3_16_0_ym19_1_1465088390980_3475">Jean-Daniel Fekete, INRIA, FR</div><div id="yui_3_16_0_ym19_1_1465088390980_3476">Stefan Felsner, TU Berlin, DE</div><div id="yui_3_16_0_ym19_1_1465088390980_3477">Radoslav Fulek, IST Austria, AT</div><div id="yui_3_16_0_ym19_1_1465088390980_3478">Emden Gansner, Google, USA</div><div id="yui_3_16_0_ym19_1_1465088390980_3479">Yifan Hu (co-chair), Yahoo Labs, USA</div><div id="yui_3_16_0_ym19_1_1465088390980_3480">Karsten Klein, Monash University, AU</div><div id="yui_3_16_0_ym19_1_1465088390980_3481">Stephen Kobourov, University of Arizona, USA</div><div id="yui_3_16_0_ym19_1_1465088390980_3482">Marc van Kreveld, Utrecht University, NL</div><div id="yui_3_16_0_ym19_1_1465088390980_3483">Jan Kynčl, Charles University Prague, CZ</div><div id="yui_3_16_0_ym19_1_1465088390980_3484">Kwan-Liu Ma, UC Davis, USA</div><div id="yui_3_16_0_ym19_1_1465088390980_3485">Tamara Mchedlidze, Karlsruhe Institute of Technology, DE</div><div id="yui_3_16_0_ym19_1_1465088390980_3486">Martin Nöllenburg (co-chair), TU Vienna, AT</div><div id="yui_3_16_0_ym19_1_1465088390980_3487">Stephen North, Infovisible, Oldwick, USA</div><div id="yui_3_16_0_ym19_1_1465088390980_3488">Maurizio Patrignani, Roma Tre University, IT</div><div id="yui_3_16_0_ym19_1_1465088390980_3489">Helen Purchase, University of Glasgow, UK</div><div id="yui_3_16_0_ym19_1_1465088390980_3490">Huamin Qu, HKUST, Hong Kong</div><div id="yui_3_16_0_ym19_1_1465088390980_3491">Günter Rote, FU Berlin, DE</div><div id="yui_3_16_0_ym19_1_1465088390980_3492">André Schulz, University of Hagen, DE</div><div id="yui_3_16_0_ym19_1_1465088390980_3493">Lei Shi, Chinese Academy of Science, CN</div><div id="yui_3_16_0_ym19_1_1465088390980_3494">Alexandru Telea, University of Groningen, NL</div><div id="yui_3_16_0_ym19_1_1465088390980_3495"><br id="yui_3_16_0_ym19_1_1465088390980_3496"></div><div id="yui_3_16_0_ym19_1_1465088390980_3497">ORGANIZING COMMITTEE</div><div id="yui_3_16_0_ym19_1_1465088390980_3498">--------------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3499"><br id="yui_3_16_0_ym19_1_1465088390980_3500"></div><div id="yui_3_16_0_ym19_1_1465088390980_3501">Kostas Karpouzis, National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_ym19_1_1465088390980_3502">Chrysanthi Raftopoulou, National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_ym19_1_1465088390980_3503">Antonios Symvonis (chair), National Tech. Univ. of Athens, GR</div><div id="yui_3_16_0_ym19_1_1465088390980_3504"><br id="yui_3_16_0_ym19_1_1465088390980_3505"></div><div id="yui_3_16_0_ym19_1_1465088390980_3506">CONTEST COMMITTEE</div><div id="yui_3_16_0_ym19_1_1465088390980_3507">-----------------</div><div id="yui_3_16_0_ym19_1_1465088390980_3508"><br id="yui_3_16_0_ym19_1_1465088390980_3509"></div><div id="yui_3_16_0_ym19_1_1465088390980_3510">Philipp Kindermann, University of Hagen, DE</div><div id="yui_3_16_0_ym19_1_1465088390980_3511">Maarten Löffler (chair), Utrecht University, NL</div><div id="yui_3_16_0_ym19_1_1465088390980_3512">Lev Nachmanson, Microsoft Research, USA</div><div dir="ltr" id="yui_3_16_0_ym19_1_1465088390980_3513">Ignaz Rutter, Karlsruhe Institute of Technology, DE</div></div></div></div></div></div></div></body></html>