<?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-25T01:58:08Z</responseDate>
  <request identifier="20499" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:20499</identifier>
        <datestamp>2026-04-20T12:54:26Z</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>Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062)</dc:title>
          <dc:creator>Dujmović, Vida</dc:creator>
          <dc:creator>Hong, Seok-Hee</dc:creator>
          <dc:creator>Kaufmann, Michael</dc:creator>
          <dc:creator>Pach, János</dc:creator>
          <dc:creator>Förster, Henry</dc:creator>
          <dc:subject>Combinatorial geometry</dc:subject>
          <dc:subject>Graph algorithm</dc:subject>
          <dc:subject>Graph drawing</dc:subject>
          <dc:subject>Graph theory</dc:subject>
          <dc:subject>Network visualization</dc:subject>
          <dc:description>This report documents the program and the outcomes of Dagstuhl Seminar 24062 "Beyond-Planar Graphs: Models, Structures and Geometric Representations". The seminar investigated beyond-planar graphs, in particular, their combinatorial and topological structures, computational complexity and algorithmics for recognition, geometric representations, and their applications to real-world network visualization. Compared to the previous two editions of the seminar, we focus more on aspects of combinatorics and geometry. &#13;
The program consists of four invited talks on beyond planar graphs, open problem session, problem solving sessions and progress report sessions. Specific open problems include questions regarding the combinatorial structures and topology (e.g., k^+-real face graphs, beyond upward planar graphs, sparse universal geometric graphs, local-crossing-critical graphs), the geometric representations (e.g., constrained outer string graphs, rerouting curves on surface), and applications.&#13;
The details of the invited talks and progress reports from each working groups are included in this report.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Vida Dujmović and Seok-Hee Hong and Michael Kaufmann and János Pach and Henry Förster</dc:contributor>
          <dc:date>2024</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 14, Issue 2 (2024)</dc:relation>
          <dc:type>Article</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/DagRep.14.2.71</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-204999</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.2.71</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>
