@InProceedings{italiano_et_al:DagSemProc.10261.1,
author = {Italiano, Giuseppe F. and Johnson, David S. and Mutzel, Petra and Sanders, Peter},
title = {{10261 Abstracts Collection – Algorithm Engineering}},
booktitle = {Algorithm Engineering},
pages = {1--10},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {10261},
editor = {Giuseppe F. Italiano and David S. Johnson and Petra Mutzel and Peter Sanders},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10261.1},
URN = {urn:nbn:de:0030-drops-28179},
doi = {10.4230/DagSemProc.10261.1},
annote = {Keywords: Experimental algorithmics, Game theory, Parallel and distributed algorithms, Multi-core}
}
@InProceedings{italiano_et_al:DagSemProc.10261.2,
author = {Italiano, Giuseppe F. and Johnson, David S. and Mutzel, Petra and Sanders, Peter},
title = {{10261 Executive Summary – Algorithm Engineering}},
booktitle = {Algorithm Engineering},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {10261},
editor = {Giuseppe F. Italiano and David S. Johnson and Petra Mutzel and Peter Sanders},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10261.2},
URN = {urn:nbn:de:0030-drops-27966},
doi = {10.4230/DagSemProc.10261.2},
annote = {Keywords: Experimental algorithmics, Game theory, Parallel and distributed algorithms, Multi-core}
}
@InProceedings{abousamra_et_al:DagSemProc.10261.3,
author = {Abousamra, Ahmed and Bunde, David P. and Pruhs, Kirk},
title = {{An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints}},
booktitle = {Algorithm Engineering},
pages = {1--22},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {10261},
editor = {Giuseppe F. Italiano and David S. Johnson and Petra Mutzel and Peter Sanders},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10261.3},
URN = {urn:nbn:de:0030-drops-27971},
doi = {10.4230/DagSemProc.10261.3},
annote = {Keywords: Scheduling, Speed Scaling, Experimental Algorithms, Power Management}
}
@InProceedings{meyerhenke_et_al:DagSemProc.10261.4,
author = {Meyerhenke, Henning and Gehweiler, Joachim},
title = {{On Dynamic Graph Partitioning and Graph Clustering using Diffusion}},
booktitle = {Algorithm Engineering},
pages = {1--19},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {10261},
editor = {Giuseppe F. Italiano and David S. Johnson and Petra Mutzel and Peter Sanders},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10261.4},
URN = {urn:nbn:de:0030-drops-27980},
doi = {10.4230/DagSemProc.10261.4},
annote = {Keywords: Dynamic graph partitioning/clustering, disturbed diffusion, load balancing, relaxed cut optimization}
}
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