<?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-20T15:08:01Z</responseDate>
  <request identifier="4427" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:4427</identifier>
        <datestamp>2024-03-06T10:26:05Z</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>Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)</dc:title>
          <dc:creator>Borradaile, Glencora</dc:creator>
          <dc:creator>Klein, Philp</dc:creator>
          <dc:creator>Marx, Dániel</dc:creator>
          <dc:creator>Mathieu, Claire</dc:creator>
          <dc:subject>Algorithms</dc:subject>
          <dc:subject>planar graphs</dc:subject>
          <dc:subject>theory</dc:subject>
          <dc:subject>approximation</dc:subject>
          <dc:subject>fixed-parameter tractable</dc:subject>
          <dc:subject>network flow</dc:subject>
          <dc:subject>network design</dc:subject>
          <dc:subject>kernelization</dc:subject>
          <dc:description>This report documents the program and the outcomes of Dagstuhl Seminar 13421 "Algorithms for Optimization Problems in Planar Graphs". The seminar was held from October 13 to October 18, 2013. This report contains abstracts for the recent developments in planar graph algorithms discussed during the seminar as well as summaries of open problems in this area of research.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Glencora Borradaile and Philp Klein and Dániel Marx and Claire Mathieu</dc:contributor>
          <dc:date>2014</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 3, Issue 10 (2014)</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.3.10.36</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-44274</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.10.36</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
