Published in: LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)
Haitao Wang. Algorithms for Computing Closest Points for Segments. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 58:1-58:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{wang:LIPIcs.STACS.2024.58, author = {Wang, Haitao}, title = {{Algorithms for Computing Closest Points for Segments}}, booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)}, pages = {58:1--58:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-311-9}, ISSN = {1868-8969}, year = {2024}, volume = {289}, editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.58}, URN = {urn:nbn:de:0030-drops-197683}, doi = {10.4230/LIPIcs.STACS.2024.58}, annote = {Keywords: Closest points, Voronoi diagrams, Segment dragging queries, Hopcroft’s problem, Algebraic decision tree model} }
Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Gang Liu and Haitao Wang. On the Line-Separable Unit-Disk Coverage and Related Problems. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{liu_et_al:LIPIcs.ISAAC.2023.51, author = {Liu, Gang and Wang, Haitao}, title = {{On the Line-Separable Unit-Disk Coverage and Related Problems}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.51}, URN = {urn:nbn:de:0030-drops-193535}, doi = {10.4230/LIPIcs.ISAAC.2023.51}, annote = {Keywords: disk coverage, line-separable, unit-disk, line-constrained, half-planes} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Haitao Wang and Yiming Zhao. Improved Algorithms for Distance Selection and Related Problems. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 101:1-101:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{wang_et_al:LIPIcs.ESA.2023.101, author = {Wang, Haitao and Zhao, Yiming}, title = {{Improved Algorithms for Distance Selection and Related Problems}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {101:1--101:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. 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.2023.101}, URN = {urn:nbn:de:0030-drops-187544}, doi = {10.4230/LIPIcs.ESA.2023.101}, annote = {Keywords: Geometric optimization, distance selection, Fr\'{e}chet distance, range searching} }
Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Sayan Bandyapadhyay, William Lochet, Saket Saurabh, and Jie Xue. Minimum-Membership Geometric Set Cover, Revisited. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2023.11, author = {Bandyapadhyay, Sayan and Lochet, William and Saurabh, Saket and Xue, Jie}, title = {{Minimum-Membership Geometric Set Cover, Revisited}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.11}, URN = {urn:nbn:de:0030-drops-178610}, doi = {10.4230/LIPIcs.SoCG.2023.11}, annote = {Keywords: geometric set cover, geometric optimization, approximation algorithms} }
Published in: LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
Haitao Wang and Yiming Zhao. Computing the Minimum Bottleneck Moving Spanning Tree. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 241, pp. 82:1-82:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang_et_al:LIPIcs.MFCS.2022.82, author = {Wang, Haitao and Zhao, Yiming}, title = {{Computing the Minimum Bottleneck Moving Spanning Tree}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {82:1--82:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-256-3}, ISSN = {1868-8969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.82}, URN = {urn:nbn:de:0030-drops-168801}, doi = {10.4230/LIPIcs.MFCS.2022.82}, annote = {Keywords: minimum spanning tree, moving points, unit-disk range emptiness query, dynamic data structure} }
Published in: LIPIcs, Volume 227, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)
Haitao Wang. Unit-Disk Range Searching and Applications. In 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 227, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{wang:LIPIcs.SWAT.2022.32, author = {Wang, Haitao}, title = {{Unit-Disk Range Searching and Applications}}, booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-236-5}, ISSN = {1868-8969}, year = {2022}, volume = {227}, editor = {Czumaj, Artur and Xin, Qin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2022.32}, URN = {urn:nbn:de:0030-drops-161926}, doi = {10.4230/LIPIcs.SWAT.2022.32}, annote = {Keywords: Unit disks, disk range searching, batched range searching, distance selection, discrete 2-center, arrangements, cuttings} }
Published in: LIPIcs, Volume 189, 37th International Symposium on Computational Geometry (SoCG 2021)
Haitao Wang. An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. In 37th International Symposium on Computational Geometry (SoCG 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 189, pp. 59:1-59:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{wang:LIPIcs.SoCG.2021.59, author = {Wang, Haitao}, title = {{An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons}}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, pages = {59:1--59:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-184-9}, ISSN = {1868-8969}, year = {2021}, volume = {189}, editor = {Buchin, Kevin and Colin de Verdi\`{e}re, \'{E}ric}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.59}, URN = {urn:nbn:de:0030-drops-138585}, doi = {10.4230/LIPIcs.SoCG.2021.59}, annote = {Keywords: farthest-sites, Voronoi diagrams, triple-point geodesic center, simple polygons} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Haitao Wang. On the Planar Two-Center Problem and Circular Hulls. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 68:1-68:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{wang:LIPIcs.SoCG.2020.68, author = {Wang, Haitao}, title = {{On the Planar Two-Center Problem and Circular Hulls}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {68:1--68:14}, 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.68}, URN = {urn:nbn:de:0030-drops-122267}, doi = {10.4230/LIPIcs.SoCG.2020.68}, annote = {Keywords: two-center, disk coverage, circular hulls, dynamic data structures} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Haitao Wang. Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 69:1-69:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{wang:LIPIcs.SoCG.2020.69, author = {Wang, Haitao}, title = {{Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {69:1--69:14}, 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.69}, URN = {urn:nbn:de:0030-drops-122275}, doi = {10.4230/LIPIcs.SoCG.2020.69}, annote = {Keywords: subpath hull queries, convex hulls, compact interval trees, ray-shooting, data structures} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Binay Bhattacharya, Sandip Das, and Subhadeep Ranjan Dev. The Weighted k-Center Problem in Trees for Fixed k. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 27:1-27:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bhattacharya_et_al:LIPIcs.ISAAC.2019.27, author = {Bhattacharya, Binay and Das, Sandip and Dev, Subhadeep Ranjan}, title = {{The Weighted k-Center Problem in Trees for Fixed k}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {27:1--27:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.27}, URN = {urn:nbn:de:0030-drops-115238}, doi = {10.4230/LIPIcs.ISAAC.2019.27}, annote = {Keywords: facility location, prune and search, parametric search, k-center problem, conditional k-center problem, trees} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Haitao Wang. A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 59:1-59:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{wang:LIPIcs.SoCG.2019.59, author = {Wang, Haitao}, title = {{A Divide-and-Conquer Algorithm for Two-Point L\underline1 Shortest Path Queries in Polygonal Domains}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {59:1--59: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.59}, URN = {urn:nbn:de:0030-drops-104631}, doi = {10.4230/LIPIcs.SoCG.2019.59}, annote = {Keywords: shortest paths, two-point queries, L\underline1 metric, polygonal domains} }
Published in: LIPIcs, Volume 129, 35th International Symposium on Computational Geometry (SoCG 2019)
Haitao Wang and Jie Xue. Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. In 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 129, pp. 60:1-60:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{wang_et_al:LIPIcs.SoCG.2019.60, author = {Wang, Haitao and Xue, Jie}, title = {{Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs}}, booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)}, pages = {60:1--60:13}, 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.60}, URN = {urn:nbn:de:0030-drops-104649}, doi = {10.4230/LIPIcs.SoCG.2019.60}, annote = {Keywords: Single-source shortest paths, Weighted unit-disk graphs, Geometric graph algorithms} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Haitao Wang and Jingru Zhang. An O(n log n)-Time Algorithm for the k-Center Problem in Trees. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 72:1-72:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{wang_et_al:LIPIcs.SoCG.2018.72, author = {Wang, Haitao and Zhang, Jingru}, title = {{An O(n log n)-Time Algorithm for the k-Center Problem in Trees}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {72:1--72:15}, 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.72}, URN = {urn:nbn:de:0030-drops-87852}, doi = {10.4230/LIPIcs.SoCG.2018.72}, annote = {Keywords: k-center, trees, facility locations} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Haitao Wang. Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 60:1-60:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{wang:LIPIcs.SoCG.2017.60, author = {Wang, Haitao}, title = {{Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {60:1--60: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.60}, URN = {urn:nbn:de:0030-drops-71876}, doi = {10.4230/LIPIcs.SoCG.2017.60}, annote = {Keywords: rectilinear paths, shortest paths, minimum-link paths, bicriteria paths, rectilinear polygons} }
Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)
Haitao Wang. Quickest Visibility Queries in Polygonal Domains. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 61:1-61:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{wang:LIPIcs.SoCG.2017.61, author = {Wang, Haitao}, title = {{Quickest Visibility Queries in Polygonal Domains}}, booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)}, pages = {61:1--61: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.61}, URN = {urn:nbn:de:0030-drops-71863}, doi = {10.4230/LIPIcs.SoCG.2017.61}, annote = {Keywords: shortest paths, visibility, quickest visibility queries, shortest path to segments, polygons with holes} }
Feedback for Dagstuhl Publishing