You may also find my publications from my
DBLP entry.
PeerReviewed Journal Articles

Haitao Wang.
On the Geodesic Centers of Polygonal Domains. Journal of Computational Geometry (JoCG), Vol. 9, pages 131190, 2018.

Haitao Wang.
An Improved Algorithm for DiameterOptimally Augmenting Paths in a Metric Space. Computational Geometry: Theory and Applications (CGTA), published online, 2018.

Joseph S.B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, and Haitao Wang.
An Optimal Algorithm for MinimumLink Rectilinear Paths in Triangulated Rectilinear Domains. Algorithmica , published online, 2018.

Haitao Wang and Jingru Zhang.
Computing the Rectilinear Center of Uncertain Points in the Plane. International Journal of Computational Geometry and Applications (IJCGA), accepted, 2018.

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

Kai Jin, Jian Li, Haitao Wang, Bowei Zhang, and Ningye Zhang.
NearLinear Time Approximation Schemes for Geometric Maximum Coverage. Theoretical Computer Science (TCS), Vol. 725, pages 6478, 2018.

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 187205, 2017.

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

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

Sang Won Bae, Matias Korman, Joseph S.B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, and Haitao Wang.
Computing the L_{1} Geodesic Diameter and Center of a Polygonal Domain.
Discrete & Computational Geometry (DCG), Vol. 57, pages 674701, 2017.

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

Haitao Wang and Jingru Zhang.
LineConstrained kMedian, kMeans, and kCenter Problems in the Plane.
International Journal of Computational Geometry and Applications (IJCGA), Vol. 26, pages 185210, 2016.

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 370373, 2016.

Danny Z. Chen, Rajasekhar Inkulu, and Haitao Wang.
TwoPoint L_{1} Shortest Path Queries in the Plane. Journal of Computational Geometry (JoCG), Vol. 1, pages 473519, 2016.

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

Minghui Jiang and Haitao Wang.
Shortest ColorSpanning Intervals. Theoretical Computer Science (TCS), Vol. 609, pages 561568, 2016.

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 704719, 2016.

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

Haitao Wang and Jingru Zhang.
OneDimensional kCenter on Uncertain Data. Theoretical Computer Science (TCS), Vol. 602, pages 114124, 2015.

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

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

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 316345, 2015.

Haitao Wang.
AggregateMax Topk Nearest Neighbor Searching in the L_{1} Plane. International Journal of Computational Geometry and Applications (IJCGA), Vol. 25(1), pages 5776, 2015.

Danny Z. Chen, Xiaomin Liu, and Haitao Wang.
Computing Maximum Noncrossing Matching in Convex Bipartite Graphs. Discrete Applied Mathematics, Vol. 187, pages 5060, 2015.

Sang Won Bae, Matias Korman, Yoshio Okamoto, and Haitao Wang.
Computing the L_{1} Geodesic Diameter and Center of a Simple Polygon in Linear Time.Computational Geometry: Theory and Applications (CGTA), Vol. 48(6), pages 495505, 2015.

Danny Z. Chen, Jian Li, and Haitao Wang.
Efficient Algorithms for the OneDimensional kCenter Problem. Theoretical Computer Science (TCS), Vol. 592, pages 135142, 2015.

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 443452, 2015.

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

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.

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

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

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

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

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 374408, 2013.

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

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

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

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 621635, 2013.

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 391405, 2012.

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 215241, 2012.

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 254257, 2012.

Danny Z. Chen and Haitao Wang.
Improved Algorithms for Path Partition and Related Problems.
Operations Research Letters (ORL), Vol. 39(6), pp, 2011.
437440.
 Danny Z. Chen and Haitao Wang.
Processing an Offline InsertionQuery Sequence with Applications.
International Journal of Foundations of Computer Science
(IJFCS) , Vol. 22(6), pages 14391456, 2011.

