<?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-08-17T12:00:58Z</responseDate>
  <request identifier="19239" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:19239</identifier>
        <datestamp>2026-04-20T13:11:48Z</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>New Frontiers of Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 23162)</dc:title>
          <dc:creator>Ganian, Robert</dc:creator>
          <dc:creator>Montecchiani, Fabrizio</dc:creator>
          <dc:creator>Nöllenburg, Martin</dc:creator>
          <dc:creator>Zehavi, Meirav</dc:creator>
          <dc:creator>Khazaliya, Liana</dc:creator>
          <dc:subject>algorithm design</dc:subject>
          <dc:subject>computational geometry</dc:subject>
          <dc:subject>graph drawing</dc:subject>
          <dc:subject>parameterized complexity</dc:subject>
          <dc:description>This report documents the program and the outcomes of Dagstuhl Seminar 23162 "New Frontiers of Parameterized Complexity in Graph Drawing”. The seminar was held in-person from April 16 to April 21, 2023. It brought together 32 researchers from the Graph Drawing and the Parameterized Complexity research communities to discuss and explore new research frontiers on the interface between the two fields. The report collects the abstracts of talks and open problems presented in the seminar, as well as brief progress reports from the working groups.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Robert Ganian and Fabrizio Montecchiani and Martin Nöllenburg and Meirav Zehavi and Liana Khazaliya</dc:contributor>
          <dc:date>2023</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 13, Issue 4 (2023)</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.13.4.58</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-192393</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.4.58</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>
