The following pages link to Haitao Wang (Q297368):
Displaying 50 items.
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- The topology aware file distribution problem (Q386444) (← links)
- Improved algorithms for path partition and related problems (Q408433) (← links)
- An improved algorithm for reconstructing a simple polygon from its visibility angles (Q419377) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Quell (Q500997) (← links)
- Computing the visibility polygon of an island in a polygonal domain (Q513290) (← links)
- New algorithms for facility location problems on the real line (Q517797) (← links)
- Outlier respecting points approximation (Q517798) (← links)
- Minimizing the aggregate movements for interval coverage (Q527411) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- New algorithms for online rectangle filling with \(k\)-lookahead (Q626457) (← links)
- Representing a functional curve by curves with fewer peaks (Q635753) (← links)
- Online rectangle filling (Q719266) (← links)
- Shortest color-spanning intervals (Q896153) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Dispersing points on intervals (Q1706121) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- Balanced splitting on weighted intervals (Q1785388) (← links)
- A note on computing the center of uncertain data on the real line (Q1790197) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- A note on searching line arrangements and applications (Q2444761) (← links)
- An improved algorithm for finding the closest pair of points (Q2508376) (← links)
- Visibility and Ray Shooting Queries in Polygonal Domains (Q2842161) (← links)
- Computing the Visibility Polygon of an Island in a Polygonal Domain (Q2843250) (← links)
- Computing Shortest Paths amid Convex Pseudodisks (Q2848214) (← links)
- Minmax Regret 1-Facility Location on Uncertain Path Networks (Q2872137) (← links)
- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs (Q2897986) (← links)
- One-Dimensional k-Center on Uncertain Data (Q2920449) (← links)
- Shortest Color-Spanning Intervals (Q2920467) (← links)
- Line-Constrained $$k$$ -Median, $$k$$ -Means, and $$k$$ -Center Problems in the Plane (Q2942608) (← links)
- (Q2957892) (← links)
- A new algorithm for computing visibility graphs of polygonal obstacles in the plane (Q2970428) (← links)
- Two-point L1 shortest path queries in the plane (Q2970460) (← links)
- Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane (Q2988724) (← links)