Haitao Wang, Amitabh Chaudhary, and Danny Z. Chen.
Online Rectangle Filling.
Theoretical Computer Science (TCS), Vol. 412(39), pages
52475275, 2011.
 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 334360, 2011.
 Haitao Wang, Amitabh Chaudhary, and Danny Z. Chen.
New Algorithms for Online Rectangle Filling with
kLookahead.
Journal of Combinatorial Optimization ,
Vol. 21(1), pages 6782, 2011.

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 2731, 2006.
PeerReviewed Conference Papers

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

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

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 533544. [arXiv].
[slides].

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 557568. [arXiv].
[slides].

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

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:160:16. [arXiv].
[slides].

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

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

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:152:12. [arXiv].
[slides].

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

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:177:17. [arXiv].
[slides].

Sang Won Bae, Matias Korman, Joseph S.B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, and Haitao Wang.
Computing the L_{1} 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:114:14. [arXiv].

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 188198.

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 182190.

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

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 606618.
[slides].

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 2839. [arXiv].
[slides].

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 559571. [arXiv].

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

Haitao Wang and Jingru Zhang.
LineConstrained kMedian, kMeans, and kCenter Problems in the Plane.
Proceedings of the 25th International Symposium on Algorithms and Computation (ISAAC), Jeonju, Korea, December 2014, pages 314.

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 326337. [arXiv].
[slides].

Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, Hui Li and Fenghua Li.
Treebased MultiDimensional 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.

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].

Haitao Wang and Jingru Zhang.
OneDimensional kCenter on Uncertain Data. Proceedings of the 20th Annual International Computing and Combinatorics Conference (COCOON), Atlanta, Georgia, USA, August 2014, pages 104115.

Minghui Jiang and Haitao Wang.
Shortest ColorSpanning Intervals. Proceedings of the 20th Annual International Computing and Combinatorics Conference (COCOON), Atlanta, Georgia, USA, August 2014, pages 288299.

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 240251.

Danny Z. Chen, Rajasekhar Inkulu, and Haitao Wang.
TwoPoint L_{1} Shortest Path Queries in the Plane. Proceedings of the 30th Anuual Symposium on Computational Geometry (SoCG), Kyoto, Japan, June 2014, pages 406415. [arXiv].
[slides].

Boyang Wang, Yantian Hou, Ming Li, Haitao Wang, and Hui Li.
Maple: Scalable MultiDimensional Range Search over Encrypted Cloud Data with Treebased Index. Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security (ASIACCS), Kyoto, Japan, June 2014, pages 111122.

Sang Won Bae, Matias Korman, Yoshio Okamoto, and Haitao Wang.
Computing the L_{1} 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 120131. [arXiv].

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

Haitao Wang.
AggregateMax Nearest Neighbor Searching in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG), Waterloo, Ontario, Canada, August 2013, pages 7176.
[arXiv] (with extended results to topk queries for the L1 case).
[slides].

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 244255.
[slides].

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 369378.
[arXiv].
[slides].

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 110122. [arXiv].

Danny Z. Chen and Haitao Wang.
L_{1} 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 293304.
[arXiv].
[slides].

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 609618.
[arXiv] (with improved results).
[slides].

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 332341. [arXiv].
[slides].

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 373380.

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 218229.
[slides].

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 177188. [arXiv].
[slides].

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

Danny Z. Chen and Haitao Wang.
Efficient Algorithms for the Weighted kCenter 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 584593.
[arXiv] (with improved results).
[slides].

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 604613.
[arXiv].
[slides].

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 594603.
[slides].

Danny Z. Chen and Haitao Wang.
A Nearly Optimal Algorithm for Finding L_{1}
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 481492.
[arXiv].
[slides].

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 366378.

Danny Z. Chen and Haitao Wang.
New Algorithms for 1D 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 207218.
[slides].

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

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 363376.
[slides].

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 200211.
[slides].

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 224233.
[slides].

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 234243.
[slides].

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 740749.
[slides].

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

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

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 274287.

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 220231.

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 660664.
Other Online Manuscripts
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).