Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, and Jie Xue. Dynamic Geometric Set Cover and Hitting Set. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 2:1-2:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2020.2, author = {Agarwal, Pankaj K. and Chang, Hsien-Chih and Suri, Subhash and Xiao, Allen and Xue, Jie}, title = {{Dynamic Geometric Set Cover and Hitting Set}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {2:1--2:15}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.2}, URN = {urn:nbn:de:0030-drops-121604}, doi = {10.4230/LIPIcs.SoCG.2020.2}, annote = {Keywords: Geometric set cover, Geometric hitting set, Dynamic data structures} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Pankaj K. Agarwal, Hsien-Chih Chang, and Allen Xiao. Efficient Algorithms for Geometric Partial Matching. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 6:1-6:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2019.6, author = {Agarwal, Pankaj K. and Chang, Hsien-Chih and Xiao, Allen}, title = {{Efficient Algorithms for Geometric Partial Matching}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {6:1--6:14}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.6}, URN = {urn:nbn:de:0030-drops-104109}, doi = {10.4230/LIPIcs.SoCG.2019.6}, annote = {Keywords: partial matching, transportation, optimal transport, minimum-cost flow, bichromatic closest pair} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, and Allen Xiao. Approximate Minimum-Weight Matching with Outliers Under Translation. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 26:1-26:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{agarwal_et_al:LIPIcs.ISAAC.2018.26, author = {Agarwal, Pankaj K. and Kaplan, Haim and Kipper, Geva and Mulzer, Wolfgang and Rote, G\"{u}nter and Sharir, Micha and Xiao, Allen}, title = {{Approximate Minimum-Weight Matching with Outliers Under Translation}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {26:1--26:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.26}, URN = {urn:nbn:de:0030-drops-99747}, doi = {10.4230/LIPIcs.ISAAC.2018.26}, annote = {Keywords: Minimum-weight partial matching, Pattern matching, Approximation} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R. Varadarajan, and Allen Xiao. Faster Algorithms for the Geometric Transportation Problem. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 7:1-7:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2017.7, author = {Agarwal, Pankaj K. and Fox, Kyle and Panigrahi, Debmalya and Varadarajan, Kasturi R. and Xiao, Allen}, title = {{Faster Algorithms for the Geometric Transportation Problem}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {7:1--7:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-038-5}, ISSN = {1868-8969}, year = {2017}, volume = {77}, editor = {Aronov, Boris and Katz, Matthew J.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.7}, URN = {urn:nbn:de:0030-drops-72344}, doi = {10.4230/LIPIcs.SoCG.2017.7}, annote = {Keywords: transportation map, earth mover's distance, shape matching, approximation algorithms} }
Feedback for Dagstuhl Publishing