<h2>Dagstuhl Seminar Proceedings, Volume 10261, </h2>
<ul>
<li>
<span class="authors">Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, and Peter Sanders</span>
<span class="title">10261 Abstracts Collection – Algorithm Engineering</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.10261.1">10.4230/DagSemProc.10261.1</a>
</li>
<li>
<span class="authors">Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, and Peter Sanders</span>
<span class="title">10261 Executive Summary – Algorithm Engineering</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.10261.2">10.4230/DagSemProc.10261.2</a>
</li>
<li>
<span class="authors">Ahmed Abousamra, David P. Bunde, and Kirk Pruhs</span>
<span class="title">An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.10261.3">10.4230/DagSemProc.10261.3</a>
</li>
<li>
<span class="authors">Henning Meyerhenke and Joachim Gehweiler</span>
<span class="title">On Dynamic Graph Partitioning and Graph Clustering using Diffusion</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.10261.4">10.4230/DagSemProc.10261.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