Approximating Spanning Trees with Inner Nodes Cost. - Rudolf Fleischer; Qi Ge; Jian Li 015; Shijun Tian; Haitao Wang 001 (PDCAT, 2005)

Traversing the Machining Graph. - Danny Z. Chen; Rudolf Fleischer; Jian Li 015; Haitao Wang 001; Hong Zhu 004 (ESA, 2006)

An Improved Algorithm for Finding the Closest Pair of Points. - Qi Ge; Haitao Wang 001; Hong Zhu 004 (J. Comput. Sci. Technol., 2006)

New Algorithms for Online Rectangle Filling with k-Lookahead. - Haitao Wang 001; Amitabh Chaudhary; Danny Z. Chen (COCOON, 2008)

Approximating Points by a Piecewise Linear Function: I. - Danny Z. Chen; Haitao Wang 001 (ISAAC, 2009)

Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers. - Danny Z. Chen; Haitao Wang 001 (ISAAC, 2009)

Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures. - Danny Z. Chen; Haitao Wang 001 (IWOCA, 2010)

A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane. - Danny Z. Chen; Haitao Wang 001 (ESA, 2011)

Efficient Algorithms for the Weighted k-Center Problem on a Real Line. - Danny Z. Chen; Haitao Wang 001 (ISAAC, 2011)

An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles. - Danny Z. Chen; Haitao Wang 001 (ISAAC, 2011)

Computing Shortest Paths amid Pseudodisks. - Danny Z. Chen; Haitao Wang 001 (SODA, 2011)

New Algorithms for 1-D Facility Location and Path Equipartition Problems. - Danny Z. Chen; Haitao Wang 001 (WADS, 2011)

Representing a Functional Curve by Curves with Fewer Peaks. - Danny Z. Chen; Chao Wang 002; Haitao Wang 001 (Discret. Comput. Geom., 2011)

Processing an Offline Insertion-Query Sequence with Applications. - Danny Z. Chen; Haitao Wang 001 (Int. J. Found. Comput. Sci., 2011)

New algorithms for online rectangle filling with k-lookahead. - Haitao Wang 001; Amitabh Chaudhary; Danny Z. Chen (J. Comb. Optim., 2011)

Improved algorithms for path partition and related problems. - Danny Z. Chen; Haitao Wang 001 (Oper. Res. Lett., 2011)

Online rectangle filling. - Haitao Wang 001; Amitabh Chaudhary; Danny Z. Chen (Theor. Comput. Sci., 2011)

Detecting and Tracking Motion of Myxococcus xanthus Bacteria in Swarms. - Xiaomin Liu; Cameron W. Harvey; Haitao Wang 001; Mark S. Alber; Danny Z. Chen (MICCAI (1), 2012)

An improved algorithm for reconstructing a simple polygon from its visibility angles. - Danny Z. Chen; Haitao Wang 001 (Comput. Geom., 2012)

Computing L1 Shortest Paths among Polygonal Obstacles in the Plane - Danny Z. Chen; Haitao Wang 001 (CoRR, 2012)

The L1 Nearest Neighbor Searching with Uncertain Queries - Haitao Wang 001; Wuzhou Zhang (CoRR, 2012)

Fitting a Step Function to a Point Set with Outliers Based on Simplicial thickness Data Structures. - Danny Z. Chen; Haitao Wang 001 (Int. J. Comput. Geom. Appl., 2012)

Locating an obnoxious Line among Planar Objects. - Danny Z. Chen; Haitao Wang 001 (Int. J. Comput. Geom. Appl., 2012)

Aggregate-Max Nearest Neighbor Searching in the Plane. - Haitao Wang 001 (CCCG, 2013)

L_1 Shortest Path Queries among Polygonal Obstacles in the Plane. - Danny Z. Chen; Haitao Wang 001 (STACS, 2013)

Approximating Points by a Piecewise Linear Function. - Danny Z. Chen; Haitao Wang 001 (Algorithmica, 2013)

Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (CoRR, 2013)

