Published in: LIPIcs, Volume 301, 22nd International Symposium on Experimental Algorithms (SEA 2024)
Philip Mayer and Petra Mutzel. Engineering A* Search for the Flip Distance of Plane Triangulations. In 22nd International Symposium on Experimental Algorithms (SEA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 301, pp. 23:1-23:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{mayer_et_al:LIPIcs.SEA.2024.23, author = {Mayer, Philip and Mutzel, Petra}, title = {{Engineering A* Search for the Flip Distance of Plane Triangulations}}, booktitle = {22nd International Symposium on Experimental Algorithms (SEA 2024)}, pages = {23:1--23:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-325-6}, ISSN = {1868-8969}, year = {2024}, volume = {301}, editor = {Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.23}, URN = {urn:nbn:de:0030-drops-203887}, doi = {10.4230/LIPIcs.SEA.2024.23}, annote = {Keywords: Computational Geometry, Triangulations, Flip Distance, A-star Search, Integer Linear Programming} }
Published in: LIPIcs, Volume 224, 38th International Symposium on Computational Geometry (SoCG 2022)
Anna Arutyunova, Anne Driemel, Jan-Henrik Haunert, Herman Haverkort, Jürgen Kusche, Elmar Langetepe, Philip Mayer, Petra Mutzel, and Heiko Röglin. Minimum-Error Triangulations for Sea Surface Reconstruction. In 38th International Symposium on Computational Geometry (SoCG 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 224, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{arutyunova_et_al:LIPIcs.SoCG.2022.7, author = {Arutyunova, Anna and Driemel, Anne and Haunert, Jan-Henrik and Haverkort, Herman and Kusche, J\"{u}rgen and Langetepe, Elmar and Mayer, Philip and Mutzel, Petra and R\"{o}glin, Heiko}, title = {{Minimum-Error Triangulations for Sea Surface Reconstruction}}, booktitle = {38th International Symposium on Computational Geometry (SoCG 2022)}, pages = {7:1--7: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.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2022.7}, URN = {urn:nbn:de:0030-drops-160155}, doi = {10.4230/LIPIcs.SoCG.2022.7}, annote = {Keywords: Minimum-Error Triangulation, k-Order Delaunay Triangulations, Data dependent Triangulations, Sea Surface Reconstruction, fixed-Edge Graph} }
Published in: LIPIcs, Volume 126, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Spyros Angelopoulos, Christoph Dürr, and Shendan Jin. Best-Of-Two-Worlds Analysis of Online Search. In 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 126, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{angelopoulos_et_al:LIPIcs.STACS.2019.7, author = {Angelopoulos, Spyros and D\"{u}rr, Christoph and Jin, Shendan}, title = {{Best-Of-Two-Worlds Analysis of Online Search}}, booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-100-9}, ISSN = {1868-8969}, year = {2019}, volume = {126}, editor = {Niedermeier, Rolf and Paul, Christophe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.7}, URN = {urn:nbn:de:0030-drops-102467}, doi = {10.4230/LIPIcs.STACS.2019.7}, annote = {Keywords: Online computation, search problems, linear search, performance measures} }
Published in: LIPIcs, Volume 53, 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)
Elmar Langetepe and David Kübel. Optimal Online Escape Path Against a Certificate. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 53, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{langetepe_et_al:LIPIcs.SWAT.2016.19, author = {Langetepe, Elmar and K\"{u}bel, David}, title = {{Optimal Online Escape Path Against a Certificate}}, booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-011-8}, ISSN = {1868-8969}, year = {2016}, volume = {53}, editor = {Pagh, Rasmus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2016.19}, URN = {urn:nbn:de:0030-drops-60414}, doi = {10.4230/LIPIcs.SWAT.2016.19}, annote = {Keywords: Search games, online algorithms, escape path, competitive analysis, spiral conjecture} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Rolf Klein, Elmar Langetepe, and Christos Levcopoulos. A Fire Fighter’s Problem. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 768-780, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{klein_et_al:LIPIcs.SOCG.2015.768, author = {Klein, Rolf and Langetepe, Elmar and Levcopoulos, Christos}, title = {{A Fire Fighter’s Problem}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {768--780}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.768}, URN = {urn:nbn:de:0030-drops-51044}, doi = {10.4230/LIPIcs.SOCG.2015.768}, annote = {Keywords: Motion Planning, Dynamic Environments, Spiralling strategies, Lower and upper bounds} }
Published in: Dagstuhl Seminar Proceedings, Volume 6421, Robot Navigation (2007)
Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, and Gerhard Trippen. Competitive Online Searching for a Ray in the Plane. In Robot Navigation. Dagstuhl Seminar Proceedings, Volume 6421, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{eubeler_et_al:DagSemProc.06421.5, author = {Eubeler, Andrea and Fleischer, Rudolf and Kamphans, Tom and Klein, Rolf and Langetepe, Elmar and Trippen, Gerhard}, title = {{Competitive Online Searching for a Ray in the Plane}}, booktitle = {Robot Navigation}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6421}, editor = {S\'{a}ndor Fekete and Rudolf Fleischer and Rolf Klein and Alejandro Lopez-Ortiz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06421.5}, URN = {urn:nbn:de:0030-drops-8687}, doi = {10.4230/DagSemProc.06421.5}, annote = {Keywords: Online motion planning, competitive analysis, ray search} }
Feedback for Dagstuhl Publishing