Published in: Dagstuhl Reports, Volume 13, Issue 6 (2024)
Anne Auger, Peter A. N. Bosman, Pascal Kerschke, Darrell Whitley, and Lennart Schäpermeier. Challenges in Benchmarking Optimization Heuristics (Dagstuhl Seminar 23251). In Dagstuhl Reports, Volume 13, Issue 6, pp. 55-80, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@Article{auger_et_al:DagRep.13.6.55, author = {Auger, Anne and Bosman, Peter A. N. and Kerschke, Pascal and Whitley, Darrell and Sch\"{a}permeier, Lennart}, title = {{Challenges in Benchmarking Optimization Heuristics (Dagstuhl Seminar 23251)}}, pages = {55--80}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2024}, volume = {13}, number = {6}, editor = {Auger, Anne and Bosman, Peter A. N. and Kerschke, Pascal and Whitley, Darrell and Sch\"{a}permeier, Lennart}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.13.6.55}, URN = {urn:nbn:de:0030-drops-196383}, doi = {10.4230/DagRep.13.6.55}, annote = {Keywords: benchmarking, design of search heuristics, optimization, real-world applications, understanding problem complexity} }
Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Erich Grädel and Svenja Schalthöfer. Choiceless Logarithmic Space. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 31:1-31:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gradel_et_al:LIPIcs.MFCS.2019.31, author = {Gr\"{a}del, Erich and Schalth\"{o}fer, Svenja}, title = {{Choiceless Logarithmic Space}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {31:1--31:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.31}, URN = {urn:nbn:de:0030-drops-109758}, doi = {10.4230/LIPIcs.MFCS.2019.31}, annote = {Keywords: Finite Model Theory, Logics for Logspace, Choiceless Computation} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Peter Schäfer. Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition). In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 66:1-66:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{schafer:LIPIcs.SoCG.2019.66, author = {Sch\"{a}fer, Peter}, title = {{Fr\'{e}chet View - A Tool for Exploring Fr\'{e}chet Distance Algorithms}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {66:1--66:5}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-104-7}, ISSN = {1868-8969}, year = {2019}, volume = {129}, editor = {Barequet, Gill and Wang, Yusu}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.66}, URN = {urn:nbn:de:0030-drops-104703}, doi = {10.4230/LIPIcs.SoCG.2019.66}, annote = {Keywords: Fr\'{e}chet distance, free-space diagram, polygonal curves, simple polygons} }
Published in: OASIcs, Volume 54, 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)
Philine Gattermann, Peter Großmann, Karl Nachtigall, and Anita Schöbel. Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. In 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016). Open Access Series in Informatics (OASIcs), Volume 54, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{gattermann_et_al:OASIcs.ATMOS.2016.3, author = {Gattermann, Philine and Gro{\ss}mann, Peter and Nachtigall, Karl and Sch\"{o}bel, Anita}, title = {{Integrating Passengers' Routes in Periodic Timetabling: A SAT approach}}, booktitle = {16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)}, pages = {3:1--3:15}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-021-7}, ISSN = {2190-6807}, year = {2016}, volume = {54}, editor = {Goerigk, Marc and Werneck, Renato F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2016.3}, URN = {urn:nbn:de:0030-drops-65279}, doi = {10.4230/OASIcs.ATMOS.2016.3}, annote = {Keywords: PESP, Timetabling, Public Transport, Passengers' Routes, SAT} }
Published in: OASIcs, Volume 14, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10) (2010)
Holger Flier, Matús Mihalák, Anita Schöbel, Peter Widmayer, and Anna Zych. Vertex Disjoint Paths for Dispatching in Railways. In 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10). Open Access Series in Informatics (OASIcs), Volume 14, pp. 61-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{flier_et_al:OASIcs.ATMOS.2010.61, author = {Flier, Holger and Mihal\'{a}k, Mat\'{u}s and Sch\"{o}bel, Anita and Widmayer, Peter and Zych, Anna}, title = {{Vertex Disjoint Paths for Dispatching in Railways}}, booktitle = {10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS'10)}, pages = {61--73}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-20-0}, ISSN = {2190-6807}, year = {2010}, volume = {14}, editor = {Erlebach, Thomas and L\"{u}bbecke, Marco}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2010.61}, URN = {urn:nbn:de:0030-drops-27508}, doi = {10.4230/OASIcs.ATMOS.2010.61}, annote = {Keywords: algorithms, approximation, complexity, graph theory, railways, routing, transportation} }
Published in: OASIcs, Volume 9, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) (2008)
Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, and Anita Schöbel. Dynamic Algorithms for Recoverable Robustness Problems. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08). Open Access Series in Informatics (OASIcs), Volume 9, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{cicerone_et_al:OASIcs.ATMOS.2008.1587, author = {Cicerone, Serafino and Di Stefano, Gabriele and Schachtebeck, Michael and Sch\"{o}bel, Anita}, title = {{Dynamic Algorithms for Recoverable Robustness Problems}}, booktitle = {8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}, pages = {1--20}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-07-1}, ISSN = {2190-6807}, year = {2008}, volume = {9}, editor = {Fischetti, Matteo and Widmayer, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2008.1587}, URN = {urn:nbn:de:0030-drops-15876}, doi = {10.4230/OASIcs.ATMOS.2008.1587}, annote = {Keywords: Robustness, optimization problems, dynamic algorithms, timetabling, delay management} }
Published in: OASIcs, Volume 9, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) (2008)
Michael Schachtebeck and Anita Schöbel. IP-based Techniques for Delay Management with Priority Decisions. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08). Open Access Series in Informatics (OASIcs), Volume 9, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{schachtebeck_et_al:OASIcs.ATMOS.2008.1586, author = {Schachtebeck, Michael and Sch\"{o}bel, Anita}, title = {{IP-based Techniques for Delay Management with Priority Decisions}}, booktitle = {8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}, pages = {1--16}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-07-1}, ISSN = {2190-6807}, year = {2008}, volume = {9}, editor = {Fischetti, Matteo and Widmayer, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2008.1586}, URN = {urn:nbn:de:0030-drops-15862}, doi = {10.4230/OASIcs.ATMOS.2008.1586}, annote = {Keywords: Public transportation, delay, integer programming, never-meet property, heuristics, preprocessing} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Péter L. Erdös, Péter Ligeti, Péter Sziklai, and David C. Torney. Subwords in reverse-complement order. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{erdos_et_al:DagSemProc.06201.10, author = {Erd\"{o}s, P\'{e}ter L. and Ligeti, P\'{e}ter and Sziklai, P\'{e}ter and Torney, David C.}, title = {{Subwords in reverse-complement order}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.10}, URN = {urn:nbn:de:0030-drops-7856}, doi = {10.4230/DagSemProc.06201.10}, annote = {Keywords: Reverse complement order, Reconstruction of words, Microarray experiments} }
Published in: Dagstuhl Seminar Proceedings, Volume 5402, Perspectives Workshop (2006)
Manfred Broy, Matthias Jarke, Manfred Nagl, Hans Dieter Rombach, Armin B. Cremers, Jürgen Ebert, Sabine Glesner, Martin Glinz, Michael Goedicke, Gerhard Goos, Volker Gruhn, Wilhelm Hasselbring, Stefan Jähnichen, Stefan Kowalewski, Bernd J. Krämer, Stefan Leue, Claus Lewerentz, Peter Liggesmeyer, Christoph Lüth, Barbara Paech, Helmut A. Partsch, Ilka Philippow, Lutz Prechelt, Andreas Rausch, Willem-Paul de Roever, Bernhard Rumpe, Gudula Rünger, Wilhelm Schäfer, Kurt Schneider, Andy Schürr, Walter F. Tichy, Bernhard Westfechtel, Wolf Zimmermann, and Albert Zündorf. Dagstuhl-Manifest zur Strategischen Bedeutung des Software Engineering in Deutschland. In Perspectives Workshop. Dagstuhl Seminar Proceedings, Volume 5402, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{broy_et_al:DagSemProc.05402.1, author = {Broy, Manfred and Jarke, Matthias and Nagl, Manfred and Rombach, Hans Dieter and Cremers, Armin B. and Ebert, J\"{u}rgen and Glesner, Sabine and Glinz, Martin and Goedicke, Michael and Goos, Gerhard and Gruhn, Volker and Hasselbring, Wilhelm and J\"{a}hnichen, Stefan and Kowalewski, Stefan and Kr\"{a}mer, Bernd J. and Leue, Stefan and Lewerentz, Claus and Liggesmeyer, Peter and L\"{u}th, Christoph and Paech, Barbara and Partsch, Helmut A. and Philippow, Ilka and Prechelt, Lutz and Rausch, Andreas and de Roever, Willem-Paul and Rumpe, Bernhard and R\"{u}nger, Gudula and Sch\"{a}fer, Wilhelm and Schneider, Kurt and Sch\"{u}rr, Andy and Tichy, Walter F. and Westfechtel, Bernhard and Zimmermann, Wolf and Z\"{u}ndorf, Albert}, title = {{Dagstuhl-Manifest zur Strategischen Bedeutung des Software Engineering in Deutschland}}, booktitle = {Perspectives Workshop}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5402}, editor = {Manfred Broy and Manfred Nagl and Hans Dieter Rombach and Matthias Jarke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05402.1}, URN = {urn:nbn:de:0030-drops-5853}, doi = {10.4230/DagSemProc.05402.1}, annote = {Keywords: Software Engineering, Software Technik, Strategie} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Peter Schütz, Leen Stougie, and Asgeir Tomasgard. Facility location with uncertain demand and economies of scale. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{schutz_et_al:DagSemProc.05031.11, author = {Sch\"{u}tz, Peter and Stougie, Leen and Tomasgard, Asgeir}, title = {{Facility location with uncertain demand and economies of scale}}, booktitle = {Algorithms for Optimization with Incomplete Information}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5031}, editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.11}, URN = {urn:nbn:de:0030-drops-1114}, doi = {10.4230/DagSemProc.05031.11}, annote = {Keywords: facility location , stochastic , economies of scale} }
Feedback for Dagstuhl Publishing