Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote, André van Renssen, Marcel Roeloffzen, and Birgit Vogtenhuber. Packing Short Plane Spanning Trees in Complete Geometric Graphs. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 9:1-9:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{aichholzer_et_al:LIPIcs.ISAAC.2016.9, author = {Aichholzer, Oswin and Hackl, Thomas and Korman, Matias and Pilz, Alexander and Rote, G\"{u}nter and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Vogtenhuber, Birgit}, title = {{Packing Short Plane Spanning Trees in Complete Geometric Graphs}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {9:1--9:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.9}, URN = {urn:nbn:de:0030-drops-67823}, doi = {10.4230/LIPIcs.ISAAC.2016.9}, annote = {Keywords: Geometric Graphs, Graph Packing, Plane Graphs, Minimum Spanning Tree, Bottleneck Edge} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Oswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, and Birgit Vogtenhuber. An Improved Lower Bound on the Minimum Number of Triangulations. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 7:1-7:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2016.7, author = {Aichholzer, Oswin and Alvarez, Victor and Hackl, Thomas and Pilz, Alexander and Speckmann, Bettina and Vogtenhuber, Birgit}, title = {{An Improved Lower Bound on the Minimum Number of Triangulations}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.7}, URN = {urn:nbn:de:0030-drops-58993}, doi = {10.4230/LIPIcs.SoCG.2016.7}, annote = {Keywords: Combinatorial geometry, Order types, Triangulations} }
Published in: Dagstuhl Seminar Proceedings, Volume 6491, Digital Historical Corpora- Architecture, Annotation, and Retrieval (2007)
Thomas Pilz. Searching in text databases with non-standard orthography. In Digital Historical Corpora- Architecture, Annotation, and Retrieval. Dagstuhl Seminar Proceedings, Volume 6491, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{pilz:DagSemProc.06491.14, author = {Pilz, Thomas}, title = {{Searching in text databases with non-standard orthography}}, booktitle = {Digital Historical Corpora- Architecture, Annotation, and Retrieval}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6491}, editor = {Lou Burnard and Milena Dobreva and Norbert Fuhr and Anke L\"{u}deling}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06491.14}, URN = {urn:nbn:de:0030-drops-10533}, doi = {10.4230/DagSemProc.06491.14}, annote = {Keywords: Rule based search, Optical character recognition, spelling variation, edit distance} }
Feedback for Dagstuhl Publishing