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 244, 30th Annual European Symposium on Algorithms (ESA 2022)
Frederik Brüning, Jacobus Conradi, and Anne Driemel. Faster Approximate Covering of Subcurves Under the Fréchet Distance. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bruning_et_al:LIPIcs.ESA.2022.28, author = {Br\"{u}ning, Frederik and Conradi, Jacobus and Driemel, Anne}, title = {{Faster Approximate Covering of Subcurves Under the Fr\'{e}chet Distance}}, booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)}, pages = {28:1--28:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-247-1}, ISSN = {1868-8969}, year = {2022}, volume = {244}, editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.28}, URN = {urn:nbn:de:0030-drops-169660}, doi = {10.4230/LIPIcs.ESA.2022.28}, annote = {Keywords: Clustering, Set cover, Fr\'{e}chet distance, Approximation algorithms} }
Published in: Dagstuhl Reports, Volume 12, Issue 2 (2022)
Anne Auger, Carlos M. Fonseca, Tobias Friedrich, Johannes Lengler, and Armand Gissler. Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081). In Dagstuhl Reports, Volume 12, Issue 2, pp. 87-102, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Article{auger_et_al:DagRep.12.2.87, author = {Auger, Anne and Fonseca, Carlos M. and Friedrich, Tobias and Lengler, Johannes and Gissler, Armand}, title = {{Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 22081)}}, pages = {87--102}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2022}, volume = {12}, number = {2}, editor = {Auger, Anne and Fonseca, Carlos M. and Friedrich, Tobias and Lengler, Johannes and Gissler, Armand}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.2.87}, URN = {urn:nbn:de:0030-drops-169325}, doi = {10.4230/DagRep.12.2.87}, annote = {Keywords: black-box optimization, derivative-free optimization, evolutionary and genetic algorithms, randomized search algorithms, stochastic gradient descent, theoretical computer science} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Jacobus Conradi and Anne Driemel. On Computing the k-Shortcut Fréchet Distance. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 46:1-46:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{conradi_et_al:LIPIcs.ICALP.2022.46, author = {Conradi, Jacobus and Driemel, Anne}, title = {{On Computing the k-Shortcut Fr\'{e}chet Distance}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {46:1--46:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.46}, URN = {urn:nbn:de:0030-drops-163875}, doi = {10.4230/LIPIcs.ICALP.2022.46}, annote = {Keywords: Fr\'{e}chet distance, Partial similarity, Conditional lower bounds, Approximation algorithms} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Anne Driemel, Ivor van der Hoog, and Eva Rotenberg. On the Discrete Fréchet Distance in a Graph. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 36:1-36:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{driemel_et_al:LIPIcs.SoCG.2022.36, author = {Driemel, Anne and van der Hoog, Ivor and Rotenberg, Eva}, title = {{On the Discrete Fr\'{e}chet Distance in a Graph}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {36:1--36:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-227-3}, ISSN = {1868-8969}, year = {2022}, volume = {224}, editor = {Goaoc, Xavier and Kerber, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.36}, URN = {urn:nbn:de:0030-drops-160448}, doi = {10.4230/LIPIcs.SoCG.2022.36}, annote = {Keywords: Fr\'{e}chet, graphs, planar, complexity analysis} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Anne Driemel, Jeff M. Phillips, and Ioannis Psarros. The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 28:1-28:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{driemel_et_al:LIPIcs.SoCG.2019.28, author = {Driemel, Anne and Phillips, Jeff M. and Psarros, Ioannis}, title = {{The VC Dimension of Metric Balls Under Fr\'{e}chet and Hausdorff Distances}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {28:1--28:16}, 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.28}, URN = {urn:nbn:de:0030-drops-104329}, doi = {10.4230/LIPIcs.SoCG.2019.28}, annote = {Keywords: VC dimension, Fr\'{e}chet distance, Hausdorff distance} }
Published in: OASIcs, Volume 34, German Conference on Bioinformatics 2013
Holger Fröhlich and Gunnar W. Klau. Reconstructing Consensus Bayesian Network Structures with Application to Learning Molecular Interaction Networks. In German Conference on Bioinformatics 2013. Open Access Series in Informatics (OASIcs), Volume 34, pp. 46-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{frohlich_et_al:OASIcs.GCB.2013.46, author = {Fr\"{o}hlich, Holger and Klau, Gunnar W.}, title = {{Reconstructing Consensus Bayesian Network Structures with Application to Learning Molecular Interaction Networks}}, booktitle = {German Conference on Bioinformatics 2013}, pages = {46--55}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-59-0}, ISSN = {2190-6807}, year = {2013}, volume = {34}, editor = {Bei{\ss}barth, Tim and Kollmar, Martin and Leha, Andreas and Morgenstern, Burkhard and Schultz, Anne-Kathrin and Waack, Stephan and Wingender, Edgar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.GCB.2013.46}, URN = {urn:nbn:de:0030-drops-42273}, doi = {10.4230/OASIcs.GCB.2013.46}, annote = {Keywords: Bayesian Networks, Network Reverse Engineering, Minimum Feedback Arc Set, Maximum Acyclic Subgraph, Molecular Interaction Networks} }
Published in: Dagstuhl Seminar Proceedings, Volume 6271, Challenges in Symbolic Computation Software (2006)
Anne Frühbis-Krüger. Computational Aspects of the Resolution of Singularities. In Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, Volume 6271, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{fruhbiskruger:DagSemProc.06271.7, author = {Fr\"{u}hbis-Kr\"{u}ger, Anne}, title = {{Computational Aspects of the Resolution of Singularities}}, booktitle = {Challenges in Symbolic Computation Software}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6271}, editor = {Wolfram Decker and Mike Dewar and Erich Kaltofen and Stephen Watt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06271.7}, URN = {urn:nbn:de:0030-drops-7713}, doi = {10.4230/DagSemProc.06271.7}, annote = {Keywords: Resolution of Singularities, algorithmic desingularization,} }
Feedback for Dagstuhl Publishing