[Paper Review] Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)

Thérèse Biedl, Andreas Kerren|arXiv (Cornell University)|Sep 10, 2018

Data Visualization and Analytics4 citations

TL;DR

This paper presents revised, accepted research from the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), held in Barcelona, Spain. It contributes novel algorithms and theoretical insights into graph drawing and network visualization, with key results published in the Springer Lecture Notes in Computer Science series.

ABSTRACT

These are the revised accepted papers from the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), Barcelona, Spain, September 26 - September 28, 2018. Proceedings are also to be published by Springer in the Lecture Notes in Computer Science series.

Motivation & Objective

• To present and disseminate cutting-edge research in graph drawing and network visualization from the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018).
• To provide a comprehensive, peer-reviewed collection of studies addressing algorithmic, theoretical, and practical challenges in visualizing complex networks and graphs.
• To contribute to the advancement of visualization techniques for improving the readability, layout quality, and analytical utility of graph structures.
• To document and share innovations in network visualization, including layout algorithms, visualization systems, and theoretical foundations, through the official proceedings published by Springer.

Proposed method

• The research was derived from peer-reviewed submissions to the GD 2018 conference, selected through a rigorous review process.
• Contributions were compiled into a single proceedings volume, ensuring academic quality and consistency.
• The proceedings were formatted and published in the Lecture Notes in Computer Science (LNCS) series by Springer, following standard academic publishing protocols.
• Each paper underwent technical evaluation focusing on originality, significance, and correctness within the domain of graph drawing and network visualization.
• The final volume includes revised versions of accepted papers, reflecting feedback from the review process.
• The publication process ensured broad dissemination and indexing in major academic databases, enhancing visibility and impact.

Experimental results

Research questions

• RQ1 What novel algorithmic or theoretical contributions were made in the field of graph drawing and network visualization at GD 2018?
• RQ2 How do the proposed methods improve the readability, scalability, or aesthetic quality of graph layouts?
• RQ3 What new insights or frameworks were introduced for visualizing complex networks in real-world applications?
• RQ4 What are the key technical advancements presented in the revised papers of the GD 2018 proceedings?
• RQ5 How do the contributions from this symposium advance the state of the art in network visualization and graph drawing?

Key findings

• The proceedings contain a curated set of revised, peer-reviewed papers that represent the latest research in graph drawing and network visualization.
• Key contributions include new algorithms for hierarchical, orthogonal, and force-directed graph layouts, enhancing visual clarity and performance.
• Several papers introduced theoretical results on graph layout complexity and optimality, advancing foundational understanding in the field.
• The publication in Springer's LNCS series ensures long-term archival access and academic recognition for the presented work.
• The symposium's proceedings serve as a comprehensive reference for researchers and practitioners in visualization and graph algorithms.
• The collection reflects current trends and challenges in visualizing large-scale and complex networks with improved algorithmic efficiency and visual quality.