Efficient Algorithms for One-Dimensional k-Center Problems - Danny Z. Chen; Jian Li 015; Haitao Wang 001 (CoRR, 2013)

Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. - Danny Z. Chen; Yan Gu 001; Jian Li 015; Haitao Wang 001 (Discret. Comput. Geom., 2013)

A note on searching line arrangements and applications. - Danny Z. Chen; Haitao Wang 001 (Inf. Process. Lett., 2013)

The topology aware file distribution problem. - Shawn T. O'Neil; Amitabh Chaudhary; Danny Z. Chen; Haitao Wang 001 (J. Comb. Optim., 2013)

Computing Shortest Paths amid Convex Pseudodisks. - Danny Z. Chen; John Hershberger 001; Haitao Wang 001 (SIAM J. Comput., 2013)

The τ-Skyline for Uncertain Data. - Haitao Wang 001; Wuzhou Zhang (CCCG, 2014)

Maple: scalable multi-dimensional range search over encrypted cloud data with tree-based index. - Boyang Wang; Yantian Hou; Ming Li 003; Haitao Wang 001; Hui Li 006 (AsiaCCS, 2014)

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (LATIN, 2014)

Tree-Based Multi-dimensional Range Search on Encrypted Data with Enhanced Privacy. - Boyang Wang; Yantian Hou; Ming Li 003; Haitao Wang 001; Hui Li 006; Fenghua Li (SecureComm (1), 2014)

New Algorithms for Facility Location Problems on the Real Line. - Danny Z. Chen; Haitao Wang 001 (Algorithmica, 2014)

Outlier Respecting Points Approximation. - Danny Z. Chen; Haitao Wang 001 (Algorithmica, 2014)

Two-Point L1 Shortest Path Queries in the Plane. - Danny Z. Chen; Rajasekhar Inkulu; Haitao Wang 001 (CoRR, 2014)

$ε$-Kernel Coresets for Stochastic Points. - Jian Li 015; Jeff M. Phillips; Haitao Wang 001 (CoRR, 2014)

Minmax regret 1-facility location on uncertain path networks. - Haitao Wang 001 (Eur. J. Oper. Res., 2014)

Algorithms for Minimizing the Movements of Spreading Points in Linear Domains. - Shimin Li; Haitao Wang 001 (CCCG, 2015)

Linear Time Approximation Schemes for Geometric Maximum Coverage. - Jian Li 015; Haitao Wang 001; Bowei Zhang 003; Ningye Zhang (COCOON, 2015)

Circular Range Search on Encrypted Spatial Data. - Boyang Wang; Ming Li 003; Haitao Wang 001; Hui Li 006 (ICDCS, 2015)

Minimizing the Maximum Moving Cost of Interval Coverage. - Haitao Wang 001; Xiao Zhang 006 (ISAAC, 2015)

Segmenting subcellular structures in histology tissue images. - Jiazhuo Wang; John D. MacKenzie; Rageshree Ramachandran; Yizhe Zhang 001; Haitao Wang 001; Danny Ziyi Chen (ISBI, 2015)

Optimal Point Movement for Covering Circular Regions. - Danny Ziyi Chen; Xuehou Tan; Haitao Wang 001; Gangshan Wu (Algorithmica, 2015)

Computing the L1 geodesic diameter and center of a simple polygon in linear time. - Sang Won Bae 001; Matias Korman; Yoshio Okamoto; Haitao Wang 001 (Comput. Geom., 2015)

Visibility and ray shooting queries in polygonal domains. - Danny Z. Chen; Haitao Wang 001 (Comput. Geom., 2015)

Weak visibility queries of line segments in simple polygons. - Danny Ziyi Chen; Haitao Wang 001 (Comput. Geom., 2015)

