<h2>Dagstuhl Seminar Proceedings, Volume 8431, </h2> <ul> <li> <span class="authors">Fedor V. Fomin, Kazuo Iwama, and Dieter Kratsch</span> <span class="title">08431 Abstracts Collection – Moderately Exponential Time Algorithms</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08431.1">10.4230/DagSemProc.08431.1</a> </li> <li> <span class="authors">Fedor V. Fomin, Kazuo Iwama, and Dieter Kratsch</span> <span class="title">08431 Executive Summary – Moderately Exponential Time Algorithms</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08431.2">10.4230/DagSemProc.08431.2</a> </li> <li> <span class="authors">Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan van Rooij, and Ryan Williams</span> <span class="title">08431 Open Problems – Moderately Exponential Time Algorithms</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08431.3">10.4230/DagSemProc.08431.3</a> </li> <li> <span class="authors">John Michael Robson</span> <span class="title">Spanning Trees of Bounded Degree Graphs</span> <a class="doi" href="https://doi.org/10.4230/DagSemProc.08431.4">10.4230/DagSemProc.08431.4</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