Haitao Wang - RankMe

250 papers A* 21A 16B 35C 2Misc 7Journal 147Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Algorithms for computing closest points for segments. Comput. Geom. Haitao Wang
2026	J	`jnl`	Computing the Minimum Bottleneck Moving Spanning Tree. Algorithmica Haitao Wang, Yiming Zhao
2026	A	`conf`	Counting Unit Circular Arc Intersections. STACS Haitao Wang
2026	A*	`conf`	Dynamic 3D Convex Hulls Revisited and Applications. SODA Haitao Wang
2025	A*	`ed.`	41st International Symposium on Computational Geometry, SoCG 2025, Kanazawa, Japan, June 23-27, 2025 SoCG Oswin Aichholzer, Haitao Wang
2025	A	`conf`	A Deterministic Partition Tree and Applications. ESA Haitao Wang
2025	J	`jnl`	A Deterministic Partition Tree and Applications. CoRR Haitao Wang
2025	J	`jnl`	Algorithms for Minimizing the Movements of Spreading Points in Linear Domains. Comput. Geom. Topol. Shimin Li, Haitao Wang
2025	—	`conf`	An Optimal Algorithm for Half-plane Hitting Set. SOSA Gang Liu, Haitao Wang
2025	J	`jnl`	An Optimal Algorithm for Half-plane Hitting Set. CoRR Gang Liu, Haitao Wang
2025	A	`conf`	An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs. ESA Bruce W. Brewer, Haitao Wang
2025	J	`jnl`	An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs. CoRR Bruce W. Brewer, Haitao Wang
2025	—	`conf`	Computing Maximum Cliques in Unit Disk Graphs. CCCG Anastasiia Tkachenko, Haitao Wang
2025	J	`jnl`	Computing Maximum Cliques in Unit Disk Graphs. CoRR Anastasiia Tkachenko, Haitao Wang
2025	J	`jnl`	Dominating Set, Independent Set, Discrete CoRR Anastasiia Tkachenko, Haitao Wang
2025	A	`conf`	Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position. STACS Anastasiia Tkachenko, Haitao Wang
2025	J	`jnl`	Dynamic Convex Hulls under Window-Sliding Updates. Comput. Geom. Topol. Haitao Wang
2025	A	`conf`	Dynamic Unit-Disk Range Reporting. STACS Haitao Wang, Yiming Zhao
2025	J	`jnl`	Dynamic Unit-Disk Range Reporting. CoRR Haitao Wang, Yiming Zhao
2025	J	`jnl`	Dynamic unit-disk range reporting. J. Comput. Geom. Haitao Wang, Yiming Zhao
2025	J	`jnl`	Geometric hitting set for line-constrained disks and related problems. J. Comput. Geom. Gang Liu, Haitao Wang
2025	J	`jnl`	Improved Algorithms for Distance Selection and Related Problems. Algorithmica Haitao Wang, Yiming Zhao
2025	J	`jnl`	Minimum-Weight Half-Plane Hitting Set. CoRR Gang Liu, Haitao Wang
2025	—	`conf`	Minimum-Weight Half-plane Hitting Set. CCCG Gang Liu, Haitao Wang
2025	J	`jnl`	On line-separable weighted unit-disk coverage and related problems. Comput. Geom. Gang Liu, Haitao Wang
2025	A*	`conf`	Shortest Paths on Convex Polyhedral Surfaces. FOCS Haitao Wang
2025	J	`jnl`	Shortest Paths on Convex Polyhedral Surfaces. CoRR Haitao Wang
2025	A*	`conf`	Standard Gaussian Process is All You Need for High-Dimensional Bayesian Optimization. ICLR Zhitong Xu, Haitao Wang, Jeff M. Phillips, Shandian Zhe
2024	A	`conf`	Algorithms for Computing Closest Points for Segments. STACS Haitao Wang
2024	J	`jnl`	Algorithms for Computing Closest Points for Segments. CoRR Haitao Wang
2024	J	`jnl`	Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint. Int. J. Comput. Geom. Appl. Princy Jain, Haitao Wang
2024	A*	`conf`	Algorithms for Halfplane Coverage and Related Problems. SoCG Haitao Wang, Jie Xue
2024	J	`jnl`	Algorithms for Halfplane Coverage and Related Problems. CoRR Haitao Wang, Jie Xue
2024	J	`jnl`	Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments. SIAM J. Comput. Haitao Wang
2024	—	`conf`	An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs. CCCG Bruce W. Brewer, Haitao Wang
2024	J	`jnl`	An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs. CoRR Bruce W. Brewer, Haitao Wang
2024	A*	`conf`	Dynamic Convex Hulls for Simple Paths. SoCG Bruce W. Brewer, Gerth Stølting Brodal, Haitao Wang
2024	J	`jnl`	Dynamic Convex Hulls for Simple Paths. CoRR Bruce W. Brewer, Gerth Stølting Brodal, Haitao Wang
2024	B	`conf`	On Line-Separable Weighted Unit-Disk Coverage and Related Problems. MFCS Gang Liu, Haitao Wang
2024	J	`jnl`	On Line-Separable Weighted Unit-Disk Coverage and Related Problems. CoRR Gang Liu, Haitao Wang
2024	J	`jnl`	On the line-separable unit-disk coverage and related problems. Comput. Geom. Gang Liu, Haitao Wang
2024	A*	`conf`	Optimal Algorithm for the Planar Two-Center Problem. SoCG Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
2024	J	`jnl`	Optimal Algorithm for the Planar Two-Center Problem. TheoretiCS Kyungjin Cho, Eunjin Oh, Haitao Wang, Jie Xue
2024	B	`conf`	Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems. MFCS Gang Liu, Haitao Wang
2024	J	`jnl`	Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems. CoRR Gang Liu, Haitao Wang
2023	J	`jnl`	A New Algorithm for Euclidean Shortest Paths in the Plane. J. ACM Haitao Wang
2023	J	`jnl`	An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. Discret. Comput. Geom. Haitao Wang
2023	J	`jnl`	An optimal algorithm for Comput. Geom. Haitao Wang, Yiming Zhao
2023	J	`jnl`	Constructing many faces in arrangements of lines and segments. J. Comput. Geom. Haitao Wang
2023	B	`conf`	Dynamic Convex Hulls Under Window-Sliding Updates. WADS Haitao Wang
2023	J	`jnl`	Dynamic Convex Hulls under Window-Sliding Updates. CoRR Haitao Wang
2023	J	`jnl`	Geometric Hitting Set for Line-Constrained Disks and Related Problems. CoRR Gang Liu, Haitao Wang
2023	B	`conf`	Geometric Hitting Set for Line-Constrained Disks. WADS Gang Liu, Haitao Wang
2023	A	`conf`	Improved Algorithms for Distance Selection and Related Problems. ESA Haitao Wang, Yiming Zhao
2023	J	`jnl`	Improved Algorithms for Distance Selection and Related Problems. CoRR Haitao Wang, Yiming Zhao
2023	B	`conf`	On the Line-Separable Unit-Disk Coverage and Related Problems. ISAAC Gang Liu, Haitao Wang
2023	J	`jnl`	On the Line-Separable Unit-Disk Coverage and Related Problems. CoRR Gang Liu, Haitao Wang
2023	J	`jnl`	Reverse shortest path problem for unit-disk graphs. J. Comput. Geom. Haitao Wang, Yiming Zhao
2023	J	`jnl`	Unit-disk range searching and applications. J. Comput. Geom. Haitao Wang
2022	—	`conf`	A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. SOSA Haitao Wang
2022	J	`jnl`	Algorithms for the line-constrained disk coverage and related problems. Comput. Geom. Logan Pedersen, Haitao Wang
2022	B	`conf`	Computing the Minimum Bottleneck Moving Spanning Tree. MFCS Haitao Wang, Yiming Zhao
2022	J	`jnl`	Computing the Minimum Bottleneck Moving Spanning Tree. CoRR Haitao Wang, Yiming Zhao
2022	A*	`conf`	Constructing Many Faces in Arrangements of Lines and Segments. SODA Haitao Wang
2022	J	`jnl`	Improved algorithms for the bichromatic two-center problem for pairs of points. Comput. Geom. Haitao Wang, Jie Xue
2022	J	`jnl`	On the Planar Two-Center Problem and Circular Hulls. Discret. Comput. Geom. Haitao Wang
2022	B	`conf`	Reverse Shortest Path Problem in Weighted Unit-Disk Graphs. WALCOM Haitao Wang, Yiming Zhao
2022	—	`conf`	Unit-Disk Range Searching and Applications. SWAT Haitao Wang
2022	J	`jnl`	Unit-Disk Range Searching and Applications. CoRR Haitao Wang
2021	J	`jnl`	A New Algorithm for Euclidean Shortest Paths in the Plane. CoRR Haitao Wang
2021	J	`jnl`	A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. CoRR Haitao Wang
2021	J	`jnl`	A linear-time algorithm for radius-optimally augmenting paths in a metric space. Comput. Geom. Christopher Johnson, Haitao Wang
2021	A*	`conf`	A new algorithm for Euclidean shortest paths in the plane. STOC Haitao Wang
2021	—	`conf`	Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint. CCCG Princy Jain, Haitao Wang
2021	B	`conf`	Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. WALCOM Haitao Wang, Yiming Zhao
2021	J	`jnl`	Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. Theor. Comput. Sci. Haitao Wang, Yiming Zhao
2021	B	`conf`	Algorithms for the Line-Constrained Disk Coverage and Related Problems. WADS Logan Pedersen, Haitao Wang
2021	J	`jnl`	Algorithms for the Line-Constrained Disk Coverage and Related Problems. CoRR Logan Pedersen, Haitao Wang
2021	J	`jnl`	An O(nlog n)-Time Algorithm for the k-Center Problem in Trees. SIAM J. Comput. Haitao Wang, Jingru Zhang
2021	—	`conf`	An Optimal Algorithm for L1 Shortest Paths in Unit-Disk Graphs. CCCG Haitao Wang, Yiming Zhao
2021	A*	`conf`	An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. SoCG Haitao Wang
2021	J	`jnl`	An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. CoRR Haitao Wang
2021	J	`jnl`	Constructing Many Faces in Arrangements of Lines and Segments. CoRR Haitao Wang
2021	B	`conf`	Reverse Shortest Path Problem for Unit-Disk Graphs. WADS Haitao Wang, Yiming Zhao
2021	J	`jnl`	Reverse Shortest Path Problem for Unit-Disk Graphs. CoRR Haitao Wang, Yiming Zhao
2021	A*	`conf`	Shortest Paths Among Obstacles in the Plane Revisited. SODA Haitao Wang
2020	J	`jnl`	A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains. J. Comput. Geom. Haitao Wang
2020	J	`jnl`	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. CoRR Haitao Wang, Yiming Zhao
2020	J	`jnl`	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. Int. J. Comput. Geom. Appl. Haitao Wang, Yiming Zhao
2020	—	`conf`	A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Pathsin a Metric Space. CCCG Haitao Wang, Yiming Zhao
2020	J	`jnl`	Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. CoRR Haitao Wang, Yiming Zhao
2020	A*	`conf`	Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. SoCG Haitao Wang
2020	J	`jnl`	Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. CoRR Haitao Wang
2020	J	`jnl`	Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Discret. Comput. Geom. Haitao Wang, Jie Xue
2020	A*	`conf`	On the Planar Two-Center Problem and Circular Hulls. SoCG Haitao Wang
2020	J	`jnl`	On the Planar Two-Center Problem and Circular Hulls. CoRR Haitao Wang
2020	J	`jnl`	Shortest Paths Among Obstacles in the Plane Revisited. CoRR Haitao Wang
2019	J	`jnl`	A Divide-and-Conquer Algorithm for Two-Point L CoRR Haitao Wang
2019	A*	`conf`	A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. SoCG Haitao Wang
2019	B	`conf`	A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. WADS Christopher Johnson, Haitao Wang
2019	J	`jnl`	A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. CoRR Christopher Johnson, Haitao Wang
2019	J	`jnl`	Algorithms for covering multiple barriers. Theor. Comput. Sci. Shimin Li, Haitao Wang
2019	J	`jnl`	An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. Algorithmica Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang
2019	J	`jnl`	Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. Discret. Comput. Geom. Haitao Wang
2019	J	`jnl`	Computing L Algorithmica Danny Z. Chen, Haitao Wang
2019	J	`jnl`	Covering Uncertain Points in a Tree. Algorithmica Haitao Wang, Jingru Zhang
2019	B	`conf`	Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. WADS Haitao Wang, Jie Xue
2019	J	`jnl`	Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. CoRR Haitao Wang, Jie Xue
2019	A*	`conf`	Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. SoCG Haitao Wang, Jie Xue
2019	J	`jnl`	Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. CoRR Haitao Wang, Jie Xue
2019	J	`jnl`	On Top-k Weighted Sum Aggregate Nearest and Farthest Neighbors in the L1 Plane. Int. J. Comput. Geom. Appl. Haitao Wang, Wuzhou Zhang
2019	J	`jnl`	Quickest Visibility Queries in Polygonal Domains. Discret. Comput. Geom. Haitao Wang
2019	J	`jnl`	Separating overlapped intervals on a line. J. Comput. Geom. Shimin Li, Haitao Wang
2018	A*	`conf`	An O(n log n)-Time Algorithm for the k-Center Problem in Trees. SoCG Haitao Wang, Jingru Zhang
2018	J	`jnl`	An improved algorithm for diameter-optimally augmenting paths in a metric space. Comput. Geom. Haitao Wang
2018	J	`jnl`	Computing the Rectilinear Center of Uncertain Points in the Plane. Int. J. Comput. Geom. Appl. Haitao Wang, Jingru Zhang
2018	J	`jnl`	Dispersing points on intervals. Discret. Appl. Math. Shimin Li, Haitao Wang
2018	J	`jnl`	L CoRR Sang Won Bae, Haitao Wang
2018	J	`jnl`	Near-linear time approximation schemes for geometric maximum coverage. Theor. Comput. Sci. Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang
2018	—	`conf`	On the Coverage of Points in the Plane by Disks Centered at a Line. CCCG Logan Pedersen, Haitao Wang
2018	J	`jnl`	On the geodesic centers of polygonal domains. J. Comput. Geom. Haitao Wang
2017	B	`conf`	Algorithms for Covering Multiple Barriers. WADS Shimin Li, Haitao Wang
2017	J	`jnl`	Algorithms for Covering Multiple Barriers. CoRR Shimin Li, Haitao Wang
2017	B	`conf`	An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. WADS Haitao Wang
2017	J	`jnl`	An O(n\log n)-Time Algorithm for the k-Center Problem in Trees. CoRR Haitao Wang, Jingru Zhang
2017	A*	`conf`	Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. SoCG Haitao Wang
2017	J	`jnl`	Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. CoRR Haitao Wang
2017	J	`jnl`	Computing the Center of Uncertain Points on Tree Networks. Algorithmica Haitao Wang, Jingru Zhang
2017	J	`jnl`	Computing the L Discret. Comput. Geom. Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
2017	J	`jnl`	Computing the Visibility Polygon of an Island in a Polygonal Domain. Algorithmica Danny Z. Chen, Haitao Wang
2017	B	`conf`	Covering Uncertain Points in a Tree. WADS Haitao Wang, Jingru Zhang
2017	J	`jnl`	Covering Uncertain Points in a Tree. CoRR Haitao Wang, Jingru Zhang
2017	J	`jnl`	Improved Algorithms For Structured Sparse Recovery. CoRR Lingxiao Huang, Yifei Jin, Jian Li, Haitao Wang
2017	J	`jnl`	Linear Time Approximation Schemes for Geometric Maximum Coverage. CoRR Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang
2017	J	`jnl`	Minimizing the Aggregate Movements for Interval Coverage. Algorithmica Aaron M. Andrews, Haitao Wang
2017	J	`jnl`	Minimizing the Maximum Moving Cost of Interval Coverage. Int. J. Comput. Geom. Appl. Victor C. S. Lee, Haitao Wang, Xiao Zhang
2017	A*	`conf`	Quickest Visibility Queries in Polygonal Domains. SoCG Haitao Wang
2017	J	`jnl`	Quickest Visibility Queries in Polygonal Domains. CoRR Haitao Wang
2017	A	`conf`	k-Regret Minimizing Set: Efficient Algorithms and Hardness. ICDT Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, Wei Zhan
2016	J	`jnl`	A note on computing the center of uncertain data on the real line. Oper. Res. Lett. Haitao Wang, Jingru Zhang
2016	J	`jnl`	An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. CoRR Haitao Wang
2016	A	`conf`	Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. STACS Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
2016	B	`conf`	Dispersing Points on Intervals. ISAAC Shimin Li, Haitao Wang
2016	J	`jnl`	Dispersing Points on Intervals. CoRR Shimin Li, Haitao Wang
2016	J	`jnl`	Geometric Range Search on Encrypted Spatial Data. IEEE Trans. Inf. Forensics Secur. Boyang Wang, Ming Li, Haitao Wang
2016	J	`jnl`	Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane. Int. J. Comput. Geom. Appl. Haitao Wang, Jingru Zhang
2016	J	`jnl`	Matroid and Knapsack Center Problems. Algorithmica Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang
2016	A	`conf`	On the Geodesic Centers of Polygonal Domains. ESA Haitao Wang
2016	J	`jnl`	On the Geodesic Centers of Polygonal Domains. CoRR Haitao Wang
2016	J	`jnl`	Range queries on uncertain data. Theor. Comput. Sci. Jian Li, Haitao Wang
2016	J	`jnl`	Separating Overlapped Intervals on a Line. CoRR Shimin Li, Haitao Wang
2016	J	`jnl`	Shortest color-spanning intervals. Theor. Comput. Sci. Minghui Jiang, Haitao Wang
2016	J	`jnl`	Two-point L1 shortest path queries in the plane. J. Comput. Geom. Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang
2016	A	`conf`	epsilon-Kernel Coresets for Stochastic Points. ESA Lingxiao Huang, Jian Li, Jeff M. Phillips, Haitao Wang
2015	J	`jnl`	A new algorithm for computing visibility graphs of polygonal obstacles in the plane. J. Comput. Geom. Danny Z. Chen, Haitao Wang
2015	J	`jnl`	Aggregate-MAX Top- Int. J. Comput. Geom. Appl. Haitao Wang
2015	—	`conf`	Algorithms for Minimizing the Movements of Spreading Points in Linear Domains. CCCG Shimin Li, Haitao Wang
2015	—	`conf`	An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. ICALP (1) Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang
2015	J	`jnl`	An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. CoRR Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang
2015	J	`jnl`	Balanced splitting on weighted intervals. Oper. Res. Lett. Wei Cao, Jian Li, Shimin Li, Haitao Wang
2015	A	`conf`	Circular Range Search on Encrypted Spatial Data. ICDCS Boyang Wang, Ming Li, Haitao Wang, Hui Li
2015	—	`conf`	Circular range search on encrypted spatial data. CNS Boyang Wang, Ming Li, Haitao Wang, Hui Li
2015	J	`jnl`	Computing Shortest Paths among Curved Obstacles in the Plane. ACM Trans. Algorithms Danny Z. Chen, Haitao Wang
2015	J	`jnl`	Computing maximum non-crossing matching in convex bipartite graphs. Discret. Appl. Math. Danny Ziyi Chen, Xiaomin Liu, Haitao Wang
2015	B	`conf`	Computing the Center of Uncertain Points on Tree Networks. WADS Haitao Wang, Jingru Zhang
2015	J	`jnl`	Computing the L CoRR Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang
2015	J	`jnl`	Computing the L1 geodesic diameter and center of a simple polygon in linear time. Comput. Geom. Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
2015	J	`jnl`	Computing the Rectilinear Center of Uncertain Points in the Plane. CoRR Haitao Wang, Jingru Zhang
2015	J	`jnl`	Efficient algorithms for the one-dimensional k-center problem. Theor. Comput. Sci. Danny Ziyi Chen, Jian Li, Haitao Wang
2015	Misc	`conf`	Linear Time Approximation Schemes for Geometric Maximum Coverage. COCOON Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang
2015	J	`jnl`	Linear Time Approximation Schemes for Geometric Maximum Coverage. CoRR Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang
2015	B	`conf`	Minimizing the Aggregate Movements for Interval Coverage. WADS Aaron M. Andrews, Haitao Wang
2015	B	`conf`	Minimizing the Maximum Moving Cost of Interval Coverage. ISAAC Haitao Wang, Xiao Zhang
2015	J	`jnl`	One-dimensional k-center on uncertain data. Theor. Comput. Sci. Haitao Wang, Jingru Zhang
2015	J	`jnl`	Optimal Point Movement for Covering Circular Regions. Algorithmica Danny Ziyi Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
2015	J	`jnl`	Quell. Theor. Comput. Sci. Minghui Jiang, Pedro J. Tejada, Haitao Wang
2015	J	`jnl`	Range Queries on Uncertain Data. CoRR Jian Li, Haitao Wang
2015	—	`conf`	Segmenting subcellular structures in histology tissue images. ISBI Jiazhuo Wang, John D. MacKenzie, Rageshree Ramachandran, Yizhe Zhang, Haitao Wang, Danny Ziyi Chen
2015	J	`jnl`	Visibility and ray shooting queries in polygonal domains. Comput. Geom. Danny Z. Chen, Haitao Wang
2015	J	`jnl`	Weak visibility queries of line segments in simple polygons. Comput. Geom. Danny Ziyi Chen, Haitao Wang
2014	J	`jnl`	$ε$-Kernel Coresets for Stochastic Points. CoRR Jian Li, Jeff M. Phillips, Haitao Wang
2014	B	`conf`	Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. LATIN Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
2014	B	`conf`	Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane. ISAAC Haitao Wang, Jingru Zhang
2014	A	`conf`	Maple: scalable multi-dimensional range search over encrypted cloud data with tree-based index. AsiaCCS Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, Hui Li
2014	J	`jnl`	Minimizing the Aggregate Movements for Interval Coverage. CoRR Aaron M. Andrews, Haitao Wang
2014	J	`jnl`	Minmax regret 1-facility location on uncertain path networks. Eur. J. Oper. Res. Haitao Wang
2014	J	`jnl`	New Algorithms for Facility Location Problems on the Real Line. Algorithmica Danny Z. Chen, Haitao Wang
2014	Misc	`conf`	One-Dimensional k-Center on Uncertain Data. COCOON Haitao Wang, Jingru Zhang
2014	J	`jnl`	Outlier Respecting Points Approximation. Algorithmica Danny Z. Chen, Haitao Wang
2014	Misc	`conf`	Quell. FUN Minghui Jiang, Pedro J. Tejada, Haitao Wang
2014	B	`conf`	Range Queries on Uncertain Data. ISAAC Jian Li, Haitao Wang
2014	Misc	`conf`	Shortest Color-Spanning Intervals. COCOON Minghui Jiang, Haitao Wang
2014	—	`conf`	The τ-Skyline for Uncertain Data. CCCG Haitao Wang, Wuzhou Zhang
2014	—	`conf`	Tree-Based Multi-dimensional Range Search on Encrypted Data with Enhanced Privacy. SecureComm (1) Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, Hui Li, Fenghua Li
2014	J	`jnl`	Two-Point L CoRR Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang
2014	A*	`conf`	Two-Point L1 Shortest Path Queries in the Plane. SoCG Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang
2013	J	`jnl`	A note on searching line arrangements and applications. Inf. Process. Lett. Danny Z. Chen, Haitao Wang
2013	—	`conf`	Aggregate-Max Nearest Neighbor Searching in the Plane. CCCG Haitao Wang
2013	J	`jnl`	Aggregate-Max Nearest Neighbor Searching in the Plane. CoRR Haitao Wang
2013	J	`jnl`	Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. Discret. Comput. Geom. Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang
2013	J	`jnl`	Approximating Points by a Piecewise Linear Function. Algorithmica Danny Z. Chen, Haitao Wang
2013	J	`jnl`	Computing Shortest Paths amid Convex Pseudodisks. SIAM J. Comput. Danny Z. Chen, John Hershberger, Haitao Wang
2013	A*	`conf`	Computing shortest paths among curved obstacles in the plane. SoCG Danny Z. Chen, Haitao Wang
2013	J	`jnl`	Computing the L CoRR Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang
2013	J	`jnl`	Efficient Algorithms for One-Dimensional k-Center Problems CoRR Danny Z. Chen, Jian Li, Haitao Wang
2013	A	`conf`	L_1 Shortest Path Queries among Polygonal Obstacles in the Plane. STACS Danny Z. Chen, Haitao Wang
2013	J	`jnl`	Matroid and Knapsack Center Problems CoRR Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang
2013	B	`conf`	Matroid and Knapsack Center Problems. IPCO Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang
2013	B	`conf`	Minmax Regret 1-Facility Location on Uncertain Path Networks. ISAAC Haitao Wang
2013	J	`jnl`	The topology aware file distribution problem. J. Comb. Optim. Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang
2013	B	`conf`	Visibility and Ray Shooting Queries in Polygonal Domains. WADS Danny Z. Chen, Haitao Wang
2012	J	`jnl`	Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain CoRR Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang
2012	—	`conf`	Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. SWAT Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang
2012	J	`jnl`	An improved algorithm for reconstructing a simple polygon from its visibility angles. Comput. Geom. Danny Z. Chen, Haitao Wang
2012	J	`jnl`	Computing L1 Shortest Paths among Polygonal Obstacles in the Plane CoRR Danny Z. Chen, Haitao Wang
2012	—	`conf`	Computing Maximum Non-crossing Matching in Convex Bipartite Graphs. FAW-AAIM Danny Z. Chen, Xiaomin Liu, Haitao Wang
2012	—	`conf`	Computing the Visibility Polygon of an Island in a Polygonal Domain. ICALP (1) Danny Z. Chen, Haitao Wang
2012	—	`conf`	Detecting and Tracking Motion of Myxococcus xanthus Bacteria in Swarms. MICCAI (1) Xiaomin Liu, Cameron W. Harvey, Haitao Wang, Mark S. Alber, Danny Z. Chen
2012	J	`jnl`	Fitting a Step Function to a Point Set with Outliers Based on Simplicial thickness Data Structures. Int. J. Comput. Geom. Appl. Danny Z. Chen, Haitao Wang
2012	J	`jnl`	Locating an obnoxious Line among Planar Objects. Int. J. Comput. Geom. Appl. Danny Z. Chen, Haitao Wang
2012	B	`conf`	Optimal Point Movement for Covering Circular Regions. ISAAC Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
2012	J	`jnl`	The L1 Nearest Neighbor Searching with Uncertain Queries CoRR Haitao Wang, Wuzhou Zhang
2012	J	`jnl`	Weak Visibility Queries of Line Segments in Simple Polygons CoRR Danny Z. Chen, Haitao Wang
2012	B	`conf`	Weak Visibility Queries of Line Segments in Simple Polygons. ISAAC Danny Z. Chen, Haitao Wang
2011	A	`conf`	A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane. ESA Danny Z. Chen, Haitao Wang
2011	B	`conf`	An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles. ISAAC Danny Z. Chen, Haitao Wang
2011	A*	`conf`	Computing Shortest Paths amid Pseudodisks. SODA Danny Z. Chen, Haitao Wang
2011	J	`jnl`	Computing Shortest Paths among Curved Obstacles in the Plane CoRR Danny Z. Chen, Haitao Wang
2011	B	`conf`	Efficient Algorithms for the Weighted k-Center Problem on a Real Line. ISAAC Danny Z. Chen, Haitao Wang
2011	J	`jnl`	Improved algorithms for path partition and related problems. Oper. Res. Lett. Danny Z. Chen, Haitao Wang
2011	B	`conf`	New Algorithms for 1-D Facility Location and Path Equipartition Problems. WADS Danny Z. Chen, Haitao Wang
2011	J	`jnl`	New algorithms for online rectangle filling with J. Comb. Optim. Haitao Wang, Amitabh Chaudhary, Danny Z. Chen
2011	J	`jnl`	Online rectangle filling. Theor. Comput. Sci. Haitao Wang, Amitabh Chaudhary, Danny Z. Chen
2011	J	`jnl`	Optimal Point Movement for Covering Circular Regions CoRR Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
2011	B	`conf`	Outlier Respecting Points Approximation. ISAAC Danny Z. Chen, Haitao Wang
2011	J	`jnl`	Processing an Offline Insertion-Query Sequence with Applications. Int. J. Found. Comput. Sci. Danny Z. Chen, Haitao Wang
2011	J	`jnl`	Representing a Functional Curve by Curves with Fewer Peaks. Discret. Comput. Geom. Danny Z. Chen, Chao Wang, Haitao Wang
2011	Misc	`conf`	The Topology Aware File Distribution Problem. COCOON Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang
2010	J	`jnl`	An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles CoRR Danny Z. Chen, Haitao Wang
2010	C	`conf`	Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures. IWOCA Danny Z. Chen, Haitao Wang
2010	—	`conf`	Representing a Functional Curve by Curves with Fewer Peaks. SWAT Danny Z. Chen, Chao Wang, Haitao Wang
2009	B	`conf`	Approximating Points by a Piecewise Linear Function: I. ISAAC Danny Z. Chen, Haitao Wang
2009	B	`conf`	Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers. ISAAC Danny Z. Chen, Haitao Wang
2009	B	`conf`	Locating an Obnoxious Line among Planar Objects. ISAAC Danny Z. Chen, Haitao Wang
2009	Misc	`conf`	Processing an Offline Insertion-Query Sequence with Applications. FAW Danny Z. Chen, Haitao Wang
2008	Misc	`conf`	New Algorithms for Online Rectangle Filling with k-Lookahead. COCOON Haitao Wang, Amitabh Chaudhary, Danny Z. Chen
2007	B	`conf`	Online Rectangle Filling. WAOA Haitao Wang, Amitabh Chaudhary, Danny Z. Chen
2006	J	`jnl`	An Improved Algorithm for Finding the Closest Pair of Points. J. Comput. Sci. Technol. Qi Ge, Haitao Wang, Hong Zhu
2006	A	`conf`	Traversing the Machining Graph. ESA Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu
2005	C	`conf`	Approximating Spanning Trees with Inner Nodes Cost. PDCAT Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang