You may also find my publications from my DBLP entry.

Peer-Reviewed Journal Articles

  1. Haitao Wang and Yiming Zhao. A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. International Journal of Computational Geometry and Applications (IJCGA), accepted, 2021.

  2. Haitao Wang and Jingru Zhang. An O(n log n)-Time Algorithm for the k-Center Problem in Trees. SIAM Journal on Computing (SICOMP), Vol. 50, pages 602--635, 2021.

  3. Christopher Johnson and Haitao Wang. A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. Computational Geometry: Theory and Applications (CGTA), Vol. 76, Article No. 101759, pages 1--21, 2021.

  4. Haitao Wang. A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. Journal of Computational Geometry (JoCG), Vol. 11, pages 235--282, 2020.

  5. Haitao Wang and Jie Xue. Near-optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Discrete & Computational Geometry (DCG), Vol. 64, pages 1141--1166, 2020.

  6. Shimin Li and Haitao Wang. Separating Overlapped Intervals on a Line. Journal of Computational Geometry (JoCG), Vol. 10, pages 281--321, 2019.

  7. Haitao Wang and Wuzhou Zhang. On Top-k Weighted SUM Aggregate Nearest and Farthest Neighbors in the L1 Plane . International Journal of Computational Geometry and Applications (IJCGA), Vol. 29, pages 189--218, 2019.

  8. Haitao Wang. Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. Discrete & Computational Geometry (DCG), Vol. 62, pages 525--582, 2019.

  9. Haitao Wang. Quickest Visibility Queries in Polygonal Domains. Discrete & Computational Geometry (DCG), Vol. 62, pages 374--432, 2019.

  10. Sang Won Bae and Haitao Wang. L1 Shortest Path Queries in Simple Polygons. Theoretical Computer Science (TCS), Vol. 790, pages 105--116, 2019.

  11. Haitao Wang and Jingru Zhang. Covering Uncertain Points in a Tree. Algorithmica, Vol. 81, pages 2346--2376, 2019.

  12. Shimin Li and Haitao Wang. Algorithms for Covering Multiple Barriers. Theoretical Computer Science (TCS), Vol. 758, pages 61--72, 2019.

  13. Joseph S.B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, and Haitao Wang. An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. Algorithmica , Vol. 81, pages 289--316, 2019.

  14. Danny Z. Chen and Haitao Wang. Computing L1 Shortest Paths Among Polygonal Obstacles in the Plane. Algorithmica, Vol. 81, pages 2430--2483, 2019.

  15. Haitao Wang. An improved algorithm for diameter-optimally augmenting paths in a metric space. Computational Geometry: Theory and Applications (CGTA), Vol. 75, pages 11--21, 2018.

  16. Haitao Wang. On the geodesic centers of polygonal domains. Journal of Computational Geometry (JoCG), Vol. 9, pages 131--190, 2018.

  17. Haitao Wang and Jingru Zhang. Computing the Rectilinear Center of Uncertain Points in the Plane. International Journal of Computational Geometry and Applications (IJCGA), Vol. 28, pages 271--288, 2018.

  18. Shimin Li and Haitao Wang. Dispersing Points on Intervals. Discrete Applied Mathematics (DAM), Vol. 239, pages 106--118, 2018.

  19. Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, and Ningye Zhang. Near-Linear Time Approximation Schemes for Geometric Maximum Coverage. Theoretical Computer Science (TCS), Vol. 725, pages 64--78, 2018.

  20. Victor C.S. Lee, Haitao Wang, and Xiao Zhang. Minimizing the Maximum Moving Cost of Interval Coverage. International Journal of Computational Geometry and Applications (IJCGA), Vol. 27, pages 187--205, 2017.

  21. Aaron M. Andrews and Haitao Wang. Minimizing the Aggregate Movements for Interval Coverage. Algorithmica, Vol. 78, pages 47--85, 2017.

  22. Haitao Wang and Jingru Zhang. Computing the Center of Uncertain Points on Tree Networks. Algorithmica, Vol. 78, pages 232--254, 2017.

  23. Sang Won Bae, Matias Korman, Joseph S.B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, and Haitao Wang. Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. Discrete & Computational Geometry (DCG), Vol. 57, pages 674--701, 2017.

  24. Danny Z. Chen and Haitao Wang. Computing the Visibility Polygon of an Island in a Polygonal Domain. Algorithmica, Vol. 77, pages 40--64, 2017.

  25. Haitao Wang and Jingru Zhang. Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane. International Journal of Computational Geometry and Applications (IJCGA), Vol. 26, pages 185--210, 2016.

  26. Haitao Wang and Jingru Zhang. A note on computing the center of uncertain data on the real line. Operations Research Letters (ORL), Vol. 44, pages 370--373, 2016.

  27. Danny Z. Chen, Rajasekhar Inkulu, and Haitao Wang. Two-Point L1 Shortest Path Queries in the Plane. Journal of Computational Geometry (JoCG), Vol. 1, pages 473--519, 2016.

  28. Jian Li and Haitao Wang. Range Queries on Uncertain Data. Theoretical Computer Science (TCS), Vol. 609, pages 32--48, 2016.

  29. Minghui Jiang and Haitao Wang. Shortest Color-Spanning Intervals. Theoretical Computer Science (TCS), Vol. 609, pages 561--568, 2016.

  30. Boyang Wang, Ming Li, and Haitao Wang. Geometric Range Searching on Encrypted Spatial Data. IEEE Transactions on Information Forensics and Security (TIFS), Vol. 11, pages 704--719, 2016.

  31. Danny Z. Chen, Jian Li, Hongyu Liang, and Haitao Wang. Matroid and Knapsack Center Problems. Algorithmica, Vol. 75, pages 27--52, 2016.

  32. Haitao Wang and Jingru Zhang. One-Dimensional k-Center on Uncertain Data. Theoretical Computer Science (TCS), Vol. 602, pages 114-124, 2015.

  33. Wei Cao, Jian Li, Shimin Li, and Haitao Wang. Balanced Splitting on Weighted Intervals. Operations Research Letters (ORL), Vol. 43, pages 396-400, 2015.

  34. Minghui Jiang, Pedro J. Tejada, and Haitao Wang. Quell. Theoretical Computer Science (TCS), Vol. 593, pages 70-78, 2015.

  35. Danny Z. Chen and Haitao Wang. A New Algorithm for Computing Visibility Graphs of Polygonal Obstacles in the Plane. Journal of Computational Geometry (JoCG), Vol. 6, pages 316-345, 2015.

  36. Haitao Wang. Aggregate-Max Top-k Nearest Neighbor Searching in the L1 Plane. International Journal of Computational Geometry and Applications (IJCGA), Vol. 25(1), pages 57--76, 2015.

  37. Danny Z. Chen, Xiaomin Liu, and Haitao Wang. Computing Maximum Non-crossing Matching in Convex Bipartite Graphs. Discrete Applied Mathematics, Vol. 187, pages 50-60, 2015.

  38. Sang Won Bae, Matias Korman, Yoshio Okamoto, and Haitao Wang. Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.Computational Geometry: Theory and Applications (CGTA), Vol. 48(6), pages 495-505, 2015.

  39. Danny Z. Chen, Jian Li, and Haitao Wang. Efficient Algorithms for the One-Dimensional k-Center Problem. Theoretical Computer Science (TCS), Vol. 592, pages 135-142, 2015.

  40. Danny Z. Chen and Haitao Wang. Weak Visibility Queries of Line Segments in Simple Polygons. Computational Geometry: Theory and Applications (CGTA), Vol. 48(6), pages 443-452, 2015.

  41. Danny Z. Chen and Haitao Wang. Visibility and Ray Shooting Queries in Polygonal Domains. Computational Geometry: Theory and Applications (CGTA), Vol. 48(2), pages 31-41, 2015.

  42. Danny Z. Chen and Haitao Wang. Computing Shortest Paths among Curved Obstacles in the Plane. ACM Transactions on Algorithms, Vol. 11(4), Article No. 26, 2015.

  43. Danny Z. Chen, Xuehou Tan, Haitao Wang, and Gangshan Wu. Optimal Point Movement for Covering Circular Regions. Algorithmica, Vol. 72(2), pages 379--399, 2015.

  44. Haitao Wang. Minmax Regret 1-Facility Location on Uncertain Path Networks. European Journal of Operational Research, Vol.239(3), pages 636-643, 2014.

  45. Danny Z. Chen and Haitao Wang. New Algorithms for Facility Location Problems on the Real Line. Algorithmica, Vol. 69(2), pages 370-383, 2014.

  46. Danny Z. Chen and Haitao Wang. Outlier Respecting Points Approximation. Algorithmica, Vol. 69(2), pages 410-430, 2014.

  47. Danny Z. Chen, Yan Gu, Jian Li, and Haitao Wang. Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. Discrete & Computational Geometry (DCG) , Vol. 50(2), pages 374-408, 2013.

  48. Danny Z. Chen and Haitao Wang. A Note on Searching Line Arrangements and Applications. Information Processing Letters (IPL), Vol. 113, pages 518-521, 2013.

  49. Danny Z. Chen, John Hershberger, and Haitao Wang. Computing Shortest Paths amid Convex Pseudodisks. SIAM Journal on Computing (SICOMP), Vol. 42(3), pages 1158-1184, 2013.

  50. Danny Z. Chen and Haitao Wang. Approximating Points by a Piecewise Linear Function. Algorithmica, Vol. 66(3), pages 682-713, 2013.

  51. Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, and Haitao Wang. The Topology Aware File Distribution Problem. Journal of Combinatorial Optimization, Vol. 26(4), pages 621-635, 2013.

  52. Danny Z. Chen and Haitao Wang. Locating an Obnoxious Line among Planar Objects. International Journal of Computational Geometry and Applications (IJCGA), Vol. 22(5), pages 391-405, 2012.

  53. Danny Z. Chen and Haitao Wang. Fitting a Step Function to a Point Set with Outliers Based on Simplicial Thickness Data Structures. International Journal of Computational Geometry and Applications (IJCGA), Vol. 22(3), pages 215-241, 2012.

  54. Danny Z. Chen and Haitao Wang. An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles. Computational Geometry: Theory and Applications (CGTA), Vol. 45, pages 254-257, 2012.

  55. Danny Z. Chen and Haitao Wang. Improved Algorithms for Path Partition and Related Problems. Operations Research Letters (ORL), Vol. 39(6), pp, 2011. 437-440.

  56. Danny Z. Chen and Haitao Wang. Processing an Offline Insertion-Query Sequence with Applications. International Journal of Foundations of Computer Science (IJFCS) , Vol. 22(6), pages 1439-1456, 2011.

  57. Haitao Wang, Amitabh Chaudhary, and Danny Z. Chen. Online Rectangle Filling. Theoretical Computer Science (TCS), Vol. 412(39), pages 5247-5275, 2011.

  58. Danny Z. Chen, Chao Wang, and Haitao Wang. Representing a Functional Curve by Curves with Fewer Peaks . Discrete & Computational Geometry (DCG) , Vol. 46(2), pages 334-360, 2011.

  59. Haitao Wang, Amitabh Chaudhary, and Danny Z. Chen. New Algorithms for Online Rectangle Filling with k-Lookahead. Journal of Combinatorial Optimization , Vol. 21(1), pages 67-82, 2011.

  60. Qi Ge, Haitao Wang, and Hong Zhu. An Improved Algorithm for Finding the Closest Pair of Points. Journal of Computer Science and Technology, Vol. 21(1), pages 27-31, 2006.

