<h2>Dagstuhl Seminar Proceedings, Volume 9491, </h2> <ul> <li> <span class="authors">Lubos Brim, Stefan Edelkamp, Eric A. Hansen, and Peter Sanders</span> <span class="title">09491 Abstracts Collection – Graph Search Engineering</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.09491.1">10.4230/DagSemProc.09491.1</a> </li> <li> <span class="authors">Rong Zhou and Eric A. Hansen</span> <span class="title">Dynamic State-Space Partitioning in External-Memory Graph Search</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.09491.2">10.4230/DagSemProc.09491.2</a> </li> <li> <span class="authors">Malte Helmert and Carmel Domshlak</span> <span class="title">Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.09491.3">10.4230/DagSemProc.09491.3</a> </li> </ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing