Haitao Wang

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 106

Top Venues

Publications

Bruce Brewer, Gerth Stølting Brodal, Haitao Wang
Dynamic Convex Hulls for Simple Paths. SoCG (2024)
Haitao Wang, Jie Xue
Algorithms for Halfplane Coverage and Related Problems. SoCG (2024)
Haitao Wang
Algorithms for Computing Closest Points for Segments. STACS (2024)
Gang Liu, Haitao Wang
On Line-Separable Weighted Unit-Disk Coverage and Related Problems. CoRR (2024)
Bruce Brewer, Gerth Stølting Brodal, Haitao Wang
Dynamic Convex Hulls for Simple Paths. CoRR (2024)
Gang Liu, Haitao Wang
Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems. MFCS (2024)
Gang Liu, Haitao Wang
On Line-Separable Weighted Unit-Disk Coverage and Related Problems. MFCS (2024)
Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
Optimal Algorithm for the Planar Two-Center Problem. SoCG (2024)
Haitao Wang, Yiming Zhao
Improved Algorithms for Distance Selection and Related Problems. CoRR (2023)
Haitao Wang
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. Discret. Comput. Geom. 70 (2) (2023)
Haitao Wang, Yiming Zhao
Improved Algorithms for Distance Selection and Related Problems. ESA (2023)
Haitao Wang
A New Algorithm for Euclidean Shortest Paths in the Plane. J. ACM 70 (2) (2023)
Gang Liu, Haitao Wang
On the Line-Separable Unit-Disk Coverage and Related Problems. ISAAC (2023)
Haitao Wang, Yiming Zhao
shortest paths in unit-disk graphs. Comput. Geom. 110 (2023)
Haitao Wang
Constructing Many Faces in Arrangements of Lines and Segments. SODA (2022)
Haitao Wang
On the Planar Two-Center Problem and Circular Hulls. Discret. Comput. Geom. 68 (4) (2022)
Haitao Wang, Jie Xue
Improved algorithms for the bichromatic two-center problem for pairs of points. Comput. Geom. 100 (2022)
Haitao Wang
Unit-Disk Range Searching and Applications. SWAT (2022)
Haitao Wang, Yiming Zhao
Reverse Shortest Path Problem in Weighted Unit-Disk Graphs. WALCOM (2022)
Haitao Wang, Yiming Zhao
Computing the Minimum Bottleneck Moving Spanning Tree. CoRR (2022)
Haitao Wang
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. SOSA (2022)
Logan Pedersen, Haitao Wang
Algorithms for the line-constrained disk coverage and related problems. Comput. Geom. (2022)
Haitao Wang, Yiming Zhao
Computing the Minimum Bottleneck Moving Spanning Tree. MFCS (2022)
Logan Pedersen, Haitao Wang
Algorithms for the Line-Constrained Disk Coverage and Related Problems. CoRR (2021)
Christopher Johnson, Haitao Wang
A linear-time algorithm for radius-optimally augmenting paths in a metric space. Comput. Geom. 96 (2021)
Haitao Wang
Shortest Paths Among Obstacles in the Plane Revisited. SODA (2021)
Haitao Wang, Yiming Zhao
Reverse Shortest Path Problem for Unit-Disk Graphs. WADS (2021)
Haitao Wang
A new algorithm for Euclidean shortest paths in the plane. STOC (2021)
Haitao Wang
A New Algorithm for Euclidean Shortest Paths in the Plane. CoRR (2021)
Haitao Wang
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. CoRR (2021)
Logan Pedersen, Haitao Wang
Algorithms for the Line-Constrained Disk Coverage and Related Problems. WADS (2021)
Haitao Wang, Yiming Zhao
Reverse Shortest Path Problem for Unit-Disk Graphs. CoRR (2021)
Haitao Wang, Jingru Zhang
An O(nlog n)-Time Algorithm for the k-Center Problem in Trees. SIAM J. Comput. 50 (2) (2021)
Haitao Wang, Yiming Zhao
Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. Theor. Comput. Sci. 890 (2021)
Haitao Wang, Yiming Zhao
An Optimal Algorithm for L1 Shortest Paths in Unit-Disk Graphs. CCCG (2021)
Haitao Wang, Yiming Zhao
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. WALCOM (2021)
Haitao Wang
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. SoCG (2021)
Haitao Wang
On the Planar Two-Center Problem and Circular Hulls. CoRR (2020)
Haitao Wang
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. SoCG (2020)
Haitao Wang
Shortest Paths Among Obstacles in the Plane Revisited. CoRR (2020)
Haitao Wang
A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains. J. Comput. Geom. 11 (1) (2020)
Haitao Wang
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. CoRR (2020)
Haitao Wang, Yiming Zhao
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Pathsin a Metric Space. CCCG (2020)
Haitao Wang, Yiming Zhao
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. CoRR (2020)
Haitao Wang, Jie Xue
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Discret. Comput. Geom. 64 (4) (2020)
Haitao Wang, Yiming Zhao
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. Int. J. Comput. Geom. Appl. 30 (3&4) (2020)
Haitao Wang, Yiming Zhao
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. CoRR (2020)
Haitao Wang
On the Planar Two-Center Problem and Circular Hulls. SoCG (2020)
Shimin Li, Haitao Wang
Algorithms for covering multiple barriers. Theor. Comput. Sci. 758 (2019)
Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. Algorithmica 81 (1) (2019)
Haitao Wang, Wuzhou Zhang
On Top-k Weighted Sum Aggregate Nearest and Farthest Neighbors in the L1 Plane. Int. J. Comput. Geom. Appl. 29 (3) (2019)
Haitao Wang, Jie Xue
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. CoRR (2019)
Haitao Wang, Jie Xue
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. SoCG (2019)
Haitao Wang
Shortest Path Queries in Polygonal Domains. CoRR (2019)
Danny Z. Chen, Haitao Wang
Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica 81 (6) (2019)
Christopher Johnson, Haitao Wang
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. CoRR (2019)
Haitao Wang, Jie Xue
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. WADS (2019)
Haitao Wang
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. Discret. Comput. Geom. 62 (3) (2019)
Christopher Johnson, Haitao Wang
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. WADS (2019)
Haitao Wang
Quickest Visibility Queries in Polygonal Domains. Discret. Comput. Geom. 62 (2) (2019)
Sang Won Bae, Haitao Wang
shortest path queries in simple polygons. Theor. Comput. Sci. 790 (2019)
Haitao Wang, Jingru Zhang
Covering Uncertain Points in a Tree. Algorithmica 81 (6) (2019)
Haitao Wang
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. SoCG (2019)
Haitao Wang, Jie Xue
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. CoRR (2019)
Shimin Li, Haitao Wang
Separating overlapped intervals on a line. J. Comput. Geom. 10 (1) (2019)
Haitao Wang, Jingru Zhang
An O(n log n)-Time Algorithm for the k-Center Problem in Trees. SoCG (2018)
Haitao Wang
On the geodesic centers of polygonal domains. J. Comput. Geom. 9 (1) (2018)
Logan Pedersen, Haitao Wang
On the Coverage of Points in the Plane by Disks Centered at a Line. CCCG (2018)
Sang Won Bae, Haitao Wang
Shortest Path Queries in Simple Polygons. CoRR (2018)
Haitao Wang, Jingru Zhang
Computing the Rectilinear Center of Uncertain Points in the Plane. Int. J. Comput. Geom. Appl. 28 (3) (2018)
Shimin Li, Haitao Wang
Dispersing points on intervals. Discret. Appl. Math. 239 (2018)
Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang
Near-linear time approximation schemes for geometric maximum coverage. Theor. Comput. Sci. 725 (2018)
Haitao Wang
An improved algorithm for diameter-optimally augmenting paths in a metric space. Comput. Geom. 75 (2018)
Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang
Linear Time Approximation Schemes for Geometric Maximum Coverage. CoRR (2017)
Shimin Li, Haitao Wang
Algorithms for Covering Multiple Barriers. CoRR (2017)
Haitao Wang
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. CoRR (2017)
Haitao Wang, Jingru Zhang
An O(n\log n)-Time Algorithm for the k-Center Problem in Trees. CoRR (2017)
Haitao Wang
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. WADS (2017)
Victor C. S. Lee, Haitao Wang, Xiao Zhang
Minimizing the Maximum Moving Cost of Interval Coverage. Int. J. Comput. Geom. Appl. 27 (3) (2017)
Haitao Wang, Jingru Zhang
Computing the Center of Uncertain Points on Tree Networks. Algorithmica 78 (1) (2017)
Haitao Wang
Quickest Visibility Queries in Polygonal Domains. SoCG (2017)
Haitao Wang
Quickest Visibility Queries in Polygonal Domains. CoRR (2017)
Haitao Wang
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. SoCG (2017)
Haitao Wang, Jingru Zhang
Covering Uncertain Points in a Tree. CoRR (2017)
Lingxiao Huang, Yifei Jin, Jian Li, Haitao Wang
Improved Algorithms For Structured Sparse Recovery. CoRR (2017)
Danny Z. Chen, Haitao Wang
Computing the Visibility Polygon of an Island in a Polygonal Domain. Algorithmica 77 (1) (2017)
Aaron M. Andrews, Haitao Wang
Minimizing the Aggregate Movements for Interval Coverage. Algorithmica 78 (1) (2017)
Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, Wei Zhan
k-Regret Minimizing Set: Efficient Algorithms and Hardness. ICDT (2017)
Shimin Li, Haitao Wang
Algorithms for Covering Multiple Barriers. WADS (2017)
Haitao Wang, Jingru Zhang
Covering Uncertain Points in a Tree. WADS (2017)
Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
Geodesic Diameter and Center of a Polygonal Domain. Discret. Comput. Geom. 57 (3) (2017)
Shimin Li, Haitao Wang
Dispersing Points on Intervals. CoRR (2016)
Haitao Wang
On the Geodesic Centers of Polygonal Domains. CoRR (2016)
Lingxiao Huang, Jian Li, Jeff M. Phillips, Haitao Wang
epsilon-Kernel Coresets for Stochastic Points. ESA (2016)
Jian Li, Haitao Wang
Range queries on uncertain data. Theor. Comput. Sci. 609 (2016)
Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. STACS (2016)
Shimin Li, Haitao Wang
Separating Overlapped Intervals on a Line. CoRR (2016)
Haitao Wang, Jingru Zhang
Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane. Int. J. Comput. Geom. Appl. 26 (3-4) (2016)
Boyang Wang, Ming Li, Haitao Wang
Geometric Range Search on Encrypted Spatial Data. IEEE Trans. Inf. Forensics Secur. 11 (4) (2016)
Minghui Jiang, Haitao Wang
Shortest color-spanning intervals. Theor. Comput. Sci. 609 (2016)

Haitao Wang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Haitao Wang