Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Zuzana Patáková. Bounding Radon Number via Betti Numbers. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 61:1-61:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{patakova:LIPIcs.SoCG.2020.61, author = {Pat\'{a}kov\'{a}, Zuzana}, title = {{Bounding Radon Number via Betti Numbers}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {61:1--61:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.61}, URN = {urn:nbn:de:0030-drops-122198}, doi = {10.4230/LIPIcs.SoCG.2020.61}, annote = {Keywords: Radon number, topological complexity, constrained chain maps, fractional Helly theorem, convexity spaces} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, and Natan Rubin. Further Consequences of the Colorful Helly Hypothesis. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 59:1-59:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{martinezsandoval_et_al:LIPIcs.SoCG.2018.59, author = {Mart{\'\i}nez-Sandoval, Leonardo and Rold\'{a}n-Pensado, Edgardo and Rubin, Natan}, title = {{Further Consequences of the Colorful Helly Hypothesis}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {59:1--59:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.59}, URN = {urn:nbn:de:0030-drops-87726}, doi = {10.4230/LIPIcs.SoCG.2018.59}, annote = {Keywords: geometric transversals, convex sets, colorful Helly-type theorems, line transversals, weak epsilon-nets, transversal numbers} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Pankaj K. Agarwal, Natan Rubin, and Micha Sharir. Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 4:1-4:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{agarwal_et_al:LIPIcs.ESA.2017.4, author = {Agarwal, Pankaj K. and Rubin, Natan and Sharir, Micha}, title = {{Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {4:1--4:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.4}, URN = {urn:nbn:de:0030-drops-78182}, doi = {10.4230/LIPIcs.ESA.2017.4}, annote = {Keywords: Approximate nearest neighbor search, k-flats, Polyhedral distance functions, Linear programming queries} }
Feedback for Dagstuhl Publishing