◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Haitao Wang

49 papers hereh-index 181.5k citations126 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author17
  • first author10
  • middle author2
  • last author19

Across the 48 of 49 papers where every author was matched, so the position is known.

fields
  • cs.CG41
  • cs.DS7
  • cs.IT1
same name
  • Haitao Wang — 13 papers, h 3
  • Haitao Wang — 12 papers, h 5
  • Haitao Wang — 11 papers, h 6
  • Haitao Wang — 11 papers, h 3
  • Haitao Wang — 9 papers, h 1
  • Haitao Wang — 6 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedLinear Time Approximation Schemes for Geometric Maximum Coverage

15 citations · 74 across the 39 of their papers we have counts for

collaborators
Showing 2015Show all

4 papers · 1 filter

cs.CG2015★ 1 cited

Computing the Rectilinear Center of Uncertain Points in the Plane

Haitao Wang, Jingru Zhang

In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set P of n (weighted) uncertain points in the pl…

cs.CG2015★ 2 cited

Linear Time Approximation Schemes for Geometric Maximum Coverage

Jian Li, Haitao Wang, Bowei Zhang +1

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b re…

cs.CG2015★ 2 cited

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains

Joseph S. B. Mitchell, Valentin Polishchuk, Mikko Sysikaski +1

We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parall…

cs.CG2015

Range Queries on Uncertain Data

Jian Li, Haitao Wang

Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.