Haitao Wang
According to our database^{1},
Haitao Wang
authored at least 98 papers
between 2005 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org

at cs.usu.edu
On csauthors.net:
Bibliography
2020
Proceedings of the 36th International Symposium on Computational Geometry, 2020
Proceedings of the 36th International Symposium on Computational Geometry, 2020
2019
Theor. Comput. Sci., 2019
Theor. Comput. Sci., 2019
J. Comput. Geom., 2019
Int. J. Comput. Geom. Appl., 2019
Discret. Comput. Geom., 2019
Discret. Comput. Geom., 2019
A DivideandConquer Algorithm for TwoPoint L<sub>1</sub> Shortest Path Queries in Polygonal Domains.
CoRR, 2019
Algorithmica, 2019
An Optimal Algorithm for MinimumLink Rectilinear Paths in Triangulated Rectilinear Domains.
Algorithmica, 2019
Algorithmica, 2019
Proceedings of the Algorithms and Data Structures  16th International Symposium, 2019
Proceedings of the Algorithms and Data Structures  16th International Symposium, 2019
Proceedings of the 35th International Symposium on Computational Geometry, 2019
A DivideandConquer Algorithm for TwoPoint L_1 Shortest Path Queries in Polygonal Domains.
Proceedings of the 35th International Symposium on Computational Geometry, 2019
2018
Theor. Comput. Sci., 2018
J. Comput. Geom., 2018
Int. J. Comput. Geom. Appl., 2018
Discret. Appl. Math., 2018
CoRR, 2018
Comput. Geom., 2018
Proceedings of the 34th International Symposium on Computational Geometry, 2018
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018
2017
Int. J. Comput. Geom. Appl., 2017
Discret. Comput. Geom., 2017
CoRR, 2017
CoRR, 2017
Algorithmica, 2017
Algorithmica, 2017
Algorithmica, 2017
Proceedings of the 20th International Conference on Database Theory, 2017
2016
IEEE Trans. Inf. Forensics Secur., 2016
Theor. Comput. Sci., 2016
Theor. Comput. Sci., 2016
Oper. Res. Lett., 2016
J. Comput. Geom., 2016
Int. J. Comput. Geom. Appl., 2016
Algorithmica, 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
ACM Trans. Algorithms, 2015
Oper. Res. Lett., 2015
A new algorithm for computing visibility graphs of polygonal obstacles in the plane.
J. Comput. Geom., 2015
AggregateMAX Top<i>k</i> Nearest Neighbor Searching in the <i>L</i><sub>1</sub> Plane.
Int. J. Comput. Geom. Appl., 2015
Discret. Appl. Math., 2015
Comput. Geom., 2015
Comput. Geom., 2015
Comput. Geom., 2015
Algorithmica, 2015
Proceedings of the Algorithms and Computation  26th International Symposium, 2015
Proceedings of the Computing and Combinatorics  21st International Conference, 2015
Proceedings of the 2015 IEEE Conference on Communications and Network Security, 2015
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2014
Eur. J. Oper. Res., 2014
CoRR, 2014
CoRR, 2014
Algorithmica, 2014
Algorithmica, 2014
TreeBased Multidimensional Range Search on Encrypted Data with Enhanced Privacy.
Proceedings of the International Conference on Security and Privacy in Communication Networks, 2014
Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.
Proceedings of the LATIN 2014: Theoretical Informatics  11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014
Maple: scalable multidimensional range search over encrypted cloud data with treebased index.
Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
SIAM J. Comput., 2013
J. Comb. Optim., 2013
Inf. Process. Lett., 2013
Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain.
Discret. Comput. Geom., 2013
CoRR, 2013
Computing the L<sub>1</sub> Geodesic Diameter and Center of a Simple Polygon in Linear Time.
CoRR, 2013
Algorithmica, 2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013
2012
Int. J. Comput. Geom. Appl., 2012
Fitting a Step Function to a Point Set with Outliers Based on Simplicial thickness Data Structures.
Int. J. Comput. Geom. Appl., 2012
CoRR, 2012
CoRR, 2012
An improved algorithm for reconstructing a simple polygon from its visibility angles.
Comput. Geom., 2012
Proceedings of the Medical Image Computing and ComputerAssisted Intervention  MICCAI 2012, 2012
2011
Theor. Comput. Sci., 2011
Oper. Res. Lett., 2011
J. Comb. Optim., 2011
Int. J. Found. Comput. Sci., 2011
Discret. Comput. Geom., 2011
Proceedings of the Algorithms and Data Structures  12th International Symposium, 2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles.
Proceedings of the Algorithms and Computation  22nd International Symposium, 2011
Proceedings of the Algorithms and Computation  22nd International Symposium, 2011
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane.
Proceedings of the Algorithms  ESA 2011, 2011
2010
Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures.
Proceedings of the Combinatorial Algorithms  21st International Workshop, 2010
2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
2006
J. Comput. Sci. Technol., 2006
Proceedings of the Algorithms, 2006
2005
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005