Peer-Reviewed Conference Papers

  1. Logan Pedersen and Haitao Wang. Algorithms for the Line-Constrained Disk Coverage and Related Problems. To appear in the 17th Algorithms and Data Structures Symposium (WADS), online, August, 2021. [arXiv].

  2. Haitao Wang and Yiming Zhao. Reverse Shortest Path Problem for Unit-Disk Graphs. To appear in the 17th Algorithms and Data Structures Symposium (WADS), online, August, 2021. [arXiv].

  3. Haitao Wang. An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons. To appear in the 37th International Symposium on Computational Geometry (SoCG), online, June 2021. [arXiv].

  4. Haitao Wang. A New Algorithm for Euclidean Shortest Paths in the Plane. To appear in the 53rd Annual ACM Symposium on Theory of Computing (STOC), online, June 2021. [arXiv].

  5. Haitao Wang and Yiming Zhao. Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees. Proceedings of the 15th International Conference and Workshops on Algorithms and Computation (WALCOM), online, March 2021, pages 27--39. [arXiv]. [Video].

  6. Haitao Wang. Shortest Paths Among Obstacles in the Plane Revisited. Proceedings of the 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), online, January 2021, pages 810--821. [arXiv]. [slides].

  7. Haitao Wang and Yiming Zhao. A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space. Proceedings of the 32nd Canadian Conference on Computational Geometry (CCCG), online, August 2020, pages 174--180. [arXiv]. [Video].

  8. Haitao Wang. Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. Proceedings of the 36th International Symposium on Computational Geometry (SoCG), online, June 2020, pages 69:1--69:14. [arXiv]. [slides].

  9. Haitao Wang. On the Planar Two-Center Problem and Circular Hulls. Proceedings of the 36th International Symposium on Computational Geometry (SoCG), online, June 2020, pages 68:1--68:14. [arXiv]. [slides].

  10. Christopher Johnson and Haitao Wang. A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space. Proceedings of the 16th Algorithms and Data Structures Symposium (WADS), Edmonton, Canada, August 2019, pages 466--480. [arXiv]. [slides].

  11. Haitao Wang and Jie Xue. Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points. Proceedings of the 16th Algorithms and Data Structures Symposium (WADS), Edmonton, Canada, August 2019, pages 578--591. [arXiv]. [slides].

  12. Haitao Wang. A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains. Proceedings of the 35th International Symposium on Computational Geometry (SoCG), Portland, Oregon, USA, June 2019, pages 59:1--59:14. [arXiv]. [slides].

  13. Haitao Wang and Jie Xue. Near-optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. Proceedings of the 35th International Symposium on Computational Geometry (SoCG), Portland, Oregon, USA, June 2019, pages 60:1--60:13. [arXiv]. [slides].

  14. Logan Pedersen and Haitao Wang. On the Coverage of Points in the Plane by Disks Centered at a Line. Proceedings of the 30th Canadian Conference on Computational Geometry (CCCG), Manitoba, Canada, August 2018, pages 158--164.

  15. Haitao Wang and Jingru Zhang. An O(n log n)-Time Algorithm for the k-Center Problem in Trees. Proceedings of the 34th International Symposium on Computational Geometry (SoCG), Budapest, Hungary, June 2018, pages 72:1--72:15. [arXiv]. [slides].

  16. Shimin Li and Haitao Wang. Algorithms for Covering Multiple Barriers. Proceedings of the 15th Algorithms and Data Structures Symposium (WADS), St. John's, Canada, August 2017, pages 533--544. [arXiv]. [slides].

  17. Haitao Wang and Jingru Zhang. Covering Uncertain Points in a Tree. Proceedings of the 15th Algorithms and Data Structures Symposium (WADS), St. John's, Canada, August 2017, pages 557--568. [arXiv]. [slides].

  18. Haitao Wang. An Improved Algorithm for Diameter-Optimally Augmenting Paths in a Metric Space. Proceedings of the 15th Algorithms and Data Structures Symposium (WADS), St. John's, Canada, August 2017, pages 545--566. [arXiv]. [slides].

  19. Haitao Wang. Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane. Proceedings of the 33rd International Symposium on Computational Geometry (SoCG), Brisbane, Australia, July 2017, pages 60:1--60:16. [arXiv]. [slides].

  20. Haitao Wang. Quickest Visibility Queries in Polygonal Domains. Proceedings of the 33rd International Symposium on Computational Geometry (SoCG), Brisbane, Australia, July 2017, pages 61:1--61:16. [arXiv]. [slides].

  21. Wei Cao, Jian Li, Haitao Wang, Kangning Wang, Ruosong Wang, Raymond Chi-Wing Wong, and Wei Zhan. k-Regret Minimizing Set: Efficient Algorithms and Hardness. Proceedings of the 20th International Conference on Database Theory (ICDT), Venice, Italy, March 2017, pages 11:1--11:19. (Best Newcomer Award) [Full Paper].

  22. Shimin Li and Haitao Wang. Dispersing Points on Intervals. Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC), Sydney, Australia, December 2016, pages 52:1--52:12. [arXiv]. [slides].

  23. Lingxiao Huang, Jian Li, Jeff M. Phillips, and Haitao Wang. epsilon-Kernel Coresets for Stochastic Points. Proceedings of the 24th Annual European Symposium on Algorithms (ESA), Aarhus, Denmark, August 2016, pages 50:1--50:18. [arXiv].

  24. Haitao Wang. On the Geodesic Centers of Polygonal Domains. Proceedings of the 24th Annual European Symposium on Algorithms (ESA), Aarhus, Denmark, August 2016, pages 77:1--77:17. [arXiv]. [slides].

  25. Sang Won Bae, Matias Korman, Joseph S.B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, and Haitao Wang. Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS), Orleans, France, February 2016, pages 14:1--14:14. [arXiv].

  26. Haitao Wang and Xiao Zhang. Minimizing the Maximum Moving Cost of Interval Coverage. Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC), Nagoya, Japan, December 2015, pages 188--198.

  27. Boyang Wang, Ming Li, Haitao Wang, and Hui Li. Circular Range Search on Encrypted Spatial Data.Proceedings of the 3rd IEEE Conference on Communications and Network Security (CNS), Florence, Italy, September 2015, pages 182--190.

  28. Shimin Li and Haitao Wang. Algorithms for Minimizing the Movements of Spreading Points in Linear Domains. Proceedings of the 27th Canadian Conference on Computational Geometry (CCCG), Kingston, Canada, August 2015, pages 187--192.

  29. Haitao Wang and Jingru Zhang. Computing the Center of Uncertain Points on Tree Networks. Proceedings of the 14th Algorithms and Data Structures Symposium (WADS), Victoria, Canada, August 2015, pages 606--618. [slides].

  30. Aaron M. Andrews and Haitao Wang. Minimizing the Aggregate Movements for Interval Coverage. Proceedings of the 14th Algorithms and Data Structures Symposium (WADS), Victoria, Canada, August 2015, pages 28--39. [arXiv]. [slides].

  31. Jian Li, Haitao Wang, Bowei Zhang, and Ningye Zhang. Linear Time Approximation Schemes for Geometric Maximum Coverage. Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), Beijing, China, August 2015, pages 559--571. [arXiv].

  32. Joseph S.B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, and Haitao Wang. An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains. Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP), Kyoto, Japan, July 2015, pages 947--959. [arXiv]. [slides].

  33. Haitao Wang and Jingru Zhang. Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane. Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), Jeonju, Korea, December 2014, pages 3--14.

  34. Jian Li and Haitao Wang. Range Queries on Uncertain Data. Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), Jeonju, Korea, December 2014, pages 326--337. [arXiv]. [slides].

  35. Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, Hui Li and Fenghua Li. Tree-based Multi-Dimensional Range Search on Encrypted Data with Enhanced Privacy. Proceedings of the 10th International Conference on Security and Privacy in Communication Networks (SecureComm), Beijing, China, September 2014.

  36. Haitao Wang and Wuzhou Zhang. The τ-Skyline for Uncertain Data. Proceedings of the 26th Canadian Conference on Computational Geometry (CCCG), Halifax, Nova Scotia, Canada, August 2014. [slides].

  37. Haitao Wang and Jingru Zhang. One-Dimensional k-Center on Uncertain Data. Proceedings of the 20th Annual International Computing and Combinatorics Conference (COCOON), Atlanta, Georgia, USA, August 2014, pages 104--115.

  38. Minghui Jiang and Haitao Wang. Shortest Color-Spanning Intervals. Proceedings of the 20th Annual International Computing and Combinatorics Conference (COCOON), Atlanta, Georgia, USA, August 2014, pages 288--299.

  39. Minghui Jiang, Pedro J. Tejada, and Haitao Wang. Quell. Proceedings of the 7th International Conference on Fun with Algorithms (FUN), Sicily, Italy, July 2014, pages 240--251.

  40. Danny Z. Chen, Rajasekhar Inkulu, and Haitao Wang. Two-Point L1 Shortest Path Queries in the Plane. Proceedings of the 30th Anuual Symposium on Computational Geometry (SoCG), Kyoto, Japan, June 2014, pages 406-415. [arXiv]. [slides].

  41. Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, and Hui Li. Maple: Scalable Multi-Dimensional Range Search over Encrypted Cloud Data with Tree-based Index. Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security (ASIACCS), Kyoto, Japan, June 2014, pages 111-122.

  42. Sang Won Bae, Matias Korman, Yoshio Okamoto, and Haitao Wang. Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time. Proceedings of the 11th Latin American Theoretical Informatics Symposium (LATIN), Montevideo, Uruguay, April 2014, pages 120-131. [arXiv].

  43. Haitao Wang. Minmax Regret 1-Facility Location on Uncertain Path Networks. Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC), Hong Kong, China, December 2013, pages 733-743. [slides].

  44. Haitao Wang. Aggregate-Max Nearest Neighbor Searching in the Plane. Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG), Waterloo, Ontario, Canada, August 2013, pages 71-76. [arXiv] (with extended results to top-k queries for the L1 case). [slides].

  45. Danny Z. Chen and Haitao Wang. Visibility and Ray Shooting Queries in Polygonal Domains. Proceedings of the 13rd Algorithms and Data Structures Symposium (WADS), London, Ontario, Canada, August 2013, pages 244-255. [slides].

  46. Danny Z. Chen and Haitao Wang. Computing Shortest Paths among Curved Obstacles in the Plane. Proceedings of the 29th Annual Symposium on Computational Geometry (SoCG), Rio de Janeiro, Brazil, June 2013, pages 369-378. [arXiv]. [slides].

  47. Danny Z. Chen, Jian Li, Hongyu Liang, and Haitao Wang. Matroid and Knapsack Center Problems. In Proceedings of the 16th Conference onInteger Programming and Combinatorial Optimization (IPCO), Valparaiso, Chile, March 2013. Springer LNCS 7801, 2013, pages 110-122. [arXiv].

  48. Danny Z. Chen and Haitao Wang. L1 Shortest Path Queries among Polygonal Obstacles in the Plane. Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science (STACS), Kiel, Germany, February 2013, pages 293-304. [arXiv]. [slides].

  49. Danny Z. Chen and Haitao Wang. Weak Visibility Queries of Line Segments in Simple Polygons. Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC), Taipei, Taiwan, December 2012. Springer LNCS 7676, 2012, pages 609-618. [arXiv] (with improved results). [slides].

  50. Danny Z. Chen, Xuehou Tan, Haitao Wang, and Gangshan Wu. Optimal Point Movement for Covering Circular Regions. Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC), Taipei, Taiwan, December 2012. Springer LNCS 7676, 2012, pages 332-341. [arXiv]. [slides].

  51. Xiaomin Liu, Cameron W. Harvey, Haitao Wang, Mark S. Alber, and Danny Z. Chen. Detecting and Tracking Motion of Myxococcus xanthus Bacteria in Swarms. Proceedings of the 15th International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI), Nice, France, October 2012. Springer LNCS 7510, 2012, pages 373-380.

  52. Danny Z. Chen and Haitao Wang. Computing the Visibility Polygon of an Island in a Polygonal Domain. Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP), Warwick, UK, July 2012. Springer LNCS 7391, 2012, pages 218-229. [slides].

  53. Danny Z. Chen, Yan Gu, Jian Li, and Haitao Wang. Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain. Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), Helsinki, Finland, July 2012. Springer LNCS 7357, 2012, pages 177-188. [arXiv]. [slides].

  54. Danny Z. Chen, Xiaomin Liu, and Haitao Wang. Computing Maximum Non-crossing Matching in Convex Bipartite Graphs. Proceedings of the 6th International Frontiers of Algorithmics Workshop (FAW) , Beijing, China, May 2012. Springer LNCS 7285, 2012, pages 105-116. [slides].

  55. Danny Z. Chen and Haitao Wang. Efficient Algorithms for the Weighted k-Center Problem on a Real Line. Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC),, Yokohama, Japan, December 2011. Springer LNCS 7074, 2011, pages 584-593. [arXiv] (with improved results). [slides].

  56. Danny Z. Chen and Haitao Wang. An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles. Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC),, Yokohama, Japan, December 2011. Springer LNCS 7074, 2011, pages 604-613. [arXiv]. [slides].

  57. Danny Z. Chen and Haitao Wang. Outlier Respecting Points Approximation. Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC),, Yokohama, Japan, December 2011. Springer LNCS 7074, 2011, pages 594-603. [slides].

  58. Danny Z. Chen and Haitao Wang. A Nearly Optimal Algorithm for Finding L1 Shortest Paths among Polygonal Obstacles in the Plane. Proceedings of the 19th European Symposium on Algorithms (ESA), Saarbrücken, Germany, September 2011. Springer LNCS 6942, 2011, pages 481-492. [arXiv]. [slides].

  59. Shawn T. O'Neil, Amitabh Chaudhary, Danny Z. Chen, and Haitao Wang. The Topology Aware File Distribution Problem. Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON), Dallas, Texas, August 2011. Springer LNCS 6842, 2011, pages 366-378.

  60. Danny Z. Chen and Haitao Wang. New Algorithms for 1-D Facility Location and Path Equipartition Problems. Proceedings of the 12nd Algorithms and Data Structures Symposium (WADS), Brooklyn, New York, August 2011. Springer LNCS 6844, 2011, pages 207-218. [slides].

  61. Danny Z. Chen and Haitao Wang. Computing Shortest Paths amid Pseudodisks. Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, January 2011, pages 309-326. [slides].

  62. Danny Z. Chen and Haitao Wang. Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures. Proceedings of the 21st International Workshop on Combinatorial Algorithms (IWOCA), London, United Kingdom, July 2010. Springer LNCS 6460, 2011, pages 363-376. [slides].

  63. Danny Z. Chen, Chao Wang, and Haitao Wang. Representing a functional curve by curves with fewer peaks. Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), Bergen, Norway, June 2010. Springer LNCS 6139, 2010, pages 200-211. [slides].

  64. Danny Z. Chen and Haitao Wang. Approximating Points by a Piecewise Linear Function: I.. Proceedings of the 20th International Symposium on Algorithm and Computation (ISAAC), Honolulu, Hawaii, December 2009. Springer LNCS 5878, 2009, pages 224-233. [slides].

  65. Danny Z. Chen and Haitao Wang. Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers. Proceedings of the 20th International Symposium on Algorithm and Computation (ISAAC), Honolulu, Hawaii, December 2009. Springer LNCS 5878, 2009, pages 234-243. [slides].

  66. Danny Z. Chen and Haitao Wang. Locating an Obnoxious Line among Planar Objects. Proceedings of the 20th International Symposium on Algorithm and Computation (ISAAC), Honolulu, Hawaii, December 2009. Springer LNCS 5878, 2009, pages 740-749. [slides].

  67. Danny Z. Chen and Haitao Wang. Processing an Offline Insertion-Query Sequence with Applications. Proceedings of the 3rd International Frontiers of Algorithmics Workshop (FAW), Hefei, China, June 2009. Springer LNCS 5598, 2009, pages141-152. [slides].

  68. Haitao Wang, Amitabh Chaudhary, and Danny Z. Chen. New Algorithms for Online Rectangle Filling with k-Lookahead. Proceedings of the 14th Annual International Conference on Computing and Combinatorics (COCOON)}, Dalian, China, June 2008. Springer LNCS 5092, 2009, pages 385-394.

  69. Haitao Wang, Amitabh Chaudhary, and Danny Z. Chen. Online Rectangle Filling. Proceedings of the 5th Workshop on Approximation and Online Algorithm (WAOA), Eilat, Israel, October 2007. Springer LNCS 4927, 2008, pages 274-287.

  70. Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao Wang, and Hong Zhu. Traversing the Machining Graph. Proceedings of the 14th Annual European Symposium on Algorithms (ESA), Zurich, Switzerland, September 2006. Springer LNCS 4168, 2006, pages 220-231.

  71. Rudolf. Fleischer, Qi Ge, Jian Li, Shijun Tian, and Haitao Wang. Approximating Spanning Trees with Inner Nodes Cost. Proceedings of the 6th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), Dalian, China, December 2005, pages 660-664.

Note: Authors in most of my papers are ordered alphabetically by the last names, which follows the convention of ACM SIGACT (for theoretical computer science).