Haitao Wang

According to our database1, Haitao Wang authored at least 98 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

On the Planar Two-Center Problem and Circular Hulls.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Algorithms for covering multiple barriers.
Theor. Comput. Sci., 2019

<i>L</i><sub>1</sub> shortest path queries in simple polygons.
Theor. Comput. Sci., 2019

Separating overlapped intervals on a line.
J. Comput. Geom., 2019

On Top-k Weighted Sum Aggregate Nearest and Farthest Neighbors in the L1 Plane.
Int. J. Comput. Geom. Appl., 2019

Bicriteria Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane.
Discret. Comput. Geom., 2019

Quickest Visibility Queries in Polygonal Domains.
Discret. Comput. Geom., 2019

A Divide-and-Conquer Algorithm for Two-Point L<sub>1</sub> Shortest Path Queries in Polygonal Domains.
CoRR, 2019

Covering Uncertain Points in a Tree.
Algorithmica, 2019

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains.
Algorithmica, 2019

Computing L<sub>1</sub> Shortest Paths Among Polygonal Obstacles in the Plane.
Algorithmica, 2019

A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

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, 2019

2018
Near-linear time approximation schemes for geometric maximum coverage.
Theor. Comput. Sci., 2018

On the geodesic centers of polygonal domains.
J. Comput. Geom., 2018

Computing the Rectilinear Center of Uncertain Points in the Plane.
Int. J. Comput. Geom. Appl., 2018

Dispersing points on intervals.
Discret. Appl. Math., 2018

L<sub>1</sub> Shortest Path Queries in Simple Polygons.
CoRR, 2018

An improved algorithm for diameter-optimally augmenting paths in a metric space.
Comput. Geom., 2018

An O(n log n)-Time Algorithm for the k-Center Problem in Trees.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

On the Coverage of Points in the Plane by Disks Centered at a Line.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Minimizing the Maximum Moving Cost of Interval Coverage.
Int. J. Comput. Geom. Appl., 2017

Computing the L<sub>1</sub> Geodesic Diameter and Center of a Polygonal Domain.
Discret. Comput. Geom., 2017

Linear Time Approximation Schemes for Geometric Maximum Coverage.
CoRR, 2017

Improved Algorithms For Structured Sparse Recovery.
CoRR, 2017

Computing the Center of Uncertain Points on Tree Networks.
Algorithmica, 2017

Computing the Visibility Polygon of an Island in a Polygonal Domain.
Algorithmica, 2017

Minimizing the Aggregate Movements for Interval Coverage.
Algorithmica, 2017

k-Regret Minimizing Set: Efficient Algorithms and Hardness.
Proceedings of the 20th International Conference on Database Theory, 2017

2016
Geometric Range Search on Encrypted Spatial Data.
IEEE Trans. Inf. Forensics Secur., 2016

Range queries on uncertain data.
Theor. Comput. Sci., 2016

Shortest color-spanning intervals.
Theor. Comput. Sci., 2016

A note on computing the center of uncertain data on the real line.
Oper. Res. Lett., 2016

Two-point L1 shortest path queries in the plane.
J. Comput. Geom., 2016

Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane.
Int. J. Comput. Geom. Appl., 2016

Matroid and Knapsack Center Problems.
Algorithmica, 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

epsilon-Kernel Coresets for Stochastic Points.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
One-dimensional k-center on uncertain data.
Theor. Comput. Sci., 2015

Quell.
Theor. Comput. Sci., 2015

Efficient algorithms for the one-dimensional k-center problem.
Theor. Comput. Sci., 2015

Computing Shortest Paths among Curved Obstacles in the Plane.
ACM Trans. Algorithms, 2015

Balanced splitting on weighted intervals.
Oper. Res. Lett., 2015

A new algorithm for computing visibility graphs of polygonal obstacles in the plane.
J. Comput. Geom., 2015

Aggregate-MAX Top-<i>k</i> Nearest Neighbor Searching in the <i>L</i><sub>1</sub> Plane.
Int. J. Comput. Geom. Appl., 2015