Computing maximum non-crossing matching in convex bipartite graphs. - Danny Ziyi Chen; Xiaomin Liu; Haitao Wang 001 (Discret. Appl. Math., 2015)

Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane. - Haitao Wang 001 (Int. J. Comput. Geom. Appl., 2015)

A new algorithm for computing visibility graphs of polygonal obstacles in the plane. - Danny Z. Chen; Haitao Wang 001 (J. Comput. Geom., 2015)

Balanced splitting on weighted intervals. - Wei Cao 007; Jian Li 015; Shimin Li; Haitao Wang 001 (Oper. Res. Lett., 2015)

Computing Shortest Paths among Curved Obstacles in the Plane. - Danny Z. Chen; Haitao Wang 001 (ACM Trans. Algorithms, 2015)

Efficient algorithms for the one-dimensional k-center problem. - Danny Ziyi Chen; Jian Li 015; Haitao Wang 001 (Theor. Comput. Sci., 2015)

Quell. - Minghui Jiang 001; Pedro J. Tejada; Haitao Wang 001 (Theor. Comput. Sci., 2015)

One-dimensional k-center on uncertain data. - Haitao Wang 001; Jingru Zhang 002 (Theor. Comput. Sci., 2015)

epsilon-Kernel Coresets for Stochastic Points. - Lingxiao Huang; Jian Li 015; Jeff M. Phillips; Haitao Wang 001 (ESA, 2016)

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. - Sang Won Bae 001; Matias Korman; Joseph S. B. Mitchell; Yoshio Okamoto; Valentin Polishchuk; Haitao Wang 001 (STACS, 2016)

Matroid and Knapsack Center Problems. - Danny Z. Chen; Jian Li 015; Hongyu Liang; Haitao Wang 001 (Algorithmica, 2016)

Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane. - Haitao Wang 001; Jingru Zhang 002 (Int. J. Comput. Geom. Appl., 2016)

Two-point L1 shortest path queries in the plane. - Danny Z. Chen; Rajasekhar Inkulu; Haitao Wang 001 (J. Comput. Geom., 2016)

A note on computing the center of uncertain data on the real line. - Haitao Wang 001; Jingru Zhang 002 (Oper. Res. Lett., 2016)

Shortest color-spanning intervals. - Minghui Jiang 001; Haitao Wang 001 (Theor. Comput. Sci., 2016)

Range queries on uncertain data. - Jian Li 015; Haitao Wang 001 (Theor. Comput. Sci., 2016)

Geometric Range Search on Encrypted Spatial Data. - Boyang Wang; Ming Li 003; Haitao Wang 001 (IEEE Trans. Inf. Forensics Secur., 2016)

k-Regret Minimizing Set: Efficient Algorithms and Hardness. - Wei Cao 007; Jian Li 015; Haitao Wang 001; Kangning Wang 001; Ruosong Wang; Raymond Chi-Wing Wong; Wei Zhan (ICDT, 2017)

Minimizing the Aggregate Movements for Interval Coverage. - Aaron M. Andrews; Haitao Wang 001 (Algorithmica, 2017)

Computing the Visibility Polygon of an Island in a Polygonal Domain. - Danny Z. Chen; Haitao Wang 001 (Algorithmica, 2017)

Computing the Center of Uncertain Points on Tree Networks. - Haitao Wang 001; Jingru Zhang 002 (Algorithmica, 2017)

Improved Algorithms For Structured Sparse Recovery. - Lingxiao Huang; Yifei Jin; Jian Li 015; Haitao Wang 001 (CoRR, 2017)

Linear Time Approximation Schemes for Geometric Maximum Coverage. - Kai Jin; Jian Li 015; Haitao Wang 001; Bowei Zhang 003; Ningye Zhang (CoRR, 2017)

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. - Sang Won Bae 001; Matias Korman; Joseph S. B. Mitchell; Yoshio Okamoto; Valentin Polishchuk; Haitao Wang 001 (Discret. Comput. Geom., 2017)

