<?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-23T21:29:21Z</responseDate>
  <request identifier="17386" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:17386</identifier>
        <datestamp>2024-03-06T10:59:37Z</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>PACE Solver Description: GraPA-JAVA</dc:title>
          <dc:creator>Bergenthal, Moritz</dc:creator>
          <dc:creator>Dirks, Jona</dc:creator>
          <dc:creator>Freese, Thorben</dc:creator>
          <dc:creator>Gahde, Jakob</dc:creator>
          <dc:creator>Gerhard, Enna</dc:creator>
          <dc:creator>Grobler, Mario</dc:creator>
          <dc:creator>Siebertz, Sebastian</dc:creator>
          <dc:subject>complexity theory</dc:subject>
          <dc:subject>parameterized complexity</dc:subject>
          <dc:subject>linear programming</dc:subject>
          <dc:subject>java</dc:subject>
          <dc:subject>directed feedback vertex set</dc:subject>
          <dc:subject>PACE 2022</dc:subject>
          <dc:description>We present an exact solver for the DFVS, submitted for the exact track of the Parameterized Algorithms and Computational Experiments challenge (PACE) in 2022. The solver heavily relies on data reduction (known from the literature and new reduction rules). The instances are then further processed by integer linear programming approaches. We implemented the algorithm in the scope of a student project at the University of Bremen.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Moritz Bergenthal and Jona Dirks and Thorben Freese and Jakob Gahde and Enna Gerhard and Mario Grobler and Sebastian Siebertz</dc:contributor>
          <dc:date>2022</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)</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.IPEC.2022.30</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-173861</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.30</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>
