<h2>Dagstuhl Seminar Proceedings, Volume 7211, </h2> <ul> <li> <span class="authors">Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, and Jeremy P. Spinrad</span> <span class="title">07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07211.1">10.4230/DagSemProc.07211.1</a> </li> <li> <span class="authors">Van Bang Le and H.N. de Ridder</span> <span class="title">Linear-time certifying recognition for partitioned probe cographs</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.07211.2">10.4230/DagSemProc.07211.2</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