Minimizing the Maximum Moving Cost of Interval Coverage. - Victor C. S. Lee; Haitao Wang 001; Xiao Zhang 006 (Int. J. Comput. Geom. Appl., 2017)

On the Coverage of Points in the Plane by Disks Centered at a Line. - Logan Pedersen; Haitao Wang 001 (CCCG, 2018)

An O(n log n)-Time Algorithm for the k-Center Problem in Trees. - Haitao Wang 001; Jingru Zhang 002 (SoCG, 2018)

An improved algorithm for diameter-optimally augmenting paths in a metric space. - Haitao Wang 001 (Comput. Geom., 2018)

L1 Shortest Path Queries in Simple Polygons. - Sang Won Bae 001; Haitao Wang 001 (CoRR, 2018)

Dispersing points on intervals. - Shimin Li; Haitao Wang 001 (Discret. Appl. Math., 2018)

Computing the Rectilinear Center of Uncertain Points in the Plane. - Haitao Wang 001; Jingru Zhang 002 (Int. J. Comput. Geom. Appl., 2018)

On the geodesic centers of polygonal domains. - Haitao Wang 001 (J. Comput. Geom., 2018)

Near-linear time approximation schemes for geometric maximum coverage. - Kai Jin; Jian Li 015; Haitao Wang 001; Bowei Zhang 003; Ningye Zhang (Theor. Comput. Sci., 2018)

A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. - Haitao Wang 001 (SoCG, 2019)

Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane. - Danny Z. Chen; Haitao Wang 001 (Algorithmica, 2019)

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. - Joseph S. B. Mitchell; Valentin Polishchuk; Mikko Sysikaski; Haitao Wang 001 (Algorithmica, 2019)

Covering Uncertain Points in a Tree. - Haitao Wang 001; Jingru Zhang 002 (Algorithmica, 2019)

A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains. - Haitao Wang 001 (CoRR, 2019)

Quickest Visibility Queries in Polygonal Domains. - Haitao Wang 001 (Discret. Comput. Geom., 2019)

Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. - Haitao Wang 001 (Discret. Comput. Geom., 2019)

On Top-k Weighted Sum Aggregate Nearest and Farthest Neighbors in the L1 Plane. - Haitao Wang 001; Wuzhou Zhang (Int. J. Comput. Geom. Appl., 2019)

Separating overlapped intervals on a line. - Shimin Li; Haitao Wang 001 (J. Comput. Geom., 2019)

L1 shortest path queries in simple polygons. - Sang Won Bae 001; Haitao Wang 001 (Theor. Comput. Sci., 2019)

Algorithms for covering multiple barriers. - Shimin Li; Haitao Wang 001 (Theor. Comput. Sci., 2019)

A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Pathsin a Metric Space. - Haitao Wang 001; Yiming Zhao (CCCG, 2020)

Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. - Haitao Wang 001; Jie Xue 003 (Discret. Comput. Geom., 2020)

A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. - Haitao Wang 001; Yiming Zhao (Int. J. Comput. Geom. Appl., 2020)

A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains. - Haitao Wang 001 (J. Comput. Geom., 2020)

An Optimal Algorithm for L1 Shortest Paths in Unit-Disk Graphs. - Haitao Wang 001; Yiming Zhao (CCCG, 2021)

Shortest Paths Among Obstacles in the Plane Revisited. - Haitao Wang 001 (SODA, 2021)

A linear-time algorithm for radius-optimally augmenting paths in a metric space. - Christopher Johnson; Haitao Wang 001 (Comput. Geom., 2021)

An O(nlog n)-Time Algorithm for the k-Center Problem in Trees. - Haitao Wang 001; Jingru Zhang 002 (SIAM J. Comput., 2021)

Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. - Haitao Wang 001; Yiming Zhao (Theor. Comput. Sci., 2021)

Computing the Minimum Bottleneck Moving Spanning Tree. - Haitao Wang 001; Yiming Zhao (MFCS, 2022)

A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. - Haitao Wang 001 (SOSA, 2022)

