International Symposium on Graph Drawing
Generated by GPT-5-miniExpansion Funnel Raw 115 → Dedup 0 → NER 0 → Enqueued 0
| International Symposium on Graph Drawing | |
|---|---|
| Name | International Symposium on Graph Drawing |
| Status | Active |
| Genre | Academic conference |
| Frequency | Annual |
| First | 1993 |
| Discipline | Computer science |
| Country | International |
International Symposium on Graph Drawing The International Symposium on Graph Drawing is an annual scholarly meeting focusing on Graph theory, Graph drawing, and related areas of Discrete mathematics and Computer science. The symposium brings together researchers from Cornell University, ETH Zurich, Princeton University, Massachusetts Institute of Technology, and other institutions to present advances connecting Computational geometry, Information visualization, Human–computer interaction, Algorithm design, and Data visualization. Papers and workshops at the symposium often intersect with work from ACM SIGGRAPH, IEEE VIS, European Symposium on Algorithms, SIAM, and International Computer Science Institute.
History
The symposium originated in 1993 amid growing interest following results by researchers affiliated with Frederickson, Tamassia, Eades, Di Battista, and collaborators who had ties to conferences like STOC, FOCS, SODA, ICALP, and SoCG. Early meetings featured attendees from Bell Labs, AT&T Research, Bellcore, and universities such as University of Toronto, University of California, Berkeley, University of Illinois Urbana–Champaign, and University of Pennsylvania. Over the years the symposium alternated hosting between European centers including University of Cambridge, Technische Universität Berlin, Università di Pisa and North American venues including Brown University, University of Arizona, and Carnegie Mellon University while occasionally collaborating with workshops at European Computer Science Summit and panels tied to Dagstuhl seminars.
Scope and Topics
The symposium covers theoretical and experimental topics linking Graph theory, Computational geometry, Algorithmics, Network science, Information visualization, and Human–computer interaction. Typical themes include layout algorithms influenced by work from Fruchterman–Reingold, Kamada–Kawai, Sugiyama, and methods related to Force-directed graph drawing, Planar graphs, Crossing number, Graph minors, Treewidth, Spectral graph theory, Orthogonal graph drawing, Straight-line drawing, Geometric graph theory, Graph drawing aesthetics, Large-scale visualization, Streaming algorithms, Parallel computing, GPU acceleration, Bioinformatics networks, Social network analysis, Databases in graph processing, and interoperability with standards promoted by W3C, IEEE, and ISO technical committees.
Conference Format and Events
Annual programs typically include peer-reviewed paper sessions modeled after ACM and IEEE proceedings, keynote lectures delivered by scholars from institutions such as Stanford University, Harvard University, Yale University, and University of Oxford, and tutorial tracks reflecting curricula from Courant Institute, Max Planck Institute for Informatics, and CNRS. Complementary events include poster sessions, software demonstrations often featuring implementations from Graphviz, Gephi, Cytoscape, and Tulip, challenge tracks in collaboration with Kaggle-style competitions, doctoral consortiums akin to SIGMOD student fora, and Dagstuhl-inspired workshops. Social events and panel discussions sometimes coincide with meetings of societies like ACM SIGACT, IEEE Computer Society, and EUROGRAPHICS.
Proceedings and Publications
Accepted research is published in formal proceedings frequently indexed by DBLP, ACM Digital Library, and IEEE Xplore; special issues often appear in journals such as Journal of Graph Algorithms and Applications, Computational Geometry: Theory and Applications, Algorithmica, Discrete & Computational Geometry, and IEEE Transactions on Visualization and Computer Graphics. Selected papers are expanded into chapters in edited volumes published by Springer, Elsevier, and Oxford University Press. Archive collections and citation records are cross-referenced in bibliographic services like Google Scholar, Scopus, and MathSciNet.
Notable Contributions and Awards
Work presented at the symposium has advanced foundational results including practical algorithms related to planarity testing, graph drawing aesthetics, and heuristics influencing software such as Graphviz and Gephi. Contributions have intersected with milestone results from laureates associated with prizes like the Gödel Prize, Knuth Prize, Turing Award, and Fulkerson Prize through cross-pollination of techniques. The community recognizes outstanding papers and young researchers via symposium-specific awards, best-paper distinctions similar to accolades at SODA and STOC, and doctoral dissertation prizes aligned with honors from ACM and SIAM.
Organizers and Governance
The symposium is organized by an international program committee drawn from university departments and research labs including University of Waterloo, ETH Zurich, TU Wien, University of Tokyo, National Institute of Informatics, University of Sydney, KAIST, and Peking University. Steering and advisory roles have involved representatives from professional bodies such as ACM, IEEE, SIAM, and European Association for Theoretical Computer Science to ensure peer review standards consistent with those at ICALP and Eurographics. Local organizing committees collaborate with host institutions and funding agencies including national science foundations like NSF and DFG when applicable.