Graph Drawing 2005

12th Annual Graph Drawing Contest

GD 2005 Graph Drawing Contest Call for Participation

The 12th Annual Graph Drawing Contest shall be held in conjunction with the 13th International Symposium on Graph Drawing (GD 2005). The anticipated funding for the contest is US$1,000. The call for participation contains details about the challenge, as well as the contest graphs. It is available as a PDF document:

Call for participation

GD 2005 Contest Overview

This year, the graph drawing contest has three distinct tracks: the graph drawing challenge competition, an evolving-graph drawing contest and a free-style drawing contest.

Challenge summary:
- The graph drawing challenge will take place in one hour during the conference and the challenge will be crossing minimization.
- Teams of one to three participants will be allowed and teams may bring their own software and computers for the challenge.
- Lab space and a simple graph editor, GraphMan, will be provided for teams that did not bring computers/software. Information about the editor, sample input files and overview of the file format are available here.
Evolving-graph drawing competition:
- The challenge of drawing large evolving graphs can be addressed in various ways. Any visualizations based on the contest data, including animations, static images, subgraphs and derivations of the contest graph, are welcome as submission.
- In addition to the visualizations, we encourage contestants to submit supplemental material, such as background relevance of the graph, case studies, concepts, algorithms, experiments, structural results, that address the problem of visualizing this type of data in a meaningful way.
- The data set for this challenge, represents a real-world bipartite graph based on the Internet Movie Database, where nodes are actors and movies and edges represent relations between movies and actors.
Free-style drawing contest:
- The free-style contest is an opportunity for participants to present their best graph visualizations.
- All types of graph drawings can be submitted to this contest, and judging will be based on artistic merit and relevance to the graph drawing community.

GD2005 Contest Submissions

Submissions for the evolving-graph and the free-style contests must be received by midnight September 8th and should include the following information:

Names and email addresses of the contributors;
A picture illustrating the graph (graphs);
A brief description of the graph, how it was generated, and its relevance to the graph drawing community;

If your drawing requires special printing because of size, resolution, or color constraints, you are encouraged to submit via hard-copy. Besides hard-copy submissions, acceptable electronic formats include PDF and PostScript for static images. For dynamic graphs or animations use mpg or avi files. Movies should be made with standard codecs and be accompanied by a pdf/ps description and a location where the movie can be downloaded from. All contest submissions should be sent to:

Stephen G. Kobourov
Department of Computer Science
University of Arizona
1040 E 4th Street
Tucson, AZ 85721-0077

Graph Drawing Contest Committee

Christian A. Duncan, University of Miami
Stephen G. Kobourov (Chair), University of Arizona
Dorothea Wagner, University of Karlsruhe

Contest Report

Graph Drawing Challenge: The first place winner was the team of Markus Chimani, Carsten Gutwenger and Karsten Klein using a custom made tool, grapla. The grapla tool was written by Andrei Grecu and was also used by last year's winning team. Three honorable mentions were given to Daniel Stefankovic, Michael Bennett, and the team of Michael Spriggs and Josh Liason. The first two used a combination approach of automated and manual crossing minimization, while the last used only the GraphMan graph editor. The 2005 Graph Challenge data is available here.
Evolving Graph Contest: The first prize winner went to Vlado Batagelj, Andrej Mrvar, Adel Ahmed, Xioyan Fu, Seokhee Hong, and Damian Merrick for their submission "Some Approaches to the Analysis and Visualization of the Internet Movie Database.'' Honorable mentions were given to Michael Baur, Marco Gaertler, and Roberg Gorke for their submission "Analyzing the Career of Actors (How to Become Famous Fast)'' and to Ulrik Brandes, Martin Hoefer, and Christian Pick for their submission "Dynamic Egocentric Layout of Actor Biographies.''
Free-Style Contest: Five submissions for the free-style category were received. The contest committee awarded first prize to Marco Gaertler and Markus Krug for their submission "Flying Through a Graph's Spectrum.''

