Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaitao Wang 0001
王海涛
Person information
- unicode name: 王海涛
- affiliation (since 2022): University of Utah, School of Computing, Salt Lake City, UT, USA
- affiliation (2012-2022): Utah State University, Department of Computer Science, Logan, UT, USA
- affiliation (2006-2012): University of Notre Dame, Department of Computer Science and Engineering, IN, USA
- affiliation (2003-2006): Fudan University, Key Laboratory of Intelligent Information Processing, Shanghai, China
Other persons with the same name
- Haitao Wang (aka: Hai-Tao Wang) — disambiguation page
- Haitao Wang 0002 — Chinese Academy of Sciences, Institute of Geodesy and Geophysics, Wuhan, China
- Haitao Wang 0003 — Oper. Work Area, Yanzhou, Datong Min. Ltd. Co., Datong, China
- Haitao Wang 0004 — Beijing Institute of Satellite Information Engineering, Beijing, China
- Haitao Wang 0005
![[0000-0003-3704-9214]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-3704-9214")
— Tsinghua University, Beijing, China - Haitao Wang 0006 — Samsung Research Center, Beijing
- Haitao Wang 0007 — Chinese Acadademy of Science, Institute of Automation, National Laboratory of Pattern Recognition, Beijing, China
- Haitao Wang 0008 — Army Engineering University of PLA, Nanjing, China (and 1 more)
- Haitao Wang 0009 — Chinese Academy of Science, Institute of Computing Technology, Beijing, China
- Haitao Wang 0010 — Nanjing University, China
- Haitao Wang 0011 — National Fundamental Software of China, Ltd.(NFS-China), Beijing, China
- Haitao Wang 0012 — Northwestern Polytechnical University, Xi'an, China
- Haitao Wang 0013 — Hebei University of Engineering, Handan, China
- Haitao Wang 0014 — Chinese Acadademy of Science, Institute of Mechanics, Urumchi, China
- Haitao Wang 0015 — Chongqing University of Posts & Telecommunications, China
- Haitao Wang 0016 — Institute of Geospatial Information, Information Engineering University, Zhengzhou, China
- Haitao Wang 0017 — Space Star Technology Co., Ltd, Beijing, China
- Haitao Wang 0018 — China National Institute of Standardization, China
- Haitao Wang 0019 — Soochow University, Suzhou, China
- Haitao Wang 0021 — Anhui University of Technology, School of Electrical and Information Engineering, Anhui Province Key Laboratory of Special Heavy Load Robot, Ma'anshan, China
- Haitao Wang 0022 — Guilin University of Electronic Technology, School of Information and Communication, Guilin, China
- Haitao Wang 0023 — Shandong Normal University, School of Information Science and Engineering, Jinan, China
- Haitao Wang 0024 — Nanjing Audit University Jinshen College, School of Information Science and Engineering, Nanjing, China
- Haitao Wang 0025 — Linyi Central Hospital, Department of Neurosurgery, Shandong, China
- Haitao Wang 0026 — Sun Yat-sen University, School of Computer Science and Engineering, Guangzhou, China (and 1 more)
- Haitao Wang 0027 — Southeast University, School of Electrical Engineering, Nanjing, China
- Haitao Wang 0028 — Shanghai Jiao Tong University, Institute of Natural Sciences, Shanghai, China
- Haitao Wang 0029 (aka: Hai-Tao Wang 0029) — Chinese Academy of Sciences, Institute of Automation, State Key Laboratory of Management and Control for Complex Systems, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c85]Haitao Wang:
Algorithms for Computing Closest Points for Segments. STACS 2024: 58:1-58:17- 2023
- [j67]Haitao Wang, Yiming Zhao:
An optimal algorithm for L1 shortest paths in unit-disk graphs. Comput. Geom. 110: 101960 (2023) - [j66]Haitao Wang:
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. Discret. Comput. Geom. 70(2): 426-454 (2023) - [j65]Haitao Wang:
A New Algorithm for Euclidean Shortest Paths in the Plane. J. ACM 70(2): 11:1-11:62 (2023) - [c84]Haitao Wang, Yiming Zhao:
Improved Algorithms for Distance Selection and Related Problems. ESA 2023: 101:1-101:14 - [c83]Gang Liu, Haitao Wang:
On the Line-Separable Unit-Disk Coverage and Related Problems. ISAAC 2023: 51:1-51:14 - [c82]Gang Liu, Haitao Wang:
Geometric Hitting Set for Line-Constrained Disks. WADS 2023: 574-587 - [c81]Haitao Wang:
Dynamic Convex Hulls Under Window-Sliding Updates. WADS 2023: 689-703 - [i52]Haitao Wang:
Dynamic Convex Hulls under Window-Sliding Updates. CoRR abs/2305.08055 (2023) - [i51]Gang Liu, Haitao Wang:
Geometric Hitting Set for Line-Constrained Disks and Related Problems. CoRR abs/2305.09045 (2023) - [i50]Haitao Wang, Yiming Zhao:
Improved Algorithms for Distance Selection and Related Problems. CoRR abs/2306.01073 (2023) - [i49]Gang Liu, Haitao Wang:
On the Line-Separable Unit-Disk Coverage and Related Problems. CoRR abs/2309.03162 (2023) - 2022
- [j64]Haitao Wang, Jie Xue:
Improved algorithms for the bichromatic two-center problem for pairs of points. Comput. Geom. 100: 101806 (2022) - [j63]Logan Pedersen, Haitao Wang:
Algorithms for the line-constrained disk coverage and related problems. Comput. Geom. 105-106: 101883 (2022) - [j62]Haitao Wang:
On the Planar Two-Center Problem and Circular Hulls. Discret. Comput. Geom. 68(4): 1175-1226 (2022) - [c80]Haitao Wang, Yiming Zhao:
Computing the Minimum Bottleneck Moving Spanning Tree. MFCS 2022: 82:1-82:15 - [c79]Haitao Wang:
Constructing Many Faces in Arrangements of Lines and Segments. SODA 2022: 3168-3180 - [c78]Haitao Wang:
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. SOSA 2022: 79-86 - [c77]Haitao Wang:
Unit-Disk Range Searching and Applications. SWAT 2022: 32:1-32:17 - [c76]Haitao Wang, Yiming Zhao:
Reverse Shortest Path Problem in Weighted Unit-Disk Graphs. WALCOM 2022: 135-146 - [i48]Haitao Wang:
Unit-Disk Range Searching and Applications. CoRR abs/2204.08992 (2022) - [i47]Haitao Wang, Yiming Zhao:
Computing the Minimum Bottleneck Moving Spanning Tree. CoRR abs/2206.12500 (2022) - 2021
- [j61]Christopher Johnson, Haitao Wang:
A linear-time algorithm for radius-optimally augmenting paths in a metric space. Comput. Geom. 96: 101759 (2021) - [j60]Haitao Wang, Jingru Zhang:
An O(nlog n)-Time Algorithm for the k-Center Problem in Trees. SIAM J. Comput. 50(2): 602-635 (2021) - [j59]Haitao Wang, Yiming Zhao:
Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. Theor. Comput. Sci. 890: 192-209 (2021) - [c75]Princy Jain, Haitao Wang:
Algorithms for Covering Barrier Points by Mobile Sensors with Line Constraint. CCCG 2021: 139-148 - [c74]Haitao Wang, Yiming Zhao:
An Optimal Algorithm for L1 Shortest Paths in Unit-Disk Graphs. CCCG 2021: 211-218 - [c73]Haitao Wang:
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. SoCG 2021: 59:1-59:15 - [c72]Haitao Wang:
Shortest Paths Among Obstacles in the Plane Revisited. SODA 2021: 810-821 - [c71]Haitao Wang:
A new algorithm for Euclidean shortest paths in the plane. STOC 2021: 975-988 - [c70]Logan Pedersen, Haitao Wang:
Algorithms for the Line-Constrained Disk Coverage and Related Problems. WADS 2021: 585-598 - [c69]Haitao Wang, Yiming Zhao:
Reverse Shortest Path Problem for Unit-Disk Graphs. WADS 2021: 655-668 - [c68]Haitao Wang, Yiming Zhao:
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. WALCOM 2021: 27-39 - [i46]Haitao Wang:
A New Algorithm for Euclidean Shortest Paths in the Plane. CoRR abs/2102.12589 (2021) - [i45]Haitao Wang:
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. CoRR abs/2103.00076 (2021) - [i44]Haitao Wang, Yiming Zhao:
Reverse Shortest Path Problem for Unit-Disk Graphs. CoRR abs/2104.14476 (2021) - [i43]Logan Pedersen, Haitao Wang:
Algorithms for the Line-Constrained Disk Coverage and Related Problems. CoRR abs/2104.14680 (2021) - [i42]Haitao Wang:
Constructing Many Faces in Arrangements of Lines and Segments. CoRR abs/2110.08669 (2021) - [i41]Haitao Wang:
A Simple Algorithm for Computing the Zone of a Line in an Arrangement of Lines. CoRR abs/2111.08238 (2021) - 2020
- [j58]Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Discret. Comput. Geom. 64(4): 1141-1166 (2020) - [j57]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): 167-182 (2020) - [j56]Haitao Wang:
A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains. J. Comput. Geom. 11(1): 235-282 (2020) - [c67]Haitao Wang, Yiming Zhao:
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Pathsin a Metric Space. CCCG 2020: 174-180 - [c66]Haitao Wang:
On the Planar Two-Center Problem and Circular Hulls. SoCG 2020: 68:1-68:14 - [c65]Haitao Wang:
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. SoCG 2020: 69:1-69:14 - [i40]Haitao Wang:
On the Planar Two-Center Problem and Circular Hulls. CoRR abs/2002.07945 (2020) - [i39]Haitao Wang:
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. CoRR abs/2002.10672 (2020) - [i38]Haitao Wang, Yiming Zhao:
A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. CoRR abs/2006.14093 (2020) - [i37]Haitao Wang:
Shortest Paths Among Obstacles in the Plane Revisited. CoRR abs/2010.09115 (2020) - [i36]Haitao Wang, Yiming Zhao:
Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. CoRR abs/2011.09591 (2020)
2010 – 2019
- 2019
- [j55]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): 289-316 (2019) - [j54]Haitao Wang, Jingru Zhang:
Covering Uncertain Points in a Tree. Algorithmica 81(6): 2346-2376 (2019) - [j53]Danny Z. Chen, Haitao Wang:
Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica 81(6): 2430-2483 (2019) - [j52]Haitao Wang:
Quickest Visibility Queries in Polygonal Domains. Discret. Comput. Geom. 62(2): 374-432 (2019) - [j51]Haitao Wang:
Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane. Discret. Comput. Geom. 62(3): 525-582 (2019) - [j50]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): 189-218 (2019) - [j49]Shimin Li, Haitao Wang:
Separating overlapped intervals on a line. J. Comput. Geom. 10(1): 281-321 (2019) - [j48]Shimin Li, Haitao Wang:
Algorithms for covering multiple barriers. Theor. Comput. Sci. 758: 61-72 (2019) - [j47]Sang Won Bae, Haitao Wang:
L1 shortest path queries in simple polygons. Theor. Comput. Sci. 790: 105-116 (2019) - [c64]Haitao Wang:
A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. SoCG 2019: 59:1-59:14 - [c63]Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. SoCG 2019: 60:1-60:13 - [c62]Christopher Johnson, Haitao Wang:
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. WADS 2019: 466-480 - [c61]Haitao Wang, Jie Xue:
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. WADS 2019: 578-591 - [i35]Haitao Wang:
A Divide-and-Conquer Algorithm for Two-Point L1 Shortest Path Queries in Polygonal Domains. CoRR abs/1903.01417 (2019) - [i34]Haitao Wang, Jie Xue:
Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. CoRR abs/1903.05255 (2019) - [i33]Christopher Johnson, Haitao Wang:
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. CoRR abs/1904.12061 (2019) - [i32]Haitao Wang, Jie Xue:
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. CoRR abs/1905.00157 (2019) - 2018
- [j46]Haitao Wang:
An improved algorithm for diameter-optimally augmenting paths in a metric space. Comput. Geom. 75: 11-21 (2018) - [j45]Shimin Li, Haitao Wang:
Dispersing points on intervals. Discret. Appl. Math. 239: 106-118 (2018) - [j44]Haitao Wang, Jingru Zhang:
Computing the Rectilinear Center of Uncertain Points in the Plane. Int. J. Comput. Geom. Appl. 28(3): 271-288 (2018) - [j43]Haitao Wang:
On the geodesic centers of polygonal domains. J. Comput. Geom. 9(1): 131-190 (2018) - [j42]Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang:
Near-linear time approximation schemes for geometric maximum coverage. Theor. Comput. Sci. 725: 64-78 (2018) - [c60]Logan Pedersen, Haitao Wang:
On the Coverage of Points in the Plane by Disks Centered at a Line. CCCG 2018: 158-164 - [c59]Haitao Wang, Jingru Zhang:
An O(n log n)-Time Algorithm for the k-Center Problem in Trees. SoCG 2018: 72:1-72:15 - [i31]Sang Won Bae, Haitao Wang:
L1 Shortest Path Queries in Simple Polygons. CoRR abs/1809.07481 (2018) - 2017
- [j41]Danny Z. Chen, Haitao Wang:
Computing the Visibility Polygon of an Island in a Polygonal Domain. Algorithmica 77(1): 40-64 (2017) - [j40]Aaron M. Andrews, Haitao Wang:
Minimizing the Aggregate Movements for Interval Coverage. Algorithmica 78(1): 47-85 (2017) - [j39]Haitao Wang, Jingru Zhang:
Computing the Center of Uncertain Points on Tree Networks. Algorithmica 78(1): 232-254 (2017) - [j38]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. Discret. Comput. Geom. 57(3): 674-701 (2017) - [j37]Victor C. S. Lee, Haitao Wang, Xiao Zhang:
Minimizing the Maximum Moving Cost of Interval Coverage. Int. J. Comput. Geom. Appl. 27(3): 187-206 (2017) - [c58]Haitao Wang:
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. SoCG 2017: 60:1-60:16 - [c57]Haitao Wang:
Quickest Visibility Queries in Polygonal Domains. SoCG 2017: 61:1-61:16 - [c56]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: 11:1-11:19 - [c55]Shimin Li, Haitao Wang:
Algorithms for Covering Multiple Barriers. WADS 2017: 533-544 - [c54]Haitao Wang:
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. WADS 2017: 545-556 - [c53]Haitao Wang, Jingru Zhang:
Covering Uncertain Points in a Tree. WADS 2017: 557-568 - [i30]Lingxiao Huang, Yifei Jin, Jian Li, Haitao Wang:
Improved Algorithms For Structured Sparse Recovery. CoRR abs/1701.05674 (2017) - [i29]Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang:
Linear Time Approximation Schemes for Geometric Maximum Coverage. CoRR abs/1702.01836 (2017) - [i28]Haitao Wang:
Quickest Visibility Queries in Polygonal Domains. CoRR abs/1703.03048 (2017) - [i27]Haitao Wang:
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. CoRR abs/1703.04466 (2017) - [i26]Shimin Li, Haitao Wang:
Algorithms for Covering Multiple Barriers. CoRR abs/1704.06870 (2017) - [i25]Haitao Wang, Jingru Zhang:
Covering Uncertain Points in a Tree. CoRR abs/1704.07497 (2017) - [i24]Haitao Wang, Jingru Zhang:
An O(n\log n)-Time Algorithm for the k-Center Problem in Trees. CoRR abs/1705.02752 (2017) - 2016
- [j36]Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang:
Matroid and Knapsack Center Problems. Algorithmica 75(1): 27-52 (2016) - [j35]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): 185-210 (2016) - [j34]Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-point L1 shortest path queries in the plane. J. Comput. Geom. 7(1): 473-519 (2016) - [j33]Haitao Wang, Jingru Zhang:
A note on computing the center of uncertain data on the real line. Oper. Res. Lett. 44(3): 370-373 (2016) - [j32]Jian Li, Haitao Wang:
Range queries on uncertain data. Theor. Comput. Sci. 609: 32-48 (2016) - [j31]Minghui Jiang, Haitao Wang:
Shortest color-spanning intervals. Theor. Comput. Sci. 609: 561-568 (2016) - [j30]Boyang Wang, Ming Li, Haitao Wang:
Geometric Range Search on Encrypted Spatial Data. IEEE Trans. Inf. Forensics Secur. 11(4): 704-719 (2016) - [c52]Lingxiao Huang, Jian Li, Jeff M. Phillips, Haitao Wang:
epsilon-Kernel Coresets for Stochastic Points. ESA 2016: 50:1-50:18 - [c51]Haitao Wang:
On the Geodesic Centers of Polygonal Domains. ESA 2016: 77:1-77:17 - [c50]Shimin Li, Haitao Wang:
Dispersing Points on Intervals. ISAAC 2016: 52:1-52:12 - [c49]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: 14:1-14:14 - [i23]Haitao Wang:
On the Geodesic Centers of Polygonal Domains. CoRR abs/1607.05824 (2016) - [i22]Haitao Wang:
An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. CoRR abs/1608.04456 (2016) - [i21]Shimin Li, Haitao Wang:
Separating Overlapped Intervals on a Line. CoRR abs/1609.07766 (2016) - [i20]Shimin Li, Haitao Wang:
Dispersing Points on Intervals. CoRR abs/1611.09485 (2016) - 2015
- [j29]Danny Ziyi Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. Algorithmica 72(2): 379-399 (2015) - [j28]Danny Z. Chen, Haitao Wang:
Visibility and ray shooting queries in polygonal domains. Comput. Geom. 48(2): 31-41 (2015) - [j27]Danny Ziyi Chen, Haitao Wang:
Weak visibility queries of line segments in simple polygons. Comput. Geom. 48(6): 443-452 (2015) - [j26]Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang:
Computing the L1 geodesic diameter and center of a simple polygon in linear time. Comput. Geom. 48(6): 495-505 (2015) - [j25]Danny Ziyi Chen, Xiaomin Liu, Haitao Wang:
Computing maximum non-crossing matching in convex bipartite graphs. Discret. Appl. Math. 187: 50-60 (2015) - [j24]Haitao Wang:
Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane. Int. J. Comput. Geom. Appl. 25(1): 57- (2015) - [j23]Danny Z. Chen, Haitao Wang:
A new algorithm for computing visibility graphs of polygonal obstacles in the plane. J. Comput. Geom. 6(1): 316-345 (2015) - [j22]Wei Cao, Jian Li, Shimin Li, Haitao Wang:
Balanced splitting on weighted intervals. Oper. Res. Lett. 43(4): 396-400 (2015) - [j21]Danny Z. Chen, Haitao Wang:
Computing Shortest Paths among Curved Obstacles in the Plane. ACM Trans. Algorithms 11(4): 26:1-26:46 (2015) - [j20]Danny Ziyi Chen, Jian Li, Haitao Wang:
Efficient algorithms for the one-dimensional k-center problem. Theor. Comput. Sci. 592: 135-142 (2015) - [j19]Minghui Jiang, Pedro J. Tejada, Haitao Wang:
Quell. Theor. Comput. Sci. 593: 70-78 (2015) - [j18]Haitao Wang, Jingru Zhang:
One-dimensional k-center on uncertain data. Theor. Comput. Sci. 602: 114-124 (2015) - [c48]Shimin Li, Haitao Wang:
Algorithms for Minimizing the Movements of Spreading Points in Linear Domains. CCCG 2015 - [c47]Boyang Wang, Ming Li, Haitao Wang, Hui Li:
Circular range search on encrypted spatial data. CNS 2015: 182-190 - [c46]Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang:
Linear Time Approximation Schemes for Geometric Maximum Coverage. COCOON 2015: 559-571 - [c45]Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang:
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. ICALP (1) 2015: 947-959 - [c44]Boyang Wang, Ming Li, Haitao Wang, Hui Li:
Circular Range Search on Encrypted Spatial Data. ICDCS 2015: 794-795 - [c43]Haitao Wang, Xiao Zhang:
Minimizing the Maximum Moving Cost of Interval Coverage. ISAAC 2015: 188-198 - [c42]Jiazhuo Wang, John D. MacKenzie, Rageshree Ramachandran, Yizhe Zhang, Haitao Wang, Danny Ziyi Chen:
Segmenting subcellular structures in histology tissue images. ISBI 2015: 556-559 - [c41]Aaron M. Andrews, Haitao Wang:
Minimizing the Aggregate Movements for Interval Coverage. WADS 2015: 28-39 - [c40]Haitao Wang, Jingru Zhang:
Computing the Center of Uncertain Points on Tree Networks. WADS 2015: 606-618 - [i19]Jian Li, Haitao Wang:
Range Queries on Uncertain Data. CoRR abs/1501.02309 (2015) - [i18]Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, Haitao Wang:
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. CoRR abs/1504.06842 (2015) - [i17]Jian Li, Haitao Wang, Bowei Zhang, Ningye Zhang:
Linear Time Approximation Schemes for Geometric Maximum Coverage. CoRR abs/1505.02591 (2015) - [i16]Haitao Wang, Jingru Zhang:
Computing the Rectilinear Center of Uncertain Points in the Plane. CoRR abs/1509.05377 (2015) - [i15]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. CoRR abs/1512.07160 (2015) - 2014
- [j17]Danny Z. Chen, Haitao Wang:
New Algorithms for Facility Location Problems on the Real Line. Algorithmica 69(2): 370-383 (2014) - [j16]Danny Z. Chen, Haitao Wang:
Outlier Respecting Points Approximation. Algorithmica 69(2): 410-430 (2014) - [j15]Haitao Wang:
Minmax regret 1-facility location on uncertain path networks. Eur. J. Oper. Res. 239(3): 636-643 (2014) - [c39]Haitao Wang, Wuzhou Zhang:
The τ-Skyline for Uncertain Data. CCCG 2014 - [c38]Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, Hui Li:
Maple: scalable multi-dimensional range search over encrypted cloud data with tree-based index. AsiaCCS 2014: 111-122 - [c37]Haitao Wang, Jingru Zhang:
One-Dimensional k-Center on Uncertain Data. COCOON 2014: 104-115 - [c36]Minghui Jiang, Haitao Wang:
Shortest Color-Spanning Intervals. COCOON 2014: 288-299 - [c35]Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-Point L1 Shortest Path Queries in the Plane. SoCG 2014: 406-416 - [c34]Minghui Jiang, Pedro J. Tejada, Haitao Wang:
Quell. FUN 2014: 240-251 - [c33]Haitao Wang, Jingru Zhang:
Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane. ISAAC 2014: 3-14 - [c32]Jian Li, Haitao Wang:
Range Queries on Uncertain Data. ISAAC 2014: 326-337 - [c31]Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang:
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. LATIN 2014: 120-131 - [c30]Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, Hui Li, Fenghua Li:
Tree-Based Multi-dimensional Range Search on Encrypted Data with Enhanced Privacy. SecureComm (1) 2014: 374-394 - [i14]Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang:
Two-Point L1 Shortest Path Queries in the Plane. CoRR abs/1403.3458 (2014) - [i13]Jian Li, Jeff M. Phillips, Haitao Wang:
$ε$-Kernel Coresets for Stochastic Points. CoRR abs/1411.0194 (2014) - [i12]Aaron M. Andrews, Haitao Wang:
Minimizing the Aggregate Movements for Interval Coverage. CoRR abs/1412.2300 (2014) - 2013
- [j14]Danny Z. Chen, Haitao Wang:
Approximating Points by a Piecewise Linear Function. Algorithmica 66(3): 682-713 (2013) - [j13]Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang:
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. Discret. Comput. Geom. 50(2): 374-408 (2013) - [j12]Danny Z. Chen, Haitao Wang:
A note on searching line arrangements and applications. Inf. Process. Lett. 113(14-16): 518-521 (2013) - [j11]Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang:
The topology aware file distribution problem. J. Comb. Optim. 26(4): 621-635 (2013) - [j10]Danny Z. Chen, John Hershberger, Haitao Wang:
Computing Shortest Paths amid Convex Pseudodisks. SIAM J. Comput. 42(3): 1158-1184 (2013) - [c29]Haitao Wang:
Aggregate-Max Nearest Neighbor Searching in the Plane. CCCG 2013 - [c28]Danny Z. Chen, Haitao Wang:
Computing shortest paths among curved obstacles in the plane. SoCG 2013: 369-378 - [c27]Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang:
Matroid and Knapsack Center Problems. IPCO 2013: 110-122 - [c26]Haitao Wang:
Minmax Regret 1-Facility Location on Uncertain Path Networks. ISAAC 2013: 733-743 - [c25]Danny Z. Chen, Haitao Wang:
L_1 Shortest Path Queries among Polygonal Obstacles in the Plane. STACS 2013: 293-304 - [c24]Danny Z. Chen, Haitao Wang:
Visibility and Ray Shooting Queries in Polygonal Domains. WADS 2013: 244-255 - [i11]Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang:
Matroid and Knapsack Center Problems. CoRR abs/1301.0745 (2013) - [i10]Danny Z. Chen, Jian Li, Haitao Wang:
Efficient Algorithms for One-Dimensional k-Center Problems. CoRR abs/1301.7512 (2013) - [i9]Haitao Wang:
Aggregate-Max Nearest Neighbor Searching in the Plane. CoRR abs/1309.1807 (2013) - [i8]Sang Won Bae, Matias Korman, Yoshio Okamoto, Haitao Wang:
Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. CoRR abs/1312.3711 (2013) - 2012
- [j9]Danny Z. Chen, Haitao Wang:
An improved algorithm for reconstructing a simple polygon from its visibility angles. Comput. Geom. 45(5-6): 254-257 (2012) - [j8]Danny Z. Chen, Haitao Wang:
Fitting a Step Function to a Point Set with Outliers Based on Simplicial thickness Data Structures. Int. J. Comput. Geom. Appl. 22(3): 215-242 (2012) - [j7]Danny Z. Chen, Haitao Wang:
Locating an obnoxious Line among Planar Objects. Int. J. Comput. Geom. Appl. 22(5): 391-406 (2012) - [c23]Danny Z. Chen, Xiaomin Liu, Haitao Wang:
Computing Maximum Non-crossing Matching in Convex Bipartite Graphs. FAW-AAIM 2012: 105-116 - [c22]Danny Z. Chen, Haitao Wang:
Computing the Visibility Polygon of an Island in a Polygonal Domain. ICALP (1) 2012: 218-229 - [c21]Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. ISAAC 2012: 332-341 - [c20]Danny Z. Chen, Haitao Wang:
Weak Visibility Queries of Line Segments in Simple Polygons. ISAAC 2012: 609-618 - [c19]Xiaomin Liu, Cameron W. Harvey, Haitao Wang, Mark S. Alber, Danny Z. Chen:
Detecting and Tracking Motion of Myxococcus xanthus Bacteria in Swarms. MICCAI (1) 2012: 373-380 - [c18]Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang:
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. SWAT 2012: 177-188 - [i7]Danny Z. Chen, Haitao Wang:
Computing L1 Shortest Paths among Polygonal Obstacles in the Plane. CoRR abs/1202.5715 (2012) - [i6]Danny Z. Chen, Yan Gu, Jian Li, Haitao Wang:
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. CoRR abs/1207.6409 (2012) - [i5]Haitao Wang, Wuzhou Zhang:
The L1 Nearest Neighbor Searching with Uncertain Queries. CoRR abs/1211.5084 (2012) - [i4]Danny Z. Chen, Haitao Wang:
Weak Visibility Queries of Line Segments in Simple Polygons. CoRR abs/1212.6039 (2012) - 2011
- [j6]Danny Z. Chen, Chao Wang, Haitao Wang:
Representing a Functional Curve by Curves with Fewer Peaks. Discret. Comput. Geom. 46(2): 334-360 (2011) - [j5]Danny Z. Chen, Haitao Wang:
Processing an Offline Insertion-Query Sequence with Applications. Int. J. Found. Comput. Sci. 22(6): 1439-1456 (2011) - [j4]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
New algorithms for online rectangle filling with k-lookahead. J. Comb. Optim. 21(1): 67-82 (2011) - [j3]Danny Z. Chen, Haitao Wang:
Improved algorithms for path partition and related problems. Oper. Res. Lett. 39(6): 437-440 (2011) - [j2]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
Online rectangle filling. Theor. Comput. Sci. 412(39): 5247-5275 (2011) - [c17]Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang:
The Topology Aware File Distribution Problem. COCOON 2011: 366-378 - [c16]Danny Z. Chen, Haitao Wang:
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane. ESA 2011: 481-492 - [c15]Danny Z. Chen, Haitao Wang:
Efficient Algorithms for the Weighted k-Center Problem on a Real Line. ISAAC 2011: 584-593 - [c14]Danny Z. Chen, Haitao Wang:
Outlier Respecting Points Approximation. ISAAC 2011: 594-603 - [c13]Danny Z. Chen, Haitao Wang:
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles. ISAAC 2011: 604-613 - [c12]Danny Z. Chen, Haitao Wang:
Computing Shortest Paths amid Pseudodisks. SODA 2011: 309-226 - [c11]Danny Z. Chen, Haitao Wang:
New Algorithms for 1-D Facility Location and Path Equipartition Problems. WADS 2011: 207-218 - [i3]Danny Z. Chen, Haitao Wang:
Computing Shortest Paths among Curved Obstacles in the Plane. CoRR abs/1103.3911 (2011) - [i2]Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu:
Optimal Point Movement for Covering Circular Regions. CoRR abs/1107.1012 (2011) - 2010
- [c10]Danny Z. Chen, Haitao Wang:
Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures. IWOCA 2010: 363-376 - [c9]Danny Z. Chen, Chao Wang, Haitao Wang:
Representing a Functional Curve by Curves with Fewer Peaks. SWAT 2010: 200-211 - [i1]Danny Z. Chen, Haitao Wang:
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles. CoRR abs/1009.2521 (2010)
2000 – 2009
- 2009
- [c8]Danny Z. Chen, Haitao Wang:
Processing an Offline Insertion-Query Sequence with Applications. FAW 2009: 141-152 - [c7]Danny Z. Chen, Haitao Wang:
Approximating Points by a Piecewise Linear Function: I. ISAAC 2009: 224-233 - [c6]Danny Z. Chen, Haitao Wang:
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers. ISAAC 2009: 234-243 - [c5]Danny Z. Chen, Haitao Wang:
Locating an Obnoxious Line among Planar Objects. ISAAC 2009: 740-749 - 2008
- [c4]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
New Algorithms for Online Rectangle Filling with k-Lookahead. COCOON 2008: 385-394 - 2007
- [c3]Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
Online Rectangle Filling. WAOA 2007: 274-287 - 2006
- [j1]Qi Ge, Haitao Wang, Hong Zhu:
An Improved Algorithm for Finding the Closest Pair of Points. J. Comput. Sci. Technol. 21(1): 27-31 (2006) - [c2]Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, Hong Zhu:
Traversing the Machining Graph. ESA 2006: 220-231 - 2005
- [c1]Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Haitao Wang:
Approximating Spanning Trees with Inner Nodes Cost. PDCAT 2005: 660-664
Coauthor Index
Danny Ziyi Chen
aka: Danny Z. Chen
aka: Danny Z. Chen
[j53] [j41] [j36] [j34] [j29] [j28] [j27] [j25] [j23] [j21] [j20] [c42] [j17] [j16] [c35] [i14] [j14] [j13] [j12] [j11] [j10] [c28] [c27] [c25] [c24] [i11] [i10] [j9] [j8] [j7] [c23] [c22] [c21] [c20] [c19] [c18] [i7] [i6] [i4] [j6] [j5] [j4] [j3] [j2] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [i3] [i2] [c10] [c9] [i1] [c8] [c7] [c6] [c5] [c4] [c3] [c2]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-05 00:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
