Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Wang, Haitao"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New algorithms for facility location problems on the real line
Danny Z. Chen
,
Haitao Wang
Algorithmica
69
(2), 2014, pp. 370-383
Outlier respecting points approximation
Danny Z. Chen
,
Haitao Wang
Algorithmica
69
(2), 2014, pp. 410-430
Shortest color-spanning intervals
Minghui Jiang
,
Haitao Wang
Lecture Notes in Computer Science
8591
, 2014, pp. 288-299
Range queries on uncertain data
Jian Li
,
Haitao Wang
Lecture Notes in Computer Science
8889
, 2014, pp. 326-337
One-dimensional
k
-center on uncertain data
Haitao Wang
,
Jingru Zhang
Lecture Notes in Computer Science
8591
, 2014, pp. 104-115
Line-constrained
k
-median,
k
-means, and
k
-center problems in the plane
Haitao Wang
,
Jingru Zhang
Lecture Notes in Computer Science
8889
, 2014, pp. 3-14
Computing shortest paths amid convex pseudodisks
Danny Z. Chen
,
John Hershberger
,
Haitao Wang
SIAM Journal on Computing
42
(3), 2013, pp. 1158-1184
Matroid and knapsack center problems
Danny Z. Chen
,
Jian Li
,
Hongyu Liang
,
Haitao Wang
Lecture Notes in Computer Science
7801
, 2013, pp. 110-122
Approximating points by a piecewise linear function
Danny Z. Chen
,
Haitao Wang
Algorithmica
66
(3), 2013, pp. 682-713
A note on searching line arrangements and applications
Danny Z. Chen
,
Haitao Wang
Information Processing Letters
113
(14-16), 2013, pp. 518-521
Visibility and ray shooting queries in polygonal domains
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
8037
, 2013, pp. 244-255
Computing shortest paths among curved obstacles in the plane
Danny Z. Chen
,
Haitao Wang
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 369-378
L_1
shortest path queries among polygonal obstacles in the plane
Danny Z. Chen
,
Haitao Wang
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 293-304
Minmax regret 1-facility location on uncertain path networks
Haitao Wang
Lecture Notes in Computer Science
8283
, 2013, pp. 733-743
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
Danny Z. Chen
,
Yan Gu
,
Jian Li
,
Haitao Wang
Lecture Notes in Computer Science
7357
, 2012, pp. 177-188
Optimal point movement for covering circular regions
Danny Z. Chen
,
Xuehou Tan
,
Haitao Wang
,
Gangshan Wu
Lecture Notes in Computer Science
7676
, 2012, pp. 332-341
Computing the visibility polygon of an island in a polygonal domain
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
7391
, 2012, pp. 218-229
Weak visibility queries of line segments in simple polygons
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
7676
, 2012, pp. 609-618
Processing an offline insertion-query sequence with applications
Danny Z. Chen
,
Haitao Wang
International Journal of Foundations of Computer Science
22
(6), 2011, pp. 1439-1456
New algorithms for 1-D facility location and path equipartition problems
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
6844
, 2011, pp. 207-218
A nearly optimal algorithm for finding
L_1
shortest paths among polygonal obstacles in the plane
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
6942
, 2011, pp. 481-492
Efficient algorithms for the weighted
k
-center problem on a real line
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
7074
, 2011, pp. 584-593
Outlier respecting points approximation
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
7074
, 2011, pp. 594-603
An improved algorithm for reconstructing a simple polygon from the visibility angles
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
7074
, 2011, pp. 604-613
The topology aware file distribution problem
Shawn T. O'Neil
,
Amitabh Chaudhary
,
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
6842
, 2011, pp. 366-378
Seiten 1
2
>