This page is a reformatted mirror of the contest page on http://www.ul.ie/gd2005/
Other Graph Drawing Contests Contest 2005 Graph Drawing Challenge Evolving Graphs Contest Report	12th Annual Graph Drawing Contest Sponsored by: GD 2005 Graph Drawing Contest Call for Participation The 12th Annual Graph Drawing Contest shall be held in conjunction with the 13th International Symposium on Graph Drawing (GD 2005). The anticipated funding for the contest is US$1,000. The call for participation contains details about the challenge, as well as the contest graphs. It is available as a PDF document: Call for participation GD 2005 Contest Overview This year, the graph drawing contest has three distinct tracks: the graph drawing challenge competition, an evolving-graph drawing contest and a free-style drawing contest. Challenge summary: The graph drawing challenge will take place in one hour during the conference and the challenge will be crossing minimization. Teams of one to three participants will be allowed and teams may bring their own software and computers for the challenge. Lab space and a simple graph editor, GraphMan, will be provided for teams that did not bring computers/software. Information about the editor, sample input files and overview of the file format are available here. Evolving-graph drawing competition: The challenge of drawing large evolving graphs can be addressed in various ways. Any visualizations based on the contest data, including animations, static images, subgraphs and derivations of the contest graph, are welcome as submission. In addition to the visualizations, we encourage contestants to submit supplemental material, such as background relevance of the graph, case studies, concepts, algorithms, experiments, structural results, that address the problem of visualizing this type of data in a meaningful way. The data set for this challenge, represents a real-world bipartite graph based on the Internet Movie Database, where nodes are actors and movies and edges represent relations between movies and actors. Free-style drawing contest: The free-style contest is an opportunity for participants to present their best graph visualizations. All types of graph drawings can be submitted to this contest, and judging will be based on artistic merit and relevance to the graph drawing community. GD2005 Contest Submissions Submissions for the evolving-graph and the free-style contests must be received by midnight September 8th and should include the following information: Names and email addresses of the contributors; A picture illustrating the graph (graphs); A brief description of the graph, how it was generated, and its relevance to the graph drawing community; If your drawing requires special printing because of size, resolution, or color constraints, you are encouraged to submit via hard-copy. Besides hard-copy submissions, acceptable electronic formats include PDF and PostScript for static images. For dynamic graphs or animations use mpg or avi files. Movies should be made with standard codecs and be accompanied by a pdf/ps description and a location where the movie can be downloaded from. All contest submissions should be sent to: Stephen G. Kobourov Department of Computer Science University of Arizona 1040 E 4th Street Tucson, AZ 85721-0077 Graph Drawing Contest Committee Christian A. Duncan, University of Miami Stephen G. Kobourov (Chair), University of Arizona Dorothea Wagner, University of Karlsruhe Contest Report Graph Drawing Challenge: The first place winner was the team of Markus Chimani, Carsten Gutwenger and Karsten Klein using a custom made tool, grapla. The grapla tool was written by Andrei Grecu and was also used by last year's winning team. Three honorable mentions were given to Daniel Stefankovic, Michael Bennett, and the team of Michael Spriggs and Josh Liason. The first two used a combination approach of automated and manual crossing minimization, while the last used only the GraphMan graph editor. The 2005 Graph Challenge data is available here. Evolving Graph Contest: The first prize winner went to Vlado Batagelj, Andrej Mrvar, Adel Ahmed, Xioyan Fu, Seokhee Hong, and Damian Merrick for their submission "Some Approaches to the Analysis and Visualization of the Internet Movie Database.'' Honorable mentions were given to Michael Baur, Marco Gaertler, and Roberg Gorke for their submission "Analyzing the Career of Actors (How to Become Famous Fast)'' and to Ulrik Brandes, Martin Hoefer, and Christian Pick for their submission "Dynamic Egocentric Layout of Actor Biographies.'' Free-Style Contest: Five submissions for the free-style category were received. The contest committee awarded first prize to Marco Gaertler and Markus Krug for their submission "Flying Through a Graph's Spectrum.''
Legal notice