Graph Drawing Symposium

Graph Drawing Symposium
Name	Graph Drawing Symposium
Abbreviation	GDS
Discipline	Computer Science, Discrete Mathematics, Computational Geometry
First	1992
Frequency	Annual

Graph Drawing Symposium is an annual scholarly meeting focused on the visualization, layout, and combinatorial properties of graphs and network structures. It convenes researchers from Computer Science, Discrete Mathematics, Computational Geometry, Information Visualization, Human–Computer Interaction, and related venues to exchange results on algorithmic, theoretical, and applied aspects. The symposium functions as a focal point linking work presented at ACM Symposium on Theory of Computing, IEEE Symposium on Foundations of Computer Science, SIAM Conference on Discrete Mathematics, and workshops associated with International Conference on Computational Geometry and CHI Conference on Human Factors in Computing Systems.

History

The origins trace to meetings organized by pioneers whose work intersected with Frank Harary, Richard K. Guy, William Tutte, Paul Erdős, and practitioners from AT&T Bell Laboratories and Bell Labs research groups. Early iterations were shaped by collaborations among researchers from University of Cambridge, Massachusetts Institute of Technology, Princeton University, Stanford University, and University of Illinois Urbana-Champaign. Over time the symposium established formal ties with the European Symposium on Algorithms and the International Symposium on Graph Drawing and Network Visualization, evolving through editorial stewardship reflecting scholars affiliated with University of Barcelona, Technical University of Berlin, École Polytechnique Fédérale de Lausanne, and Tokyo Institute of Technology.

Scope and Topics

The symposium covers a range of topics including algorithmic layout methods influenced by work from David Eppstein, Robert Tarjan, Rafael Tamassia, Jonathan Shewchuk, and Gábor Tardos; combinatorial characterizations building on results by László Lovász, Paul Seymour, Neil Robertson, and Robin Thomas; and interactive visualization techniques associated with groups at Microsoft Research, Google Research, IBM Research, and Yahoo! Research. Typical technical themes intersect with research presented at NeurIPS, ICML, SIGGRAPH, Eurographics, and VLDB: force-directed methods, planar embeddings, orthogonal drawings, 3D visualization, spectral layouts, graph compression, and dynamic network visualization. Applied domains include studies from Bioinformatics labs connected to Harvard Medical School and Sanger Institute, transportation network analyses by teams at MIT Media Lab and ETH Zurich, and social network studies related to Facebook, Twitter, and LinkedIn research groups.

Organization and Governance

Governance is typically conducted by an international program committee chaired by senior researchers with affiliations at institutions such as Cornell University, University of California, Berkeley, Imperial College London, and National University of Singapore. Oversight includes partnership with learned societies like the Association for Computing Machinery, the Institute of Electrical and Electronics Engineers, and SIAM. Proceedings are often edited under the auspices of editors linked to Springer, Lecture Notes in Computer Science, and occasionally ACM Digital Library collections. Decisions on program direction and hosting rotate among organizers with ties to European Research Council grants, National Science Foundation awards, and collaborative projects funded by Horizon 2020 and national funding agencies such as EPSRC.

Annual Conferences and Events

Each annual conference has hosted plenary talks, tutorials, poster sessions, and satellite workshops co-located with meetings like Algorithms and Data Structures Symposium, Graph Algorithms Workshop, and Visualization and Data Analysis (VDA). Notable venues have included Prague, Barcelona, Boston, Berlin, Tokyo, Rome, Vienna, Salt Lake City, and Toronto. Key invited speakers have ranged from scholars at Google DeepMind to academics from Yale University, Columbia University, University of Oxford, and McGill University. Satellite events often feature collaborations with the International Federation for Information Processing and regional chapters of the ACM SIGGRAPH and IEEE VIS communities.

Key Papers and Contributions

Influential contributions presented at the symposium include algorithmic breakthroughs related to planar graph drawing influenced by Kurt Mehlhorn, crossing number bounds connected to work by Miklós Bóna and János Pach, layered graph layouts extending research of Eugene W. Myers and Kozo Sugiyama, and compact encodings of graph embeddings following lines from Jacobson-style succinct data structure research. Other landmark topics include force-directed algorithms building on classical physics analogies popularized by researchers at Bell Labs and later refined by scholars at University of Toronto and Tokyo University, spectral methods inspired by Fan Chung and László Lovász, and dynamic graph drawing techniques aligned with work occurring at Carnegie Mellon University and University of Washington.

Awards and Recognition

The symposium and its community recognize contributions with best paper awards, best student paper awards, and lifetime achievement acknowledgments frequently bestowed by committees including senior members from ACM SIGACT, IEEE Technical Committee on Visualization and Graphics, SIAM Activity Group on Discrete Mathematics, and editorial boards of journals such as Journal of Graph Algorithms and Applications, Computational Geometry: Theory and Applications, and IEEE Transactions on Visualization and Computer Graphics. Recipients have included noted researchers affiliated with Princeton University, Massachusetts Institute of Technology, University of Illinois, University of Pennsylvania, and research labs at Microsoft Research and Google Research.

Category:Academic conferences in computer science