<?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-10T23:00:41Z</responseDate>
  <request identifier="3153" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:3153</identifier>
        <datestamp>2024-03-06T10:25:40Z</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>Theory and Applications of Graph Searching Problems  (GRASTA 2011) (Dagstuhl Seminar 11071)</dc:title>
          <dc:creator>Fomin, Fedor V.</dc:creator>
          <dc:creator>Fraigniaud, Pierre</dc:creator>
          <dc:creator>Kreutzer, Stephan</dc:creator>
          <dc:creator>Thilikos, Dimitrios M.</dc:creator>
          <dc:subject>Graph Searching</dc:subject>
          <dc:subject>Pursuit Evasion Games</dc:subject>
          <dc:subject>Cop and Robers Games</dc:subject>
          <dc:subject>Fugitive Search Games</dc:subject>
          <dc:description>From February 14, 2012 to February 18, 2012, the Dagstuhl Seminar 11071 &#13;
``Theory and Applications of Graph Searching Problems  (GRASTA 2011)'' &#13;
was held in Schloss Dagstuhl~--~Leibniz Center for Informatics.&#13;
During the seminar, participants presented their current&#13;
research, and ongoing work and open problems were discussed. Abstracts of&#13;
the presentations given during the seminar as well as abstracts of&#13;
seminar results and open problems are put together in this paper. The first section describes the seminar topics and goals in general.&#13;
The second section contains the abstracts of the talks and the third section&#13;
includes the open problems presented during the seminar.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Fedor V. Fomin and Pierre Fraigniaud and Stephan Kreutzer and Dimitrios M. Thilikos</dc:contributor>
          <dc:date>2011</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 1, Issue 2 (2011)</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.1.2.30</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-31534</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.30</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