Reverse Shortest Path Problem in Weighted Unit-Disk Graphs. - Haitao Wang 001; Yiming Zhao (WALCOM, 2022)

Algorithms for the line-constrained disk coverage and related problems. - Logan Pedersen; Haitao Wang 001 (Comput. Geom., 2022)

Improved algorithms for the bichromatic two-center problem for pairs of points. - Haitao Wang 001; Jie Xue 003 (Comput. Geom., 2022)

On the Planar Two-Center Problem and Circular Hulls. - Haitao Wang 001 (Discret. Comput. Geom., 2022)

Improved Algorithms for Distance Selection and Related Problems. - Haitao Wang 001; Yiming Zhao (ESA, 2023)

Geometric Hitting Set for Line-Constrained Disks. - Gang Liu; Haitao Wang 001 (WADS, 2023)

Dynamic Convex Hulls Under Window-Sliding Updates. - Haitao Wang 001 (WADS, 2023)

An optimal algorithm for L1 shortest paths in unit-disk graphs. - Haitao Wang 001; Yiming Zhao (Comput. Geom., 2023)

Geometric Hitting Set for Line-Constrained Disks and Related Problems. - Gang Liu; Haitao Wang 001 (CoRR, 2023)

Constructing many faces in arrangements of lines and segments. - Haitao Wang 001 (J. Comput. Geom., 2023)

Unit-disk range searching and applications. - Haitao Wang 001 (J. Comput. Geom., 2023)

Reverse shortest path problem for unit-disk graphs. - Haitao Wang 001; Yiming Zhao (J. Comput. Geom., 2023)

A New Algorithm for Euclidean Shortest Paths in the Plane. - Haitao Wang 001 (J. ACM, 2023)

An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. - Haitao Wang 001 (Discret. Comput. Geom., 2023)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs. - Bruce W. Brewer; Haitao Wang 001 (CCCG, 2024)

Algorithms for Halfplane Coverage and Related Problems. - Haitao Wang 001; Jie Xue 003 (SoCG, 2024)

Dynamic Convex Hulls for Simple Paths. - Bruce W. Brewer; Gerth Stølting Brodal; Haitao Wang 001 (SoCG, 2024)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems. - Gang Liu; Haitao Wang 001 (MFCS, 2024)

On the line-separable unit-disk coverage and related problems. - Gang Liu; Haitao Wang 001 (Comput. Geom., 2024)

Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint. - Princy Jain; Haitao Wang 001 (Int. J. Comput. Geom. Appl., 2024)

Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments. - Haitao Wang 001 (SIAM J. Comput., 2024)

Optimal Algorithm for the Planar Two-Center Problem. - Kyungjin Cho; Eunjin Oh 001; Haitao Wang 001; Jie Xue 003 (TheoretiCS, 2024)

Standard Gaussian Process is All You Need for High-Dimensional Bayesian Optimization. - Zhitong Xu; Haitao Wang 001; Jeff M. Phillips; Shandian Zhe (ICLR, 2025)

An Optimal Algorithm for Half-plane Hitting Set. - Gang Liu; Haitao Wang 001 (SOSA, 2025)

Dynamic Unit-Disk Range Reporting. - Haitao Wang 001; Yiming Zhao (STACS, 2025)

Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position. - Anastasiia Tkachenko; Haitao Wang 001 (STACS, 2025)

On line-separable weighted unit-disk coverage and related problems. - Gang Liu; Haitao Wang 001 (Comput. Geom., 2025)

Dominating Set, Independent Set, Discrete k-Center, Dispersion, and Related Problems for Planar Points in Convex Position. - Anastasiia Tkachenko; Haitao Wang 001 (CoRR, 2025)

Computing Maximum Cliques in Unit Disk Graphs. - Anastasiia Tkachenko; Haitao Wang 001 (CoRR, 2025)

Algorithms for computing closest points for segments. - Haitao Wang 001 (Comput. Geom., 2026)