Wednesday, July 23, 2025

[DMANET] GD 2025: CALL FOR POSTERS

Sorry if you receive multiple copies of this announcement.

================================================================
GD 2025: CALL FOR POSTERS

The 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)
September 24-26, 2025, Norrköping, Sweden
https://graphdrawing.github.io/gd2025/

================================================================
IMPORTANT DATES

-     Poster submission deadline: August 22
-     Poster notification: September 1

================================================================

*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 for which it is crucial to visually analyze and interact with relational datasets. Application areas include data science, social sciences, web computing, information systems, life sciences, geography, business intelligence, information security, and software engineering.

Graph Drawing has been the main annual conference in this area for more than 30 years. Its focus is on combinatorial and algorithmic aspects of graph drawing, their experimental evaluation, as well as the design of network visualization systems and interfaces. 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 as well as the graph drawing contest.

GD 2025 will be held in Norrköping, Sweden, on September 24-26, 2025 with a reception on the evening of September 23. A preconference PhD school will take place September 22-23, 2025. GD 2025 is designed to be held on-site. It is expected that regular papers are presented on site by one of the authors. To address the global challenges and as an offer for authors who are unable to attend we allow for a limited number of remote presentations, as further explained below.

The code of conduct for the GD conference can be found at http://graphdrawing.org/safetoc.html

================================================================

*POSTERS*

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 that must be submitted together with the poster itself. Each submission will thus consist of two pdf files (the abstract and the poster).

================================================================
RULES FOR SUBMISSION

Each poster must be presented at the conference by an author.

The proceedings will be published in the LIPIcs <https://www.dagstuhl.de/en/publishing/series/details/lipics> series. To facilitate the process, submissions have to be prepared in accordance with the LIPIcs author instructions <https://submission.dagstuhl.de/series/details/LIPIcs#author>, the page provides links to the LIPIcs class file along with an example and detailed author instructions. For the submission, the use of the LaTeX class file gd-lipics-v2.cls <https://graphdrawing.github.io/gd2025/assets/template/gd-lipics-v2.cls> is requested. The class file is a wrapper around the standard LIPIcs class and implements line counting, see CG-linecount.pdf <https://www.computational-geometry.org/guidelines/linecount_2022_09_19.pdf> for details.

Submissions must not exceed the following limits:

-     80 lines for posters' abstracts.

The above limits do not include front matter (title, authors, and affiliations) and references. The class files provide line counting which should be accurate in most cases. Authors should avoid substantial amounts of text in unnumbered lines.

In addition, the main content of the paper must not exceed the following page limits excluding references:

-     3 pages for posters' abstracts.

For poster submissions, no appendix is expected.

We also encourage authors to avoid "et al." in citations in favor of an equal mention of the surnames of all authors. For references with few authors, it is recommended to name all of them; if the number of authors is large, consider writing "(It is shown that) X [#]" or "The authors in [#] show that X" instead of "A et al. [#] show that X".

Posters should be submitted electronically via Easychair <https://easychair.org/conferences/?conf=gd2025>. The proceedings will be published in the *Leibniz International Proceedings in Informatics (LIPIcs)* series and are available open access.


================================================================
SINGLE-BLIND REVIEW PROCESS

Poster submissions will be evaluated by the Program Committee in a single-blind mode. In particular, the submitted abstract should contain the authors' names, affiliations, and email addresses.

================================================================
AWARDS

To recognize the effort of participants to prepare their posters in a clear and elegant way, there will be a Best Poster Award voted on by the GD 2025 attendees.

================================================================
INVITED SPEAKERS

Hans Bodlaender, Utrecht University, Netherlands
Huamin Qu, Hong Kong University of Science and Technology (HKUST), Hong Kong

================================================================
ORGANIZING COMMITTEE

Andreas Kerren, Linköping University, Sweden (general co-chair)
Kostiantyn Kucher, Linköping University, Sweden (general co-chair)
Claudio Linhares, Linnaeus University, Sweden (PhD school chair)
Nico Reski, Linköping University, Sweden (Decision Arena chair)
Zeyang Huang, Linköping University, Sweden (web chair)

================================================================
PROGRAM COMMITTEE

Alessio Arleo, TU Eindhoven, Netherlands
Michael Bekos, University of Ioannina, Greece
Markus Chimani, University of Osnabrück, Germany
Éric Colin de Verdière, CNRS, LIGM, Marne-la-Vallée, France
Giordano Da Lozzo, Roma Tre University, Italy
Sara Di Bartolomeo, TU Wien, Austria
Vida Dujmovic, University of Ottawa, Canada (program co-chair)
Henry Förster, TU Munich, Germany
Fabrizio Frati, Roma Tre University, Italy
Robert Ganian, TU Wien, Austria
Daniel Gonçalves, CNRS & University of Montpellier, France
Siddharth Gupta, BITS Pilani, K K Birla Goa Campus, India
Thekla Hamm, TU Eindhoven, Netherlands
Takayuki Itoh, Ochanomizu University, Japan
Philipp Kindermann, Trier University, Germany
Stephen Kobourov, TU Munich, Germany
Kostiantyn Kucher, Linköping University, Sweden
Silvia Miksch, TU Wien, Austria
Fabrizio Montecchiani, University of Perugia, Italy (program co-chair)
Pat Morin, Carleton University, Canada
Tamara Mchedlidze, Utrecht University, Netherlands
Giacomo Ortali, University of Perugia, Italy
Sergey Pupyrev, Meta, USA
Marcus Schaefer, DePaul University, USA
Raphael Steiner, ETH Zurich, Switzerland
Andrew Suk, University of California San Diego, USA
Antonios Symvonis, National Technical University of Athens, Greece
Csaba D. Tóth, CSU Northridge, USA
Torsten Ueckerdt, Karlsruhe Institute of Technology, Germany
Pavel Valtr, Charles University, Czech Republic
Tatiana von Landesberger, University of Cologne, Germany
Meirav Zehavi, Ben-Gurion University, Israel

================================================================
CONTEST COMMITTEE

Sara Di Bartolomeo, University of Konstanz, Germany
Fabian Klute, UPC Barcelona, Spain (chair)
Debajyoti Mondal, University of Saskatchewan, Canada
Jules Wulms, TU Eindhoven, Netherlands
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************