Computing maximum non-crossing matching in convex bipartite graphs.
Discret. Appl. Math., 2015

Weak visibility queries of line segments in simple polygons.
Comput. Geom., 2015

Visibility and ray shooting queries in polygonal domains.
Comput. Geom., 2015

Computing the L1 geodesic diameter and center of a simple polygon in linear time.
Comput. Geom., 2015

Optimal Point Movement for Covering Circular Regions.
Algorithmica, 2015

Minimizing the Maximum Moving Cost of Interval Coverage.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Linear Time Approximation Schemes for Geometric Maximum Coverage.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

Circular range search on encrypted spatial data.
Proceedings of the 2015 IEEE Conference on Communications and Network Security, 2015

Algorithms for Minimizing the Movements of Spreading Points in Linear Domains.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Minmax regret 1-facility location on uncertain path networks.
Eur. J. Oper. Res., 2014

$ε$-Kernel Coresets for Stochastic Points.
CoRR, 2014

Two-Point L<sub>1</sub> Shortest Path Queries in the Plane.
CoRR, 2014

Outlier Respecting Points Approximation.
Algorithmica, 2014

New Algorithms for Facility Location Problems on the Real Line.
Algorithmica, 2014

Tree-Based Multi-dimensional 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 multi-dimensional range search over encrypted cloud data with tree-based index.
Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, 2014

The τ-Skyline for Uncertain Data.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Computing Shortest Paths amid Convex Pseudodisks.
SIAM J. Comput., 2013

The topology aware file distribution problem.
J. Comb. Optim., 2013

A note on searching line arrangements and applications.
Inf. Process. Lett., 2013

Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain.
Discret. Comput. Geom., 2013

Efficient Algorithms for One-Dimensional k-Center Problems
CoRR, 2013

Computing the L<sub>1</sub> Geodesic Diameter and Center of a Simple Polygon in Linear Time.
CoRR, 2013

Approximating Points by a Piecewise Linear Function.
Algorithmica, 2013

L_1 Shortest Path Queries among Polygonal Obstacles in the Plane.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Aggregate-Max Nearest Neighbor Searching in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Locating an obnoxious Line among Planar Objects.
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

The L1 Nearest Neighbor Searching with Uncertain Queries
CoRR, 2012

Computing L1 Shortest Paths among Polygonal Obstacles in the Plane
CoRR, 2012

An improved algorithm for reconstructing a simple polygon from its visibility angles.
Comput. Geom., 2012

Detecting and Tracking Motion of Myxococcus xanthus Bacteria in Swarms.
Proceedings of the Medical Image Computing and Computer-Assisted Intervention - MICCAI 2012, 2012

2011
Online rectangle filling.
Theor. Comput. Sci., 2011

Improved algorithms for path partition and related problems.
Oper. Res. Lett., 2011

New algorithms for online rectangle filling with <i>k</i>-lookahead.
J. Comb. Optim., 2011

Processing an Offline Insertion-Query Sequence with Applications.
Int. J. Found. Comput. Sci., 2011

Representing a Functional Curve by Curves with Fewer Peaks.
Discret. Comput. Geom., 2011

New Algorithms for 1-D Facility Location and Path Equipartition Problems.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Computing Shortest Paths amid Pseudodisks.
Proceedings of the Twenty-Second Annual ACM-SIAM 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

Efficient Algorithms for the Weighted k-Center Problem on a Real Line.
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
Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Approximating Points by a Piecewise Linear Function: I.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
New Algorithms for Online Rectangle Filling with k-Lookahead.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2006
An Improved Algorithm for Finding the Closest Pair of Points.
J. Comput. Sci. Technol., 2006

Traversing the Machining Graph.
Proceedings of the Algorithms, 2006

2005
Approximating Spanning Trees with Inner Nodes Cost.
Proceedings of the Sixth International Conference on Parallel and Distributed Computing, 2005


  Loading...