Published in: Dagstuhl Reports, Volume 6, Issue 3 (2016)
Daniel Delling, Camil Demetrescu, David S. Johnson, and Jan Vitek. Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111). In Dagstuhl Reports, Volume 6, Issue 3, pp. 24-43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{delling_et_al:DagRep.6.3.24, author = {Delling, Daniel and Demetrescu, Camil and Johnson, David S. and Vitek, Jan}, title = {{Rethinking Experimental Methods in Computing (Dagstuhl Seminar 16111)}}, pages = {24--43}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {6}, number = {3}, editor = {Delling, Daniel and Demetrescu, Camil and Johnson, David S. and Vitek, Jan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.3.24}, URN = {urn:nbn:de:0030-drops-61463}, doi = {10.4230/DagRep.6.3.24}, annote = {Keywords: Algorithms, Benchmarks, Data sets, Experiments, Repeatability, Reproducibility, Software Artifacts, Statistics} }
Published in: Dagstuhl Reports, Volume 3, Issue 9 (2014)
Andrew V. Goldberg, Giuseppe F. Italiano, David S. Johnson, and Dorothea Wagner. Algorithm Engineering (Dagstuhl Seminar 13391). In Dagstuhl Reports, Volume 3, Issue 9, pp. 169-189, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@Article{goldberg_et_al:DagRep.3.9.169, author = {Goldberg, Andrew V. and Italiano, Giuseppe F. and Johnson, David S. and Wagner, Dorothea}, title = {{Algorithm Engineering (Dagstuhl Seminar 13391)}}, pages = {169--189}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2014}, volume = {3}, number = {9}, editor = {Goldberg, Andrew V. and Italiano, Giuseppe F. and Johnson, David S. and Wagner, Dorothea}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.9.169}, URN = {urn:nbn:de:0030-drops-44214}, doi = {10.4230/DagRep.3.9.169}, annote = {Keywords: Algorithm Engineering, Science of Algorithmics, Manycore Algorithms, Certifying Algorithms, Web Search, Large Graphs} }
Published in: Dagstuhl Seminar Proceedings, Volume 10261, Algorithm Engineering (2010)
Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, and Peter Sanders. 10261 Abstracts Collection – Algorithm Engineering. In Algorithm Engineering. Dagstuhl Seminar Proceedings, Volume 10261, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 10261, Algorithm Engineering (2010)
Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, and Peter Sanders. 10261 Executive Summary – Algorithm Engineering. In Algorithm Engineering. Dagstuhl Seminar Proceedings, Volume 10261, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 10261, Algorithm Engineering (2010)
Ahmed Abousamra, David P. Bunde, and Kirk Pruhs. An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints. In Algorithm Engineering. Dagstuhl Seminar Proceedings, Volume 10261, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@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} }
Published in: Dagstuhl Seminar Proceedings, Volume 10261, Algorithm Engineering (2010)
Henning Meyerhenke and Joachim Gehweiler. On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In Algorithm Engineering. Dagstuhl Seminar Proceedings, Volume 10261, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@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} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
David S. Johnson, Jan Karel Lenstra, and Gerhard J. Woeginger. The Travelling Salesman Problem (Dagstuhl Seminar 02261). Dagstuhl Seminar Report 346, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2004)
@TechReport{johnson_et_al:DagSemRep.346, author = {Johnson, David S. and Lenstra, Jan Karel and Woeginger, Gerhard J.}, title = {{The Travelling Salesman Problem (Dagstuhl Seminar 02261)}}, pages = {1--17}, ISSN = {1619-0203}, year = {2004}, type = {Dagstuhl Seminar Report}, number = {346}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.346}, URN = {urn:nbn:de:0030-drops-152271}, doi = {10.4230/DagSemRep.346}, }
Feedback for Dagstuhl Publishing