<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-24T12:23:39Z</responseDate>
  <request identifier="25027" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:25027</identifier>
        <datestamp>2026-02-09T07:53:50Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Graph Drawing Contest Report (Graph Drawing Contest Report)</dc:title>
          <dc:creator>Di Bartolomeo, Sara</dc:creator>
          <dc:creator>Klute, Fabian</dc:creator>
          <dc:creator>Mondal, Debajyoti</dc:creator>
          <dc:creator>Wulms, Jules</dc:creator>
          <dc:subject>Graph Drawing</dc:subject>
          <dc:subject>Information Visualization</dc:subject>
          <dc:subject>Graph Drawing Contest</dc:subject>
          <dc:description>This report describes the 32nd Annual Graph Drawing Contest, held in conjunction with the 33rd International Symposium on Graph Drawing and Network Visualization (GD'25) at Linköping University, Norrköping, Sweden. The mission of the Graph Drawing Contest is to monitor and challenge the current state of the art in graph-drawing technology. This year’s edition featured two categories, a creative topic in which participants visualized a dataset based on the Netflix show Dark and a live challenge held at the conference where participants had to draw a graph on a grid, such that the drawing is k-planar for as low a k as possible. A special feature of this year’s contest is that the submissions to the creative topic were exhibited in the "Norrköping Decision Arena", a room with a circular annulus-shaped screen.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Sara Di Bartolomeo and Fabian Klute and Debajyoti Mondal and Jules Wulms</dc:contributor>
          <dc:date>2025</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 357, 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.GD.2025.41</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-250275</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.41</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
