<?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-21T23:20:45Z</responseDate>
  <request identifier="22267" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:22267</identifier>
        <datestamp>2026-04-20T12:50:14Z</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>Discrete Algorithms on Modern and Emerging Compute Infrastructure (Dagstuhl Seminar 24201)</dc:title>
          <dc:creator>Hanauer, Kathrin</dc:creator>
          <dc:creator>Naumann, Uwe</dc:creator>
          <dc:creator>Pothen, Alex</dc:creator>
          <dc:creator>Schreiber, Robert</dc:creator>
          <dc:subject>Combinatorial Scientific Computing</dc:subject>
          <dc:subject>Discrete Algorithms</dc:subject>
          <dc:subject>Graph Algorithms</dc:subject>
          <dc:subject>High-Performance Computing</dc:subject>
          <dc:description>Inspired by three plenary talks by leading figures in the area of "Discrete algorithms on modern and emerging compute infrastructure" this Dagstuhl Seminar emphasized focus sessions and working groups to dive into this very versatile topic. Lively discussions between experts from academia, research laboratories, and industry yielded a number of promising prospects for follow-up activities. As always, Dagstuhl provided the perfect setting for this kind of scientific exchange.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Kathrin Hanauer and Uwe Naumann and Alex Pothen and Robert Schreiber</dc:contributor>
          <dc:date>2024</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 14, Issue 5 (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.5.12</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-222672</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.5.12</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>
