@book{bcko-cgaa-08,
keyent = {bcko-cgaa-08},
author = {M. de Berg and O. Cheong and {M. van} Kreveld and
M. H. Overmars},
title = {Computational Geometry: Algorithms and Applications},
publisher = "Springer-Verlag",
address = {Santa Clara, CA, USA},
year = 2008,
edition = {3rd},
url = {http://www.cs.uu.nl/geobook/},
doi = {10.1007/978-3-540-77974-2}
}
@article{ahy-escmp-13,
author = {P. Agarwal and S. {Har-Peled} and H. Yu},
title = {Embeddings of surfaces, curves, and moving points in
{Euclidean} space},
volume = 42,
number = 2,
year = 2013,
pages = {442--458},
journal = SICOMP,
url = {http://sarielhp.org/papers/06/embed/},
doi = {10.1137/110830046}
}
@article{flm-msnmt-08,
author = {S. P. Fekete and M. E. L{\"u}bbecke and H. Meijer},
title = {Minimizing the Stabbing Number of Matchings, Trees,
and Triangulations},
journal = DCG,
volume = 40,
number = 4,
year = 2008,
pages = {595--621}
}
@inproceedings{ahrssw-tpomp-02,
author = {P. K. Agarwal and T. Hagerup and R. Ray and
M. Sharir and M. H. M. Smid and E. Welzl},
title = {Translating a Planar Object to Maximize Point
Containment},
booktitle = ESA_2002,
year = 2002,
pages = {42--53}
}
@article{kpw-atben-92,
author = "J. Koml{\'o}s and J. Pach and G. Woeginger",
title = "Almost tight bounds for {\(\varepsilon\)}-nets",
journal = DCG,
volume = 7,
year = 1992,
pages = "163--173"
}
@inproceedings{g-seakp-05,
author = {N. Garg},
title = {Saving an epsilon: a {$2$}-approximation for the
$k$-{MST} problem in graphs},
booktitle = STOC_2005,
year = 2005,
pages = {396--402}
}
@article{g-aslpr-95,
author = "M. Goldwasser",
title = "A survey of linear programming in randomized
subexponential time",
journal = "SIGACT News",
volume = 26,
number = 2,
year = 1995,
pages = "96--104"
}
@article{c-lvali-95,
author = "K. L. Clarkson",
title = {{Las} {Vegas} algorithms for linear and integer
programming},
journal = JACM,
volume = 42,
year = 1995,
pages = "488--499",
doi = {10.1145/201019.201036},
keywords = "convex, optimization, {$d$}-dimensional, random
sampling"
}
@inproceedings{k-srsa-92,
author = "G. Kalai",
title = "A subexponential randomized simplex algorithm",
booktitle = STOC_1992,
year = 1992,
pages = "475--482"
}
@article{s-sdlpc-91,
author = "R. Seidel",
title = "Small-dimensional linear programming and convex
hulls made easy",
journal = DCG,
volume = 6,
year = 1991,
pages = "423--434",
doi = {10.1007/BF02574699},
}
@inproceedings{c-fdlpq-96,
author = "T. M. Chan",
title = "Fixed-Dimensional Linear Programming Queries Made
Easy",
booktitle = SOCG_1996,
acceptrate = SOCG_1996_AR,
year = 1996,
pages = "284--290"
}
@article{m-lpltw-84,
author = "N. Megiddo",
title = "Linear programming in linear time when the dimension
is fixed",
journal = JACM,
volume = 31,
year = 1984,
pages = "114--127",
doi = {10.1145/2422.322418},
keywords = "design of algorithms, linear programming, worst-case
analysis, prune-and-search"
}
@inproceedings{bch-cmfpud-06,
author = {Mark de Berg and Sergio Cabello and Sariel
Har{-}Peled},
editor = {Thomas Erlebach and Christos Kaklamanis},
title = {Covering Many or Few Points with Unit Disks},
booktitle = WAOA_2006,
acceptrate = WAOA_2006_AR,
series = LNCS,
volume = {4368},
pages = {55--68},
publisher = {Springer},
year = {2006},
doi = {10.1007/11970125_5}
}
@inproceedings{hrz-mmcan-07,
author = {S. {Har-Peled} and D. Roth and D. Zimak},
title = {Maximum Margin Coresets for Active and Noise
Tolerant Learning.},
booktitle = IJCAI_2007,
acceptrate = IJCAI_2007_AR,
year = 2007,
pages = {836--841}
}
@inproceedings{ahs-ahrcr-07,
author = {B. Aronov and S. {Har-Peled} and M. Sharir},
title = {On approximate halfspace range counting and relative
epsilon-approximations},
booktitle = SOCG_2007,
acceptrate = SOCG_2007_AR,
year = 2007,
pages = {327--336}
}
@inproceedings{ac-arcd-07-conf,
author = {P. Afshani and T. M. Chan},
title = {On approximate range counting and depth},
booktitle = SOCG_2007,
year = 2007,
pages = {337--343}
}
@article{ac-arcd-09,
author = {P. Afshani and T. M. Chan},
title = {On Approximate Range Counting and Depth},
journal = DCG,
volume = 42,
number = 1,
year = 2009,
pages = {3--21}
}
@Article{e-nsp-97,
author = {G.~Elekes},
title = {On the number of sums and products},
journal = {ACTA Arithmetica},
year = 1997,
pages = {365--367},
annote = {{350}}
}
@article{s-cnhep-97,
author = "L. A. Sz{\'e}kely",
title = "Crossing numbers and hard {E}rd{\H o}s problems in
discrete geometry",
journal = "Combinatorics, Probability and Computing",
volume = 6,
year = 1997,
pages = "353--358"
}
@Book{bmp-rpdg-05,
author = {P. Brass and W. Moser and J. Pach},
title = {Research Problems in Discrete Geometry},
publisher = {Springer},
year = 2005
}
@article{l-nlbtv-84,
author = "F. T. Leighton",
title = "New lower bound techniques for {VLSI}",
journal = "Math. Syst. Theory",
volume = 17,
year = 1984,
pages = "47--70"
}
@article{acns-cfs-82,
author = "M. Ajtai and V. Chv{\'a}tal and M. Newborn and
E. Szemer{\'e}di",
title = "Crossing-free subgraphs",
journal = "Ann. Discrete Math.",
volume = 12,
year = 1982,
pages = "9--12"
}
@article{w-mksfs-86,
author = "E. Welzl",
title = "More on {$k$}-sets of finite sets in the plane",
journal = DCG,
volume = 1,
year = 1986,
pages = "95--100",
keywords = "combinatorial geometry"
}
@article{gp-nkssn-84,
author = "J. E. Goodman and R. Pollack",
title = "On the number of {$k$}-subsets of a set of $n$ points
in the plane",
journal = "J. Combin. Theory Ser. A",
volume = 36,
year = 1984,
pages = "101--104"
}
@article{ag-nssfs-86,
author = "N. Alon and E. Gy{\H o}ri",
title = "The number of small semispaces of a finite set of
points in the plane",
journal = "J. Combin. Theory Ser. A",
volume = 41,
year = 1986,
pages = "154--157"
}
@inproceedings{c-cfaak-08,
author = {K. Chen},
title = {A constant factor approximation algorithm for
{$k$}-median clustering with outliers},
booktitle = SODA_2008,
year = 2008,
pages = {826--835},
numpages = 10
}
@Unpublished{c-cfaak-07-old,
author = {K. Chen},
title = {A constant factor approximation algorithm for
{$k$}-median with outliers},
note = {manuscript},
year = 2007
}
@article{ABP90,
keyent = {ABP90},
author = {Alevizos and J. D. Boissonnat and F. P. Preparata},
title = {An optimal algorithm for the boundary of a cell in a
union of rays},
journal = {Algorithmica},
year = 1990,
volume = 5,
pages = {573--590}
}
@article{AEGS92,
keyent = {AEGS92},
author = {B. Aronov and H. Edelsbrunner and L. J. Guibas and
M. Sharir},
title = {The number of edges of many faces in a line segment
arrangement},
journal = {Combinatorica},
year = 1992,
volume = 12,
pages = {261--274}
}
@article{AHKMN94,
keyent = {AHKMN94},
author = {E. M. Arkin and D. Halperin and K. Kedem and
J. S.B. Mitchell and N. Naor},
title = {Arrangements of segments that share endpoints:
Single face results},
journal = DCG,
year = 1995,
volume = 13,
pages = "257--270"
}
@unpublished{AS94,
keyent = {AS94},
author = {B. Aronov and M. Sharir},
title = {The common exterior of convex polygons in the plane},
year = 1996,
note = {to appear in {\em CGTA}}
}
@article{ASS89,
keyent = {ASS89},
author = {P. K. Agarwal and M. Sharir and P. W. Shor},
title = {Sharp upper and lower bounds for the length of
general {Davenport-Schinzel} sequences},
journal = {J. Combin. Theory. Ser A.},
year = 1989,
volume = 52,
pages = {228--274}
}
@Article{AloBop87,
keyent = {AloBop87},
author = "N. Alon and R. B. Boppana",
title = "The Monotone Circuit Complexity of Boolean
Functions",
journal = "Combinatorica",
volume = 7,
year = 1987,
pages = "1--22"
}
@article{Alon85,
keyent = {Alon85},
author = {N. Alon},
title = {Hypergraphs with high chromatic numbers},
journal = {Graphs and Combinatorics},
year = 1985,
volume = 1,
pages = {387--389}
}
@article{And63,
keyent = {And63},
author = "G. E. Andrews",
title = {A lower bound for the volume of strictly convex
bodies with many boundary lattice points},
journal = "Trans. Amer. Math. Soc.",
volume = 106,
year = 1963,
pages = "270--279"
}
@article{Atall85,
keyent = {Atall85},
author = "M. J. Atallah",
title = "Some dynamic computational geometry problems",
journal = "Comput. Math. Appl.",
volume = 11,
year = 1985,
pages = "1171--1181"
}
@inproceedings{BB91,
keyent = {BB91},
author = "A. Balog and I. B{\'a}r{\'a}ny",
title = {On the convex hull of the integer points in a disc},
booktitle = SOCG_1991,
year = 1991,
pages = "162--165"
}
@Unpublished{BGR96,
keyent = {BGR96},
author = "J. Basch and L. J. Guibas and G. D. Ramkumar",
title = "Reporting red-blue intersections between connected
sets of line segments",
note = "to appear in Proc. European Symposium on Algorithm",
year = 1996
}
@Article{BV92,
keyent = {BV92},
author = "I. B{\'a}r{\'a}ny and A. M. Vershik",
title = "On the number of convex lattice polytopes",
journal = "Geometry and Functional Analysis",
year = 1992,
volume = 2,
pages = "381--393"
}
@article{cegsw-ccbac-90,
keyent = {CEGSW90},
author = {K. L. Clarkson and H. Edelsbrunner and L. J. Guibas
and M. Sharir and E. Welzl},
title = {Combinatorial complexity bounds for arrangements of
curves and spheres},
journal = DCG,
year = 1990,
volume = 5,
pages = {99--160}
}
@inproceedings{CH90,
keyent = {CH90},
author = "J. Chen and Y. Han",
title = "Shortest paths on a polyhedron",
booktitle = SOCG_1990,
year = 1990,
pages = "360--369",
annote = 60
}
@article{CS89-bogi,
keyent = {CS89-bogi},
author = {K. L. Clarkson and P. W. Shor},
title = {Applications of random sampling in computational
geometry {II}},
journal = DCG,
year = 1989,
volume = 4,
pages = {387--421}
}
@InProceedings{CannyR87,
keyent = {CannyR87},
title = {New Lower Bound Techniques for Robot Motion Planning
Problems},
author = {J. F. Canny and J. Reif},
pages = {49--60},
crossref = {FOCS28},
source = {http://theory.lcs.mit.edu/ dmjones/FOCS/focs.bib}
}
@proceedings{DBLP:conf/esa/2001,
keyent = {DBLP:conf/esa/2001},
editor = {F. Meyer auf der Heide},
title = {Algorithms - ESA 2001, 9th Annual European
Symposium, Aarhus, Denmark, August 28-31, 2001,
Proceedings},
booktitle = {ESA},
publisher = {Springer},
series = LNCS,
volume = 2161,
year = 2001,
isbn = {3-540-42493-8}
}
@inproceedings{DK90,
keyent = {DK90},
author = "D. P. Dobkin and D. G. Kirkpatrick",
title = "Determining the separation of preprocessed polyhedra
-- a unified approach",
booktitle = "Proc. 17th Internat. Colloq. Automata
Lang. Program.",
series = LNCS,
volume = 443,
publisher = "Springer-Verlag",
year = 1990,
pages = "400--413"
}
@article{DS65,
keyent = {DS65},
author = {H. Davenport and A. Schinzel},
title = {A combinatorial problem connected with differential
equations},
journal = {Amer. J. Math.},
year = 1965,
volume = 87,
pages = {684--695}
}
@Book{Dav83,
keyent = {Dav83},
author = {H. Davenport},
title = {The Higher Arithmetic: Introduction to the Theory of
Numbers},
publisher = {Oxford University Press},
year = 1983
}
@article{EG94,
keyent = {EG94},
author = "A. Efrat and C. Gotsman",
title = {Subpixel image registration using circular
fiducials},
journal = IJCGA,
year = 1994,
pages = "403--422",
Volume = 4,
Number = 4
}
@article{EGPPSS92,
keyent = {EGPPSS92},
author = {H. Edelsbrunner and L. J. Guibas and J. Pach and
R. Pollack and R. Seidel and M. Sharir},
title = {Arrangements of curves in the plane: Topology,
combinatorics, and algorithms},
journal = TCS,
year = 1992,
volume = 92,
pages = {319--336}
}
@article{EGS90,
keyent = {EGS90},
author = {H. Edelsbrunner and L. J. Guibas and M. Sharir},
title = {{The complexity and construction of many faces in
arrangements of lines and of segments}},
journal = DCG,
year = 1990,
volume = 5,
pages = {161--196}
}
@article{ES90,
keyent = {ES90},
author = {H. Edelsbrunner and M. Sharir},
title = {{The maximum number of ways to stab {$n$} disjoint
convex sets in the plane is {$2n-2$}}},
journal = DCG,
year = 1990,
volume = 5,
pages = {35--42}
}
@Proceedings{FOCS28,
keyent = {FOCS28},
title = {28th Annual Symposium on Foundations of Computer
Science},
booktitle = {28th Annual Symposium on Foundations of Computer
Science},
month = {12--14 } # oct,
year = 1987,
organization = {IEEE},
crossrefonly = 1,
source = {http://theory.lcs.mit.edu/ dmjones/FOCS/focs.bib}
}
@inproceedings{GRS83,
keyent = {GRS83},
author = {L. J. Guibas and L. Ramshaw and J. Stolfi.},
title = {{A kinetic framework for computational geometry}},
booktitle = FOCS_1983,
year = 1983,
pages = {100--111}
}
@article{GSS89,
keyent = {GSS89},
author = {L. J. Guibas and M. Sharir and S. Sifrony.},
title = {{On the general motion-planning problem with two
degrees of freedom}},
journal = DCG,
year = 1989,
volume = 4,
pages = {491--521}
}
@inproceedings{GY86,
keyent = {GY86},
author = "D. H. Greene and F. F. Yao",
title = "Finite-resolution computational geometry",
booktitle = FOCS_1986,
year = 1986,
pages = "143--152"
}
@inproceedings{HCAHS95,
keyent = {HCAHS95},
author = {S. {Har-Peled} and T. M. Chan and B. Aronov and
D. Halperin and J. Snoeyink},
title = {{The complexity of a single face of a Minkowski
Sum}},
year = 1995,
booktitle = CCCG_1995,
address = "Universit{\'e} Laval, Quebec",
pages = "91--96",
cvsection = "unrefconf"
}
@article{hkk-vdrms-92,
keyent = {HKK92j},
author = "D. P. Huttenlocher and K. Kedem and J. M. Kleinberg",
title = {{Voronoi} diagrams of rigidly moving sets of points},
journal = IPL,
volume = 43,
year = 1992,
pages = "217--223"
}
@article{HS86,
keyent = {HS86},
author = {S. Hart and M. Sharir},
title = {Nonlinearity of {Davenport-Schinzel} sequences and of
generalized path compression schemes},
journal = {Combinatorica},
year = 1986,
volume = 6,
pages = {151--177}
}
@InProceedings{hsv-aspcp-96,
keyent = {HSV96},
author = "S. {Har-Peled} and M. Sharir and K. R. Varadarajan",
title = {{Approximate shortest paths on a convex polytope in
three dimensions}},
pages = {329--338},
booktitle = SOCG_1996,
acceptrate = SOCG_1996_AR,
year = 1996,
url = {http://doi.acm.org/10.1145/237218.237402},
doi = {10.1145/237218.237402}
}
@mastersthesis{Har95,
keyent = {Har95},
author = "S. {Har-Peled}",
title = "The Complexity of Many Cells in the Overlay of Many
Arrangements",
type = {{M. S.} Thesis},
school = "Dept. Computer Science, Tel Aviv University",
address = "Tel Aviv, Israel",
year = 1995,
keywords = "master thesis"
}
@Article{KV86,
keyent = {KV86},
author = "M. D. Katz and D. J. Volper",
title = {{Data structures for retrieval on square grids}},
journal = SICOMP,
year = 1986,
volume = 15,
number = 4,
pages = "919--931"
}
@book{Knu81,
keyent = {Knu81},
author = "D. E. Knuth",
title = "Seminumerical Algorithms",
series = "The Art of Computer Programming",
volume = 2,
edition = "2nd",
publisher = "Addison-Wesley",
year = 1981
}
@Article{m-fsscs-86,
author = {G. L. Miller},
title = {{Finding small simple cycle separators for
2-connected planar graphs}},
journal = JCSS,
year = 1986,
volume = 32,
number = 3,
pages = {265--279}
}
@book{Orourke94,
keyent = {Orourke94},
author = "J. O'Rourke",
title = "Computational Geometry in {C}",
publisher = "Cambridge University Press",
year = 1994,
address = "Cambridge",
annote = "Textbook"
}
@Article{P79,
keyent = {P79},
author = "C. H. Papadimitriou",
title = "Efficient Search for Rationals",
journal = "Info. Process. Lett.",
pages = {1--4},
volume = 8,
number = 1,
year = 1979
}
@Article{PY91,
keyent = {PY91},
author = {C. H. Papadimitriou and M. Yannakakis},
title = {{Optimization, approximation, and complexity
classes}},
journal = {Journal of Computer and System Sciences},
year = 1991,
volume = 43,
pages = {425--440}
}
@Book{Pog73,
keyent = {Pog73},
author = {A. V. Pogorelov},
title = {{Extrinsic Geometry of Convex Surfaces}},
publisher = AMS,
year = 1973,
volume = 35,
series = {Translations of Mathematical Monographs}
}
@Article{SS86,
keyent = {SS86},
author = {M. Sharir and A. Schorr},
title = {{On shortest paths in polyhedral spaces}},
journal = SICOMP,
year = 1986,
volume = 15,
pages = {193--215}
}
@article{WS88,
keyent = {WS88},
author = {A. Wiernik and M. Sharir},
title = {{Planar realization of nonlinear {Davenport-Schinzel}
sequences by segments}},
journal = DCG,
year = 1988,
volume = 3,
pages = {15--47}
}
@article{a-asngo-03,
title = "Approximation schemes for {NP}-hard geometric
optimization problems: a survey",
author = "S. Arora",
journal = "Math. Prog.",
volume = 97,
pages = "43--69",
year = 2003
}
@article{a-bttdb-03,
author = "L. Arge",
title = "The {Buffer} {Tree}: {A} Technique for Designing
Batched External Data Structures",
pages = "1--24",
journal = "Algorithmica",
year = 2003,
volume = 37,
number = 1
}
@InProceedings{a-dfrp-01,
keyent = {a-dfrp-01},
author = {D. Achlioptas},
title = {Database-friendly random projections},
booktitle = PODS_2001,
pages = {274--281},
year = 2001,
annote = {A replacement of JL that uses only -1, 0, 1}
}
@incollection{a-gpia-91i,
keyent = {a-gpia-91i},
author = "P. K. Agarwal",
key = "xxxx",
title = "Geometric partitioning and its applications",
editor = "J. E. Goodman and R. Pollack and W. Steiger",
booktitle = "Computational Geometry: Papers from the DIMACS
Special Year",
publisher = AMS,
year = 1991,
pages = "1--37",
keywords = "random sampling, partition, arrangement, point
location",
comments = "survey paper --- cuttings, range search"
}
@book{a-idapa-91,
keyent = {a-idapa-91},
author = "P. K. Agarwal",
title = "Intersection and Decomposition Algorithms for Planar
Arrangements",
publisher = "Cambridge University Press",
address = {New York},
year = 1991,
url =
{http://www.cup.org/titles/catalogue.asp?isbn=0521404460},
keywords = "arrangement, partition, {Davenport-Schinzel}
sequences"
}
@article{a-pal2a-90,
keyent = {a-pal2a-90},
author = "P. K. Agarwal",
title = "Partitioning arrangements of lines:
{II}. {Applications}",
journal = DCG,
volume = 5,
year = 1990,
pages = "533--573",
keywords = "random sampling, arrangements, divide-and-conquer"
}
@article{a-pldr-83,
keyent = {a-pldr-83},
AUTHOR = {P. Assouad},
TITLE = {Plongements lipschitziens dans {${\bf R}\sp{n}$}},
JOURNAL = {Bull. Soc. Math. France},
FJOURNAL = {Bulletin de la Soci\'et\'e Math\'ematique de France},
VOLUME = 111,
YEAR = 1983,
NUMBER = 4,
PAGES = {429--448},
ISSN = {0037-9484},
CODEN = {BSMFAA},
MRCLASS = {54E40 (54F45)},
MRNUMBER = {86f:54050},
MRREVIEWER = {S. J. Taylor},
}
@article{a-prec-03,
author = "N. Alon",
title = "Problems and results in extremal combinatorics {I}",
journal = "Discrete Math.",
volume = 273,
year = 2003,
pages = "31--53",
}
@article{a-ptase-98,
keyent = {a-ptase-98},
title = {Polynomial time approximation schemes for
{Euclidean} {TSP} and other geometric problems},
author = {S. Arora},
journal = JACM,
publisher = {{ACM}},
volume = 45,
number = 5,
pages = {753--782},
month = {Sept.},
year = 1998,
url = {http://www.cs.princeton.edu/~arora/pubs/tsp.ps}
}
@incollection{i-nnhds-04,
author = "P. Indyk",
title = "Nearest Neighbors in High-dimensional Spaces",
chapter = 39,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
edition = {2nd},
publisher = "CRC Press LLC",
year = 2004,
pages = "877--892",
isbm = 1584883014,
doi = {10.1201/9781420035315.ch39},
delurl = {http://theory.lcs.mit.edu/~indyk/39.ps}
}
@incollection{a-rs-97-old,
keyent = {a-rs-97},
author = "P. K. Agarwal",
title = "Range searching",
chapter = 31,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
year = 1997,
pages = "575--598",
url = {http://www.cs.duke.edu/~pankaj/papers/revised-rs.ps.gz}
}
@incollection{a-rs-04,
keyent = {a-rs-97},
author = "P. K. Agarwal",
title = "Range searching",
chapter = 36,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
year = 2004,
edition = {2nd},
pages = "809--838",
address = {Boca Raton, FL, USA},
url = {http://www.cs.duke.edu/~pankaj/papers/revised-rs.ps.gz}
}
@article{a-sdcgp-85,
keyent = {a-sdcgp-85},
author = "M. J. Atallah",
title = "Some dynamic computational geometry problems",
journal = "Comput. Math. Appl.",
volume = 11,
number = 12,
year = 1985,
pages = "1171--1181"
}
@article{a-vdsfg-91,
keyent = {a-vdsfg-91},
author = "F. Aurenhammer",
title = {{Voronoi} diagrams: A survey of a fundamental
geometric data structure},
journal = "ACM Comput. Surv.",
volume = 23,
year = 1991,
pages = "345--405",
keywords = "survey paper, {Voronoi} diagrams, Delaunay
triangulations, arrangements, hyperplanes, plane
sweep, divide-and-conquer, parallel computation,
minimum spanning trees, cluster analysis, motion
planning"
}
@article{aaas-cvgbr-94,
author = "P. K. Agarwal and N. Alon and B. Aronov and S. Suri",
title = "Can visibility graphs be represented compactly?",
journal = DCG,
volume = 12,
year = 1994,
pages = "347--365"
}
@InProceedings{aabv-iedpl-99,
keyent = {aabv-iedpl-99},
author = {P. K. Agarwal and L. Arge and G. Brodal and
J. S. Vitter},
title = {{I/O}-efficient dynamic point location in monotone
subdivisions},
booktitle = SODA_1999,
year = 1999,
pages = {11--20}
}
@article{aacs-lalsp-98,
keyent = {aacs-lalsp-98},
author = "P. K. Agarwal and B. Aronov and T. M. Chan and
M. Sharir",
title = "On Levels in Arrangements of Lines, Segments,
Planes, and Triangles",
journal = DCG,
volume = 19,
year = 1998,
pages = "315--331"
}
@inproceedings{aae-imp-00,
keyent = {aae-imp-00},
author = "P. K. Agarwal and L. Arge and J. Erickson",
title = "Indexing Moving Points",
booktitle = PODS_2000,
pages = "175--186",
year = 2000,
url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/kindex.html}
}
@article{aaefv-eslc-00,
keyent = {aaefv-eslc-00},
author = "P. K. Agarwal and L. Arge and J. Erickson and
P. G. Franciosa and J. S. Vitter",
title = "Efficient Searching with Linear Constraints",
journal = "Journal of Computer and System Sciences",
volume = 61,
number = 2,
year = 2000,
pages = {194--216},
annote = {{728}}
}
@article{aaefv-eswlc-00,
author = "P.~K. Agarwal and L. Arge and J. Erickson and
P. Franciosa and J.~S. Vitter",
title = "Efficient searching with linear constraints",
journal = JCSS,
volume = 61,
number = 2,
year = 2000,
pages = "192--216",
}
@unpublished{aag-ecwsp-00,
keyent = {aag-ecwsp-00},
author = {P. K. Agarwal and L. Arge and S. Govindarajan},
title = {{I/O}-Efficient Construction of Well Seperated Pairs
Decomposition},
note = {manuscript},
year = 2000
}
@article{aahs-aeamw-00,
keyent = {aahs-aeamw-00},
author = {P. K. Agarwal and B. Aronov and S. {Har-Peled} and
M. Sharir},
title = {Approximation and Exact Algorithms for Minimum-Width
Annuli and Shells},
journal = DCG,
pages = "687--705",
volume = 24,
number = 4,
year = 2000,
url =
{http://cs.uiuc.edu/~sariel/research/papers/98/min_width_annulus.html}
}
@inproceedings{aahs-aeamw-99-conf,
author = {P. K. Agarwal and B. Aronov and S. {Har-Peled} and
M. Sharir},
title = {Approximation and Exact Algorithms for Minimum-Width
Annuli and Shells},
booktitle = SOCG_1999,
acceptrate = SOCG_1999_AR,
pages = "380--389",
year = 1999,
doi = {10.1145/304893.304992}
}
@inproceedings{aahsw-rsfcm-98c,
keyent = {aahsw-rsfcm-98c},
author = "A. Andrzejak and B. Aronov and S. {Har-Peled} and
R. Seidel and E. Welzl",
title = {{Results on {$k$}-sets and $j$-facets via continuous
motion arguments}},
booktitle = SOCG_1998,
acceptrate = SOCG_1998_AR_TT,
pages = {192--199},
year = 1998,
url = {http://doi.acm.org/10.1145/276884.276906},
doi = {10.1145/276884.276906}
}
@Article{aahsw-rsfcm-98d,
keyent = {aahsw-rsfcm-98d},
author = "A. Andrzejak and B. Aronov and S. {Har-Peled} and
R. Seidel and E. Welzl",
journal = DCG,
title = {{Results on {$k$}-sets and $j$-facets via continuous
motion arguments}},
year = 1998,
note = {to appear}
}
@Article{aahsw-rsfcm-99,
keyent = {aahsw-rsfcm-99},
author = "A. Andrzejak and B. Aronov and S. {Har-Peled} and
R. Seidel and E. Welzl",
title = {{Results on {$k$}-sets and $j$-facets via continuous
motion arguments}},
journal = "Discrete Comput. Geom.",
year = 1999
}
@inproceedings{aak-eabs-04,
keyent = {aak-eabs-04},
author = "P. K. Agarwal and B. Aronov and V. Koltun",
title = "Efficient Algorithms for Bichromatic Separability",
booktitle = SODA_2004,
year = 2004,
pages = "675--683"
}
@article{aaos-supa-97,
keyent = {aaos-supa-97},
author = "P. K. Agarwal and B. Aronov and J. O'Rourke and
C. A. Schevon",
title = "Star Unfolding of a Polytope with Applications",
journal = SICOMP,
volume = 26,
year = 1997,
pages = "1679--1713",
keywords = "motion planning, shortest paths, polytopes,
diameter, edge sequences, unfolding of polytopes"
}
@article{aas-cefda-97,
keyent = {aas-cefda-97},
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Computing Envelopes in Four Dimensions with
Applications",
journal = SICOMP,
volume = 26,
year = 1997,
pages = "1714--1732",
url = {http://epubs.siam.org/sam-bin/dbq/article/26572}
}
@InProceedings{aas-eaamw-00,
keyent = {aas-eaamw-00},
author = {P. K. Agarwal and B. Aronov and M. Sharir},
title = {Exact and Approximation Algorithms for Minimum-Width
Cylindrical Shells},
booktitle = SODA_2000,
year = 2000,
pages = "510--517",
url = {http://www.math.tau.ac.il/~michas/shellqq.ps}
}
@article{aas-eaamw-01,
keyent = {aas-eaamw-01},
author = {P. K. Agarwal and B. Aronov and M. Sharir},
title = {Exact and Approximation Algorithms for Minimum-Width
Cylindrical Shells},
journal = DCG,
year = 2001,
pages = "307--320",
volume = 26,
number = 3,
url = {http://www.math.tau.ac.il/~michas/shellqq.ps}
}
@article{aas-ltbse-99,
keyent = {aas-ltbse-99},
author = "P. K. Agarwal and B. Aronov and M. Sharir",
title = "Line Traversals of Balls and Smallest Enclosing
Cylinders in Three Dimensions",
journal = DCG,
volume = 21,
year = 1999,
pages = "373--388"
}
@Unpublished{ab-cdtps-01,
keyent = {ab-cdtps-01},
author = {D. Attali and J. D. Boissonnat},
title = {Complexity of the {Delaunay} triangulation of points
on a smooth surface},
note =
{\href{http://www-sop.inria.fr/prisme/personnel/boissonnat/papers.html}{http://www-sop.inria.fr/prisme/personnel/boissonnat/papers.html}},
year = 2001
}
@Book{ab-nnltf-99,
keyent = {ab-nnltf-99},
author = {M.~Anthony and P. L. Bartlett},
title = {Neural Network Learning: Theoretical Foundations},
publisher = {Cambridge},
year = 1999
}
@inproceedings{ab-scfds-05,
author = "H. Alt and M. Buchin",
title = "Semi-computability of the {\Frechet}~distance
between surfaces",
booktitle = EWCG_2005,
pages = {45--48},
year = 2005
}
@inproceedings{ab-srvf-98,
keyent = {ab-srvf-98},
author = "N. Amenta and M. Bern",
title = "Surface reconsruction by {Voronoi} filtering",
booktitle = SOCG_1998,
site = "Minneapolis",
year = 1998,
pages = "39--48"
}
@inproceedings{abbgh-lbkps-99,
keyent = {abbgh-lbkps-99},
author = {P. K. Agarwal and J. Basch and M. de Berg and
L. J. Guibas and J. Hershberger},
title = {Lower Bounds for Kinetic Planar Subdivisions},
booktitle = SOCG_1999,
acceptrate = SOCG_1999_AR,
pages = {247--254},
year = 1999
}
@inproceedings{abcgst-stcfb-99,
keyent = {abcgst-stcfb-99},
author = {T. Asano and M. de Berg and O. Cheong and
L. J. Guibas and J. Snoeyink and H. Tamaki},
title = {Spanning Trees Crossing Few Barriers},
booktitle = SOCG_1999,
pages = "41--48",
year = 1999
}
@article{abch-ssduc-97,
keyent = {abch-ssduc-97},
author = "N. Alon and S. Ben-David and N. {Cesa-Bianchi} and
D. Haussler",
title = "Scale-sensitive dimensions, uniform convergence, and
learnability",
journal = JACM,
volume = 44,
number = 4,
pages = "615--631",
year = 1997
}
@InCollection{abghz-dfstk-01,
keyent = {abghz-dfstk-01},
author = {P. K.~Agarwal and J. Basch and L. J.~Guibas and
J. Hershberger and L. Zhang},
title = {Deformable free space tiling for kinetic collision
detection},
booktitle = {Algorithmic and Computational Robotics: New
Directions},
year = 2001,
pages = {83--96},
publisher = {A. K. Peters},
editor = {B. R. Donald and K. Lynch and D. Rus}
}
@unpublished{abghz-dfstk-99,
keyent = {abghz-dfstk-99},
author = {P. K. Agarwal and J. Basch and L. J. Guibas and
J. Hershberger and L. Zhang},
title = {Deformable free space tiling for kinetic collision
detection},
note = stWAFR4,
year = 2000
}
@article{abh-rwc-01,
keyent = {abh-rwc-01},
author = "Y.~Afek and A.~{Bremler-Barr} and S. {Har-Peled} ",
journal = "IEEE\slash ACM Transactions on Networking",
title = "Routing with a Clue",
pages = "693--705",
year = 2001,
month = dec,
volume = 9,
number = 6
}
@inproceedings{abhosv-rippt-01,
keyent = {abhosv-rippt-01},
author = "P. K. Agarwal and M. de Berg and S. {Har-Peled} and
M. H. Overmars and M. Sharir and J. Vahrenhold",
title = "Reporting Intersecting Pairs of Polytopes in Two and
Three Dimensions",
pages = "122--134",
booktitle = WADS_2001,
acceptrate = WADS_2001_AR,
year = 2001,
editor = "F. Dehne and J. Sack and R. Tamassia",
volume = 2125,
series = LNCS
}
@inproceedings{cdhsw-cfdfp-11,
author = {A. F. Cook and A. Driemel and S. {Har-Peled} and
J. Sherette and C. Wenk},
title = {Computing the {Fr{\'e}chet} Distance Between Folded
Polygons},
booktitle = WADS_2011,
acceptrate = WADS_2011_AR,
doi = {10.1007/978-3-642-22300-6_23},
year = 2011,
pages = {267--278}
}
@article{abhosv-rippt-02,
keyent = {abhosv-rippt-02},
author = "P. K. Agarwal and M. de Berg and S. {Har-Peled}
and M. H. Overmars and M. Sharir and J. Vahrenhold",
title = "Reporting intersecting pairs of convex polytopes in
two and three dimensions",
journal = CGTA,
volume = 23,
issue = 2,
pages = "195--207",
year = 2002,
month = "August"
}
@article{abku-ba-00,
author = "Y. Azar and A. Z. Broder and A. R. Karlin and
E. Upfal",
title = "Balanced Allocations",
journal = SICOMP,
volume = 29,
number = 1,
pages = "180--200",
year = 2000,
url =
"http://www.cs.brown.edu/people/eli/papers/SICOMP29.pdf"
}
@article{abms-claho-98,
keyent = {abms-claho-98},
author = "P. K. Agarwal and M. de Berg and J. Matou{\v s}ek and O. Schwarzkopf",
title = "Constructing Levels in Arrangements and Higher Order
{Voronoi} Diagrams",
journal = SICOMP,
volume = 27,
year = 1998,
pages = "654--667",
url = "http://epubs.siam.org/sam-bin/dbq/article/28184"
}
@inproceedings{abn-amet-06,
author = {I. Abraham and Y. Bartal and O. Neimany},
title = {Advances in metric embedding theory},
booktitle = STOC_2006,
year = 2006,
pages = {271--286},
location = {Seattle, WA, USA},
doi = {10.1145/1132516.1132557}
}
@article{abosy-fmcnp-89,
keyent = {abosy-fmcnp-89},
author = "A. Aggarwal and H. Booth and J. O'Rourke and S. Suri
and C. K. Yap",
title = "Finding minimal convex nested polygons",
journal = "Inform. Comput.",
volume = 83,
number = 1,
month = oct,
year = 1989,
pages = "98--110",
keywords = "packing, visibility, convex polygons, extremal
figures"
}
@inproceedings{abs-osaupp-99,
keyent = {abs-osaupp-99},
author = {P. K. Agarwal and B. Bhattacharya and S. Sen},
title = {Output-sensitive algorithms for uniform partitions
of points},
booktitle = ISAAC_1999,
year = 1999
}
@inproceedings{ac-annfjl-06,
author = {N. Ailon and B. Chazelle},
title = {Approximate nearest neighbors and the fast
{Johnson-Lindenstrauss} transform},
booktitle = STOC_2006,
year = 2006,
pages = {557--563},
location = {Seattle, WA, USA},
doi = {10.1145/1132516.1132597}
}
@inproceedings{accgo-cflah-01,
keyent = {accgo-cflah-01},
author = "H.-K. Ahn and S.-W. Cheng and O. Cheong and M. Golin
and R. van Oostrum",
title = "Competitive facility location along a highway",
booktitle = "7th Annual International Computing and Combinatorics
Conference",
series = "LNCS",
volume = 2108,
year = 2001,
pages = "237--246",
url = {http://citeseer.nj.nec.com/467216.html}
}
@article{accgo-cflvg-04,
author = "H.-K. Ahn and S.-W. Cheng and O. Cheong and M. Golin
and R. van Oostrum",
title = "Competitive Facility Location: The {Voronoi} Game",
journal = TCS,
volume = 310,
year = 2004,
pages = "457--467"
}
@inproceedings{acdl-sahsr-00,
keyent = {acdl-sahsr-00},
author = {N. Amenta and S. Choi and T. Dey and N. Leekha},
title = {A simple algorithm for homeomorphic surface
reconstruction},
booktitle = SOCG_2000,
pages = "213--222",
year = 2000
}
@book{acgkm-ca-99,
keyent = {acgkm-ca-99},
author = "G. Ausiello and P. Crescenzi and G. Gambosi and
V. Kann and A. Marchetti-Spaccamela and M. Protasi",
title = "Complexity and approximation",
publisher = {Springer-Verlag},
address = "Berlin",
year = 1999,
doi = {10.1007/978-3-642-58412-1}
}
@inproceedings{ad-aalm-99,
keyent = {ad-aalm-99},
author = {P. K. Agarwal and P. K. Desikan},
title = {Approximation algorithms for layered manufacturing},
booktitle = SODA_1999,
year = 2000,
note = "to appear"
}
@inproceedings{ad-eats-97,
author = {P. K. Agarwal and P. K. Desikan},
title = {An efficient algorithm for terrain simplification},
booktitle = SODA_1997,
year = 1997,
pages = {139--147}
}
@Unpublished{adggh-smeam-05,
keyent = {adggh-smeam-04},
author = {P. K. Agarwal and M. de Berg and J. Gao and
L. J. Guibas and S. {Har-Peled}},
title = {Staying in the Middle: Exact and Approximate Medians
in {$R^1$} and $R^2$ for Moving Points},
note = {manuscript},
year = 2005,
url =
{http://cs.uiuc.edu/~sariel/research/papers/03/median/}
}
@Unpublished{adm-ccues-99,
keyent = {adm-ccues-99},
author = {P. K. Agarwal and P. K. Desikan and T. M. Murali},
title = {Occlusion culling using exact shadow computations
and ray-shooting queries},
note = stSOCG16,
year = 2000,
}
@InProceedings{adpr-tc-00,
keyent = {adpr-tc-00},
author = "N. Alon and S. Dar and M. Parnas and D. Ron",
title = "Testing of Clustering",
booktitle = FOCS_2000,
year = 2000,
pages = "240--250",
annote = {{614}}
}
@incollection{ae-rsir-99,
keyent = {ae-rsir-99},
author = "P. K. Agarwal and J. Erickson",
title = "Geometric range searching and its relatives",
editor = "B. Chazelle and J. E. Goodman and R. Pollack",
booktitle = "Advances in Discrete and Computational Geometry",
publisher = AMS,
Pages = {1--56},
year = 1999
}
@inproceedings{aeg-kbisd-98,
keyent = {aeg-kbisd-98},
author = "P. K. Agarwal and J. Erickson and L. J. Guibas",
title = "Kinetic {BSP}s for Intersecting Segments and
Disjoint Triangles",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "107--116"
}
@inproceedings{aeg-kbspf-97,
keyent = {aeg-kbspf-97},
author = {P. K. Agarwal and J. Erickson and L. J. Guibas},
title = {Kinetic Binary Space Partitions for Triangles},
pages = {107--116},
year = 1998,
booktitle = SODA_1998
}
@inproceedings{aegm-pkmst-98,
keyent = {aegm-pkmst-98},
author = "P. K. Agarwal and D. Eppstein and L. J. Guibas and
M. Henzinger",
title = "Parametric and kinetic minimum spanning trees",
booktitle = FOCS_1998,
year = 1998,
pages = "596--605"
}
@inproceedings{aeis-eards-99,
keyent = {aeis-eards-99},
author = {A. Amir and A. Efrat and P. Indyk and H. Samet},
title = {Efficient Algorithms and Regular Data Structures for
Dilation, Location and Proximity Problems},
booktitle = FOCS_1999,
pages = "160--170",
nickname = "FOCS '99",
year = 1999
}
@article{aerw-mpm-03,
author = "H. Alt and A. Efrat and G. Rote and C. Wenk",
title = "Matching planar maps",
journal = JALG,
volume = 49,
pages = {262--283},
year = 2003
}
@article{k-tdvrs-97,
author = {M. J. Katz},
title = {3-{D} Vertical Ray Shooting and 2-{D} Point
Enclosure, Range Searching, and Arc Shooting Amidst
Convex Fat Objects},
journal = CGTA,
volume = {8},
pages = {299--316},
year = {1997},
doi = {10.1016/S0925-7721(96)00027-2}
}
@article{aes-vdsl3-99,
keyent = {aes-vdsl3-99},
author = "P. K. Agarwal and A. Efrat and M. Sharir",
title = "Vertical decomposition of shallow levels in
{$3$}-dimensional arrangements and its applications",
journal = SICOMP,
volume = 29,
year = 1999,
pages = "912--953",
url = {http://epubs.siam.org/sam-bin/dbq/article/29593}
}
@inproceedings{af-acrsm-97,
keyent = {af-acrsm-97},
author = "B. Aronov and S. Fortune",
title = "Average-Case Ray Shooting and Minimum Weight
Triangulations",
booktitle = SOCG_1997,
year = 1997,
pages = "203--211",
url = {10.1145/262839.262972}
}
@Unpublished{afh-pdecms-99,
keyent = {afh-pdecms-99},
author = {P. K. Agarwal and E. Flato and D. Halperin},
title = {Polygon decomposition for efficient construction of
Minkowski sums},
note = stSOCG16,
year = 2000,
}
@Article{afhkrs-akhmst-05,
author = {E. Althaus and S. Funke and S. {Har-Peled} and
J. K\"onemann and E. A. Ramos and M. Skutella},
title = {Approximating {$k$}-hop minimum-spanning trees},
journal = ORL,
year = 2005,
volume = 33,
number = 2,
pages = {115--120},
month = {March}
}
@article{afrw-mcsrs-98,
keyent = {afrw-mcsrs-98},
author = "H. Alt and U. Fuchs and G. Rote and G. Weber",
title = "Matching convex shapes with respect to the symmetric
difference",
journal = "Algorithmica",
volume = 21,
year = 1998,
pages = "89--103",
url = {http://citeseer.nj.nec.com/267158.html},
succeeds = "afrw-mcsrs-96",
cites = "bdkst-cmotc-96",
update = "98.07 rote",
abstract = "This paper deals with questions from convex geometry
related to shape matching. In particular, we
consider the problem of moving one convex figure
over another, minimizing the area of their symmetric
difference. We show that if we just let the two
centers of gravity coincide, the resulting symmetric
difference is within a factor of 11/3 of the
optimum. This leads to efficient approximate
matching algorithms for convex figures."
}
@article{ag-cfdbt-95,
keyent = {ag-cfdbt-95},
author = "H. Alt and M. Godau",
title = "Computing the {Fr\'echet} distance between two
polygonal curves",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "75--91"
}
@incollection{ag-dgsmi-00,
keyent = {ag-dgsmi-00},
author = "H. Alt and L. J. Guibas",
title = "Discrete Geometric Shapes: {Matching},
Interpolation, and Approximation",
editor = "J.-R. Sack and J. Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "North-Holland",
year = 2000,
pages = "121--153",
annote = "Chapter 3 of su-hcg-00"
}
@inproceedings{agg-kmkdt-02,
keyent = {agg-kmkdt-02},
author = "P. K. Agarwal and J. Gao and L. J. Guibas",
title = "Kinetic medians and {$kd$}-trees",
booktitle = ESA_2002,
pages = "5-16",
year = 2002,
url =
"http://www.cs.duke.edu/~pankaj/papers/kinetic-kdtree.pdf.gz"
}
@Article{aghhr-gbaur-05,
author = {S. Agarwal and T. Graepel and R. Herbrich and
S. {Har-Peled} and D. Roth},
title = {Generalization Bounds for the Area Under the ROC
Curve},
journal = JMLR,
year = 2005,
volume = 6,
pages = {393--425},
month = {Apr},
url = {http://cs.uiuc.edu/~sariel/papers/05/generalization}
}
@Article{aghrs-cpdtc-00,
keyent = {aghrs-cpdtc-00},
author = {P. K. Agarwal and L. J. Guibas and S. {Har-Peled}
and A. Rabinovitch and M. Sharir},
title = {Computing the Penetration Depth of Two Convex
Polytopes in 3D},
journal = NORDIC_J_COMP,
volume = 7,
number = 3,
pages = {227--240},
year = 2000
}
@InProceedings{aghrs-cpdtc-00-swat,
keyent = {aghrs-cpdtc-00-swat},
author = {P. K. Agarwal and L. J. Guibas and S. {Har-Peled}
and A. Rabinovitch and M. Sharir},
title = {Computing the Penetration Depth of Two Convex
Polytopes in 3D},
booktitle = SWAT_2000,
acceptrate = SWAT_2000_AR,
pages = {328--338},
year = 2000,
doi = {10.1007/3-540-44985-X_29}
}
@article{aghv-memps-01,
keyent = {aghv-memps-01},
author = {P. K. Agarwal and L. J. Guibas and J. Hershberger
and E. Veach},
title = {Maintaining the Extent of a Moving Point Set},
journal = DCG,
year = 2001,
pages = {353--374},
volume = 26,
number = 3,
url = {http://graphics.stanford.edu/papers/extent/}
}
@inproceedings{aghv-memps-97,
keyent = {aghv-memps-97},
author = "P. K. Agarwal and L. J. Guibas and J. Hershberger
and E. Veach",
title = "Maintaining the extent of a moving point set",
booktitle = WADS_1997,
nickname = "WADS '97",
site = "Halifax, Canada",
series = LNCS,
volume = 1272,
publisher = "Springer-Verlag",
year = 1997,
pages = "31--44"
}
@article{agkmm-lshkm-04,
author = {Vijay Arya and Naveen Garg and Rohit Khandekar and
Adam Meyerson and Kamesh Munagala and Vinayaka
Pandit},
title = {Local Search Heuristics for $k$-Median and Facility
Location Problems},
journal = SICOMP,
volume = {33},
number = {3},
pages = {544--562},
year = {2004},
doi = {10.1137/S0097539702416402}
}
@inproceedings{agkmp-lshkm-01-conf,
keyent = {agkmp-lshkm-01},
author = "V. Arya and N. Garg and R. Khandekar and K. Munagala
and V. Pandit",
title = "Local search heuristic for {$k$}-median and facility
location problems",
booktitle = STOC_2001,
pages = "21--29",
year = 2001
}
@inproceedings{agmv-cskbs-97,
keyent = {agmv-cskbs-97},
author = "P. K. Agarwal and L. J. Guibas and T. M. Murali and
J. S. Vitter",
title = "Cylindrical Static and Kinetic Binary Space
Partitions",
booktitle = SOCG_1997,
year = 1997,
pages = "39--48"
}
@article{agss-ltacv-89,
keyent = {agss-ltacv-89},
author = "A. Aggarwal and L. J. Guibas and J. Saxe and
P. W. Shor",
title = "A linear-time algorithm for computing the {Voronoi}
diagram of a convex polygon",
journal = DCG,
volume = 4,
number = 6,
year = 1989,
pages = "591--604",
keywords = "convex polygons, {Voronoi} diagram"
}
@article{agt-wat-94,
keyent = {agt-wat-94},
author = "T. Asano and L. J. Guibas and T. Tokuyama",
title = "Walking on an arrangement topologically",
journal = IJCGA,
volume = 4,
year = 1994,
pages = "123--151"
}
@InProceedings{ah-adrp-05-conf,
keyent = {ah-adrp-05},
author = {B. Aronov and S. {Har-Peled}},
booktitle = SODA_2005,
acceptrate = SODA_2005_AR,
title = {On Approximating the Depth and Related Problems},
year = 2005,
pages = {886--894}
}
@article{ah-adrp-08,
author = {B. Aronov and S. {Har-Peled}},
title = {On Approximating the Depth and Related Problems},
publisher = {SIAM},
year = 2008,
journal = SICOMP,
volume = 38,
number = 3,
pages = {899--921},
url = {http://dx.doi.org/10.1137/060669474},
doi = {10.1137/060669474},
}
@Unpublished{ah-aspt-00,
keyent = {ah-aspt-00},
author = {P. K. Agarwal and S. {Har-Peled}},
title = {Approximating shortest-path of terrains},
note = {manuscript},
year = 2000
}
@InProceedings{ah-maemm-01,
keyent = {ah-maemm-01},
author = {P. K. Agarwal and S. {Har-Peled}},
title = {Maintaining the Approximate Extent Measures of
Moving Points},
booktitle = SODA_2001,
acceptrate = SODA_2001_AR,
year = 2001,
pages = {148--157},
url =
{http://cs.uiuc.edu/~sariel/research/papers/00/extent.html}
}
@inproceedings{ahhhl-olzca-99,
author = {Y. Aharoni and D. Halperin and I. Hanniel and
S. {Har-Peled} and C. Linhart},
title = {On-line Zone Construction in Arrangements of Lines
in the Plane},
booktitle = WAE_1999,
acceptrate = WAE_1999_AR,
year = 1999,
pages = {139--153},
doi = {10.1007/3-540-48318-7_13},
}
@inproceedings{ahk-caspcp-00,
keyent = {ahk-caspcp-00},
author = {P. K. Agarwal and S. {Har-Peled} and M. Karia},
title = {Computing Approximate Shortest Paths on Convex
Polytopes},
booktitle = SOCG_2000,
acceptrate = SOCG_2000_AR_TT,
pages = "270--279",
year = 2000,
url =
{http://www.cs.duke.edu/~sariel/papers/99/navigator.html}
}
@article{ahk-caspcp-02,
keyent = {ahk-caspcp-02},
author = {P. K.~Agarwal and S. {Har-Peled} and M.~Karia},
title = {Computing Approximate Shortest Paths on Convex
Polytopes},
year = 2002,
journal = ALGORITHMICA,
pages = {227--242},
volume = 33,
number = 2
}
@Unpublished{ahk-mwmma-06,
author = {S. Arora and E. Hazan and S. Kale},
title = {Multiplicative weights method: a meta-algorithm and
its applications},
note = {manuscript. Available from
\url{http://www.cs.princeton.edu/~arora/pubs/MWsurvey.pdf}},
year = 2006,
url =
{http://www.cs.princeton.edu/~arora/pubs/MWsurvey.pdf}
}
@Unpublished{ahk-spdp-99prog,
keyent = {ahk-spdp-99prog},
author = {P. K. Agarwal and S. {Har-Peled} and M. Karia},
title = {Shortest path --- demo program},
note = {{\tt http://www.cs} {\tt .duke.edu/\tildegen{}} {\tt
{sariel/papers/99/nav/nav.html}}},
year = 1999
}
@Unpublished{ahm-csr-00,
keyent = {ahm-csr-00},
author = {P. K. Agarwal and S. {Har-Peled} and N. Mustafa},
title = {Curve Simplification Revisited},
note = {manuscript},
year = 2000
}
@inproceedings{ahmss-slbgs-01,
keyent = {ahmss-slbgs-01},
author = "E. Arkin and F. Hurtado and J. Mitchell and C. Seara
and S. Skiena",
title = "Some lower bounds on geometric separability
problems",
booktitle = FWCG_2001,
year = 2001
}
@inproceedings{ahmw-nltaa-02,
author = {P. K. Agarwal and S. {Har-Peled} and N. H. Mustafa
and Y. Wang},
title = {Near-Linear Time Approximation Algorithms for Curve
Simplification},
booktitle = ESA_2002,
acceptrate = ESA_2002_AR,
year = 2002,
pages = {29--41},
}
@article{ahmw-nltaa-05,
keyent = {ahmw-nltaa-05},
author = {P. K. Agarwal and S. {Har-Peled} and N. Mustafa and
Y. Wang},
title = {Near-Linear Time Approximation Algorithms for Curve
Simplification in Two and Three dimensions},
journal = ALGORITHMICA,
year = 2005,
pages = {203--219},
volume = 42,
number = {3-4},
url = {http://dx.doi.org/10.1007/s00453-005-1165-y},
doi = {10.1007/s00453-005-1165-y},
}
@InProceedings{ahr-ucbau-05,
title = {A Uniform Convergence Bound for the Area Under the
{ROC} Curve},
pages = {1--8},
author = {S. Agarwal and S. {Har-Peled} and D. Roth},
booktitle = AISTAT_2005,
acceptrate = AISTAT_2005_AR,
editor = {R. G. Cowell and Z. Ghahramani},
year = 2005,
publisher = {Soc. Artif. Intel. Stats.}
}
@techreport{ahsv-aspcp-96-old,
keyent = {ahsv-aspcp-96-old},
author = "P. K. Agarwal and S. {Har-Peled} and M. Sharir and
K. R. Varadarajan",
title = "Approximate Shortest Paths on a Convex Polytope in
Three Dimensions",
type = "Report",
number = "CS-1996-12",
institution = "Dept. Comput. Sci., Duke Univ.",
address = "Durham, NC",
year = 1996
}
@Article{ahsv-aspcp-97,
author = "P. K. Agarwal and S. {Har-Peled} and M. Sharir and
K. R. Varadarajan",
title = "Approximate Shortest Paths on a Convex Polytope in
Three Dimensions",
journal = JACM,
year = 1997,
volume = 44,
number = {4},
pages = {567--584},
url = {http://doi.acm.org/10.1145/263867.263869},
doi = {10.1145/263867.263869},
}
@InProceedings{ahsw-hdtpd-03,
keyent = {ahsw-hdtpd-03},
author = {P. K. Agarwal and S. {Har-Peled} and M. Sharir and
Y. Wang},
title = {Hausdorff Distance under Translation for Points,
Disks, and Balls},
booktitle = SOCG_2003,
acceptrate = SOCG_2003_AR,
pages = {282--291},
url =
{http://cs.uiuc.edu/~sariel/research/papers/02/hausdorff/},
year = 2003
}
@article{ahsw-hdtpd-04-old,
author = {P. K. Agarwal and S. {Har-Peled} and M. Sharir and
Y. Wang},
title = {Hausdorff Distance under Translation for Points,
Disks, and Balls},
journal = CGTA,
note = {To appear},
year = 2004
}
@article{ahv-aemp-04,
keyent = {ahv-aemp-04},
author = {P. K. Agarwal and S. {Har-Peled} and
K. R. Varadarajan},
title = {Approximating extent measures of points},
journal = JACM,
volume = 51,
number = 4,
year = 2004,
issn = {0004-5411},
pages = {606--635},
doi = {10.1145/1008731.1008736},
url = {http://cs.uiuc.edu/~sariel/papers/01/fitting/}
}
@unpublished{ahv-gavc-04-old,
keyent = {ahv-gavc-04},
author = {P. K. Agarwal and S. {Har-Peled} and K. Varadarajan},
title = {Geometric Approximation via Coresets},
url = {http://cs.uiuc.edu/~sariel/papers/04/survey/},
year = 2004,
note = {\urlSarielPaper{04/survey/}}
}
@InCollection{ahv-gavc-05,
author = {P. K. Agarwal and S. {Har-Peled} and K. Varadarajan},
title = {Geometric Approximation via Coresets},
booktitle = {Combinatorial and Computational Geometry},
publisher = {Cambridge},
year = 2005,
editor = {J. E. Goodman and J. Pach and E. Welzl},
series = {Math. Sci. Research Inst. Pub.},
address = {New York, NY, USA}
}
@InProceedings{ahy-escmp-07,
author = {P. Agarwal and S. {Har-Peled} and H. Yu},
title = {Embeddings of surfaces, curves, and moving points in
{Euclidean} space},
booktitle = SOCG_2007,
acceptrate = SOCG_2007_AR,
year = 2007,
pages = {381--389},
url = {http://sarielhp.org/papers/06/embed/}
}
@article{ahy-rsfpg-08,
author = {P. Agarwal and S. {Har-Peled} and H. Yu},
title = {Robust Shape Fitting via Peeling and Grating
Coresets},
journal = DCG,
volume = 39,
number = {1-3},
year = 2008,
pages = {38--58},
url = {http://dx.doi.org/10.1007/s00454-007-9013-2},
doi = {10.1007/s00454-007-9013-2},
}
@InProceedings{ahy-rsfpg-06,
author = {P. Agarwal and S. {Har-Peled} and H. Yu},
title = {Robust Shape Fitting via Peeling and Grating
Coresets},
booktitle = SODA_2006,
acceptrate = SODA_2006_AR,
year = 2006,
pages = {182--191}
}
@inproceedings{ak-aeub-00,
keyent = {ak-aeub-00},
author = {N. Amenta and R. Kolluri},
title = {Accurate and efficient unions of balls},
booktitle = SOCG_2000,
pages = "119--128",
year = 2000
}
@article{ak-amplp-99,
author = {S. Arora and G. Karakostas},
title = {Approximation Schemes for Minimum Latency Problems.},
journal = {SIAM J. Comput.},
volume = 32,
number = 5,
year = 2003,
pages = {1317--1337},
ee = {http://epubs.siam.org/sam-bin/dbq/article/39965}
}
@article{ak-asmlp-03,
author = {S. Arora and G. Karakostas},
title = {Approximation Schemes for Minimum Latency Problems},
journal = SICOMP,
volume = 32,
number = 5,
year = 2003,
issn = {0097-5397},
pages = {1317--1337}
}
@article{ak-iplal-94,
keyent = {ak-iplal-94},
author = "P. K. Agarwal and {M. van} Kreveld",
title = "Implicit Point Location in Arrangements of Line
Segments, with an Application to Motion Planning",
journal = IJCGA,
volume = 4,
year = 1994,
pages = "369--383",
keywords = "point location, motion planning, arrangements"
}
@incollection{ak-vd-00,
keyent = {ak-vd-00},
author = "F. Aurenhammer and R. Klein",
title = "{Voronoi} Diagrams",
editor = "J.-R. Sack and J. Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "North-Holland",
year = 2000,
pages = "201--290",
url =
"http://wwwpi6.fernuni-hagen.de/Publikationen/tr198.pdf",
annote = "Chapter 5 of su-hcg-00"
}
@InCollection{akksw-seahql-99,
keyent = {akksw-seahql-99},
author = "P. K. Agarwal and L. Knipping and {M. van} Kreveld
and T. Strijk and A. Wolf",
booktitle = {Innovations in GIS VII: GeoComputation},
title = {A Simple and Efficient Algorithm for High-Quality
Line Labeling},
publisher = {Taylor and Francis},
year = 1999,
editor = {P. Atkinson and D. Martin},
address = {Lonton},
note = {to appear}
}
@article{akmm-tnhag-02,
keyent = {akmm-tnhag-02},
author = {N.~Alon and G.~Kalai and J.~Matou{\v s}ek and
R.~Meshulam},
title = {Transversal numbers for hypergraphs arising in
geometry},
journal = {Adv. Appl. Math.},
year = 2002,
pages = {79--101},
volume = 29,
url = {http://www.math.tau.ac.il/~nogaa/PDFS/akmm6.pdf}
}
@Article{akpw-gtgak-95,
keyent = {akpw-gtgak-95},
author = "N. Alon and R. M. Karp and D. Peleg and D. West",
title = "A graph-theoretic game and its application to the
{$k$}-server problem",
journal = SICOMP,
volume = 24,
number = 1,
pages = "78--100",
month = feb,
year = 1995,
URL = "http://epubs.siam.org/sam-bin/dbq/article/22447"
}
@Article{aks-cgsn-98,
keyent = {aks-cgsn-98},
author = "N. Alon and M. Krivelevich and B. Sudakov",
title = "Coloring Graphs with Sparse Neighborhoods",
number = "73--82",
year = 1998,
volume = 77,
journal = {J. Comb. Theo. Ser. B},
url = {http://www.math.princeton.edu/~bsudakov/sparse.pdf}
}
@inproceedings{aks-osn-83,
keyent = {aks-osn-83},
author = "M. Ajtai and J. Koml{\'o}s and E. Szemer{\'e}di",
title = "An {$O(n \log n)$} Sorting Network",
booktitle = STOC_1983,
year = 1983,
pages = "1--9"
}
@inproceedings{aktt-cppkt-97,
author = {T. Asano and N. Katoh and H. Tamaki and T. Tokuyama},
title = {Covering points in the plane by {$k$}-tours: towards a
polynomial time approximation scheme for general k},
booktitle = STOC_1997,
year = 1997,
isbn = {0-89791-888-6},
pages = {275--283},
}
@Article{akw-cdmpc-04,
author = {H. Alt and C. Knauer and C. Wenk},
title = {Comparison of distance measures for planar curves},
journal = {Algorithmica},
year = 2004,
volume = 38,
number = 1,
pages = {45--58},
}
@article{r-cic-94,
author = "G. Rote",
title = "Curves with increasing chords",
journal = "Math. Proc. Camb. Phil. Soc.",
volume = 115,
pages = {1--12},
year = 1994
}
@InProceedings{akw-mpcrf-01,
author = {H. Alt and C. Knauer and C. Wenk},
title = {Matching polygonal curves with respect to the
Fr\'echet distance},
booktitle = STACS_2001,
year = 2001,
pages = {63--74}
}
@inproceedings{alms-eaaws-98b,
keyent = {alms-eaaws-98b},
author = "L. Aleksandrov and M. Lanthier and A. Maheshwari and
J.-R. Sack",
title = "An {\(\varepsilon\)}-Approximation Algorithm for
Weighted Shortest Paths on Polyhedral Surfaces",
booktitle = SWAT_1998,
nickname = "SWAT '98",
site = "Stockholm",
series = LNCS,
volume = 1432,
publisher = "Springer-Verlag",
year = 1998,
pages = "11--22"
}
@Unpublished{alps-cacp-00,
keyent = {alps-cacp-00},
author = {N. Alon and H. Last and R. Pinchasi and M. Sharir},
title = {On the complexity of arrangements of circles in the
plane},
note = {manuscript},
year = 2000
}
@Unpublished{am-ann-98,
keyent = {am-ann-98},
author = {S.~Arya and D.~Mount},
title = {{ANN}: library for approximate nearest neighbor
searching},
url = {http://www.cs.umd.edu/~mount/ANN/},
note = {\url{http://www.cs.umd.edu/~mount/ANN/}},
year = 1998
}
@article{am-ars-00,
keyent = {am-ars-0},
author = "S. Arya and D. M. Mount",
title = "Approximate range searching",
journal = CGTA,
volume = 17,
year = 2000,
pages = "135--152"
}
@inproceedings{am-ars-95-conf,
keyent = {am-ars-95-conf},
author = "S. Arya and David M. Mount",
title = "Approximate Range Searching",
booktitle = SOCG_1995,
year = 1995,
pages = "172--181",
keywords = "quadtrees, box decomposition trees"
}
@incollection{am-cgpl-04,
keyent = {am-cgpl-04},
author = "S. Arya and D. M. Mount",
title = "Computational Geometry: Proximity and Location",
editor = "D. Mehta and S. Sahni",
booktitle = "Handbook of Data Structures and Applications",
publisher = "CRC Press LLC",
pages = {63.1--63.22},
year = 2005,
isbm = 1584884355,
url = {http://www.cs.umd.edu/~mount/Papers/crc-prox.pdf}
}
@article{am-dhsrr-95,
keyent = {am-dhsrr-95},
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "Dynamic Half-Space Range Reporting and Its
Applications",
journal = "Algorithmica",
volume = 13,
year = 1995,
pages = "325--345",
keywords = "arrangements, cuttings, range-searching,
dynamization"
}
@InProceedings{am-fclra-01,
author = {D. Achlioptas and F. McSherry},
title = {Fast Computation of Low Rank Approximations},
booktitle = STOC_2001,
year = 2001,
note = {To appear in JACM}
}
@InProceedings{am-lsavd-02,
keyent = {am-lsavd-02},
author = {S. Arya and T. Malamatos},
title = {Linear-size approximate {Voronoi} diagrams},
booktitle = SODA_2002,
year = 2002,
pages = {147--155}
}
@article{am-rsss-94,
keyent = {am-rsss-94},
author = "P. K. Agarwal and J. Matou{\v s}ek",
title = "On range searching with semialgebraic sets",
journal = DCG,
volume = 11,
year = 1994,
pages = "393--418",
url = {http://citeseer.ist.psu.edu/agarwal94range.html}
}
@inproceedings{amm-seavd-02,
keyent = {amm-seavd-02},
author = "S. Arya and T. Malamatos and D. M. Mount",
title = "Space-efficient approximate {Voronoi} diagrams",
year = 2002,
booktitle = STOC_2002,
pages = {721--730}
}
@inproceedings{amn-rcgno-98,
author = {E. M. Arkin and J. S. B. Mitchell and G. Narasimhan},
title = {Resource-constrained geometric network optimization},
booktitle = SOCG_1998,
year = 1998,
pages = {307--316}
}
@Article{amnsw-oaann-98,
keyent = {amnsw-oaann-98},
author = {S. Arya and D. M. Mount and N. S. Netanyahu and
R. Silverman and A. Y. Wu},
title = {An optimal algorithm for approximate nearest
neighbor searching in fixed dimensions},
journal = JACM,
year = 1998,
volume = 45,
number = 6,
annote = 459,
pages = {891--923},
doi = {10.1145/293347.293348},
url = {http://www.cs.umd.edu/~mount/Papers/dist.pdf}
}
@article{amrt-sdarq-96,
keyent = {amrt-sdarq-96},
author = "A. Andersson and P. B. Miltersen and S. Riis and
M. Thorup",
title = "Static dictionaries on {$AC^0$} RAMs: Query time
$\Theta(\sqrt{\log n/ \log \log n})$ is necessary
and sufficient",
journal = FOCS_1996,
year = 1996,
pages = "441--450"
}
@inproceedings{ams-cmfal-94,
keyent = {ams-cmfal-94},
author = "P. K. Agarwal and J. Matou{\v s}ek and
O. Schwarzkopf",
title = "Computing Many Faces in Arrangements of Lines and
Segments",
booktitle = SOCG_1994,
year = 1994,
pages = "76--84",
url =
"ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-39.ps.gz"
}
@article{ams-cmfal-98,
keyent = {ams-cmfal-98},
author = "P. K. Agarwal and J. Matou{\v s}ek and
O. Schwarzkopf",
title = "Computing Many Faces in Arrangements of Lines and
Segments",
journal = SICOMP,
volume = 27,
number = 2,
year = 1998,
pages = "491--505",
url = {http://epubs.siam.org/sam-bin/dbq/article/26616}
}
@article{ams-fnmst-92,
keyent = {ams-fnmst-92},
author = "P. K. Agarwal and J. Matou{\v s}ek and S. Suri",
title = "Farthest neighbors, maximum spanning trees and
related problems in higher dimensions",
journal = CGTA,
volume = 1,
number = 4,
year = 1992,
pages = "189--201"
}
@article{ams-ltlpq-95,
author = "E. M. Arkin and J. S. B. Mitchell and S. Suri",
title = "Logarithmic-time link path queries in a simple
polygon",
journal = IJCGA,
volume = 5,
number = 4,
year = 1995,
pages = "369--395",
keywords = "link distance, shortest paths, geodesic paths"
}
@inproceedings{an-acnge-04,
author = {N. Alon and A. Naor},
title = {Approximating the cut-norm via Grothendieck's
inequality},
booktitle = STOC_2004,
year = 2004,
isbn = {1-58113-852-0},
pages = {72--80},
location = {Chicago, IL, USA},
doi = {10.1145/1007352.1007371}
}
@inproceedings{ap-aapc-00,
keyent = {ap-aapc-00},
author = "P. K. Agarwal and C. M. Procopiuc",
title = "Approximation Algorithms for Projective Clustering",
booktitle = SODA_2000,
year = 2000,
pages = "538--547"
}
@Article{ap-eaac-02,
keyent = {ap-eaac-02},
author = {P. K. Agarwal and C. M. Procopiuc},
title = {Exact and Approximation Algorithms for Clustering},
journal = {Algorithmica},
year = 2002,
volume = 33,
number = 2,
pages = {201--226},
url =
{http://link.springer.de/link/service/journals/00453/bibs/2033002/20330201.html}
}
@inproceedings{ap-eaac-98-old,
keyent = {ap-eaac-98-old},
author = "P. K. Agarwal and C. M. Procopiuc",
title = "Exact and Approximation Algorithms for Clustering",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "658--667"
}
@inproceedings{ap-eaamw-99,
keyent = {ap-eaamw-99},
author = {P. K. Agarwal and B. Aronov and M. Sharir},
title = {Exact and approximation algorithms for minimum-width
cylindrical shells},
booktitle = SODA_1999,
year = 2000,
note = "to appear"
}
@Book{apr-hmds-01,
keyent = {apr-hmds-01},
editor = {J. Abello and P. M. Pardalos and M. G.C. Resende},
title = {Handbook of Massive Data Sets},
publisher = {Kluwer Academic Publishers},
year = 2001,
note = {to appear}
}
@inproceedings{apv-aaklc-02,
keyent = {apv-aaklc-02},
author = {P. K. Agarwal and C. M. Procopiuc and
K. R. Varadarajan},
title = {Approximation algorithms for {$k$}-line center},
year = 2002,
booktitle = ESA_2002,
pages = {54--63},
url =
{http://link.springer.de/link/service/series/0558/bibs/2461/24610054.htm}
}
@inproceedings{ar-ppopm-90,
keyent = {ar-ppopm-90},
author = "R. Alexander and N. Rowe",
title = "Path Planning by Optimal-Path-Map Construction for
Homogeneous-Cost Two-Dimensional Regions",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
year = 1990
}
@inproceedings{arr-asekm-98,
keyent = {arr-asekm-98},
author = "S. Arora and P. Raghavan and S. Rao",
title = "Approximation schemes for {Euclidean} {$k$}-median and
related problems",
booktitle = STOC_1998,
year = 1998,
pages = "106--113"
}
@incollection{as-aa-00,
author = {P.~K. Agarwal and M.~Sharir},
editor = {J.-R. Sack and J.~Urrutia},
title = {Arrangements and their applications},
booktitle = {Handbook of Computational Geometry},
year = 2000,
pages = {49--119},
publisher = {North-Holland Publishing Co.},
address = {Amsterdam},
url = {http://www.cs.duke.edu/~pankaj/papers/arrangement-survey.ps.gz}
}
@article{as-eago-98,
author = "P. K. Agarwal and M. Sharir",
title = "Efficient algorithms for geometric optimization",
journal = "ACM Comput. Surv.",
volume = 30,
year = 1998,
pages = "412--458",
url = {http://www.cs.duke.edu/~pankaj/papers/geom-full.ps.gz}
}
@article{as-erasg-96,
keyent = {as-erasg-96},
author = "P. K. Agarwal and M. Sharir",
title = "Efficient Randomized Algorithms for Some Geometric
Optimization Problems",
journal = DCG,
volume = 16,
year = 1996,
pages = "317--337",
url =
{http://link.springer.de/link/service/journals/00454/bibs/16n4p317.html}
}
@inproceedings{as-mpbpo-99,
keyent = {as-mpbpo-99},
author = "P. K. Agarwal and M. Sharir",
title = "Motion planning of a ball amid polyhedral obstacles
in three dimensions",
booktitle = SODA_1999,
year = 1999,
pages = "21--30"
}
@inproceedings{as-pckum-99,
keyent = {as-pckum-99},
author = "P. K. Agarwal and M. Sharir",
title = "Pipes, cigars, and kreplach: The union of
{M}inkowski sums in three dimensions",
booktitle = SOCG_1999,
year = 1999,
pages = "143--153"
}
@Article{as-pckums-00,
keyent = {as-pckums-00},
author = {P. K. Agarwal and M. Sharir},
title = {Pipes, Cigars, and Kreplach: The Union of Minkowski
Sums in Three Dimensions},
journal = DCG,
year = 2000,
volume = 24,
pages = {645--657}
}
@inproceedings{as-pckums-99,
keyent = {as-pckums-99},
author = {P. K. Agarwal and M. Sharir},
title = {Pipes, Cigars, and Kreplach: The Union of Minkowski
Sums in Three Dimensions},
booktitle = SOCG_1999,
pages = "143--153",
year = 1999
}
@Book{as-pm-00,
keyent = {as-pm-00},
author = {N. Alon and J. H. Spencer},
title = {The Probabilistic Method},
publisher = {Wiley InterScience},
year = 2000,
edition = {2nd},
url =
{http://www.cs.nyu.edu/cs/faculty/spencer/nogabook/nogabook.html}
}
@InCollection{as-rago-99,
keyent = {as-rago-99},
author = {P. K. Agarwal and S. Sen},
title = {Randomized algorithms for geometric optimization},
booktitle = {Handbook of Randomized Computation},
publisher = {Kluwar Academic Press},
year = 1999,
editor = {J. Pardalos and S. Rajasekaran and J. Reif and
J. Rolim},
note = {to appear}
}
@article{as-rbida-90,
keyent = {as-rbida-90},
author = "P. K. Agarwal and M. Sharir",
title = "Red-blue intersection detection algorithms, with
applications to motion planning and collision
detection",
journal = SICOMP,
volume = 19,
number = 2,
year = 1990,
pages = "297--321"
}
@article{as-rsacp-96i,
keyent = {as-rsacp-96i},
author = "P. K. Agarwal and M. Sharir",
title = "Ray shooting amidst convex polygons in {2D}",
journal = JALG,
volume = 21,
year = 1996,
pages = "508--519"
}
@inproceedings{as-sagp-94,
keyent = {as-sagp-94},
booktitle = SODA_1994,
year = 1994,
pages = "24--33",
keywords = "triangulation, ray shooting"
}
@Article{as-sagp-98,
keyent = {as-sagp-98},
author = "P. K. Agarwal and S. Suri",
title = "Surface Approximation and Geometric Partitions",
journal = SICOMP,
year = 1998,
pages = {1016--1035},
volume = 27,
number = 4
}
@article{ass-ctsp-93,
author = "B. Aronov and R. Seidel and D. Souvaine",
title = "On compatible triangulations of simple polygons",
journal = CGTA,
volume = 3,
number = 1,
year = 1993,
pages = "27--35",
keywords = "polygon, triagulation"
}
@article{ass-oleia-96,
keyent = {ass-oleia-96},
author = "P. K. Agarwal and O. Schwarzkopf and M. Sharir",
title = "The overlay of lower envelopes and its applications",
journal = DCG,
volume = 15,
year = 1996,
pages = "1--13",
url =
"http://link.springer.de/link/service/journals/00454/bibs/15n1p1.html"
}
@book{ass-sicp-95,
keyent = {ass-sicp-95},
author = "H. Abelson and G. J. Sussman and J. Sussman",
title = "Structure and interpretation of computer programs",
year = 1996,
publisher = "MIT Press"
}
@article{assc-wsns-02,
keyent = {assc-wsns-02},
author = {I. F. Akyildiz and W. Su and Y. Sankarasubramaniam
and E. Cayirci},
title = {Wireless sensor networks: A survey},
journal = {Computer Networks},
pages = {393--422},
year = 2002
}
@article{ast-apsgo-94,
keyent = {ast-apsgo-94},
author = "P. K. Agarwal and M. Sharir and S. Toledo",
title = "Applications of parametric searching in geometric
optimization",
journal = JALG,
volume = 17,
year = 1994,
pages = "292--318",
keywords = "parametric search"
}
@inproceedings{asw-d2cp-97,
keyent = {asw-d2cp-97},
author = "P. K. Agarwal and M. Sharir and E. Welzl",
title = "The Discrete {$2$}-Center Problem",
booktitle = SOCG_1997,
year = 1997,
pages = "147--155"
}
@inproceedings{av-atlrc-99,
author = "R. Arriaga and S. Vempala",
title = "An algorithmic theory of learning: robust concepts
and random projection",
booktitle = FOCS_1999,
pages = "616--623",
year = 1999,
}
@article{av-iocsr-88,
keyent = {av-iocsr-88},
author = "A. Aggarwal and J. S. Vitter",
title = "The input/output complexity of sorting and related
problems",
journal = "Commun. ACM",
volume = 31,
year = 1988,
pages = "1116--1127"
}
@InProceedings{av-ioedp-00,
author = {L. Arge and J. Vahrenhold},
title = {{I/O}-Efficient Dynamic Planar Point Location},
booktitle = SOCG_2000,
pages = {191--200},
year = 2000,
}
@InProceedings{avv-emapl-95,
author = {L. Arge and D. E. Vengroff and J. S. Vitter},
title = {External-Memory Algorithms for Processing Line
Segments in Geographic Information Systems},
booktitle = ESA_1995,
pages = {295--310},
year = 1995
}
@inproceedings{awypp-fapc-99,
keyent = {awypp-fapc-99},
author = "C. C. Aggarwal and J. L. Wolf and P. S. Yu and
C. Procopiuc and J. S. Park",
title = "Fast algorithms for projected clustering",
booktitle = {SIGMOD 99},
pages = "61--72",
year = 1999,
}
@inproceedings{b-aamtm-98,
keyent = {b-aamtm-98},
author = {Y. Bartal},
title = {On approximating arbitrary metrics by tree metrics},
booktitle = STOC_1998,
year = 1998,
isbn = {0-89791-962-9},
pages = {161--168},
location = {Dallas, Texas, United States},
doi = {10.1145/276698.276725}
}
@book{b-acc-02,
keyent = {b-acc-02},
AUTHOR = {A. Barvinok},
TITLE = {A course in convexity},
SERIES = {Graduate Studies in Mathematics},
VOLUME = 54,
PUBLISHER = AMS,
YEAR = 2002,
PAGES = {x+366},
url =
{http://www.ams.org/bookstore?fn=20&arg1=gsmseries&item=GSM-54}
}
@inproceedings{b-eatdd-98,
keyent = {b-eatdd-98},
author = {S. N. Bespamyatnikh},
title = {An efficient algorithm for the three-dimensional
diameter problem},
pages = {136--147},
year = 1998,
booktitle = SODA_1998
}
@book{b-eimcg-97,
keyent = {b-eimcg-97},
author = {K. Ball},
title = {An Elementary Introduction to Modern Convex
Geometry},
booktitle = {Flavors of geometry},
publisher = {Cambridge Univ. Press},
year = 1997,
volume = {MSRI Publ. 31},
url =
{http://msri.org/publications/books/Book31/files/ball.pdf},
note =
{\url{http://msri.org/publications/books/Book31/files/ball.pdf}}
}
@book{b-h-89,
keyent = {b-h-89},
author = "C. Berge",
title = "Hypergraphs",
publisher = "North Holland",
year = 1989
}
@article{d-ibucf-08,
author = {M. de Berg},
title = {Improved Bounds on the Union Complexity of Fat
Objects},
journal = DCG,
volume = 40,
number = 1,
year = 2008,
pages = {127--140},
}
@inproceedings{b-ibucf-05,
author = {M. de Berg},
title = {Improved Bounds on the Union Complexity of Fat
Objects},
booktitle = FSTTCS_2005,
year = 2005,
pages = {116--127},
}
@InProceedings{b-isvdu-02,
keyent = {b-isvdu-02},
author = {M.E. Brand},
title = {Incremental Singular Value Decomposition of
Uncertain Data with Missing Values},
booktitle = {Euro. Conf. Comp. Vision (ECCV)},
volume = 2350,
pages = {707--720},
year = 2002,
series = LNCS
}
@inproceedings{b-lbact-83,
keyent = {b-lbact-8},
author = "M. {Ben-Or}",
title = "Lower bounds for algebraic computation trees",
booktitle = STOC_1983,
year = 1983,
pages = "80--86",
url =
{http://portal.acm.org/citation.cfm?id=808735&jmp=indexterms&dl=GUIDE&dl=ACM}
}
@article{b-lefms-85,
keyent = {b-lefms-85},
AUTHOR = {J. Bourgain},
TITLE = {On {L}ipschitz embedding of finite metric spaces in
{H}ilbert space},
JOURNAL = {Israel J. Math.},
FJOURNAL = {Israel Journal of Mathematics},
VOLUME = 52,
YEAR = 1985,
NUMBER = {1-2},
PAGES = {46--52},
ISSN = {0021-2172},
CODEN = {ISJMAP},
MRCLASS = {46B99 (05C80 58B05)},
MRNUMBER = {87b:46017},
MRREVIEWER = {Michel Deza},
}
@article{b-lsbsp-00,
author = "M. de~Berg",
title = "Linear size binary space partitions for uncluttered
scenes",
journal = "Algorithmica",
volume = 28,
year = 2000,
pages = "353--366"
}
@Book{b-mgt-98,
keyent = {b-mgt-98},
author = {B. Bollobas},
title = {Modern Graph Theory},
publisher = {Springer-Verlag},
year = 1998
}
@inproceedings{b-oafsi-95,
keyent = {b-oafsi-95},
author = "I. J. Balaban",
title = "An Optimal Algorithm for Finding Segment
Intersections",
booktitle = SOCG_1995,
year = 1995,
pages = "211--219"
}
@article{b-ogppl-02,
keyent = {b-ogppl-02},
author = {A.~Brieden},
journal = {DCG},
title = {Geometric optimization problems likely not contained
in APX},
year = 2002,
pages = {201--209},
volume = 28,
number = 2
}
@Unpublished{b-ombp-01,
keyent = {b-ombp-01},
author = {S. N. Bespamyatnikh},
title = {An optimal morphing between polylines},
note = {Submitted to IJCGA},
year = 2001
}
@article{b-ombp-02,
author = {S. Bespamyatnikh},
title = {An Optimal Morphing Between Polylines},
journal = IJCGA,
volume = 12,
number = 3,
year = 2002,
pages = {217--228}
}
@InProceedings{b-pamsa-96,
keyent = {b-pamsa-96},
title = {Probabilistic approximations of metric space and its
algorithmic application},
author = {Y. Bartal},
pages = {183--193},
year = 1996,
booktitle = FOCS_1996,
month = oct
}
@InProceedings{b-rcd-97,
keyent = {b-rcd-97},
author = {A. Z. Broder},
title = {On the resemblance and containment of documents},
booktitle = {Compress. Complex. Sequences (SEQUENCES'97)},
pages = {21--29},
year = 1997
}
@inproceedings{bah-rwc-99,
keyent = {bah-rwc-99},
author = "A. {Bremler-Barr} and Y. Afek and S. {Har-Peled}",
title = "Routing with a Clue",
booktitle = "Ann. Conf. on Data Comm. (SIGCOMM)",
nickname = "SIGCOMM '99",
pages = "203--214",
year = 1999,
doi = {10.1145/316188.316223},
acceptrate = SIGCOMM_1999_AR
}
@Unpublished{bar-pc-96,
keyent = {bar-pc-96},
author = {I. B{\'a}r{\'a}ny},
title = {personal communication},
year = 1996
}
@inproceedings{bbbkk-fpssm-97,
keyent = {bbbkk-fpssm-97},
author = "S. Berchtold and C. B{\"o}hm and B. Barunm{\"u}ller
and D. A. Keim and H.-P. Kriegel",
title = "Fast parallel similarity search in multimedia
databases",
booktitle = SIGMOD,
year = 1997,
pages = "1--12"
}
@article{bbbrw-ccmwa-98,
keyent = {bbbrw-ccmwa-98},
author = "M. de Berg and P. Bose and D. Bremner and
S. Ramaswami and G. Wilfong",
title = "Computing Constrained Minimum-Width Annuli of Point
Sets",
journal = "Comput. Aided Design",
volume = 30,
number = 4,
year = 1998,
pages = "267--275"
}
@inproceedings{bbcm-aadtv-04,
author = {N. Bansal and A. Blum and S. Chawla and A. Meyerson},
title = {Approximation algorithms for deadline-{TSP} and
vehicle routing with time-windows.},
booktitle = STOC_2004,
year = 2004,
pages = {166--174},
}
@Unpublished{bbks-mfl-01,
keyent = {bbks-mfl-01},
author = {S. Bespamyatnikh and B. Bhattacharya and
D. Kirkpatrick and M. Segal},
title = {Mobile Facility Location},
note = {appeared in Dial M for mibility},
year = 2001,
annote = {{613}}
}
@inproceedings{bbp-iayed-98scg,
keyent = {bbp-iayed-98scg},
author = "H. Br{\"o}nnimann and C. Burnikel and S. Pion",
title = "Interval Arithmetic Yields Efficient Dynamic Filters
for Computational Geometry",
booktitle = SOCG_1998,
year = 1998,
pages = "165--174"
}
@inproceedings{bbw-cfdsp-06,
author = {K. Buchin and M. Buchin and C. Wenk},
title = {Computing the {\Frechet} distance between simple
polygons in polynomial time},
booktitle = SOCG_2006,
year = 2006,
pages = {80--87},
location = {Sedona, Arizona, USA}
}
@unpublished{bc-ocsb-03,
keyent = {bc-ocsb-03},
author = {M. \Badoiu{} and K. L. Clarkson},
title = {Optimal Coresets for Balls},
note =
{\url{http://cm.bell-labs.com/who/clarkson/coresets2.pdf}},
year = 2003,
url = {http://cm.bell-labs.com/who/clarkson/coresets2.pdf}
}
@inproceedings{bc-scsb-03,
keyent = {bc-scsb-03},
author = "M. B\u{a}doiu and K. Clarkson",
title = "Smaller coresets for balls",
pages = "801--802",
booktitle = SODA_2003,
year = 2003,
url = {http://cm.bell-labs.com/who/clarkson/coresets2.pdf}
}
@article{bcdkt-cmotc-98,
keyent = {bcdkt-cmotc-98},
author = "M. de~Berg and O. Cheong and O. Devillers and M. van
Kreveld and M. Teillaud",
title = "Computing the Maximum Overlap of Two Convex Polygons
Under Translations",
journal = TCS,
volume = 31,
year = 1998,
pages = "613--628",
url =
{http://link.springer-ny.com/link/service/journals/00224/bibs/31n5p613.html}
}
@inproceedings{bcgkov-maotu-04,
title = "Maximizing the Area of Overlap of Two Unions of
Disks Under Rigid Motion",
author = "M. de~Berg and S. Cabello and P. Giannopoulos and
C. Knauer and R. van~Oostrum and R. C. Veltkamp",
booktitle = "Scandinavian Workshop on Algorithms",
year = 2004,
series = "LNCS",
volume = 3111,
pages = "138--149"
}
@article{bcgmt-bthrs-96,
keyent = {bcgmt-bthrs-96},
author = "G. Barequet and B. Chazelle and L. J. Guibas and
J. S.B. Mitchell and A. Tal",
title = "{BOXTREE}: {A} Hierarchical Representation for
Surfaces in {3D}",
journal = "Comput. Graph. Forum",
volume = 15,
number = 3,
year = 1996,
pages = "C387--C396, C484",
note = "Proc.\ Eurographics'96"
}
@Article{bchl-clcvf-95,
keyent = {bchl-clcvf-95},
author = {S. {Ben-David} and N. {Cesa-Bianchi} and D. Haussler
and P. Long},
title = {Characterizations of Learnability for Classes of
{${0,...,n}$}- valued Functions},
journal = JCSS,
year = 1995,
volume = 50,
number = 1,
pages = {74--86}
}
@inproceedings{bcklm-aaodr-03,
author = {A. Blum and S. Chawla and D. R. Karger and T. Lane
and A. Meyerson and M. Minkoff},
title = {Approximation Algorithms for Orienteering and
Discounted-Reward {TSP}},
booktitle = FOCS_2003,
year = 2003,
pages = {46--55},
}
@article{bcp-hhihr-93,
keyent = {bcp-hhihr-93},
author = "H. Br{\"o}nnimann and B. Chazelle and J. Pach",
title = "How hard is halfspace range searching?",
journal = DCG,
volume = 10,
year = 1993,
pages = "143--155"
}
@inproceedings{bcr-eseco-02,
author = {M. Bender and R. Cole and R. Raman},
title = {Exponential structures for efficient cache-oblivious
algorithms},
booktitle = ICALP_2002,
series = {LNCS},
volume = 2380,
year = 2002,
pages = {195--207},
publisher = {Springer-Verlag},
address = {Berlin},
}
@InProceedings{bdf-cobt-00,
author = {M. A. Bender and E. D. Demaine and M. Farach-Colton},
title = {Cache-Oblivious {B}-Trees},
booktitle = FOCS_2000,
pages = {339--409},
year = 2000,
}
@inproceedings{bdh-abpfe-97old,
keyent = {bdh-abpfe-97old},
author = "K.-F. B{\"o}hringer and B. Donald and D. Halperin",
title = "The Area Bisectors of a Polygon and Force Equilibria
in Programmable Vector Fields",
booktitle = SOCG_1997,
year = 1997,
pages = "457--459"
}
@article{bdh-abpfe-99,
keyent = {bdh-abpfe-99},
author = "K.-F. B{\"o}hringer and B. Donald and D. Halperin",
title = "The Area Bisectors of a Polygon and Force Equilibria
in Programmable Vector Fields",
journal = DCG,
volume = 22,
number = 2,
year = 1999,
pages = "269--285",
}
@inproceedings{bdiz-pacfm-97,
keyent = {bdiz-pacfm-97},
author = "J. Basch and H. Devarajan and P. Indyk and L. Zhang",
title = "Probabilistic Analysis for Combinatorial Functions
of Moving Points",
booktitle = SOCG_1997,
year = 1997,
pages = "442--444"
}
@techreport{bds-lric-94t,
keyent = {bds-lric-94t},
author = "M. de Berg and K. Dobrindt and O. Schwarzkopf",
title = "On Lazy Randomized Incremental Construction",
type = "Tech.\ {Report}",
number = "UU-CS-1991-12",
institution = "Dept. Comput. Sci., Utrecht Univ.",
address = "Utrecht, Netherlands",
month = mar,
year = 1994,
url =
"ftp://ftp.cs.ruu.nl/pub/RUU/CS/techreps/CS-1994/1994-12.ps.gz",
keywords = "vertical decomposition, trapezoidal map, point
location",
annote = 11
}
@article{bds-lric-95,
keyent = {bds-lric-95},
author = "M. de Berg and K. Dobrindt and O. Schwarzkopf",
title = "On lazy randomized incremental construction",
journal = DCG,
volume = 14,
year = 1995,
pages = "261--286",
url = {http://www.inria.fr/rrrt/rr-2262.html}
}
@InCollection{be-aagp-97,
keyent = {be-aagp-97},
author = {M. Bern and D. Eppstein},
editor = {D. S. Hochbaum},
title = {Approximation algorithms for geometric problems},
booktitle = {Approximationg algorithms for {NP}-Hard problems},
pages = {296--345},
publisher = {PWS Publishing Company},
year = 1997
}
@article{beg-pgmg-94,
keyent = {beg-pgmg-94},
author = "M. Bern and D. Eppstein and J. Gilbert",
title = "Provably good mesh generation",
journal = "J. Comput. Syst. Sci.",
volume = 48,
year = 1994,
pages = "384--409"
}
@inproceedings{bvig-psfnd-91,
author = "C. Bennis and J.-M. V{\'e}zien and G. Igl{\'e}sias
and A. Gagalowicz",
title = "Piecewise surface flattening for non-distorted
texture mapping",
booktitle = SIGGRAPH_1991,
volume = 25,
editor = "Thomas W. Sederberg",
pages = "237--246",
year = 1991
}
@article{bes-agpct-05,
author = {R. {Bar-Yehuda} and G. Even and S. Shahar},
title = {On approximating a geometric prize-collecting
traveling salesman problem with time windows},
journal = {J. Algorithms},
volume = 55,
number = 1,
year = 2005,
issn = {0196-6774},
pages = {76--92}
}
@article{bet-pcqqt-99,
author = "M. Bern and D. Eppstein and S.-H. Teng",
title = "Parallel Construction of Quadtrees and Quality
Triangulations",
journal = IJCGA,
volume = 9,
number = 6,
year = 1999,
pages = "517--532"
}
@inproceedings{bf-laps-02-old,
keyent = {bf-laps-02-old},
author = {M. A. Bender and M. {Farach-Colton}},
title = {The Level Ancestor Problem Simplified},
booktitle = {Proceedings of the 5th Latin American Symposium on
Theoretical Informatics},
year = 2002,
isbn = {3-540-43400-3},
pages = {508--515},
publisher = {Springer-Verlag},
}
@article{bf-laps-04,
keyent = {bf-laps-04},
title = {The Level Ancestor Problem simplified},
author = {M. A. Bender and M. Farach-Colton},
journal = TCS,
volume = 321,
number = 1,
pages = {5--12},
year = 2004
}
@inproceedings{bf-lpr-00,
keyent = {bf-lpr-00},
author = {M. A. Bender and M. {Farach-Colton}},
title = {The LCA Problem Revisited},
booktitle = {Proc. 4th Latin Amer. Symp. on Theor. Info.},
year = 2000,
isbn = {3-540-67306-7},
pages = {88--94},
publisher = {Springer-Verlag},
url = {http://www.cs.sunysb.edu/~bender/pub/lca.ps}
}
@InProceedings{bfj-costb-02,
author = {G. S. Brodal and R. Fagerberg and R. Jacob},
title = {Cache Oblivious Search Trees via Binary Trees of
Small Height},
booktitle = SODA_2002,
pages = {39--48},
year = 2002,
}
@article{bfp-aach-82,
keyent = {bfp-aach-82},
author = "J. L. Bentley and G. M. Faust and F. P. Preparata",
title = "Approximation algorithms for convex hulls",
journal = CACM,
volume = 25,
year = 1982,
pages = "64--68"
}
@article{bfprt-tbs-73,
author = {M. Blum and R. W. Floyd and V. R. Pratt and
R. L. Rivest and R. E. Tarjan},
title = {Time Bounds for Selection.},
journal = JCSS,
volume = 7,
number = 4,
year = 1973,
pages = {448--461}
}
@article{bg-aoscf-95,
keyent = {bg-aoscf-95},
author = "H. Br{\"o}nnimann and M. T. Goodrich",
title = "Almost Optimal Set Covers in Finite {VC}-Dimension",
journal = DCG,
volume = 14,
year = 1995,
pages = "463--479"
}
@inproceedings{bgh-dsmd-97-old,
keyent = {bgh-dsmd-97-old},
author = "J. Basch and L. J. Guibas and J. Hershberger",
title = "Data Structures for Mobile Data",
booktitle = SODA_1997,
year = 1997,
pages = "747--756",
url =
{http://graphics.stanford.edu/~jbasch/publications/kinetic/}
}
@article{bgh-dsmd-99,
keyent = {bgh-dsmd-99},
author = "J. Basch and L. J. Guibas and J. Hershberger",
title = "Data Structures for Mobile Data",
journal = JALG,
year = 1999,
pages = "1--28",
volume = 31,
number = 1,
url =
{http://graphics.stanford.edu/~jbasch/publications/kinetic/}
}
@Article{bgk-ccnm-90,
keyent = {bgk-ccnm-90},
author = {H.~L.~Bodlaender and P.~Gritzmann and V.~Klee and
J. van Leeuwen},
title = {The computational complexity of norm-maximization},
journal = {Combinatorica},
year = 1990,
volume = 10,
pages = {203--225}
}
@InCollection{bgk-isgqo-00,
keyent = {bgk-isgqo-00},
author = {A. Brieden and P. Gritzmann and V. Klee},
title = {Inapproximability of some geometric and quadratic
optimization problems},
booktitle = {Approximation and Complexity in Numerical
Optimization: Continuous and Discrete Problems},
pages = {96--115},
publisher = {Kluwer},
year = 2000,
editor = {P. M. Pardalos}
}
@inproceedings{bgkkls-adrdh-98,
keyent = {bgkkls-adrdh-98},
author = {A. Brieden and P. Gritzmann and R. Kannan and
V. Klee and L. Lov{\'a}sz and M. Simonovits},
title = {Approximation of Diameters: Randomization Doesn't
Help},
booktitle = FOCS_1998,
pages = {244--251},
year = 1998,
note = {Note: They show that under an oracle model
approximating any of the diameters of a convex body
can not be done to better than {$O(n /\log{n})$},
where $n$ is the dimensions}
}
@inproceedings{bgkov-maotu-03,
keyent = {bgkov-maotu-03},
author = "M. de Berg and P. Giannopoulos and C. Knauer and
R. van Oostrum and R. C. Veltkamp",
title = "Maximizing the area of overlap of two unions of
convex homothets under translation",
booktitle = "Scandinavian Workshop on Algorithms",
year = 2004,
series = "LNCS",
volume = 3111,
pages = "138--149"
}
@Article{bgr-rrbit-03,
keyent = {bgr-rrbit-03},
author = "J. Basch and L. J. Guibas and G. D. Ramkumar",
title = "Reporting red-blue intersections between two sets of
connected line segments",
journal = ALGORITHMICA,
year = 2003,
volume = 35,
pages = {1--20},
url =
"http://link.springer-ny.com/link/service/journals/00453/contents/02/0967/"
}
@inproceedings{bgr-rrbit-96-conf,
keyent = {bgr-rrbit-96-conf},
author = "J. Basch and L. J. Guibas and G. D. Ramkumar",
title = "Reporting red-blue intersections between two sets of
connected line segments",
booktitle = ESA_1996,
series = LNCS,
volume = 1136,
publisher = "Springer-Verlag",
year = 1996,
pages = "302--319"
}
@inproceedings{bgr-sllsh-97,
keyent = {bgr-sllsh-97},
author = "J. Basch and L. J. Guibas and G. Ramkumar",
title = "Sweeping Lines and Line Segments with a Heap",
booktitle = SOCG_1997,
year = 1997,
pages = "469--472"
}
@inproceedings{bgsz-pekds-97,
keyent = {bgsz-pekds-97},
author = "J. Basch and L. J. Guibas and C. Silverstein and
L. Zhang",
title = "A practical evaluation of kinetic data structures",
booktitle = SOCG_1997,
year = 1997,
pages = "388--390"
}
@Article{bh-eamvb-01,
keyent = {bh-eamvb-01},
author = {G. Barequet and S. {Har-Peled}},
journal = {J. Algorithms},
title = {Efficiently Approximating the Minimum-Volume
Bounding Box of a Point Set in Three Dimensions},
volume = 38,
issue = 1,
pages = {91--109},
year = 2001,
url =
{http://cs.uiuc.edu/~sariel/research/papers/98/bbox.html}
}
@inproceedings{bh-eamvb-99-conf,
keyent = {bh-eamvb-99-conf},
author = {G. Barequet and S. {Har-Peled}},
title = {Efficiently Approximating the Minimum-Volume
Bounding Box of a Point Set in Three Dimensions},
booktitle = SODA_1999,
acceptrate = SODA_1999_AR,
year = 1999,
pages = {82--91},
url = {http://dl.acm.org/citation.cfm?id=314500.314536}
}
@article{bh-hofca-86,
keyent = {bh-hofca-86},
author = "J. Barnes and P. Hut",
title = "A hierarchical {$O(n \log n)$} force-calculation
algorithm",
journal = "Nature",
volume = 324,
number = 4,
month = dec,
year = 1986,
pages = "446--449"
}
@article{bh-pctmh-01,
keyent = {bh-svpcm-99},
author = {G. Barequet and S. {Har-Peled}},
title = {POLYGON CONTAINMENT AND TRANSLATIONAL
MIN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE
3SUM-HARD},
journal = IJCGA,
pages = {465--474},
volume = 11,
number = 4,
year = 2001
}
@article{bh-svdtv-03,
author = "M. Baumann and U. Helmke",
title = "Singular value decomposition of time-varying
matrices",
journal = "Future Gen. Comp. Sys.",
volume = 19,
year = 2003,
pages = "353--361",
}
@inproceedings{bh-svpcm-99,
keyent = {bh-svpcm-99},
author = {G. Barequet and S. {Har-Peled}},
title = {Polygon-containment and Translational
min-{Hausdorff}-Distance between segment Sets are
{3SUM}-hard},
booktitle = SODA_1999,
acceptrate = SODA_1999_SHORT_AR,
url = {http://dl.acm.org/citation.cfm?id=314500.314973},
pages = {862--863},
year = 1999
}
@inproceedings{bhi-accs-02,
keyent = {bhi-accs-02},
title = {Approximate Clustering via Coresets},
author = {M. B\u{a}doiu and S. {Har-Peled} and P. Indyk},
booktitle = STOC_2002,
acceptrate = STOC_2002_AR,
year = 2002,
pages = {250--257},
url =
{http://cs.uiuc.edu/~sariel/research/papers/02/coreset/}
}
@Unpublished{bi-faahf-06,
author = {M. \Badoiu{} and P. Indyk},
title = {Fast approximation algorithms for the hyperplace
fitting problem},
note = {manuscript},
year = 2006
}
@Article{bi-tacsp-76,
keyent = {bi-tacsp-76},
author = {E. M. Bronshteyn and L. D. Ivanov},
title = {The Approximation of Convex Sets by Polyhedra},
journal = {Siberian Math. J.},
year = 1976,
volume = 16,
pages = {852--853}
}
@misc{birs-aaeild-04,
keyent = {birs-aaeild-04},
title = {Approximation algorithms for embedding into
low-dimensional spaces},
author = {M. B\u{a}doiu and P. Indyk and Y. Rabinovich and
A. Sidiropoulos},
year = 2004,
note = {manuscript}
}
@InProceedings{bj-dpch-02,
keyent = {bj-dpch-02},
author = {G. S. Brodal and R. Jacob},
title = {Dynamic Planar Convex Hull},
booktitle = FOCS_2002,
year = 2002,
pages = {617--626}
}
@InProceedings{bj-dpcho-00,
keyent = {bj-dpcho-00},
author = {G. Brodal and R. Jacob},
title = {Dynamic Planar Convex Hull with Optimal Query Time
and {$O(\log n\cdot\log\log n)$} Update Time},
pages = "57--70",
booktitle = SWAT_2000,
year = 2000
}
@inproceedings{bj-fmrtc-85,
author = {S. W. Bent and J. W. John},
title = {Finding the median requires {$2n$} comparisons},
booktitle = STOC_1985,
year = 1985,
pages = {213--216}
}
@misc{bkl-ctnn-04,
keyent = {bkl-ctnn-04},
title = {Cover trees for nearest neighbor},
author = {A. beygelzimer and S. kakade and J. Langford},
year = 2004,
}
@inproceedings{bkss-rtera-90,
keyent = {bkss-rtera-90},
author = "N. Beckmann and H.-P. Kriegel and R. Schneider and
B. Seeger",
title = "The {R$^*$}-tree: {An} efficient and robust access
method for points and rectangles",
booktitle = SIGMOD,
year = 1990,
pages = "322--331"
}
@inproceedings{bkss-trter-90,
keyent = {bkss-trter-90},
title = "The {R}{$^*$}-tree: An efficient and robust access
method for points and rectangles",
author = "N. Beckmann and H.-P. Kriegel and R. Schneider and
B. Seeger",
pages = {322--331},
year = 1990,
booktitle = "ACM SIGMOD Int.\ Conf.\ on Manag.\ of Data"
}
@article{bkst-anmsv-78,
keyent = {bkst-anmsv-78},
author = "J. L. Bentley and H. T. Kung and M. Schkolnick and
C. D. Thompson",
title = "On the average number of maxima in a set of vectors
and applications",
journal = JACM,
volume = 25,
year = 1978,
pages = "536--543"
}
@ARTICLE{bksv-rimga-02,
author = {M. de Berg and M. J. Katz and {A. F.} {van~der}
Stappen and J. Vleugels},
title = {Realistic Input Models for Geometric Algorithms},
year = 2002,
journal = ALGORITHMICA,
volume = "34",
number = "1",
pages = {81--97},
doi = "10.1007/s00453-002-0961-x"
}
@inproceedings{bksv-rimga-97-conf,
keyent = {bksv-rimga-97},
author = "M. de Berg and M. J. Katz and {A. F. van~der}
Stappen and J. Vleugels",
title = "Realistic Input Models for Geometric Algorithms",
booktitle = SOCG_1997,
year = 1997,
pages = "294--303"
}
@article{bl-chip-96,
keyent = {bl-chip-96},
author = "I. B{\'a}r{\'a}ny and D. G. Larman",
title = "The Convex Hull of the integer points of a large
ball",
journal = {Math. Ann.},
volume = 312,
number = 1,
pages = {167--181},
year = 1998,
annote = 200
}
@book{bl-gnfa-00,
keyent = {bl-gnfa-00},
author = {Y. Benyamini and J. Lindenstrauss},
title = {geometric nonlinear functional analysis},
year = 2000,
publisher = AMS,
}
@article{bl-tchot-98,
keyent = {bl-tchot-98},
author = "I. B{\'a}r{\'a}ny and D. G. Larman",
title = {The convex hull of the integer points in a large
ball},
journal = {Math annalen},
number = 312,
pages = {167--181},
year = 1998
}
@Article{blmn-omrtp-04,
keyent = {blmn-omrtp-04},
author = {Y. Bartal and N. Linial and M. Mendel and A. Naor},
title = {On Metric Ramsey-type Phenomena},
journal = "Annals of Math.",
year = 2004,
pages = {To appear},
note = {arXiv:math.MG/0406353}
}
@Unpublished{bm-cdps-01,
keyent = {bm-cdps-01},
author = {J.-D. Boissonnat and G. Malandain},
title = {Computing the diameter of a point set},
note = {submitted to SoCG 2001 applied track and rejected},
year = 2001,
annote = {{699}}
}
@article{bm-ngrnd-58,
keyent = {bm-ngrnd-58},
mmnr = 1018,
author = "G. E.P. Box and M. E. Muller",
title = "A note on the generation of random normal deviates",
journal = "Ann. Math. Stat.",
volume = 28,
pages = "610-611",
year = 1958
}
@inproceedings{bm-rpdra-01,
author = "E. Bingham and H. Mannila",
title = "Random projection in dimensionality reduction:
applications to image and text data",
booktitle = "Proc. 7th ACM SIGKDD Intl. Conf. Knowl. Disc. Data
Mining",
pages = "245--250",
year = 2001
}
@article{bn-ledrd-03,
author = "M. Belkin and P. Niyogi",
title = "Laplacian Eigenmaps for Dimensionality Reduction and
Data Representation",
journal = "Neural Computation",
volume = "15(6)",
pages = "1373--1396",
year = 2003,
}
@article{bo-arcgi-79,
keyent = {bo-arcgi-79},
author = "J. L. Bentley and T. A. Ottmann",
title = "Algorithms for reporting and counting geometric
intersections",
journal = "IEEE Trans. Comput.",
volume = "C-28",
number = 9,
month = sep,
year = 1979,
pages = "643--647",
}
@inproceedings{bor-saacp-99,
keyent = {bor-saacp-99},
author = "A. Borodin and R. Ostrovsky and Y. Rabani",
title = "Subquadratic Approximation Algorithms For clustering
Problems in High Dimensional Spaces",
booktitle = STOC_1999,
pages = "312--321",
year = 1999
}
@article{bos-cvdo-94,
keyent = {bos-cvdo-94},
author = "M. de Berg and M. H. Overmars and O. Schwarzkopf",
title = "Computing and verifying depth orders",
journal = SICOMP,
volume = 23,
year = 1994,
pages = "437--446"
}
@Article{bpr-cacqe-96,
keyent = {bpr-cacqe-96},
author = {S. Basu and R. Pollack and M.-F. Roy},
title = {On the combinatorial and algebraic complexity of
quantifier elimination},
journal = JACM,
year = 1996,
volume = 43,
pages = {1002--1045}
}
@inproceedings{bpsw-mmvtd-05,
author = {S. Brakatsoulas and D. Pfoser and R. Salas and
C. Wenk},
title = "On Map-Matching Vehicle Tracking Data",
booktitle = "Proc. 31st VLDB Conference",
pages = "853--864",
year = 2005,
publisher = {VLDB Endowment},
location = {Trondheim, Norway}
}
@article{bs-ca-95,
keyent = {bs-ca-95},
author = "M. de Berg and O. Schwarzkopf",
title = "Cuttings and applications",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "343--355",
keywords = "cuttings, random sampling, segment intersection
counting, Hopcroft's problem, point location",
annote = 267
}
@inproceedings{bs-cspta-97,
keyent = {bs-cspta-97},
author = "S. Bespamyatnikh and M. Segal",
title = "Covering a set of points by two axis-parallel boxes",
booktitle = CCCG_1997,
year = 1997,
pages = "33--38"
}
@article{bs-dspsd-80,
keyent = {bs-dspsd-80},
author = "J. L. Bentley and J. B. Saxe",
title = "Decomposable Searching Problems I: Static-to-Dynamic
Transformation",
journal = JALG,
volume = 1,
number = 4,
pages = "301-358",
year = 1980
}
@InBook{bs-gpsvm-98,
keyent = {bs-gpsvm-98},
author = "P. Bartlett and J. {Shawe-Taylor}",
title = "Advances in Kernel Methods --- Support Vector
Learning",
chapter = {Generalization Performance of Support Vector
Machines and other Pattern Classifiers},
publisher = {MIT Press},
year = 1998
}
@Book{bv-co-04,
author = {S. Boyd and L. Vandenberghe},
title = {Convex Optimization},
publisher = {Cambridge},
year = 2004,
url = {http://www.stanford.edu/~boyd/cvxbook/}
}
@article{bvz-faemg-01,
author = {Y. Boykov and O. Veksler and R. Zabih},
title = {Fast Approximate Energy Minimization via Graph Cuts},
journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
volume = 23,
number = 11,
year = 2001,
issn = {0162-8828},
pages = {1222--1239},
doi = {10.1109/34.969114},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@inproceedings{bw-rpmm-06,
author = "R. Baraniuk and M. Wakin",
title = "Random projections of smooth manifolds",
booktitle = "Proc. IEEE Intl. Conf. Acoustics, Speech and Signal
Processing",
year = 2006,
pages = "941--944",
}
@article{bwfgb-pdb-00,
author = "H. M. Berman and J. Westbrook and Z. Feng and
G. Gilliland and T. N. Bhat and H. Weissig and
I. H. Shinkdyalov and P. E. Bourne",
title = "The Protein Data Bank",
journal = "Nucleic Acid Res.",
volume = 28,
pages = {235--242},
year = 2000
}
@book{by-ag-98,
keyent = {by-ag-98},
author = "J.-D. Boissonnat and M. Yvinec",
title = "Algorithmic Geometry",
publisher = "Cambridge University Press",
year = 1998,
annote = "Translated by H. Br{\"o}nnimann",
url =
"http://www.inria.fr/prisme/personnel/yvinec/livre.html"
}
@inproceedings{c-aacpq-94,
keyent = {c-aacpq-94},
author = "K. L. Clarkson",
title = "An Algorithm for Approximate Closest-Point Queries",
booktitle = SOCG_1994,
year = 1994,
pages = "160--164"
}
@inproceedings{c-aaspm-87,
keyent = {c-aaspm-87},
author = "K. L. Clarkson",
title = "Approximation algorithms for shortest path motion
planning",
booktitle = STOC_1987,
year = 1987,
pages = "56--65",
keywords = "motion planning, approximation, two-dimensional,
three-dimensional, {Voronoi} diagrams"
}
@inproceedings{c-adwse-00-old,
keyent = {c-adwse-00-old},
author = {T.M.~Chan},
title = {Approximating the Diameter, width, smallest
enclosing cylinder and minimum-width annulus},
booktitle = SOCG_2000,
pages = "300--309",
year = 2000,
}
@article{c-adwse-02,
keyent = {c-adwse-02},
author = {T. M. Chan},
title = {Approximating the Diameter, width, smallest
enclosing cylinder and minimum-width annulus},
journal = IJCGA,
pages = "67--85",
year = 2002,
volume = 12,
number = 2,
url =
{http://www.worldscinet.com/ijcga/12/1201n02/S0218195902000748.html}
}
@Article{c-annqr-98,
keyent = {c-annqr-98},
author = {T. M. Chan},
title = {Approximate nearest neighbor queries revisited},
journal = DCG,
year = 1998,
volume = 20,
pages = {359--373}
}
@inproceedings{c-apca-93,
keyent = {c-apca-93},
author = "K. L. Clarkson",
title = "Algorithms for Polytope Covering and Approximation",
booktitle = WADS_1993,
series = LNCS,
volume = 709,
publisher = "Springer-Verlag",
year = 1993,
pages = "246--252",
annote = {{509}}
}
@inproceedings{c-arscg-88,
keyent = {c-arscg-88},
author = "K. L. Clarkson",
title = "Applications of random sampling in computational
geometry, {II}",
booktitle = SOCG_1988,
year = 1988,
pages = "1--11",
publisher = {ACM},
address = {New York, NY, USA},
doi = {10.1145/73393.73394}
}
@Unpublished{c-cauac-04,
keyent = {c-cauac-04},
author = {K. Chen},
title = {Clustering algorithms using adaptive sampling},
note = {manuscript},
year = 2004
}
@ARTICLE{c-cdt-89,
keyent = {c-cdt-89},
AUTHOR = "L. P. Chew",
TITLE = "Constrained {Delaunay} triangulations",
JOURNAL = "Algorithmica",
VOLUME = 4,
YEAR = 1989,
PAGES = "97--108"
}
@article{c-chdc-93,
keyent = {c-chdc-93},
author = "B. Chazelle",
title = "Cutting hyperplanes for divide-and-conquer",
journal = DCG,
volume = 9,
number = 2,
year = 1993,
pages = "145--158",
keywords = "partition, divide-and-conquer, hyperplanes",
annote = 266
}
@article{c-cpplb-84,
keyent = {c-cpplb-84},
author = "B. Chazelle",
title = "Convex partitions of polyhedra: a lower bound and
worst-case optimal algorithm",
journal = SICOMP,
volume = 13,
year = 1984,
pages = "488--507"
}
@inproceedings{c-cppsr-02,
keyent = {c-cppsr-02},
author = {T. M. Chan},
title = {Closest-point problems simplified on the RAM},
booktitle = SODA_2002,
year = 2002,
isbn = {0-89871-513-X},
pages = {472--473},
location = {San Francisco, California},
publisher = {Society for Industrial and Applied Mathematics},
}
@book{c-dmr-01,
keyent = {c-dmr-01},
author = "B. Chazelle",
title = "The Discrepancy Method: Randomness and Complexity",
publisher = "Cambridge University Press",
address = "New York",
url = {http://www.cs.princeton.edu/~chazelle/book.html},
year = 2001
}
@inproceedings{c-dpcho-99,
keyent = {c-dpcho-99},
author = {T. M. Chan},
title = {Dynamic Planar convex hull operations in
near-logarithmic amortized time},
booktitle = FOCS_1999,
pages = "92--99",
nickname = "FOCS '99",
year = 1999
}
@phdthesis{c-dwhdt-95,
keyent = {c-dwhdt-95},
author = "P. B. Callahan",
title = "Dealing with higher dimensions: the well-separated
pair decomposition and its applications",
type = "Ph.{D}. Thesis",
school = "Dept. Comput. Sci., Johns Hopkins University",
address = "Baltimore, Maryland",
year = 1995,
keywords = "doctoral thesis"
}
@InProceedings{c-egcmp-97,
keyent = {c-egcmp-97},
author = {S. Cameron},
title = {Enhancing gjk: Computing minimum and penetration
distance between convex polyhedra},
booktitle = {Proc. Int. Conf. Robot. Auto.},
pages = {3112--3117},
year = 1997
}
@inproceedings{c-faann-83,
keyent = {c-faann-83},
author = "K. L. Clarkson",
title = "Fast algorithms for the all nearest neighbors
problem",
booktitle = FOCS_1983,
year = 1983,
pages = "226--232",
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
keywords = "proximity, bucketing, approximation, probabilistic
analysis"
}
@InProceedings{c-fcscd-03-old,
keyent = {c-fcscd-03},
author = {T. M. Chan},
title = {Faster coreset constructions and data stream
algorithms in fixed dimensions},
year = 2004,
pages = {152--159},
booktitle = SOCG_2004
}
@article{c-fcscd-04,
author = {T. M. Chan},
title = {Faster core-set constructions and data-stream
algorithms in fixed dimensions.},
journal = CGTA,
volume = 35,
number = {1-2},
year = 2006,
pages = {20--35}
}
@Article{c-garot-99,
keyent = {c-garot-99},
author = {T. M. Chan},
title = {Geometric applications of a randomized optimization
technique},
journal = DCG,
year = 1999,
volume = 22,
url = {http://www.cs.uwaterloo.ca/~tmchan/rand.ps.gz},
pages = {547--567}
}
@techreport{c-gqtm-89,
keyent = {c-gqtm-89},
author = "L. P. Chew",
title = "Guaranteed-quality triangular meshes",
type = "Technical {Report}",
number = "TR-89-983",
institution = "Dept. Comput. Sci., Cornell Univ.",
address = "Ithaca, NY",
month = apr,
year = 1989
}
@Misc{c-hs-1876,
author = {L. Carroll},
title = {The hunting of the snark},
year = 1876
}
@inproceedings{c-kmchd-06,
author = {K. Chen},
title = {On {$k$}-Median clustering in high dimensions},
booktitle = SODA_2006,
year = 2006,
isbn = {0-89871-605-5},
pages = {1177--1185},
location = {Miami, Florida},
doi = {10.1145/1109557.1109687}
}
@InProceedings{c-lac-00-conf,
keyent = {c-lac-00-conf},
author = {T. M. Chan},
title = {On levels in arrangements of curves},
booktitle = FOCS_2000,
nickname = "FOCS 2000",
pages = {??},
year = 2000
}
@Article{c-lac-03,
keyent = {c-lac-03},
author = {T. M. Chan},
title = {On levels in arrangements of curves},
journal = DCG,
year = 2003,
volume = 29,
nubmer = 3,
pages = {375--393},
url =
"http://link.springer-ny.com/link/service/journals/00454/contents/02/2840/index.html"
}
@article{c-ldlpv-05,
author = {T. M. Chan},
title = {Low-dimensional linear programming with violations},
journal = SICOMP,
year = 2005,
volume = {34},
number = {4},
pages = {879--893},
url = {http://www.math.uwaterloo.ca/~tmchan/pub.html},
doi = {10.1137/S0097539703439404}
}
@article{c-narsc-87,
keyent = {c-narsc-87},
author = "K. L. Clarkson",
title = "New applications of random sampling in computational
geometry",
journal = DCG,
volume = 2,
year = 1987,
pages = "195--222",
keywords = "combinatorial geometry, data structuring, reporting,
searching, separation, range search, point location,
probabilistic analysis, triangulations,
{$d$}-dimensional"
}
@inproceedings{c-nnqms-97-conf,
keyent = {c-nnqms-97-conf},
author = {K. L. Clarkson},
title = {Nearest neighbor queries in metric spaces},
booktitle = STOC_1997,
year = 1997,
isbn = {0-89791-888-6},
pages = {609--617},
location = {El Paso, Texas, United States},
doi = {10.1145/258533.258655}
}
@article{c-nnqms-99,
keyent = {c-nnqms-99},
title = "Nearest neighbor queries in metric spaces",
author = {K. L. Clarkson},
journal = DCG,
volume = 22,
number = 1,
url = {http://cm.bell-labs.com/who/clarkson/nnms.html},
pages = {63--93},
year = 1999
}
@Unpublished{c-nnsms-02,
keyent = {c-nnsms-02},
author = {K. L. Clarkson},
title = {Nearest Neighbor Searching in Metric Spaces:
Experimental Results for {$\mathrm{sb}(S)$}},
note = {Available from
\href{http://cm.bell-labs.com/who/clarkson/Msb/white_paper.pdf}},
url =
{http://cm.bell-labs.com/who/clarkson/Msb/white_paper.pdf},
year = 2002
}
@article{c-ochaa-93,
keyent = {c-ochaa-93},
author = "B. Chazelle",
title = "An optimal convex hull algorithm in any fixed
dimension",
journal = DCG,
volume = 10,
year = 1993,
pages = "377--409"
}
@inproceedings{c-ochan-91,
keyent = {c-ochan-91},
author = "B. Chazelle",
title = "An optimal convex hull algorithm and new results on
cuttings",
booktitle = FOCS_1991,
year = 1991,
pages = "29--38"
}
@article{c-osrch-96,
keyent = {c-osrch-96},
author = "T. M. Chan",
title = "Output-Sensitive Results on Convex Hulls, Extreme
Points, and Related Problems",
journal = DCG,
volume = 16,
year = 1996,
pages = "369--387"
}
@Unpublished{c-pc-04,
keyent = {c-pc-04},
author = {T. M. Chan},
title = {Personal communication},
note = {Feb},
year = 2004
}
@PhdThesis{c-pdtol-92,
keyent = {c-pdtol-92},
author = {D.~J. Cannon},
title = {Point-And-Direct Telerobotics: Object Level
Strategic Supervisory Control in Unstructured
Interactive Human-Machine System Environments},
school = {Stanford Mechanical Engineering},
year = 1992
}
@article{c-racpq-88,
author = "K. L. Clarkson",
title = "A randomized algorithm for closest-point queries",
journal = SICOMP,
volume = 17,
number = 4,
year = 1988,
pages = "830--847",
url = {http://dx.doi.org/10.1137/0217052},
doi = {10.1137/0217052},
}
@article{c-rshrr-00,
author = {T. M. Chan},
title = {Random Sampling, Halfspace Range Reporting, and
Construction of {$(\le k)$}-Levels in Three
Dimensions},
journal = SICOMP,
volume = 30,
number = 2,
year = 2000,
pages = {561--575}
}
@article{c-sefat-97,
author = {E. Cohen},
title = {Size-estimation framework with applications to
transitive closure and reachability},
journal = JCSS,
volume = 55,
number = 3,
year = 1997,
issn = {0022-0000},
pages = {441--453},
doi = {10.1006/jcss.1997.1534},
publisher = {Academic Press, Inc.},
address = {Orlando, FL, USA},
}
@InProceedings{c-ssalo-05,
author = {K. L. Clarkson},
title = {Subgradient and sampling algorithms for {$\ell_1$}
regression},
booktitle = SODA_2005,
year = 2005,
isbn = {0-89871-585-7},
pages = {257--266},
location = {Vancouver, British Columbia},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
}
@Unpublished{c-toann-01,
keyent = {c-toann-01},
author = {M. Cary},
title = {Towards optimal {\(\varepsilon\)}-approximate nearest
neighbor algorithms in constant dimnesions},
note = {from web page},
year = 2001,
annote = {{691}}
}
@article{c-tsplt-91a,
keyent = {c-tsplt-91a},
author = "B. Chazelle",
title = "Triangulating a simple polygon in linear time",
journal = DCG,
volume = 6,
year = 1991,
pages = "485--524",
doi = {10.1007/BF02574703}
}
@TechReport{c-wcanh-76,
author = {N. Christofides},
title = {Worst-case analysis of a new heuristic for the
travelling salesman problem},
institution = {Graduate School of Industrial Administration,
Carnegie Mellon University},
year = 1976,
number = {Report 388}
}
@Misc{canon-web-02,
keyent = {canon-web-02},
title =
{http://www.x-zone.canon.co.jp/WebView-E/all/list.htm},
url =
{http://www.x-zone.canon.co.jp/WebView-E/all/list.htm},
key = {Canon},
year = 2002
}
@inproceedings{ccfm-icdir-97,
keyent = {ccfm-icdir-97},
author = "M. Charikar and C. Chekuri and T. Feder and
R. Motwani",
title = "Incremental Clustering and Dynamic Information
Retrieval",
booktitle = STOC_1997,
pages = "626--635",
year = 1997
}
@article{cdhks-gqsa-05,
keyent = {cdhks-gqsa-05},
title = {Geographic Quorum Systems Approximations},
author = {P. Carmi and S. Dolev and S. {Har-Peled} and
M. J. Katz and M. Segal},
year = 2005,
journal = ALGORITHMICA,
volume = 41,
number = 4,
pages = {233--244}
}
@Unpublished{cdks-gqsa-03-old,
keyent = {cdks-gqsa-03},
author = {P. Carmi and S. Dolev and M. J. Katz and M. Segal},
title = {Geographic Quorum Systems approximations},
note = {manuscript},
year = 2003,
annote = 921
}
@inproceedings{ce-oails-88,
keyent = {ce-oails-88},
author = "B. Chazelle and H. Edelsbrunner",
title = "An optimal algorithm for intersecting line segments
in the plane",
booktitle = FOCS_1988,
year = 1988,
pages = "590--600",
keywords = "intersection, topological sweep, segments",
}
@article{ce-oails-92,
keyent = {ce-oails-92},
author = "B. Chazelle and H. Edelsbrunner",
title = "An optimal algorithm for intersecting line segments
in the plane",
journal = JACM,
volume = 39,
year = 1992,
pages = "1--54",
keywords = "intersection, topological sweep, segments"
}
@article{cegghss-rspug-94,
keyent = {cegghss-rspug-94},
author = "B.~Chazelle and H.~Edelsbrunner and M. Grigni and
L. J.~Guibas and J. Hershberger and M.~Sharir and
J.~Snoeyink",
title = "Ray shooting in polygons using geodesic
triangulations",
journal = "Algorithmica",
volume = 12,
year = 1994,
pages = "54--68"
}
@article{cegpsss-ccclr-92,
keyent = {cegpsss-ccclr-92},
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
R. Pollack and R. Seidel and M. Sharir and
J. Snoeyink",
title = "Counting and cutting cycles of lines and rods in
space",
journal = CGTA,
volume = 1,
year = 1992,
pages = "305--323"
}
@article{cegs-ablsp-94,
keyent = {cegs-ablsp-94},
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir",
title = "Algorithms for bichromatic line segment problems and
polyhedral terrains",
journal = "Algorithmica",
volume = 11,
year = 1994,
pages = "116--132"
}
@article{cegs-dwclp-93,
keyent = {cegs-dwclp-93},
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir",
title = "Diameter, width, closest line pair and parametric
searching",
journal = DCG,
volume = 10,
year = 1993,
pages = "183--196"
}
@article{cegss-cfals-93,
keyent = {cegss-cfals-93},
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir and J. Snoeyink",
title = "Computing a face in an arrangement of line segments
and related problems",
journal = SICOMP,
volume = 22,
year = 1993,
pages = "1286--1302",
annote = 13
}
@Article{ceh-fgsms-07,
author = {O. Cheong and A. Efrat and S. {Har-Peled}},
title = {On Finding a Guard that Sees Most and a Shop that
Sells Most},
journal = DCG,
year = 2007,
volume = 37,
number = 4,
pages = {545--563},
url = {http://dx.doi.org/10.1007/s00454-007-1328-5},
doi = {10.1007/s00454-007-1328-5},
}
@InProceedings{ceh-fgsms-04-conf,
keyent = {ceh-fgsms-04},
author = {O. Cheong and A. Efrat and S. {Har-Peled}},
title = {On Finding a Guard that Sees Most and a Shop that
Sells Most},
booktitle = SODA_2004,
acceptrate = SODA_2004_AR,
pages = {1091--1100},
url = {http://cs.uiuc.edu/~sariel/papers/03/area/},
year = 2004
}
@article{cemst-acpir-96,
keyent = {cemst-acpir-96},
author = "K. L. Clarkson and D. Eppstein and G. L. Miller and
C. Sturtivant and S.-H. Teng",
title = "Approximating center points with iterative {Radon}
points",
journal = IJCGA,
volume = 6,
year = 1996,
pages = "357--377",
url = {http://cm.bell-labs.com/who/clarkson/center.html}
}
@Article{cf-dvrsi-90,
keyent = {cf-dvrsi-90},
author = "B. Chazelle and J. Friedman",
title = "A deterministic view of random sampling and its use
in geometry",
journal = "Combinatorica",
volume = 10,
number = 3,
year = 1990,
pages = "229--249",
url = {http://dx.doi.org/10.1007/BF02122778},
doi = {10.1007/BF02122778},
keywords = "point location, range search, {$d$}-dimensional",
annote = "derandomizes with polynomial overhead"
}
@article{cfmmr-remas-01,
author = {A. Crauser and P. Ferragina and K. Mehlhorn and
U. Meyer and E. Ramos},
title = "Randomized External-Memory Algorithms for Some
Geometric Problems",
journal = CGTA,
year = 2001,
volume = 11,
number = 3,
month = "June",
pages = "305--337"
}
@article{cg-fc1ds-86,
keyent = {cg-fc1ds-86},
author = "B. Chazelle and L. J. Guibas",
title = "Fractional cascading: {I}. {A} data structuring
technique",
journal = "Algorithmica",
volume = 1,
number = 3,
year = 1986,
pages = "133--162"
}
@inproceedings{cg-icaflkm-99,
keyent = {cg-icaflkm-99},
author = "M. Charikar and S. Guha",
title = "Improved Combinatorial Algorithms for the Facility
Location and {$k$}-Median Problems",
booktitle = FOCS_1999,
pages = "378-388",
year = 1999,
url = {http://citeseer.nj.nec.com/charikar99improved.html}
}
@inproceedings{cggtv-emga-95,
author = {Y.-J. Chiang and M. T. Goodrich and E. F. Grove and
R. Tamassia and D. E. Vengroff and J. S. Vitter},
title = {External-Memory Graph Algorithms},
year = 1995,
booktitle = SODA_1995,
pages = {139--149},
}
@article{cgl-pgd-85,
keyent = {cgl-pgd-85},
author = "B. Chazelle and L. J. Guibas and D. T. Lee",
title = "The power of geometric duality",
journal = "BIT",
volume = 25,
year = 1985,
pages = "76--90",
}
@article{cgl-pogd-85,
author = "B. Chazelle and L.~J. Guibas and D.~T. Lee",
title = "The power of geometric duality",
journal = "BIT",
volume = 25,
number = 1,
year = 1985,
pages = "76--90",
}
@inproceedings{cgmz-hrbgm-05,
title = {On Hierarchical Routing in Bounded Growth Metrics},
author = {Chan, H. T-H and Gupta, A. and Maggs, B. M. and
Zhou, S.},
booktitle = SODA_2005,
year = 2005,
}
@inproceedings{cgts-cfaak-99,
keyent = {cgts-caamp-99},
author = "M. Charikar and S. Guha and E. Tardos and
D. B. Shmoys",
title = "A Constant-Factor Approximation Algorithm for the
{$k$}-Median Problem",
booktitle = STOC_1999,
pages = "1-10",
year = 1999,
url =
{http://citeseer.nj.nec.com/charikar99constantfactor.html}
}
@article{ch-nnpc-67,
keyent = {ch-nnpc-67},
author = "T.M. Cover and P.E. Hart",
title = "Nearest Neighbor Pattern Classification",
journal = "IEEE Transactions on Information Theory",
volume = 13,
year = 1967,
pages = "21--27"
}
@article{ch-eopr-08,
author = {K. Chen and S. {Har-Peled}},
title = {The {Euclidean} Orienteering Problem Revisited},
journal = SICOMP,
volume = 38,
number = 1,
year = 2008,
pages = {385--397},
doi = {10.1137/060667839}
}
@InProceedings{ch-oppr-06,
author = "K. Chen and S. {Har-Peled}",
title = {The Orienteering Problem in the Plane Revisited},
year = 2006,
booktitle = SOCG_2006,
acceptrate = SOCG_2006_AR,
pages = {247--254},
doi = {10.1145/1137856.1137893}
}
@inproceedings{ch-spp-90,
keyent = {ch-spp-90},
author = "J. Chen and Y. Han",
title = "Shortest paths on a polyhedron",
booktitle = SOCG_1990,
year = 1990,
pages = "360--369"
}
@Article{ch-spp1c-96,
keyent = {ch-spp1c-96},
author = {J. Chen and Y. Han},
title = {{Shortest paths on a polyhedron; Part I: computing
shortest paths}},
journal = {Int.\ J. Comput. Geom. \& Appl.},
year = 1996,
volume = 6,
number = 2,
pages = {127--144}
}
@inproceedings{ch-sspp-91,
keyent = {ch-sspp-91},
author = "J. Chen and Y. Han",
title = "Storing shortest paths for a polyhedron",
editor = "F. Dehne and F. Fiala and W. W. Koczkodaj",
booktitle = "Advances in Computing and Information --- ICCI '91
International Conference Proceedings",
publisher = "Springer-Verlag",
year = 1991,
pages = "169--80",
annote = {99a}
}
@article{chk-ofwcc-05,
author = {Paz Carmi and Sariel Har{-}Peled and Matthew
J. Katz},
title = {On the {Fermat-Weber} center of a convex object},
journal = CGTA,
volume = {32},
number = {3},
pages = {188--195},
year = {2005},
url = {http://dx.doi.org/10.1016/j.comgeo.2005.01.002},
doi = {10.1016/j.comgeo.2005.01.002}
}
@Article{chk-ofwcc-05-old,
author = {P. Carmi and S. {Har-Peled} and M. Katz},
title = {On the {Fermat-Weber} Center of a Convex Object},
journal = CGTA,
year = 2005,
note = {To appear}
}
@inproceedings{chlm-orvg-02-conf,
keyent = {chlm-orvg-02-conf},
title = "The One-Round {Voronoi} Game",
author = "O. Cheong and S. {Har-Peled} and N. Linial and
J. Matou{\v s}ek",
booktitle = SOCG_2002,
acceptrate = SOCG_2002_AR,
pages = {97--101},
year = 2002,
url =
{http://cs.uiuc.edu/~sariel/research/papers/01/vor_game/}
}
@article{chlm-orvg-04,
keyent = {chlm-orvg-04},
title = "The One-Round {Voronoi} Game",
author = "O. Cheong and S.~{Har-Peled} and N. Linial and
J. Matou{\v s}ek",
journal = DCG,
volume = 31,
number = 1,
pages = {125--138},
year = 2004
}
@inproceedings{ck-adcpn-95,
keyent = {ck-adcpn-95},
author = "P. B. Callahan and S. R. Kosaraju",
title = "Algorithms for Dynamic Closest-Pair and {$n$}-Body
Potential Fields",
booktitle = SODA_1995,
year = 1995,
pages = "263--272",
keywords = "dynamic algorithms, closest pair, all nearest
neighbors, fast multipole method"
}
@article{ck-dmpsa-95,
keyent = {ck-dmpsa-95},
author = "P. B. Callahan and S. R. Kosaraju",
title = "A decomposition of multidimensional point sets with
applications to {$k$}-nearest-neighbors and $n$-body
potential fields",
journal = JACM,
volume = 42,
year = 1995,
pages = "67--90"
}
@inproceedings{ck-fasgg-93,
keyent = {ck-fasgg-93},
author = "P. B. Callahan and S. R. Kosaraju",
title = "Faster Algorithms for Some Geometric Graph Problems
in Higher Dimensions",
booktitle = SODA_1993,
year = 1993,
pages = "291--300",
keywords = "optimization, minimum spanning trees, spanner,
well-separated pair decomposition"
}
@inproceedings{ck-mcpgb-04,
author = {C. Chekuri and A. Kumar},
title = {Maximum Coverage Problem with Group Budget
Constraints and Applications.},
booktitle = {APPROX-RANDOM},
year = 2004,
pages = {72--83},
ee =
{http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3122{\&}spage=72}
}
@inproceedings{ckmn-aflpo-01,
keyent = {ckmn-aflpo-01},
author = "M. Charikar and S. Khuller and D. M. Mount and
G. Narasimhan",
title = "Algorithms for facility location problems with
outliers",
booktitle = SODA_2001,
pages = "642--651",
year = 2001
}
@inproceedings{ckr-aazep-01,
keyent = {ckr-aazep-01},
author = {G. Calinescu and H. Karloff and Y. Rabani},
title = {Approximation algorithms for the {$0$}-extension
problem},
booktitle = SODA_2001,
year = 2001,
pages = {8--16},
location = {Washington, D.C., United States}
}
@article{ckstw-vdl3s-98,
keyent = {ckstw-vdl3s-98},
author = "L. P. Chew and K. Kedem and M. Sharir and
B. Tagansky and E. Welzl",
title = "{Voronoi} Diagrams of Lines in 3-Space under
Polyhedral Convex Distance Functions",
journal = JALG,
volume = 29,
number = 2,
year = 1998,
pages = "238--255"
}
@book{clr-ia-90,
keyent = {clr-ia-90},
author = "T. H. Cormen and C. E. Leiserson and R. L. Rivest",
title = "Introduction to Algorithms",
publisher = "The MIT Press",
address = "Cambridge, Mass.",
year = 1990
}
@book{clrs-ia-01,
keyent = {clrs-ia-01},
author = "T. H. Cormen and C. E. Leiserson and R. L. Rivest
and C. Stein",
title = "Introduction to Algorithms",
publisher = "MIT Press / McGraw-Hill",
eddition = {2ed},
year = 2001,
url = "http://theory.lcs.mit.edu/~clr/"
}
@article{cm-ampcr-05,
author = "M. Clausen and A. Mosig",
title = "Approximately matching polygonal curves with respect
to the {\Frechet}~distance",
journal = CGTA,
volume = 30,
issue = 2,
pages = {113--127},
year = 2005
}
@article{cm-ltdao-96,
author = "B. Chazelle and J. Matou{\v s}ek",
title = "On Linear-Time Deterministic Algorithms for
Optimization Problems in Fixed Dimension",
journal = JALG,
volume = 21,
year = 1996,
pages = "579--597",
doi = {10.1006/jagm.1996.0060}
}
@Unpublished{cms-arers-06,
author = {E. Cohen and Y. Mansour and M. Sharir},
title = {Approximation with relative errors in range spaces
of finite {VC} dimension},
note = {Manuscript},
year = 2006
}
@InProceedings{cmtv-cpqsd-00,
keyent = {cmtv-cpqsd-00},
author = {A. Corral and Y. Manolopoulos and Y. Theodoridis and
M. Vassilakopoulos},
title = {Closest Pair Queries in Spatial Databases},
booktitle = "ACM SIGMOD Int.\ Conf.\ on Manag.\ of Data",
pages = {189--200},
year = 2000
}
@inproceedings{cop-bsacp-03,
keyent = {cop-bsacp-03},
author = {M. Charikar, L. O'Callaghan and R. Panigrahy},
title = {Better Streaming Algorithms for Clustering Problems},
booktitle = STOC_2003,
pages = "30-39",
year = 2003
}
@article{cp-hrsaa-86,
author = {B. Chazelle and F. P. Preparata},
title = {Halfspace range search: an algorithmic application
of {$k$}-sets},
journal = DCG,
volume = 1,
number = 1,
year = 1986,
issn = {0179-5376},
pages = {83--93},
publisher = {Springer}
}
@inproceedings{cp-rgawd-05,
author = {C. Chekuri and M. P{\'a}l},
title = {A Recursive Greedy Algorithm for Walks in Directed
Graphs},
booktitle = FOCS_2005,
year = 2005,
pages = {245--253},
}
@inproceedings{cr-nlbtr-87,
keyent = {cr-nlbtr-87},
author = "J. F. Canny and J. H. Reif",
title = "New lower bound techniques for robot motion planning
problems",
booktitle = FOCS_1987,
year = 1987,
pages = "49--60"
}
@article{cs-arscg-89,
author = "K. L. Clarkson and P. W. Shor",
title = "Applications of random sampling in computational
geometry, {II}",
journal = DCG,
volume = 4,
year = 1989,
pages = "387--421",
doi = {10.1007/BF02187740}
}
@inproceedings{cs-ptgq-01,
keyent = {cs-ptgq-01},
author = {A. Czumaj and C. Sohler},
title = {Property testing with geometric queries},
year = 2001,
booktitle = {Proc. 9th Annu. European Symp. Algorithms},
pages = {266--277},
}
@book{cs-svm-00,
keyent = {cs-svm-00},
author = {N. Cristianini and J. {Shaw-Taylor}},
title = {Support Vector Machines},
publisher = {Cambridge Press},
year = 2000
}
@article{csl-tddfm-98,
author = {D. {Cohen-Or} and A. Solomovici and D. Levin},
title = {Three-Dimensional Distance Field Metamorphosis},
journal = {ACM Trans. Graph.},
volume = 17,
number = 2,
year = 1998,
pages = {116--141}
}
@inproceedings{csy-aesp3-94,
keyent = {csy-aesp3-94},
author = "J. Choi and J. Sellen and C. K. Yap",
title = "Approximate {Euclidean} Shortest Path in {$3$}-Space",
booktitle = SOCG_1994,
year = 1994,
pages = "41--48",
}
@article{csy-khrp-87,
author = "R. Cole and M. Sharir and C. K. Yap",
title = "On {$k$}-hulls and related problems",
journal = SICOMP,
volume = 16,
year = 1987,
pages = "61--77",
keywords = "design of algorithms, searching, two-dimensional,
three-dimensional"
}
@article{csy-smico-95,
author = "D. Crass and I. Suzuki and M. Yamashita",
title = "Searching for a mobile intruder in a corridor: the
open edge variant of the polygon search problem",
journal = IJCGA,
volume = 5,
year = 1995,
pages = "397--412",
keywords = "geometry, visibility, search"
}
@article{cw-oaimd-83,
keyent = {cw-oaimd-83},
author = "F. Chin and C. A. Wang",
title = "Optimal Algorithms for the Intersection and the
Minimum Distance Problems between Planar Polygons",
journal = "IEEE Trans. Comput.",
volume = "C-32",
number = 12,
year = 1983,
pages = "1203--1207"
}
@article{cw-qorss-89,
author = "B. Chazelle and E. Welzl",
title = "Quasi-optimal range searching in spaces of finite
{VC}-dimension",
journal = DCG,
volume = 4,
year = 1989,
pages = "467--489"
}
@phdthesis{d-bart-99,
author = "C. A. Duncan",
title = "Balanced Aspect Ratio Trees",
type = "Ph.{D}. Thesis",
school = "Department of Computer Science, Johns Hopkins
University",
address = "Baltimore, Maryland",
year = 1999,
keywords = "doctoral thesis"
}
@InProceedings{d-hfkm-03,
keyent = {d-hfkm-03},
author = {S. Dasgupta},
title = {How fast is {$k$}-means?},
year = 2003,
pages = 735,
booktitle = COLT_2003,
number = 2777,
series = LNCS
}
@inproceedings{d-ibkkl-97-conf,
keyent = {d-ibkkl-97-conf},
author = "T. K. Dey",
title = "Improved Bounds for {$k$-Sets} and {$k$-th} levels",
booktitle = FOCS_1997,
nickname = "FOCS '97",
year = 1997,
pages = "156--161"
}
@Article{d-ibpks-98,
keyent = {d-ibpks-98},
author = {T. K. Dey},
title = {Improved Bounds for Planar {$k$}-Sets and Related
Problems},
journal = DCG,
volume = 19,
number = 3,
year = 1998,
pages = "373--382",
url =
"http://link.springer-ny.com/link/service/journals/00454/bibs/19n3p373.html"
}
@article{d-kgaca-90,
keyent = {d-kgaca-90},
author = "R. A. Dwyer",
title = "Kinder, gentler average-case analysis for convex
hulls and maximal vectors",
journal = "SIGACT News",
volume = 21,
number = 2,
year = 1990,
pages = "64--71",
keywords = "probabilistic analysis, expected-case analysis,
convex hull, {$d$}-dimensional"
}
@techreport{d-lcpgi-93,
keyent = {d-lcpgi-93},
author = "D. H. Douglas",
title = "Least Cost Path in Geographic Information Systems",
type = "Research Note No. 61",
institution = "Department of Geography, University of Ottawa",
address = "Ottawa, Ontario",
month = aug,
year = 1993,
keywords = "shortest paths, weighted region problem, GIS,
Snell's Law",
annote = "paper was submitted to a journal. Has it appeared??"
}
@inproceedings{d-lmg-99,
author = "S. Dasgupta",
title = "Learning mixtures of {G}aussians",
booktitle = FOCS_1999,
pages = "634--644",
year = 1999,
}
@article{d-mescs-74,
keyent = {d-mescs-74},
author = {R. M. Dudley},
title = {{Metric entropy of some classes of sets with
differentiable boundaries}},
journal = {J. Approx. Theory},
year = 1974,
volume = 10,
number = 3,
pages = {227--236},
notes = {correction: Volume 26, Number 2, June 1979,
pp.192--193}
}
@book{d-pte-95,
title = {Probability: Theory and Examples},
author = {R. Durrett},
isbn = 0534243185,
keywords = {probability-theory},
month = {August},
priority = 2,
publisher = {Duxbury Press},
year = 1995,
url =
{http://www.amazon.co.uk/exec/obidos/ASIN/0534243185/citeulike-21}
}
@Article{d-sgopg-03,
author = {M. Denny},
title = {Solving Geometric Optimization Problems using
Graphics Hardware},
journal = {Comput. Graph. Forum},
year = 2003,
volume = 22,
number = 3,
pages = {441--452}
}
@article{dbs-gttd-92,
keyent = {dbs-gttd-92},
author = "T. K. Dey and C. L. Bajaj and K. Sugihara",
title = "On good triangulations in three dimensions",
journal = IJCGA,
volume = 2,
number = 1,
year = 1992,
pages = "75--95",
keywords = "Delaunay triangulation, mesh generation"
}
@Unpublished{ddp-3dvc-02,
keyent = {ddp-3dvc-02},
author = {F. Durand and G. Drettakis and C. Puech},
title = {The 3D Visibility Complex},
note = {submitted to ACM Transactions on Graphics},
year = 2002
}
@article{de-sdm-99,
author = "L. Dieci and T. Eirola",
title = "On smooth decompositions of matrices",
journal = "SIAM J. Matrix Anal. Appl.",
volume = 20,
year = 1999,
pages = "800--819",
}
@Article{df-fptcI-95,
keyent = {df-fptcI-95},
author = {R. G. Downey and M. R. Fellows},
title = {Fixed-Parameter Tractability and Completeness I:
Basic Results},
journal = SICOMP,
year = 1995,
volume = 24,
number = 4,
pages = {873--921}
}
@Article{dfg-cvtaa-99,
keyent = {dfg-cvtaa-99},
author = {Q. Du and V. Faber and M. Gunzburger},
title = {Centroidal {Voronoi} Tessellations: Applications and
Algorithms},
journal = SIAM_REVIEW,
year = 1999,
url = {http://epubs.siam.org/sam-bin/dbq/article/35283},
volume = 41,
number = 4,
pages = {637--676},
annote = 920
}
@article{dg-dbppl-98,
keyent = {dg-dbppl-98},
author = "O. Devillers and M. Golin",
title = "Dog Bites Postman: Point Location in the Moving
{Voronoi} Diagram and Related Problems",
journal = IJCGA,
volume = 8,
year = 1998,
pages = "321--342"
}
@TechReport{dg-epjll-99-old,
keyent = {dg-epjll-99},
author = {S. Dasgupta and A. Gupta},
title = {An elementary proof of the {Johnson-Lindenstrauss}
lemma},
institution = {International computer science institute},
year = 1999,
number = {TR-99-006}
}
@article{dg-eptjl-03,
author = "S. Dasgupta and A. Gupta",
title = "An elementary proof of a theorem of {J}ohnson and
{L}indenstrauss",
journal = "Rand. Struct. Alg.",
volume = 22,
number = 3,
pages = "60--65",
year = 2003,
}
@InProceedings{dglsw-giama-03,
keyent = {dglsw-giama-03},
author = {S.~Dolev and S.~Gilbert and N.~A.~Lynch and
A.~Shvartsman and J.~L.~Welch},
title = {GeoQuorums: Implementing Atomic Memory in Ad Hoc
Networks},
booktitle = DISC_2003,
year = 2003,
url =
{http://theory.lcs.mit.edu/~sethg/pubs/GeoQuorums-DISC.ps}
}
@inproceedings{dgr-eaoac-97,
keyent = {dgr-eaoac-97},
author = "C. A. Duncan and M. T. Goodrich and E. A. Ramos",
title = "Efficient Approximation and Optimization Algorithms
for Computational Metrology",
booktitle = SODA_1997,
year = 1997,
pages = "121--130"
}
@book{dhs-pc-01,
author = "R. O. Duda and P. E. Hart and D. G. Stork",
title = "Pattern Classification",
edition = {2nd},
publisher = "Wiley-Interscience",
address = "New York",
year = 2001
}
@article{dhks-cidp-93,
keyent = {dhks-cidp-93},
author = "D. Dobkin and J. Hershberger and D. Kirkpatrick and
S. Suri",
title = "Computing the intersection-depth of polyhedra",
journal = "Algorithmica",
volume = 9,
year = 1993,
pages = "518--533"
}
@inproceedings{diim-lshsb-04,
keyent = {diim-lshsb-04},
author = {M. Datar and N. Immorlica and P. Indyk and
V. S. Mirrokni},
title = {Locality-sensitive hashing scheme based on
{$p$}-stable distributions},
booktitle = SOCG_2004,
year = 2004,
doi = {10.1145/997817.997857},
pages = {253--262},
location = {Brooklyn, New York, USA},
delurl = {http://www.mit.edu/~mirrokni/pstable.ps},
delisbn = {1-58113-885-7},
}
@inproceedings{dk-dsppu-90,
keyent = {dk-dsppu-90},
author = "D. P. Dobkin and D. G. Kirkpatrick",
title = "Determining the separation of preprocessed polyhedra
-- a unified approach",
booktitle = "Proc. 17th Internat. Colloq. Automata
Lang. Program.",
series = LNCS,
volume = 443,
publisher = "Springer-Verlag",
year = 1990,
pages = "400--413"
}
@article{dk-ladsc-85,
keyent = {dk-ladsc-85},
author = "D. P. Dobkin and D. G. Kirkpatrick",
title = "A linear algorithm for determining the separation of
convex polyhedra",
journal = JALG,
volume = 6,
year = 1985,
pages = "381--392",
keywords = "design of algorithms, construction, separation,
convex, polyhedra, hierarchical representations"
}
@InProceedings{dks-mvrcc-02,
keyent = {dks-mvrcc-02},
author = {F. Dehne and R. Klein and R. Seidel},
title = {Maximizing a {Voronoi} Region: The Convex Case},
booktitle = ISAAC_2002,
pages = {624--634},
year = 2002,
url =
{http://134.117.206.249:8000/www/publications/publ/2-62/paper.pdf}
}
@article{dks-mvrcc-05,
author = {F. Dehne and R. Klein and R. Seidel},
title = "Maximizing a {Voronoi} region: the convex case",
journal = IJCGA,
volume = 15,
year = 2005,
pages = "463--475"
}
@article{dls-oaclc-92,
author = "H. N. Djidjev and A. Lingas and J. Sack",
title = "An {$O(n\log n)$} algorithm for computing the link
center of a simple polygon",
journal = DCG,
volume = 8,
number = 2,
year = 1992,
pages = "131--152",
keywords = "visibility"
}
@article{dlss-sdakp-95,
keyent = {dlss-sdakp-95},
author = "A. Datta and H.-P. Lenhof and C. Schwarz and
M. Smid",
title = "Static and dynamic algorithms for {$k$}-point
clustering problems",
journal = JALG,
volume = 19,
year = 1995,
pages = "474--503"
}
@incollection{dm-lpld-97,
keyent = {dm-lpld-97},
author = "M. Dyer and N. Megiddo",
title = "Linear programming in low dimensions",
chapter = 38,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
year = 1997,
pages = "699--710"
}
@book{dm-ssa-98,
keyent = {dm-ssa-98},
author = "I. Dryden and K. Mardia",
title = "Statistical Shape Analysis",
publisher = "John Wiley and Sons",
address = "San Diego",
year = 1998
}
@article{dmn-rass-92,
author = "M. B. Dillencourt and D. M. Mount and
N. S. Netanyahu",
title = "A randomized algorithm for slope selection",
journal = IJCGA,
volume = 2,
year = 1992,
pages = "1--27",
keywords = "slope selection, randomized algorithm, Theil Sen
estimator, line fitting, robust estimation"
}
@Unpublished{dmo-opp33-03,
keyent = {dmo-opp33-03},
key = {OPP},
title = {The Open Problems Project. {Problem 33}: Sum of
Square Roots},
note = {\href{http://cs.smith.edu/~orourke/TOPP/P33.html}
{http://cs.smith.edu/\protect{\tildegen}orourke/TOPP/P33.html}},
year = 2003
}
@article{dp-arnpr-73,
keyent = {dp-arnpr-73},
author = "D. H. Douglas and T. K. Peucker",
title = "Algorithms for the Reduction of the Number of Points
Required to Represent a Digitized Line or Its
Caricature",
journal = "Canadian Cartographer",
volume = 10,
number = 2,
month = dec,
year = 1973,
pages = "112--122"
}
@inproceedings{dp-ecncp-00,
keyent = {dp-ecncp-00},
author = {O. Devillers and F. P. Preparata},
title = {Evaluating the cylindricity of a nominally
cylindrical point set},
booktitle = SODA_2000,
year = 2000,
pages = {518--527}
}
@article{drvw-mapcv-06,
author = {Amit Deshpande and
Luis Rademacher and
Santosh Vempala and
Grant Wang},
title = {Matrix Approximation and Projective Clustering via Volume Sampling},
journal = {Theory of Computing},
volume = {2},
number = {12},
pages = {225--247},
year = {2006},
url = {http://dx.doi.org/10.4086/toc.2006.v002a012},
doi = {10.4086/toc.2006.v002a012},
timestamp = {Sat, 11 Apr 2015 19:44:34 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/toc/DeshpandeRVW06},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{drvw-mapcv-06-conf,
author = {A. Deshpande and L. Rademacher and S. Vempala and
G. Wang},
title = {Matrix approximation and projective clustering via
volume sampling},
booktitle = SODA_2006,
year = 2006,
isbn = {0-89871-605-5},
pages = {1117--1126},
location = {Miami, Florida},
doi = {10.1145/1109557.1109681}
}
@unpublished{ds-ibb-01,
keyent = {ds-ibb-01},
author = {I. Dinur and S. Safra},
title = {On the Importance of Being Biased},
year = 2001,
note = {manuscript
\href{http://www.math.ias.edu/~iritd/mypapers/vc.pdf}{{\tt
http://www.math.ias.edu/\tildegen{}iritd/mypapers/vc.pdf}}}
}
@article{dsds,
keyent = {dsds},
author = {D. Peleg},
title = {Proximity preserving labeling schemes},
journal = {Journal of Graph Theory},
volume = 33,
pages = {167--176},
year = 2000,
}
@InProceedings{dsw-wssgc-02,
keyent = {dsw-wssgc-02},
author = {S.~Dolev and E.~Schiller and J.~Welch},
title = {Walk for Self-Stabilizing Group Communication in
Ad-Hoc Networks},
booktitle = {Proc.\ 21st IEEE Symp. Reliable Dist. Sys.},
pages = {70--79},
year = 2002
}
@InProceedings{dv-oorhd-01,
keyent = {dv-oorhd-01},
author = {J. Dunagan and S. Vempala},
title = {Optimal outlier removal in high-dimensional spaces},
booktitle = STOC_2001,
year = 2001,
pages = {627--636},
url =
{http://portal.acm.org/citation.cfm?id=380860&coll=portal&dl=ACM&CFID=6053296&CFTOKEN=23775034}
}
@InCollection{dw-nnmd-82,
keyent = {dw-nnmd-82},
author = {L. Devroye and T.J. Wagner},
title = {Handbook of Statistics},
booktitle = {Nearest neighbor methods in discrimination},
publisher = {North-Holland},
year = 1982,
editor = {P. R. Krishnaiah and L. N. Kanal},
volume = 2
}
@article{dz-msrtc-01,
author = {D. Dor and U. Zwick},
title = {Median Selection Requires {$(2+\varepsilon)n$}
Comparisons},
journal = {SIAM J. Discret. Math.},
volume = 14,
number = 3,
year = 2001,
issn = {0895-4801},
pages = {312--325}
}
@article{dz-sm-99,
author = {D. Dor and U. Zwick},
title = {Selecting the Median.},
journal = {SIAM J. Comput.},
volume = 28,
number = 5,
year = 1999,
pages = {1722--1758}
}
@book{e-acg-87,
keyent = {e-acg-87},
author = {H. Edelsbrunner},
title = {{Algorithms in Combinatorial Geometry}},
year = 1987,
publisher = {Springer-Verlag},
series = "EATCS Monographs on Theoretical Computer Science",
address = {Heidelberg},
url =
"http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-13722-X&cookie=done"
}
@article{e-chrsp-65,
keyent = {e-chrsp-65},
author = "B. Efron",
title = "The convex hull of a random set of points",
journal = "Biometrika",
volume = 52,
number = 3,
year = 1965,
pages = "331--343",
annote = 168
}
@article{e-cuabc-05,
author = {A. Efrat},
title = {The Complexity of the Union of
{$(\alpha,\beta)$}-Covered Objects},
journal = SICOMP,
year = 2005,
volume = 34,
number = 4,
pages = {775--787},
publisher = {SIAM},
keywords = {fat objects; realistic input models; motion
planning},
url = {http://link.aip.org/link/?SMJ/34/775/1},
doi = {10.1137/S0097539702407515}
}
@InProceedings{e-cuabc-99-conf,
keyent = {e-cuabc-99},
author = {A. Efrat},
title = {The Complexity of the Union of
{$(\alpha,\beta)$}-Covered Objects},
booktitle = SOCG_1999,
pages = {134--142},
year = 1999,
url = {http://www.cs.arizona.edu/~alon/papers/alphabeta.ps}
}
@article{e-demst-95,
keyent = {e-demst-95},
author = "D. Eppstein",
title = "Dynamic {Euclidean} minimum spanning trees and
extrema of binary functions",
journal = DCG,
volume = 13,
year = 1995,
pages = "111--122",
url =
{http://www.ics.uci.edu/~eppstein/pubs/Epp-DCG-95.pdf}
}
@InProceedings{e-dgteg-03,
keyent = {e-dgteg-03},
author = {D. Eppstein},
title = {Dynamic generators of topologically embedded graphs},
booktitle = SODA_2003,
pages = {599--608},
year = 2003
}
@inproceedings{e-fcptc-97,
keyent = {e-fcptc-97},
author = "D. Eppstein",
title = "Faster construction of planar two-centers",
booktitle = SODA_1997,
year = 1997
}
@inproceedings{e-fhcoa-98,
keyent = {e-fhcoa-98},
author = "D. Eppstein",
title = "Fast Hierarchical Clustering and Other Applications
of Dynamic Closest Pairs",
booktitle = SODA_1998,
nickname = "SODA '98",
year = 1998,
pages = "619--628"
}
@Book{e-gtmg-01,
keyent = {e-gtmg-01},
author = {H. Edelsbrunner},
title = {Geometry and Topology for Mesh Generation},
publisher = {Cambridge Univ. Press},
year = 2001,
url = {http://books.cambridge.org/0521793092.htm}
}
@article{e-lblsp-99,
keyent = {e-lblsp-99},
author = "J. Erickson",
title = "Lower Bounds for Linear Satisfiability Problems",
journal = "Chicago J. Comput. Sci.",
volume = 1999,
number = 8,
year = 1999,
url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/linsat.html}
}
@article{e-nlbch-99,
keyent = {e-nlbch-99},
author = "J. Erickson",
title = "New Lower Bounds for Convex Hull Problems in Odd
Dimensions",
journal = SICOMP,
volume = 28,
year = 1999,
pages = "1198--1214",
url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/convex.html}
}
@inproceedings{e-nlbhp-95-conf,
keyent = {e-nlbhp-95},
author = "J. Erickson",
title = "New Lower Bounds for {Hopcroft's} Problem",
booktitle = SOCG_1995,
year = 1995,
pages = "127--137",
keywords = "partitioning algorithms",
annote = 109
}
@article{e-nlbhp-96,
author = "J. Erickson",
title = "New Lower Bounds for {Hopcroft's} Problem",
journal = DCG,
volume = 16,
year = 1996,
pages = "389--418",
keywords = "range searching, incidence, partitioning algorithm,
partition graph"
}
@inproceedings{e-npsnd-01-conf,
keyent = {e-npsnd-01-conf},
author = {J. Erickson},
booktitle = SOCG_2001,
title = {Nice point sets can have nasty {Delaunay}
triangulations},
pages = "96--105",
year = 2001,
url = {http://cs.uiuc.edu/~jeffe/pubs/spread.html}
}
@article{e-npsnd-03,
keyent = {e-npsnd-03},
title = {Nice point sets can have nasty {Delaunay}
triangulations},
author = {J. Erickson},
journal = DCG,
volume = 30,
number = 1,
pages = {109--132},
year = 2003,
url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/spread.html}
}
@article{e-pofll-77,
keyent = {e-pofll-77},
author = "P. van {Emde Boas}",
title = "Preserving order in a forest in less than
logarithmic time and linear space",
journal = IPL,
volume = 6,
year = 1977,
pages = "80--82"
}
@inproceedings{e-rcsgp-95,
keyent = {e-rcsgp-95},
author = "J. Erickson",
title = "On the Relative Complexities of Some Geometric
Problems",
booktitle = CCCG_1995,
year = 1995,
pages = "85--90",
publisher = {Carleton University},
address = {Ottawa, Canada},
url =
{http://compgeom.cs.uiuc.edu/~jeffe/pubs/relative.html}
}
@article{ea-lacvp-81,
keyent = {ea-lacvp-81},
author = "H. ElGindy and D. Avis",
title = "A linear algorithm for computing the visibility
polygon from a point",
journal = JALG,
volume = 2,
year = 1981,
pages = "186--197",
keywords = "polygons, visibility, visibility graphs"
}
@article{ec-gard-95,
keyent = {ec-gard-95},
author = "I. Z. Emiris and J. F. Canny",
title = "A general approach to removing degeneracies",
journal = SICOMP,
volume = 24,
year = 1995,
pages = "650--664",
url = {http://citeseer.nj.nec.com/8401.html},
keywords = "input degeneracy, ill-conditioned problems, symbolic
perturbation, infinitesimals, randomization,
determinants, roots of polynomials, algorithmic
complexity"
}
@article{ecs-ephgd-97,
keyent = {ecs-ephgd-97},
author = "I. Z. Emiris and J. F. Canny and R. Seidel",
title = "Efficient Perturbations for Handling Geometric
Degeneracies",
journal = "Algorithmica",
volume = 19,
number = "1--2",
month = sep,
year = 1997,
pages = "219--242",
url = {http://citeseer.nj.nec.com/51100.html}
}
@article{ee-innfm-94,
keyent = {ee-innfm-94},
author = "D. Eppstein and J. Erickson",
title = {Iterated nearest neighbors and finding minimal
polytopes},
url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/small.html},
journal = DCG,
volume = 11,
year = 1994,
pages = "321--350"
}
@inproceedings{efnn-rauvd-89,
keyent = {efnn-rauvd-89},
author = "H. Ebara and N. Fukuyama and H. Nakano and
Y. Nakanishi",
title = "Roundness algorithms using the {Voronoi} diagrams",
booktitle = CCCG_1989,
year = 1989,
pages = 41
}
@INPROCEEDINGS{eg-simi-01,
keyent = {eg-simi-01},
AUTHOR = "H. Edelsbrunner and D. Guoy",
TITLE = "Sink insertion for mesh improvement",
BOOKTITLE = "Proc. {$17th$} ACM Symp. Comp. Geom.",
PAGES = "115--123",
YEAR = 2001
}
@article{eg-tsa-89,
keyent = {eg-tsa-89},
author = "H. Edelsbrunner and L. J. Guibas",
title = "Topologically sweeping an arrangement",
journal = "J. Comput. Syst. Sci.",
volume = 38,
year = 1989,
pages = "165--194",
note = "Corrigendum in 42 (1991), 249--251"
}
@inproceedings{eghlmm-sspcg-00,
keyent = {eghlmm-sspcg-00},
author = {A. Efrat and L. J. Guibas and S. {Har-Peled} and
D. C. Lin and J. S.B. Mitchell and T. M. Murali},
title = {Sweeping Simple Polygons with a Chain of Guards},
booktitle = SODA_2000,
acceptrate = SODA_2000_AR,
pages = {927--936},
year = 2000,
}
@InProceedings{eghm-mbp-01,
keyent = {eghm-mbp-01},
author = {A. Efrat and L. J. Guibas and S. {Har-Peled} and
T. M. Murali},
title = {Morphing between Polylines},
booktitle = SODA_2001,
acceptrate = SODA_2001_AR,
year = 2001,
pages = {680--689}
}
@article{eghsssw-irals-89,
keyent = {eghsssw-irals-89},
author = "H. Edelsbrunner and L. J. Guibas and J. Hershberger
and R. Seidel and M. Sharir and J. Snoeyink and
E. Welzl",
title = "Implicitly representing arrangements of lines or
segments",
journal = DCG,
volume = 4,
year = 1989,
pages = "433--466"
}
@inproceedings{egp-megcm-00,
keyent = {egp-megcm-00},
author = "A. Elisseeff and Y. Guermeur and H. {Paugam-Moisy}",
title = "Margin error and generalization capabilities of
multiclass discriminant systems",
booktitle = "IEEE-INNS-ENNS Int. Joint Conf. on Neural Networks",
year = 2000,
}
@article{egs-oplms-86,
keyent = {egs-oplms-86},
author = "H. Edelsbrunner and L. J. Guibas and J. Stolfi",
title = "Optimal point location in a monotone subdivision",
journal = SICOMP,
volume = 15,
number = 2,
year = 1986,
pages = "317--340",
keywords = "data structuring, searching, point location, binary
search, directed acyclic graphs, subdivisions,
two-dimensional"
}
@inproceedings{egs-sqsdd-05,
title = {The skip quadtree: a simple dynamic data structure
for multidimensional data},
author = {D. Eppstein and M. T. Goodrich and J. Z. Sun},
eprint = {cs.CG/0507049},
booktitle = SOCG_2005,
pages = {296--305},
month = {June},
year = 2005
}
@article{egs-ueplf-89,
keyent = {egs-ueplf-89},
author = "H. Edelsbrunner and L. J. Guibas and M. Sharir",
title = "The upper envelope of piecewise linear functions:
algorithms and applications",
journal = DCG,
volume = 4,
year = 1989,
pages = "311--336",
keywords = "upper/lower envelope, arrangement of simplices"
}
@inproceedings{eh-fcmfc-98c,
keyent = {eh-fcmfc-98c},
author = "A. Efrat and S. {Har-Peled}",
title = {{Fly cheaply: on the minimum fuel consumption
problem}},
booktitle = SOCG_1998,
acceptrate = SOCG_1998_AR_TT,
year = 1998,
pages = {143--145},
url = {http://doi.acm.org/10.1145/276884.276900},
doi = {10.1145/276884.276900}
}
@Article{eh-fcmfc-98d,
keyent = {eh-fcmfc-98d},
author = "A. Efrat and S. {Har-Peled}",
title = {{Fly cheaply: on the minimum fuel consumption
problem}},
journal = IJCGA,
year = 1998,
note = {to appear}
}
@article{eh-ggt-06,
title = "Guarding galleries and terrains",
author = "A. Efrat and S. {Har-Peled}",
journal = IPL,
volume = 100,
year = 2006,
pages = "238--245",
number = 6,
doi = {10.1016/j.ipl.2006.05.014}
}
@Article{eh-lgag-02,
keyent = {eh-lgag-02},
author = "A. Efrat and S. {Har-Peled}",
title = {Guarding Galleries and Terrains},
journal = "2nd IFIP Internat. Conf. Theo. Comp. Sci.",
year = 2002,
pages = {181--192},
acceptrate = {52\%}
}
@inproceedings{eh-ocsid-02,
keyent = {eh-ocsid-02},
author = "J. Erickson and S. {Har-Peled}",
title = "Optimally Cutting a Surface into a Disk",
booktitle = SOCG_2002,
acceptrate = SOCG_2002_AR,
year = 2002,
pages = {244--253}
}
@article{eh-ocsid-04,
keyent = {eh-ocsid-04},
author = "J. Erickson and S. {Har-Peled}",
title = "Optimally Cutting a Surface into a Disk",
journal = DCG,
volume = 31,
number = 1,
pages = {37--59},
year = 2004
}
@Article{eghmm-nsmpa-02,
author = {A. Efrat and L. J. Guibas and S. {Har-Peled} and
J. S.B. Mitchell and T.M. Murali},
title = {New Similarity Measures between Polylines with
Applications to Morphing and Polygon Sweeping},
journal = DCG,
year = 2002,
volume = 28,
pages = {535--569}
}
@inproceedings{ehm-aatol-05,
author = {A. Efrat and S. {Har-Peled} and J. S. B. Mitchell},
title = {Approximation algorithms for location problems in
sensor networks},
booktitle = BROADNETS_2005,
acceptrate = BROADNETS_2005_AR,
year = 2005,
pages = {767-776},
crossref = {DBLP:conf/broadnets/2005},
}
@proceedings{DBLP:conf/broadnets/2005,
title = {2nd International Conference on Broadband Networks
(BROADNETS 2005), 3-7 October 2005, Boston,
Massachusetts, USA},
booktitle = {BROADNETS},
publisher = {IEEE},
year = 2005,
}
@inproceedings{ehm-lmsp-04,
keyent = {ehm-lmsp-04},
title = {On the Least Median Square Problem},
author = {J. Erickson and S. {Har-Peled} and D. Mount},
year = 2004,
booktitle = SOCG_2004,
acceptrate = SOCG_2004_AR,
pages = {273--279}
}
@article{ehm-lmsp-06,
title = {On the Least Median Square Problem},
author = {J. Erickson and S. {Har-Peled} and D. Mount},
journal = DCG,
volume = 36,
number = 4,
year = 2006,
pages = {593--607},
url = {http://dx.doi.org/10.1007/s00454-006-1267-6},
doi = {10.1007/s00454-006-1267-6},
}
@article{eik-ghbmr-01,
keyent = {eik-ghbmr-01},
author = "A. Efrat and A. Itai and M. J. Katz",
title = "Geometry Helps in Bottleneck Matching and Related
Problems",
journal = "Algorithmica",
volume = 31,
number = 1,
pages = "1-28",
year = 2001,
url = "citeseer.nj.nec.com/efrat99geometry.html"
}
@inproceedings{eio-ddra-02,
keyent = {eio-ddra-02},
author = "L. Engebretsen and P. Indyk and R. O'Donnell",
title = "Derandomized dimensionality reduction with
applications",
booktitle = SODA_2002,
year = 2002,
pages = "705--712"
}
@article{ek-adspe-89,
keyent = {ek-adspe-89},
author = "O. Egecioglu and B. Kalantari",
title = "Approximating the diameter of a set of points in the
{Euclidean} space",
journal = IPL,
volume = 32,
year = 1989,
pages = "205--211"
}
@Article{el-csm-89,
keyent = {el-csm-89},
author = {H. A. Eiselt and G. Laporte},
title = {Competitive spatial models},
journal = {European Journal of Operational Research},
volume = 39,
pages = {231--242},
year = 1989
}
@InProceedings{elrs-cfcsg-02,
keyent = {elrs-cfcsg-02},
author = {G.~Even and Z.~Lotker and D.~Ron and S.~Smordinsky},
title = {Conflict-free colorings of simple geometric regions
with applications to frequency assignment in
cellular networks},
booktitle = FOCS_2002,
year = 2002,
url = {http://www.eng.tau.ac.il/~guy/Papers/ELRS.pdf},
pages = {691--700}
}
@article{elrs-cfcsg-03,
keyent = {elrs-cfcsg-03},
author = {G.~Even and Z.~Lotker and D.~Ron and S.~Smordinsky},
title = {Conflict-free colorings of simple geometric regions
with applications to frequency assignment in
cellular networks},
journal = SICOMP,
year = 2003,
note = "To appear."
}
@Article{elt-clmfb-93,
keyent = {elt-clmfb-93},
author = {H. A. Eiselt and G. Laporte and J.-F. Thisse},
title = {Competitive location models: A framework and
bibliography},
journal = {Transportation Science},
volume = 27,
pages = {44--54},
year = 1993
}
@article{ep-mps-88,
keyent = {ep-mps-88},
author = "H. Edelsbrunner and F. P. Preparata",
title = "Minimum polygonal separation",
journal = "Inform. Comput.",
volume = 77,
year = 1988,
pages = "218--232"
}
@article{erk-oalla-96,
keyent = {erk-oalla-96},
author = "H. Everett and J.-M. Robert and {M. van} Kreveld",
title = "An optimal algorithm for the {$({\leq} k)$}-levels,
with applications to separation and transversal
problems",
journal = IJCGA,
volume = 6,
year = 1996,
pages = "247--261"
}
@article{es-blbda-95,
keyent = {es-blbda-95},
author = "J. Erickson and R. Seidel",
title = "Better lower bounds on detecting affine and
spherical degeneracies",
journal = DCG,
volume = 13,
year = 1995,
pages = "41--57",
doi = {10.1007/BF02574027},
url = {http://compgeom.cs.uiuc.edu/~jeffe/pubs/degen.html}
}
@article{es-cmsrl-90,
keyent = {es-cmsrl-90},
author = "H. Edelsbrunner and D. L. Souvaine",
title = "Computing median-of-squares regression lines and
guided topological sweep",
journal = "J. Amer. Statist. Assoc.",
volume = 85,
year = 1990,
pages = "115--119",
url = {http://www.cs.tufts.edu/r/geometry/lms/},
keywords = "statistics, optimization, plane-sweep, topological
sweep, geometric transformations, binary search,
points, lines"
}
@article{es-cufop-00,
keyent = {es-cufop-00},
author = "A. Efrat and M. Sharir",
title = "On the complexity of the union of fat convex objects
in the plane",
journal = DCG,
volume = 23,
year = 2000,
pages = "171--189"
}
@TechReport{es-rcddn-03,
keyent = {es-rcddn-03},
author = {M. Effros and L. J. Schulman},
title = {Deterministic clustering with data nets},
institution = {Elec. Colloq. Comp. Complexity},
year = 2003,
number = {TR04-085},
note =
{\url{http://www.eccc.uni-trier.de/eccc-reports/2004/TR04-085/}},
url =
{http://www.eccc.uni-trier.de/eccc-reports/2004/TR04-085/}
}
@article{esz-cskec-94,
keyent = {esz-cskec-94},
author = "A. Efrat and M. Sharir and A. Ziv",
title = "Computing the Smallest {$k$}-Enclosing Circle and
Related Problems",
journal = CGTA,
volume = 4,
year = 1994,
pages = "119--136"
}
@article{ew-cbtda-86,
keyent = {ew-cbtda-86},
author = "H. Edelsbrunner and E. Welzl",
title = "Constructing belts in two-dimensional arrangements
with applications",
journal = SICOMP,
volume = 15,
year = 1986,
pages = "271--284"
}
@InProceedings{ew-gohhg-05,
author = {J. Erickson and K. Whittlesey},
title = {Greedy optimal homotopy and homology generators},
booktitle = SODA_2005,
pages = {1038--1046},
year = 2005
}
@techreport{f-cmlrb-92,
keyent = {f-cmlrb-92},
author = "S. P. Fekete",
title = "On the complexity of min-link red-blue separation",
type = "Manuscript",
institution = "Department of Applied Mathematics, SUNY Stony Brook,
NY",
year = 1992
}
@article{f-dsolu-85,
keyent = {f-dsolu-85},
author = "G. N. Frederickson",
title = "Data Structures for On-Line Updating of Minimum
Spanning Trees, with Applications",
journal = SICOMP,
volume = 14,
number = 4,
year = 1985,
pages = "781--798"
}
@article{f-faspp-87,
keyent = {f-faspp-87},
author = "G. N. Frederickson",
title = "Fast algorithms for shortest paths in planar graphs,
with applications",
journal = SICOMP,
volume = 16,
number = 6,
year = 1987,
pages = "1004--1022",
keywords = "shortest paths, graphs",
doi = {10.1137/0216064},
}
@book{f-gmagt-82,
keyent = {f-gmagt-82},
author = "L. W. Foster",
title = "GEO-METRICS {II}: {The} application of geometric
tolerancing techniques",
publisher = "Addison-Wesley",
year = 1982
}
@book{f-iptia-91,
keyent = {f-iptia-91},
author = "W. Feller",
title = "An Introduction to Probability Theory and its
Applications",
publisher = "John Wiley \& Sons, NY",
year = 1991
}
@book{f-iptiaII-71,
keyent = {f-iptiaII-71},
author = "W. Feller",
title = "An Introduction to Probability Theory and its
Applications",
publisher = "John Wiley \& Sons, NY",
eddition = {2ed},
volume = {II},
year = 1971
}
@article{f-savd-87,
keyent = {f-savd-87},
author = "S. J. Fortune",
title = "A sweepline algorithm for {Voronoi} diagrams",
journal = ALGORITHMICA,
volume = 2,
year = 1987,
pages = "153--174",
doi = {10.1007/BF01840357},
keywords = "plane-sweep, geometric transformations, {Voronoi}
diagrams, Delaunay triangulations"
}
@Book{f-spr-90,
keyent = {f-spr-90},
author = {K. Fukunaga},
title = {Statistical Pattern Recognition},
publisher = {Academic Press},
year = 1990,
edition = {2nd}
}
@article{f-sqpcf-06,
author = {M.~Frech\'{e}t},
title = {Sur quelques points du calcul fonctionnel},
journal = {Rendic. Circ. Mat. Palermo},
volume = 22,
pages = {1--74},
year = 1906
}
@article{f-sdds-24,
author = {M.~Frech\'{e}t},
title = {Sur la distance de deux surfaces},
journal = {Ann.~Soc.~Polonaise Math.},
volume = 3,
pages = {4--19},
year = 1924
}
@incollection{f-vddt-97,
keyent = {f-vddt-97},
author = "S. Fortune",
title = "{Voronoi} diagrams and {Delaunay} triangulations",
chapter = 20,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
year = 1997
}
@Unpublished{ffs-cwfta-06,
author = {D. Feldman and A. Fiat and M. Sharir},
title = {Coresets for Weighted Facilities and Their
Applications},
note = {manucript},
year = 2006
}
@inproceedings{fg-avtpp-95,
author = {U. Feige and M. Goemans},
title = {Approximating the value of two power proof systems,
with applications to MAX 2SAT and MAX DICUT},
booktitle = {ISTCS '95: Proceedings of the 3rd Israel Symposium
on the Theory of Computing Systems (ISTCS'95)},
year = 1995,
isbn = {0-8186-6915-2},
pages = 182,
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@InProceedings{fg-oafac-88,
keyent = {fg-oafac-88},
author = {T. Feder and D. H. Greene},
title = {Optimal algorithms for approximate clustering},
booktitle = STOC_1988,
year = 1988,
pages = {434--444},
doi = {10.1145/62212.62255}
}
@article{fgkss-dccga-00,
author = "A. Fabri and G.-J. Giezeman and L. Kettner and
S. Schirra and S. Sch{\"o}nherr",
title = "On the Design of {CGAL} a Computational Geometry
Algorithms Library",
journal = "Softw. -- Pract. Exp.",
volume = 30,
number = 11,
year = 2000,
pages = "1167--1202",
annote = "Special Issue on Discrete Algorithm Engineering"
}
@Unpublished{fh-ccrp-06,
author = {J. Fischer and S. {Har-Peled}},
title = {On Coresets for Clustering and Related Problems},
note = {manuscript},
year = 2006
}
@article(fh-dandc-49,
author = "E. Fix and J. Hodges",
title = "Discriminatory Analysis. Nonparametric
Discrimination: Consistency Properties",
journal = "Technical Report 4, Project Number 21-49-004, USAF
School of Aviation Medicine, Randolph Field, TX",
year = 1949
)
@inproceedings{fh-dwspd-05,
author = {J. Fischer and S. {Har-Peled}},
title = {Dynamic Well-Separated Pair Decomposition Made
Easy.},
booktitle = CCCG_2005,
year = 2005,
pages = {235--238},
ee = {http://www.cccg.ca/proceedings/2005/32.pdf}
}
@inproceedings{fh-oscps-95,
keyent = {fh-oscps-95},
author = "U. Finke and K. Hinrichs",
title = "Overlaying simply connected planar subdivisions in
linear time",
booktitle = SOCG_1995,
year = 1995,
pages = "119--126",
keywords = "red-blue segment intersection"
}
@article{fj-gsrsm-84,
author = "G. N. Frederickson and D. B. Johnson",
title = "Generalized selection and ranking: {Sorted
matrices}",
journal = SICOMP,
volume = 13,
year = 1984,
pages = "14--30"
}
@Article{fks-nccjp-96,
keyent = {fks-nccjp-96},
author = {U.~Faigle and W.~Kern and M.~Streng},
title = {{Note on the computational complexity of {$j$}-radii
of polytopes in $\Re^n$}},
journal = {Math. Prog.},
year = 1996,
volume = 73,
pages = {1--5}
}
@article{fks-sstwc-84,
keyent = {fks-sstwc-84},
author = "M. L. Fredman and J. Komlos and E. Szemeredi",
title = "Storing a sparse table with {$O(1)$} worst case access
time",
journal = JACM,
volume = 31,
number = 3,
month = jul,
year = 1984,
pages = "538--544"
}
@article{fkv-fmcaf-04,
author = {A. Frieze and R. Kannan and S. Vempala},
title = {Fast monte-carlo algorithms for finding low-rank
approximations},
journal = JACM,
volume = 51,
number = 6,
year = 2004,
issn = {0004-5411},
pages = {1025--1041},
doi = {10.1145/1039488.1039494}
}
@inproceedings{fkv-fmcaf-98-conf,
author = {A. Frieze and R. Kannan and S. Vempala},
title = {Fast {M}onte-{C}arlo Algorithms for finding low-rank
approximations},
booktitle = {FOCS '98: Proceedings of the 39th Annual Symposium
on Foundations of Computer Science},
year = 1998,
isbn = {0-8186-9172-7},
pages = 370,
publisher = {IEEE Computer Society},
}
@ARTICLE{fl-fmfai-95,
keyent = {fl-fmfai-95},
author = {C. Faloutsos and K. I. Lin},
title = {{FastMap}: a fast algorithm for indexing,
data-mining and visualization of traditional and
multimedia datasets},
journal = {SIGMOD Record (ACM Special Interest Group on
Management of Data)},
volume = 24,
number = 2,
pages = {163--174},
month = {June},
year = 1995,
coden = {SRECD8},
issn = {0163-5808},
bibdate = {Mon Dec 9 16:02:09 MST 1996},
acknowledgement= {Nelson H. F. Beebe, Center for Scientific
Computing, Department of Mathematics, University of
Utah, Salt Lake City, UT 84112, USA, Tel: +1 801 581
5254, FAX: +1 801 581 4148, e-mail:
\path|beebe@math.utah.edu|, URL:
\path|http://www.math.utah.edu/\tildegen{}beebe/|},
affiliation = {AT\&T Bell Labs., Murray Hill, NJ, USA},
classification= {C6160 (Database management systems (DBMS)); C6170K
(Knowledge engineering techniques); C7240
(Information analysis and indexing); C6160S (Spatial
and pictorial databases); C4240 (Programming and
algorithm theory)},
keywords = {FastMap; Fast algorithm; Indexing; Data-mining;
Visualization; Multimedia datasets; Traditional
datasets; Feature-extraction functions; Domain
expert; Highly fine-tuned spatial access methods;
Best-match query; K-dimensional space; Potential
clusters; Pattern recognition},
thesaurus = {Feature extraction; Indexing; Knowledge acquisition;
Multimedia computing; Pattern matching},
xxcrossref = {Anonymous:1995:ASI},
}
@article{flm-dassc-77,
keyent = {flm-dassc-77},
author = {T. Figiel and J. Lindenstrauss and V. D. Milman},
title = {The dimension of almost spherical sections of convex
bodies},
journal = {Acta Math.},
number = 139,
year = 1977,
pages = {53--94}
}
@InProceedings{flpr-coa-99,
author = {M. Frigo and C. E. Leiserson and H. Prokop and
S. Ramachandran},
title = {Cache-Oblivious Algorithms},
booktitle = FOCS_1999,
pages = {285--298},
year = 1999,
}
@article{fm-jllss-88,
keyent = {fm-jllss-88},
author = "P. Frankl and H. Maehara",
title = "The {Johnson-Lindenstrauss} Lemma and the Sphericity
of Some Graphs",
journal = "J. Comb. Theory B",
volume = 44,
year = 1988,
pages = "355--362"
}
@InProceedings{fm-lookg-00,
keyent = {fm-lookg-00},
author = {S. Funke and K. Mehlhorn},
title = {{LOOK} - A Lazy object-oriented kernel for geometric
computation},
booktitle = SOCG_2000,
pages = {156--165},
year = 2000
}
@article{fm-orvgr-05,
author = {S. P. Fekete and H. Meijer},
title = {The one-round {Voronoi} game replayed},
journal = {Comput. Geom. Theory Appl.},
volume = 30,
number = 2,
year = 2005,
issn = {0925-7721},
pages = {81--94},
doi = {10.1016/j.comgeo.2004.05.005},
publisher = {Elsevier}
}
@book{fm-sac-01,
keyent = {fm-sac-01},
author = "L. da {Fontana Costa} and R. {Marcondes Cesar, Jr.}",
title = "Shape Analysis and Classification",
publisher = "CRC Press",
year = 2001
}
@article{fp-ochr3-87,
keyent = {fp-ochr3-87},
author = "O. D. Faugeras and J. Ponce",
title = "An object-centered hierarchical representation for
{$3$}-d objects: {The} prism-tree",
journal = "Computer Vision, Graphics, and Image Processing",
volume = 38,
pages = {1--28},
year = 1987
}
@inproceedings{frt-tbaam-03,
keyent = {frt-tbaam-03},
AUTHOR = {J. Fakcharoenphol and S. Rao and K. Talwar},
TITLE = {A tight bound on approximating arbitrary metrics by
tree metrics},
PAGES = {448--455},
YEAR = 2003,
BOOKTITLE = STOC_2003
}
@InProceedings{fs-cdgds-05,
author = {G. Frahling and C. Sohler},
title = {Coresets in dynamic geometric data streams},
booktitle = STOC_2005,
year = 2005,
note = {To appear}
}
@article{fs-dtgol-97,
author = {Y. Freund and R. E. Schapire},
title = {A decision-theoretic generalization of on-line
learning and an application to boosting},
journal = {J. Comput. Syst. Sci.},
volume = 55,
number = 1,
year = 1997,
issn = {0022-0000},
pages = {119--139},
doi = {10.1006/jcss.1997.1504}
}
@inproceedings{fs-lmcup-98,
keyent = {fs-lmcup-98},
author = "Y. Freund and R. E. Schapire",
title = "Large Margin Classification Using the Perceptron
Algorithm",
booktitle = "Computational Learing Theory",
pages = "209-217",
year = 1998
}
@Article{ftm-etscnflm-89,
keyent = {ftm-etscnflm-89},
author = {R. L. Tobin and T. L. Friesz and T. Miller},
title = {Existence theory for spatially competitive network
facility location models},
journal = {Annals of Operations Research},
year = 1989,
volume = 18,
pages = {267--276}
}
@inproceedings{g-aaagp-87,
keyent = {g-aaagp-87},
author = "S. K. Ghosh",
title = "Approximation algorithms for art gallery problems",
booktitle = "Proc. Canadian Inform. Process. Soc. Congress",
year = 1987
}
@incollection{g-aacb-93,
keyent = {g-aacb-93},
author = "P. M. Gruber",
title = "Aspects of approximation of convex bodies",
chapter = "1.10",
editor = "P. M. Gruber and J. M. Wills",
booktitle = "Handbook of Convex Geometry",
volume = "A",
publisher = "North-Holland",
year = 1993,
pages = "319--345",
annote = 584
}
@Article{g-bmi-02,
keyent = {g-bmi-02},
author = {R. J. Gardner},
title = {The {Brunn-Minkowski} inequality},
journal = {Bull. Amer. Math. Soc.},
year = 2002,
volume = 39,
pages = {355--405},
url = "http://www.ac.wwu.edu/~gardner/gorizia12.pdf"
}
@article{g-cmmid-85,
keyent = {g-cmmid-85},
author = "T. Gonzalez",
title = "Clustering to minimize the maximum intercluster
distance",
journal = "Theoret. Comput. Sci.",
volume = 38,
year = 1985,
pages = "293--306"
}
@inproceedings{g-ealcc-98,
keyent = {g-ealcc-98},
author = "B. Gaertner",
title = "Exact Arithmetic at Low Cost - {A} Case Study in
Linear Programming",
booktitle = SODA_1998,
nickname = "SODA'98",
year = 1998,
pages = "157--166"
}
@PhdThesis{g-efm-00,
keyent = {g-efm-00},
AUTHOR = {A. Gupta},
TITLE = {Embeddings of Finite Metrics},
YEAR = 2000,
school = {University of California, Berkeley}
}
@article{g-ewrq-82,
author = {I. Gargantini},
title = {An effective way to represent quadtrees},
journal = CACM,
volume = 25,
number = 12,
year = 1982,
pages = {905--910},
}
@incollection{g-kdssa-98,
keyent = {g-kdssa-98},
author = "L. J. Guibas",
title = "Kinetic data structures --- a state of the art
report",
editor = "P. K. Agarwal and L. E. Kavraki and M. Mason",
booktitle = WAFR_1998,
publisher = "A. K. Peters",
address = "Wellesley, MA",
year = 1998,
pages = "191--209",
url = {http://graphics.stanford.edu/~guibas/g-kds.ps}
}
@article{t-psmks-01,
keyent = {t-psmks-01},
author = "G. T{\'o}th",
title = "Point sets with many {$k$}-sets",
journal = DCG,
volume = 26,
number = 2,
pages = "187--194",
year = 2001
}
@book{g-repfp-88,
keyent = {g-repfp-88},
author = "L. Greengard",
title = "The rapid evaluation of potential fields in particle
systems",
publisher = "MIT Press",
address = "Cambridge",
year = 1988
}
@inproceedings{g-rtdis-84,
keyent = {g-rtdis-84},
author = "A. Guttman",
title = "R-Trees: {A} Dynamic Index Structure for Spatial
Searching",
booktitle = "Proc. ACM SIGMOD Conf. Principles Database Systems",
year = 1984,
pages = "47--57",
annote = {{564}}
}
@article{g-saaop-95,
keyent = {g-saaop-95},
author = "B. G{\"a}rtner",
title = "A Subexponential Algorithm for Abstract Optimization
Problems",
journal = SICOMP,
volume = 24,
year = 1995,
pages = "1018--1035",
url =
{http://www.inf.ethz.ch/personal/gaertner/texts/own_work/GART_aop.ps.gz},
keywords = "geometric optimization, randomized algorithm,
smallest enclosing ball, distance of convex
polyhedra"
}
@Book{g-ssabm-87,
keyent = {g-ssabm-87},
editor = {M. Gardner},
title = {Second Scientific American Book of Mathematical
Puzzles and Diversions},
publisher = {Univ of Chicago Pr},
year = 1987,
note = {ISBN 0226282538}
}
@InProceedings{gc-ccrmr-01,
keyent = {gc-ccrmr-01},
author = {K.~Goldberg and B.~Chen},
title = {Collaborative control of robot motion: Robustness to
error},
booktitle = {Int. Conf. Intell. Robots Sys.},
year = 2001,
url =
{http://www.ieor.berkeley.edu/~goldberg/pubs/robust-iros01.pdf}
}
@Misc{gc-web-02,
keyent = {gc-web-02},
title = {http://www.globalcam.net/demos.html},
url = {http://www.globalcam.net/demos.html},
key = {GlobalCam},
year = 2002
}
@InProceedings{gcsbf-cti-01,
keyent = {gcsbf-cti-01},
author = {K.~Goldberg and B.~Chen and R.~Solomon and S.~Bui
and B.~Farzin and J.~Heitler and D.~Poon and
G.~Smith},
title = {Collaborative teleoperation via the internet},
booktitle = ICRA_2001,
year = 2001,
url =
{http://www.ieor.berkeley.edu/~goldberg/pubs/ctoi.pdf}
}
@article{gg-mam-98,
keyent = {gg-mam-98},
author = "V. Gaede and O. G{\"u}nther",
title = "Multidimensional Access Methods",
journal = "ACM Comput. Surv.",
volume = 30,
year = 1998,
pages = "170--231"
}
@Unpublished{gg-smamm-02,
keyent = {gg-smamm-02},
author = {J.~Gao and L. J. Guibas},
title = {Staying in the middle: approximate medians in
{$\reals^1$} and $\reals^2$ for moving points},
year = 2002,
note = {manuscript}
}
@book{gg-vqsc-91,
keyent = {gg-vqsc-91},
author = "A. Gersho and R. M. Gray",
title = "Vector Quantization and Signal Compression",
publisher = "Kluwer Academic Publishers",
year = 1991
}
@inproceedings{gghzz-dmc-01,
keyent = {gghzz-dmc-01},
author = {J. Gao and L. Guibas and J. Hershberger and L. Zhang
and A. Zhu},
title = {Discrete Mobile Centers},
booktitle = SOCG_2001,
pages = "188--196",
year = 2001
}
@inproceedings{gh-msp-94,
author = "L. J. Guibas and J. Hershberger",
title = "Morphing Simple Polygons",
booktitle = SOCG_1994,
year = 1994,
pages = "267--276"
}
@article{gh-ospqs-89,
keyent = {gh-ospqs-89},
author = "L. J. Guibas and J. Hershberger",
title = "Optimal shortest path queries in a simple polygon",
journal = JCSS,
volume = 39,
number = 2,
month = oct,
year = 1989,
pages = "126--152",
doi = {10.1016/0022-0000(89)90041-x}
}
@article{ghlst-ltavs-87,
keyent = {ghlst-ltavs-87},
author = "L. J. Guibas and J. Hershberger and D. Leven and
M. Sharir and R. E. Tarjan",
title = "Linear-time algorithms for visibility and shortest
path problems inside triangulated simple polygons",
journal = "Algorithmica",
volume = 2,
year = 1987,
pages = "209--233",
keywords = "polygons, simple, shortest paths, visibility, finger
search trees"
}
@inproceedings{ghr-gbppm-02,
keyent = {ghr-gbppm-02},
title = "On generalization bounds, projection profile, and
margin distribution",
author = "A. Garg and S. {Har-Peled} and D. Roth",
booktitle = ICML_2002,
acceptrate = ICML_2002_AR,
year = 2002,
pages = {171--178}
}
@article{ghs-citds-91,
keyent = {ghs-citds-91},
author = "L. J. Guibas and J. Hershberger and J. Snoeyink",
title = "Compact interval trees: a data structure for convex
hulls",
journal = IJCGA,
volume = 1,
number = 1,
year = 1991,
pages = "1--22",
url =
{http://portal.acm.org/citation.cfm?id=320195&coll=portal&dl=ACM&CFID=11111111&CFTOKEN=2222222&ret=1#},
keywords = "data structures, convex hull, lower bounds, common
tangents"
}
@misc{gim-sshdh-99,
keyent = {gim-sshdh-99},
author = "A. Gionis and P. Indyk and R. Motwani",
title = "Similarity Search in High Dimensions via Hashing",
text = "A. Gionis, P. Indyk, and R. Motwani. Similarity
Search in High Dimensions via Hashing. Manuscript,
1997.",
year = 1997
}
@inproceedings{giv-rahdp-01,
keyent = {giv-rahdp-01},
author = "A. Goel and P. Indyk and K. R. Varadarajan",
title = "Reductions among high dimensional proximity
problems",
booktitle = SODA_2001,
year = 2001,
pages = {769--778},
url = {http://pollux.usc.edu/~agoel/papers/reductions.ps}
}
@book{gj-cigtn-79,
author = {M. R. Garey and D. S. Johnson},
title = {Computers and Intractability; A Guide to the Theory
of {NP}-Completeness},
year = 1990,
isbn = 0716710455,
publisher = {W. H. Freeman \& Co.}
}
@article{gjs-eacrp-99,
keyent = {gjs-eacrp-99},
author = "P. Gupta and R. Janardan and M. Smid",
title = "Efficient algorithms for counting and reporting
pairwise intersections between convex polygons",
journal = IPL,
volume = 69,
year = 1999,
pages = "7--13",
}
@article{gk-ccioj-93,
keyent = {gk-ccioj-93},
author = "P. Gritzmann and V. Klee",
title = "Computational complexity of inner and outer
{$j$}-radii of polytopes in finite-dimensional normed
spaces",
journal = "Math. Program.",
volume = 59,
year = 1993,
pages = "163--213"
}
@article{gk-csbpc-94,
keyent = {gk-csbpc-94},
author = "P. Gritzmann and V. Klee",
title = "On the complexity of some basic problems in
computational convexity: I. Containment problems",
journal = "Discrete Math.",
volume = 136,
year = 1994,
pages = "129--174"
}
@article{gk-iojrc-92,
keyent = {gk-iojrc-92},
author = "P. Gritzmann and V. Klee",
title = "Inner and outer {$j$}-radii of convex bodies in
finite-dimensional normed spaces",
journal = DCG,
volume = 7,
year = 1992,
pages = "255--280"
}
@inproceedings{gk-pccos-04,
author = {M. Greenwald and S. Khanna},
title = {Power-conserving computation of order-statistics
over sensor networks},
booktitle = PODS_2004,
year = 2004,
pages = {275--285},
location = {Paris, France}
}
@inproceedings{gk-seocq-01,
author = {M. Greenwald and S. Khanna},
title = {Space-efficient online computation of quantile
summaries},
booktitle = SIGMOD_2001,
year = 2001,
pages = {58--66},
location = {Santa Barbara, California, United States}
}
@inproceedings{gkkpp-adls-01,
keyent = {gkkpp-adls-01},
author = "C. Gavoille and M. Katz and N. A. Katz and C. Paul
and D. Peleg",
title = {Approximate Distance Labeling Schemes},
year = 2001,
pages = {476--487},
booktitle = ESA_2001,
publisher = {Springer},
series = LNCS,
volume = 2161,
}
@inproceedings{gkl-bgfld-03,
keyent = {gkl-bgfld-03},
TITLE = {Bounded Geometries, Fractals, and Low-Distortion
Embeddings},
AUTHOR = {Gupta, A. and Krauthgamer, R. and Lee, J. R.},
BOOKTITLE = FOCS_2003,
YEAR = 2003,
PAGES = {534--543},
}
@book{gl-mc-96,
keyent = {gl-mc-96},
author = "G. H. Golub and C. F. van Loan",
title = "Matrix computations",
edition = "3nd",
publisher = "Johns Hopkins University Press",
address = "Baltimore, MD",
year = 1996
}
@inproceedings{gl-ragas-01,
keyent = {gl-ragas-01},
author = {H. {Gonz{\'a}lez-Banos} and J.-C. Latombe},
title = {A randomized art-gallery algorithm for sensor
placement},
booktitle = SOCG_2001,
year = 2001,
pages = {232--240}
}
@inproceedings{glllm-vbpep-97,
author = {L. J. Guibas and J.-C. Latombe and S. M. LaValle and
D. Lin and R. Motwani},
title = {Visibility-Based Pursuit-Evasion in a Polygonal
Environment},
booktitle = WADS_1997,
year = 1997,
pages = {17--30}
}
@inproceedings{glm-othsr-96,
keyent = {glm-othsr-96},
author = "S. Gottschalk AND M. C. Lin and D. Manocha",
title = "{OBB}-tree: A hierarchical structure for rapid
interference detection",
booktitle = SIGGRAPH_1996,
year = 1996,
pages = "171-180"
}
@inproceedings{glns-adogg-02,
keyent = {glns-adogg-02},
author = {J. Gudmundsson and C. Levcopoulos and G. Narasimhan
and M. Smid},
title = {Approximate distance oracles for geometric graphs},
booktitle = SODA_2002,
year = 2002,
isbn = {0-89871-513-X},
pages = {828--837},
location = {San Francisco, California},
publisher = {Society for Industrial and Applied Mathematics},
}
@inproceedings{glns-ador-02,
keyent = {glns-ador-02},
author = {J. Gudmundsson and C. Levcopoulos and G. Narasimhan
and M. H. M. Smid},
title = {Approximate Distance Oracles Revisited},
booktitle = ISAAC_2002,
year = 2002,
isbn = {3-540-00142-5},
pages = {357--368},
publisher = {Springer-Verlag},
}
@inproceedings{gls-aidid-06,
title = "Analysis of Incomplete Data and an
Intrinsic-Dimension Helly Theorem",
author = "J. Gao and M. Langberg and L. Schulman",
year = 2006,
pages = {464--473},
url =
"http://www.cs.sunysb.edu/~jgao/paper/clustering_lines.pdf",
booktitle = SODA_2006,
}
@book{gls-gaco-93,
keyent = {gls-gaco-93},
author = "M. Gr{\"o}tschel and L. Lov{\'a}sz and A. Schrijver",
title = "Geometric Algorithms and Combinatorial Optimization",
series = "Algorithms and Combinatorics",
volume = 2,
edition = {2nd},
publisher = "Springer-Verlag",
address = "Berlin Heidelberg",
year = 1993
}
@inproceedings{gmmc-cds-00,
keyent = {gmmc-cds-00},
author = "S. Guha and N. Mishra and R. Motwani and
L. O'Callaghan",
title = "Clustering Data Streams",
booktitle = FOCS_2000,
pages = "359-366",
year = 2000,
url = {http://citeseer.nj.nec.com/guha00clustering.html}
}
@Article{gmmn-pp0wr-90,
keyent = {gmmn-pp0wr-90},
author = "L.~Gewali and A.~Meng and J. S. B. Mitchell and
S. Ntafos",
title = "Path planning in {$0/1/\infty$} weighted regions with
applications",
journal = "ORSA J. Computing",
volume = 2,
pages = {253--272},
year = 1990
}
@inproceedings{gmmo-cds-00,
keyent = {gmmo-cds-00},
author = {S. Guha and N. Mishra, R. Motwani and
L. O'Callaghan},
title = {Clustering Data Streams},
booktitle = FOCS_2000,
pages = "359-366",
year = 2000
}
@book{go-chdcg-04,
title = "Handbook of Discrete and Computational Geometry",
editor = "J. E. Goodman and J. O'Rourke",
publisher = "CRC Press LLC",
year = 2004,
edition = {2nd}
}
@article{go-copcg-95,
keyent = {go-copcg-95},
author = "A. Gajentaan and M. H. Overmars",
title = "On a class of {$O(n^2)$} problems in computational
geometry",
journal = CGTA,
volume = 5,
year = 1995,
pages = "165--185",
url =
{http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1993/1993-15.ps.gz}
}
@InProceedings{go-ndspo-94,
keyent = {go-ndspo-94},
author = {E. G. Gilbert and C. J. Ong},
title = {New distances for the separation and penetration of
objects},
booktitle = {Proc. Int. Conf. Robot. Auto.},
pages = {579--586},
year = 1994
}
@inproceedings{gppr-dlg-01,
keyent = {gppr-dlg-01},
author = {C. Gavoille and D. Peleg and S. Perennes and R. Raz},
title = {Distance labeling in graphs},
booktitle = SODA_2001,
year = 2001,
isbn = {0-89871-490-7},
pages = {210--219},
location = {Washington, D.C., United States},
publisher = {Society for Industrial and Applied Mathematics},
}
@article{gppr-dlg-04,
keyent = {gppr-dlg-04},
author = {C. Gavoille and D. Peleg and S. Perennes and R. Raz},
title = {Distance labeling in graphs},
journal = {J. Algorithms},
volume = 53,
number = 1,
year = 2004,
pages = {85--112}
}
@inproceedings{gpy-mihir-94,
keyent = {gpy-mihir-94},
author = "D. Greene and M. Parnas and F. Yao",
title = "Multi-index hashing for information retrieval",
booktitle = FOCS_1994,
year = 1994,
pages = "722--731"
}
@inproceedings{gr-fspc-97-grs,
keyent = {gr-fspc-97-grs},
author = "J. Garc{\'i}a-Lopez and P. Ramos",
title = "Fitting a set of points by a circle",
booktitle = SOCG_1997,
year = 1997,
pages = "139--146"
}
@Article{grs-fspc-98,
keyent = {grs-fspc-98},
author = {J. Garc{\'i}a-Lopez and P. Ramos and J. Snoeyink},
title = {Fitting a Set of Points by a Circle},
journal = DCG,
year = 1998,
volume = 20,
number = 3,
pages = {389--402},
url =
{http://link.springer-ny.com/link/service/journals/00454/bibs/20n3p389.html}
}
@article{grss-sracp-95,
keyent = {grss-sracp-95},
author = "M. Golin and R. Raman and C. Schwarz and M. Smid",
title = "Simple randomized algorithms for closest pair
problems",
journal = NORDIC_J_COMP,
volume = 2,
year = 1995,
pages = "3--27"
}
@article{hatksh-csptm-00,
keyent = {hatksh-csptm-00},
author = {S. Haker and S. Angenent and A. Tannenbaum and
R. Kikinis and G. Sapiro and M. Halle},
title = {Conformal surface parameterization for texture
mapping},
pages = "181--187",
journal = "IEEE Trans. Visualizat. Comput. Graph.",
year = 2000,
volume = 6,
number = 2
}
@article{gs-gifpm-01,
author = "C. Gotsman and V. Surazhsky",
title = "Guaranteed intersection-free polygon morphing",
journal = "Computers and Graphics",
volume = 25,
number = 1,
pages = "67--75",
year = 2001
}
@InProceedings{gskpl-cotsd-02,
keyent = {gskpl-cotsd-02},
author = {K.~Goldberg and D.~Song and Y.~Khor and D.~Pescovitz
and A.~Levandowski and J.~Himmelstein and J.~Shih
and A.~Ho and E.~Paulos and J.~Donath},
title = {Collaborative online teleoperation with spatial
dynamic voting and a human ``tele-actor''},
booktitle = ICRA_2002,
year = 2002,
url =
{http://ford.ieor.berkeley.edu:8000/papers/paper?paper_id=7}
}
@article{gslml-isdpm-99,
author = {A. D. Gregory and A. State and M. C. Lin and
D. Manocha and M. A. Livingston},
title = {Interactive surface decomposition for polyhedral
morphing},
journal = {The Visual Computer},
volume = 15,
number = 9,
year = 1999,
pages = {453--470}
}
@Article{gt-atbop-88,
keyent = {gt-atbop-88},
author = {H.~N.~Gabow and R.~E.~Tarjan},
title = {Algorithms for two bottleneck optimization problems},
journal = JALG,
year = 1988,
volume = 9,
pages = {411--417}
}
@inproceedings{gt-cfaac-00,
author = {A. Gupta and E. Tardos},
title = {A constant factor approximation algorithm for a
class of classification problems},
booktitle = STOC_2000,
year = 2000,
isbn = {1-58113-184-4},
pages = {652--658},
location = {Portland, Oregon, United States},
doi = {10.1145/335305.335397}
}
@article{gt-fmccc-89,
author = {A. V. Goldberg and R. E. Tarjan},
title = {Finding minimum-cost circulations by canceling
negative cycles.},
journal = JACM,
volume = 36,
number = 4,
year = 1989,
pages = {873--886},
doi = {10.1145/76359.76368}
}
@inproceedings{gtvv-emcg-93,
author = {M. T. Goodrich and J.-J. Tsay and D. E. Vengroff and
J. S. Vitter},
title = {External-Memory Computational Geometry},
year = 1993,
booktitle = FOCS_1993,
pages = {714--723}
}
@article{gw-cplhs-97,
author = "H. Gupta and R. Wenger",
title = "Constructing Piecewise Linear Homeomorphisms of
Simple Polygons",
journal = JALG,
volume = 22,
year = 1997,
pages = "142--157"
}
@Article{gw-iaamc-95,
keyent = {JACM::GoemansW1995},
title = "Improved Approximation Algorithms for Maximum Cut
and Satisfiability Problems Using Semidefinite
Programming",
author = "M. X. Goemans and D. P. Williamson",
area = "Complexity of Algorithms",
journal = JACM,
pages = "1115--1145",
month = nov,
year = 1995,
volume = 42,
number = 6
}
@incollection{h-a-97,
keyent = {h-a-97},
author = "D. Halperin",
title = "Arrangements",
chapter = 21,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
year = 1997,
pages = "389--412"
}
@Unpublished{h-aabp-05,
author = {S. {Har-Peled}},
title = {Approximation Algorithm for the Beltway Problem},
year = 2005,
note = {\urlSarielPaper{05/l1\_fitting/}}
}
@book{h-aanph-96,
keyent = {h-aanph-96},
author = "D. Hochbaum",
title = "Approximation Algorithms for {NP}-hard Problems",
publisher = "PWS Publishing",
year = 1996
}
@phdthesis{h-aspaw-00,
keyent = {h-aspaw-00},
author = {W. Heinzelman},
title = {Application-specific Protocol Architectures for
Wireless},
school = "MIT",
year = 2000
}
@article{h-bst-55,
keyent = {h-bst-55},
author = "J. Hodges",
title = "A bivariate sign test",
journal = "Annals of Math. Stat.",
volume = 26,
pages = "523-527",
year = 1955
}
@article{h-caspm-99,
keyent = {h-caspm-99},
author = "S. {Har-Peled}",
title = {{Constructing approximate shortest path maps in
three dimensions}},
year = 1999,
journal = SICOMP,
volume = 28,
number = 4,
pages = {1182--1197},
}
@article{h-cctp-00,
keyent = {h-cctp-00},
author = "S. {Har-Peled}",
title = "Constructing planar cuttings in theory and practice",
year = 2000,
journal = SICOMP,
pages = "2016--2039",
volume = 29,
number = 6
}
@inproceedings{h-cctp-98-conf,
keyent = {h-cctp-98old},
author = "S. {Har-Peled}",
title = "Constructing cuttings in theory and practice",
year = 1998,
booktitle = SOCG_1998,
acceptrate = SOCG_1998_AR_AT,
pages = {327--336},
url = {http://doi.acm.org/10.1145/276884.276921},
doi = {10.1145/276884.276921}
}
@inproceedings{h-cdic-06,
author = {S. {Har-Peled}},
title = {Coresets for Discrete Integration and Clustering},
booktitle = FSTTCS_2006,
acceptrate = FSTTCS_2006_AR,
year = 2006,
pages = {33--44},
href = {http://cs.uiuc.edu/~sariel/papers/06/integrate}
}
@article{h-cdiga-95,
keyent = {h-cdiga-95},
author = "P. M. Hubbard",
title = "Collision detection for interactive graphics
applications",
journal = "IEEE Trans. Visualization and Computer Graphics",
volume = 1,
number = 3,
month = sep,
year = 1995,
pages = "218--230",
keywords = "collision detection, intersection detection, sphere
trees"
}
@inproceedings{h-cm-01-conf,
keyent = {h-cm-01-conf},
author = "S. {Har-Peled}",
title = "Clustering Motion",
year = 2001,
booktitle = FOCS_2001,
acceptrate = FOCS_2001_AR,
pages = "84--93",
url = {http://sarielhp.org/p/01/cluster/},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@article{h-cm-04,
keyent = {h-cm-04},
title = "Clustering Motion",
author = "S. {Har-Peled}",
journal = DCG,
volume = 31,
number = 4,
year = 2004,
pages = {545--565},
url =
{http://cs.uiuc.edu/~sariel/research/papers/01/cluster/}
}
@mastersthesis{h-cmco-95,
keyent = {h-cmco-95},
author = "S. {Har-Peled}",
title = "The Complexity of Many Cells in the Overlay of Many
Arrangements",
type = "{M. S.} Thesis",
school = "Dept. Computer Science, Tel Aviv University",
address = "Tel Aviv, Israel",
year = 1995,
keywords = "master thesis"
}
@Article{h-cmcom-99-kiskosh,
keyent = {h-cmcom-99-kiskosh},
author = "S. {Har-Peled}",
title = "The Complexity of Many Cells in the Overlay of Many
Arrangements",
year = 1999,
journal = CGTA,
note = {in press}
}
@Article{h-dqapd-87,
keyent = {h-dqapd-87},
author = {M.~P.~Herlihy},
title = {Dynamic Quorum Adjustment for Partitioned Data},
journal = {ACM Transactions on Database Systems},
year = 1987,
volume = 12,
number = 2,
pages = {170--194},
month = {June}
}
@PhdThesis{h-gaara-99,
keyent = {h-gaara-99},
author = {S. {Har-Peled}},
title = {Geometric Approximation Algorithms and Randomized
Algorithms for Planar Arrangements},
school = "Dept. Computer Science, Tel Aviv University",
address = "Tel Aviv, Israel",
year = 1999,
}
@InProceedings{h-htgcm-06-conf,
author = {S. {Har-Peled}},
title = {How to Get Close to the Median Shape},
url = {http://cs.uiuc.edu/~sariel/papers/05/l1_fitting/},
booktitle = SOCG_2006,
acceptrate = SOCG_2006_AR,
pages = {402--410},
year = 2006,
doi = {10.1145/1137856.1137915},
}
@article{h-htgcm-07,
author = {S. {Har-Peled}},
title = {How to Get Close to the Median Shape},
journal = CGTA,
pages = {39--51},
volume = 36,
year = 2007,
url = {http://cs.uiuc.edu/~sariel/papers/05/l1_fitting/}
}
@article{h-htgcm-07-alt,
author = {Sariel Har{-}Peled},
title = {How to Get Close to the Median Shape},
journal = CGTA,
pages = {39--51},
volume = 36,
year = 2007,
url = {http://cs.uiuc.edu/~sariel/papers/05/l1_fitting/}
}
@book{h-lams-01,
keyent = {h-lams-01},
AUTHOR = {J. Heinonen},
TITLE = {Lectures on analysis on metric spaces},
SERIES = {Universitext},
PUBLISHER = {Springer-Verlag},
ADDRESS = {New York},
YEAR = 2001
}
@Unpublished{h-lrmal-06,
author = {S.~{Har-Peled}},
title = {Low rank matrix approximation in linear time},
note = {manuscript},
year = 2006
}
@Article{h-mcl-99,
keyent = {h-mcl-99},
author = "S. {Har-Peled}",
title = "Multicolor Combination Lemma",
year = 1999,
journal = CGTA,
pages = {155--176},
volume = 12
}
@InProceedings{h-ncnc-04,
keyent = {h-ncnc-04},
author = {S. {Har-Peled}},
title = {No Coreset, No Cry},
url = {http://cs.uiuc.edu/~sariel/papers/02/2slab/},
year = 2004,
booktitle = FSTTCS_2004,
acceptrate = FSTTCS_2004_AR,
pages = {324--335},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg}
}
@article{h-oatgp-96,
author = "P. J. Heffernan",
title = "An optimal algorithm for the two-guard problem",
journal = IJCGA,
volume = 6,
year = 1996,
pages = "15--44"
}
@inproceedings{h-pacdp-01,
keyent = {h-pacdp-01},
author = "S. {Har-Peled}",
booktitle = SOCG_2001,
acceptrate = SOCG_2001_AR_AT,
title = "A Practical Approach for Computing the Diameter of a
Point-Set",
year = 2001,
pages = {177--186},
}
@inproceedings{h-rvdnl-01,
keyent = {h-rvdnl-01},
author = "S. {Har-Peled}",
title = "A Replacement for {Voronoi} Diagrams of Near Linear
Size",
booktitle = FOCS_2001,
acceptrate = FOCS_2001_AR,
year = 2001,
pages = "94--103",
doi = {10.1109/SFCS.2001.959884},
url = {http://sarielhp.org/p/01/avoronoi}
}
@Misc{h-scpca-00,
keyent = {h-scpca-00},
author = {S. {Har-Peled}},
title = {Source code of program for computing and
approximating the diameter of a point-set in 3d},
year = 2000,
note =
{\url{http://cs.uiuc.edu/~sariel/papers/00/diameter/diam_prog.html}}
}
@inproceedings{h-sfvm-92,
Author = {J. F. Hughes},
title = {Scheduled Fourier volume morphing},
booktitle = SIGGRAPH_1992,
year = 1992,
pages = {43--46}
}
@article{h-soir,
author = {J. H{\r{a}}stad},
title = {Some optimal inapproximability results},
journal = {J. ACM},
volume = 48,
number = 4,
year = 2001,
issn = {0004-5411},
pages = {798--859},
doi = {10.1145/502090.502098}
}
@inproceedings{h-soir-97,
author = {J. Hastad},
title = {Some optimal inapproximability results},
booktitle = STOC_1997,
year = 1997,
isbn = {0-89791-888-6},
pages = {1--10},
location = {El Paso, Texas, United States},
doi = {10.1145/258533.258536}
}
@article{h-twpa-00,
keyent = {h-twpa-00},
author = {S. {Har-Peled}},
journal = SICOMP,
title = {Taking a Walk in a Planar Arrangement},
year = 2000,
pages = "1341--1367",
volume = 30,
number = 4
}
@inproceedings{h-twpa-99-conf,
keyent = {h-twpa-99-conf},
author = {S. {Har-Peled}},
title = {Taking a Walk in a Planar Arrangement},
booktitle = FOCS_1999,
acceptrate = FOCS_1999_AR,
year = 1999,
pages = "100--110",
doi = {10.1145/316188.316223}
}
@Unpublished{h-twpai-00,
keyent = {h-twpai-00},
author = {S. {Har-Peled}},
title = {Taking a Walk in a Planar Arrangement - The
Implementation},
note = {{\tt http://www.math.tau.ac.il/\tildegen{}} {\!\!}
{\tt sariel/papers/99/qwalk.html} },
year = 2000
}
@Unpublished{her-pc-97,
keyent = {her-pc-97},
author = "J. Hershberger",
title = {personal communication},
year = 1997
}
@TechReport{hg-spsssa-97,
keyent = {hg-spsssa-97},
author = {P. S. Heckbert and M. Garland},
title = {Survey of Polygonal Surface Simplification
Algorithms},
institution = {CMU-CS},
year = 1997,
note = {\href{http://cs.uiuc.edu/ garland/papers.html}
{http://cs.uiuc.edu/\tildegen{}garland/papers.html}}
}
@InProceedings{hgki-esssw-02,
keyent = {hgki-esssw-02},
author = {T.~Haveliwala and A.~Gionis and D.~Klein and
P.~Indyk},
title = {Evaluating strategies for similarity search on the
web},
booktitle = {WWW},
year = 2002,
url = {http://www2002.org/CDROM/refereed/75/}
}
@inproceedings{hi-wccam-00,
keyent = {hi-wccam-00},
author = {S. {Har-Peled} and P. Indyk},
title = {When Crossings Count -- Approximating the Minimum
Spanning Tree},
booktitle = SOCG_2000,
acceptrate = SOCG_2000_AR_TT,
pages = "166--175",
year = 2000,
url = {http://cs.uiuc.edu/~sariel/papers/99/mst.html}
}
@Unpublished{hk-allcf-04-useless,
author = {S. {Har-Peled} and V. {Koltun}},
title = {Approximate {$L_1$} and $L_2$ Circle Fitting in (easy)
Polynomial Time},
note = {manuscript},
year = 2004
}
@Unpublished{hk-sckmk-04-old,
author = {S. {Har-Peled} and A. Kushal},
title = {Smaller Coresets for {$k$}-Median and $k$-Means
Clustering},
note = {\urlSarielPaper{04/small\_coreset/}},
year = 2004
}
@inproceedings{hk-sckmk-05-conf,
author = {S. {Har-Peled} and A. Kushal},
title = {Smaller Coresets for {$k$}-Median and $k$-Means
Clustering},
url = {http://cs.uiuc.edu/~sariel/papers/04/small_coreset/},
booktitle = SOCG_2005,
acceptrate = SOCG_2005_AR,
year = 2005,
pages = {126--134}
}
@article{hk-sckmk-07,
author = {S. {Har-Peled} and A. Kushal},
title = {Smaller Coresets for {$k$}-Median and $k$-Means
Clustering},
journal = DCG,
volume = 37,
number = 1,
year = 2007,
pages = {3--19},
url = {http://dx.doi.org/10.1007/s00454-006-1271-x},
doi = {10.1007/s00454-006-1271-x},
}
@inproceedings{hk-so-05,
author = {S. {Har-Peled} and V. {Koltun}},
title = {Separability with Outliers},
booktitle = ISAAC_2005,
year = 2005,
pages = {28--39},
doi = {10.1007/11602613_5}
}
@inproceedings{hkk-dvdmh-92,
keyent = {hkk-dvdmh-92},
author = {D. Huttenlocher and K. Kedem and J. Kleinberg.},
title = {{On dynamic {Voronoi} diagrams and the minimum
Hausdorff distance for point sets under {Euclidean}
motion in the plane}},
booktitle = SOCG_1992,
year = 1992,
pages = {110--119}
}
@incollection{hkl-r-97,
keyent = {hkl-r-97},
author = "D. Halperin and L. E. Kavraki and J.-C. Latombe",
title = "Robotics",
chapter = 41,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
year = 1997,
pages = "755--778"
}
@inproceedings{hkm-ecdmv-95,
keyent = {hkm-ecdmv-95},
author = "M. Held and J. T. Klosowski and J. S.B. Mitchell",
title = "Evaluation of Collision Detection Methods for
Virtual Reality Fly-Throughs",
booktitle = CCCG_1995,
year = 1995,
pages = "205--210"
}
@inproceedings{hkmr-nnng-04,
keyent = {hkmr-nnng-04},
author = {K. Hildrum and J. Kubiatowicz and S. Ma and S. Rao},
title = {A note on the nearest neighbor in growth-restricted
metrics},
booktitle = SODA_2004,
year = 2004,
isbn = {0-89871-XXX-X},
pages = {560--561},
location = {New Orleans, Louisiana},
publisher = {Society for Industrial and Applied Mathematics},
}
@article{hkr-ciuhd-93,
author = "D. P. Huttenlocher and G. A. Klanderman and
W. J. Rucklidge",
title = "Comparing Images Using the {Hausdorff} Distance",
journal = "IEEE Trans. Pattern Anal. Mach. Intell.",
volume = 15,
year = 1993,
pages = "850--863"
}
@article{hks-uevsi-93,
keyent = {hks-uevsi-93},
author = "D. P. Huttenlocher and K. Kedem and M. Sharir",
title = "The upper envelope of {Voronoi} surfaces and its
applications",
journal = DCG,
volume = 9,
year = 1993,
pages = "267--291"
}
@InProceedings{hksg-eascc-03,
keyent = {hksg-eascc-03},
author = {S. {Har-Peled} and V. Koltun and D. Song and
K. Goldberg},
title = {Efficient Algorithms for Shared Camera Control},
booktitle = SOCG_2003,
acceptrate = SOCG_2003_AR,
pages = {68--77},
url =
{http://cs.uiuc.edu/~sariel/research/papers/02/camera/},
year = 2003
}
@article{hlc-sdase-93,
author = {R. Z. Hwang and Richard C. T. Lee and R. C. Chang},
title = {The Slab Dividing Approach To Solve the Euclidean
$P$-Center Problem},
journal = ALGORITHMICA,
volume = {9},
number = {1},
pages = {1--22},
year = {1993},
url = {http://dx.doi.org/10.1007/BF01185335},
doi = {10.1007/BF01185335},
}
@article{hcl-sosss-93,
author = {R. Z. Hwang and R. C. Chang and Richard C. T. Lee},
title = {The Searching over Separators Strategy To Solve Some
{NP}-{H}ard Problems in Subexponential Time},
journal = ALGORITHMICA,
volume = {9},
number = {4},
pages = {398--423},
year = {1993},
url = {http://dx.doi.org/10.1007/BF01228511},
doi = {10.1007/BF01228511}
}
@article{hm-aahos-91,
keyent = {hm-aahos-91},
author = "R. Hassin and N. Megiddo",
title = "Approximation algorithms for hitting objects by
straight lines",
journal = "Discrete Appl. Math.",
volume = 30,
year = 1991,
pages = "29--42",
keywords = "NP-Completeness, stabbing, approximation"
}
@inproceedings{hm-ckmkm-04,
keyent = {hm-ckmkm-04},
author = {S. {Har-Peled} and S.~{Mazumdar}},
booktitle = STOC_2004,
acceptrate = STOC_2004_AR,
title = {Coresets for {$k$}-Means and $k$-Median Clustering and
their Applications},
year = 2004,
pages = {291--300},
url =
{http://cs.uiuc.edu/~sariel/research/papers/03/kcoreset/},
publisher = {{ACM}},
address = {New York, NY, USA}
}
@inproceedings{hm-facsk-03-conf,
keyent = {hm-facsk-03-conf},
author = {S. {Har-Peled} and S.~{Mazumdar}},
title = {Fast Algorithms for Computing the Smallest
{$k$}-Enclosing Disc},
booktitle = ESA_2003,
acceptrate = ESA_2003_AR,
series = LNCS,
volume = 2832,
publisher = "Springer-Verlag",
year = 2003,
pages = "278--288"
}
@article{hm-facsk-05,
keyent = {hm-facsk-05},
author = {S. {Har-Peled} and S.~{Mazumdar}},
title = {Fast Algorithms for Computing the Smallest
{$k$}-Enclosing Disc},
journal = ALGORITHMICA,
year = 2005,
pages = "147--157",
Volume = 41,
Number = 3,
url = {http://cs.uiuc.edu/~sariel/papers/03/min_disk/}
}
@Unpublished{hm-fcnld-04-old,
keyent = {hm-fcnld-04},
author = {S. {Har-Peled} and M. Mendel},
title = {Fast Construction of Nets in Low Dimensional
Metrics, and Their Applications},
note = {\urlSarielPaper{04/lipschitz}},
url = {http://cs.uiuc.edu/~sariel/papers/04/lipschitz},
year = 2004
}
@inproceedings{hm-fcnld-05-conf,
keyent = {hm-fcnld-04},
author = {S. {Har-Peled} and M. Mendel},
title = {Fast Construction of Nets in Low Dimensional
Metrics, and Their Applications},
note = {\urlSarielPaper{04/lipschitz}},
url = {http://cs.uiuc.edu/~sariel/papers/04/lipschitz},
booktitle = SOCG_2005,
acceptrate = SOCG_2005_AR,
pages = {150--158},
year = 2005
}
@Article{hm-fcnld-06,
author = {S. {Har-Peled} and M. Mendel},
title = {Fast Construction of Nets in Low Dimensional
Metrics, and Their Applications},
journal = SICOMP,
year = 2006,
volume = 35,
number = 5,
pages = {1148--1184},
url = {http://dx.doi.org/10.1137/S0097539704446281},
doi = {10.1137/S0097539704446281},
}
@inproceedings{hmrs-tpslp-99,
keyent = {hmrs-tpslp-99},
author = "F. Hurtado and M. Mora and P. A. Ramos and C. Seara",
title = "Two Problems on Separability with Lines and
Polygonals",
booktitle = EWCG_1999,
year = 1999,
pages = "33--35"
}
@article{hnrs-sopws-01,
keyent = {hnrs-sopws-01},
author = "F. Hurtado and M. Noy and P. A. Ramos and C. Seara",
title = "Separating objects in the plane with wedges and
strips",
journal = DAM,
volume = 109,
year = 2001,
pages = "109--138"
}
@Unpublished{h-aaspm-97old,
keyent = {hp-aaspm-97old},
author = "S. {Har-Peled}",
title = {{Constructing approximate shortest path maps in
three dimensions}},
year = 1997,
note = {manuscript}
}
@inproceedings{h-aaspm-98-conf,
keyent = {hp-aaspm-98c-old},
author = "S. {Har-Peled}",
title = {{Constructing approximate shortest path maps in
three dimensions}},
booktitle = SOCG_1998,
acceptrate = SOCG_1998_AR_TT,
year = 1998,
pages = {383--391},
url = {http://doi.acm.org/10.1145/276884.276927},
doi = {10.1145/276884.276927}
}
@Article{hp-agacp-98,
keyent = {hp-agacp-98},
author = "D. Hochbaum and A. Pathria",
title = "Analysis of the Greedy Approach in Covering
Problems",
journal = "Naval Research Quarterly",
volume = 45,
year = 1998,
pages = {615--627},
url =
{http://riot.ieor.berkeley.edu/~dorit/pub/greedy.html}
}
@inproceedings{hp-aspgd-97-conf,
keyent = {hp-aspgd-97xx-old},
author = "S. {Har-Peled}",
title = {{Approximate shortest paths and Geodesic diameters
on convex polytopes in three dimensions}},
booktitle = SOCG_1997,
acceptrate = SOCG_1997_AR_TT,
pages = {359--365},
year = 1997,
url = {http://doi.acm.org/10.1145/262839.263003},
doi = {10.1145/262839.263003}
}
@Article{h-aspgd-99,
keyent = {hp-aspgd-99},
author = "S. {Har-Peled}",
title = {Approximate shortest paths and geodesic diameters on
convex polytopes in three dimensions},
journal = DCG,
year = 1999,
pages = {216--231},
volume = 21
}
@Unpublished{hp-cri98prog,
keyent = {hp-cri98prog},
author = {S. {Har-Peled}},
title = {Cuttings --- demo program},
note = {{\tt http://www.math.tau.ac.il/\tildegen{}} {\tt
{sariel/CG/cutting/cuttings.html}}},
year = 1998
}
@unpublished{hv-asfl-02,
keyent = {hv-asfl-02},
author = {P. K. Agarwal and S.~{Har-Peled} and
K. R.~Varadarajan},
title = {Approximate Shape Fitting via Linearization},
year = 2002,
note = {manuscript}
}
@Unpublished{hp-oradc-97,
keyent = {hp-oradc-97},
author = "S. {Har-Peled}",
title = "On Random and Discrete Convex Hulls in the Plane",
year = 1997,
note = {manuscript}
}
@techreport{hp-oradc-98,
keyent = {hp-oradc-98},
author = "S. {Har-Peled}",
title = "On Random and Discrete Convex Hulls in the Plane",
type = "Technical {Report}",
number = "330/98",
institution = "School Math. Sci., Tel-Aviv Univ.",
address = "Tel-Aviv, Israel",
year = 1998,
keywords = "convex-hull, discrete-hull"
}
@inproceedings{h-osafd-98,
keyent = {hp-osafd-98},
author = {S. {Har-Peled}},
title = {An Output Sensitive Algorithm for Discrete Convex
Hulls},
booktitle = SOCG_1998,
acceptrate = SOCG_1998_AR_AT,
pages = {357--364},
year = 1998,
url = {http://doi.acm.org/10.1145/276884.276924},
doi = {10.1145/276884.276924}
}
@Article{h-osafd-98a,
keyent = {hp-osafd-98a},
author = {S. {Har-Peled}},
title = {An Output Sensitive Algorithm for Discrete Convex
Hulls},
volume = 10,
pages = {125--138},
journal = CGTA,
year = 1998
}
@Unpublished{hp-otecg-97,
keyent = {hp-otecg-97},
author = "S. {Har-Peled}",
title = "On the Expected Complexity of a Generalized Convex
Hull Inside a Disk",
year = 1997,
note = {manuscript}
}
@Unpublished{hp-otecg-98,
keyent = {hp-otecg-98},
author = "S. {Har-Peled}",
title = "On the Expected Complexity of a random Convex Hull",
year = 1998,
note = {manuscript}
}
@article{hpp-fdaas-02,
author = "P. Hall and D. Poskitt and B. Presnell",
title = "A functional data-analytic approach to signal
discrimination",
journal = "Technometrics",
volume = 43,
number = 1,
pages = "1--9",
year = 2001,
}
@InProceedings{hrz-ccmcr-02,
keyent = {hrz-ccmcr-02},
author = {S. {Har-Peled} and D. Roth and D. Zimak},
title = {Constraint Classification for Multiclass
Classification and Ranking},
year = 2002,
booktitle = NIPS_2002,
acceptrate = NIPS_2002_AR
}
@unpublished{hrz-wwtac-02,
keyent = {hrz-wwtac-02},
title = "Why Winner-Take-All Cannot Lose",
author = "S. {Har-Peled} and D. Roth and D. Zimak",
year = 2002,
note = {manuscript}
}
@InProceedings{hs-cfcps-03-conf,
keyent = {hs-cfcps-03},
author = {S. {Har-Peled} and S. Smorodinsky},
title = {On Conflict-Free Coloring of Points and Simple
Regions in the Plane},
booktitle = SOCG_2003,
acceptrate = SOCG_2003_AR,
pages = {114--123},
url = {http://sarielhp.org/research/papers/02/coloring},
year = 2003
}
@article{hs-cfcps-05,
keyent = {hs-cfcps-05},
author = {S. {Har-Peled} and S. Smorodinsky},
title = {On Conflict-Free Coloring of Points and Simple
Regions in the Plane},
journal = DCG,
volume = 34,
number = 1,
pages = {47--70},
year = 2005
}
@article{hs-hfkmm-05,
keyent = {hs-hfkmm-04},
author = {S. {Har-Peled} and B. Sadri},
title = {How fast is the {$k$}-means Method?},
journal = ALGORITHMICA,
Volume = 41,
Number = 3,
Pages = {185--202},
year = 2005,
month = {January},
url = {http://sarielhp.org/papers/03/lloyd_kmeans/}
}
@InProceedings{hs-hfkmm-05-conf,
keyent = {hs-hfkmm-05},
author = {S. {Har-Peled} and B. Sadri},
title = {How fast is the {$k$}-means Method?},
booktitle = SODA_2005,
acceptrate = SODA_2005_AR,
pages = {877--885},
year = 2005,
url = {http://sarielhp.org/papers/03/lloyd_kmeans/}
}
@inproceedings{hs-kcr-99,
keyent = {hs-kcr-99},
author = "J. Hershberger and S. Suri",
title = "Kinetic Connectivity of Rectangles",
booktitle = SOCG_1999,
pages = "237-246",
year = 1999,
}
@inproceedings{hs-mbt-95,
author = "J. Hershberger and S. Suri",
title = "Morphing Binary Trees",
booktitle = SODA_1995,
year = 1995,
pages = "396--404",
keywords = "shape morphing, rotation distance, tree morphing"
}
@inproceedings{hs-oplpa-01,
keyent = {hs-oplpa-01},
author = "S. {Har-Peled} and M. Sharir",
title = "On-line Point Location in Planar Arrangements and
Its Applications",
booktitle = SODA_2001,
acceptrate = SODA_2001_AR,
year = 2001,
pages = {57--66}
}
@article{hs-oplpa-01-dcg,
keyent = {hs-oplpa-01-dcg},
author = "S. {Har-Peled} and M. Sharir",
title = "Online Point Location in Planar Arrangements and Its
Applications",
journal = DCG,
year = 2001,
pages = "19--40",
volume = 26,
url = {http://sarielhp.org/research/papers/99/run.html}
}
@inproceedings{hs-pmasp-95,
keyent = {hs-pmasp-95},
author = "J. Hershberger and S. Suri",
title = "Practical Methods for Approximating Shortest Paths
on a Convex Polytope in {$\Re^3$}",
booktitle = SODA_1995,
year = 1995,
pages = "447--456",
keywords = "geodesic paths, shortest paths, approximation
algorithm"
}
@article{hs-pmasp-98,
keyent = {hs-pmasp-98},
author = "J. Hershberger and S. Suri",
title = "Practical Methods for Approximating Shortest Paths
on a Convex Polytope in {$\Re^3$}",
journal = CGTA,
volume = 10,
number = 1,
year = 1998,
pages = "31--46"
}
@Unpublished{hs-rag-06-old,
author = {S. {Har-Peled} and M. Sharir},
title = {Relative {\(\varepsilon\)}-Approximations in Geometry},
note = {Manuscript. Available from
\url{http://sarielhp.org/papers/06/integrate}},
year = 2006
}
@inproceedings{hs-skcrh-01,
keyent = {hs-skcrh-01},
author = {J. Hershberger and S. Suri},
title = {Simplified Kinetic Connectivity for Rectangles and
Hypercubes},
booktitle = SODA_2001,
year = 2001,
pages = "158--167"
}
@article{hs-sucpq-02,
author = "G. R. Hjaltason and H. Samet",
title = "Speeding up construction of PMR quadtree-based
spatial indexes",
pages = "190--137",
journal = "VLDB Journal",
year = 2002,
volume = 11
}
@TechReport{hspem-mlwsn-03,
keyent = {hspem-mlwsn-03},
author = {Y. Hou and Y. Shi and J. Pan and A. Efrat and
S. Midkiff},
title = {Maximizing lifetime of wireless sensor networks
through single-session flow routing},
institution = {The Bradley Dept. of ECE, Virginia Tech},
year = 2003
}
@inproceedings{hss-rbsp-03,
keyent = {hss-rbsp-03},
author = "F. Hurtado and C. Seara and S. Sethia",
title = "Red-Blue Separability Problems in 3D",
booktitle = ICCSA_2003,
pages = {766--775},
year = 2003
}
@article{ht-cws-88,
keyent = {ht-cws-88},
author = "M. E. Houle and G. T. Toussaint",
title = "Computing the width of a set",
journal = "IEEE Trans. Pattern Anal. Mach. Intell.",
volume = "PAMI-10",
number = 5,
year = 1988,
pages = "761--765"
}
@book{htf-esl-01,
keyent = {htf-esl-01},
author = "T. Hastie and R. Tibshirani and J. Friedman",
title = "The Elements of Statistical Learning",
publisher = "Springer-Verlag",
address = "Berlin, Germany",
year = 2001
}
@Unpublished{hu-todra-04-old,
author = {S. {Har-Peled} and A. {\"U}ng{\"o}r},
title = {A Time-Optimal {Delaunay} Refinement Algorithm in
Two Dimensions},
note = {\urlSarielPaper{04/opt\_del/}},
year = 2004
}
@inproceedings{hu-todra-05,
author = {S. {Har-Peled} and A. {\"U}ng{\"o}r},
title = {A Time-Optimal {Delaunay} Refinement Algorithm in
Two Dimensions},
url = {http://sarielhp.org/papers/05/opt_del/},
booktitle = SOCG_2005,
acceptrate = SOCG_2005_AR,
pages = {228--236},
year = 2005
}
@inproceedings{hv-asfl-01,
keyent = {hv-asfl-01},
author = {S. {Har-Peled} and K. R. Varadarajan},
title = {Approximate Shape Fitting via Linearization},
booktitle = FOCS_2001,
acceptrate = FOCS_2001_AR,
year = 2001,
pages = "66--73",
url =
{http://sarielhp.org/research/papers/01/linearize.html}
}
@Unpublished{hv-hdsfl-02-old,
keyent = {hv-hdsfl-02-old},
author = {S. {Har-Peled} and K. R. Varadarajan},
title = {High-Dimensional Shape Fitting in Linear Time},
note = {manuscript},
year = 2002,
url = {http://sarielhp.org/research/papers/02/pcluster/}
}
@InProceedings{hv-hdsfl-03-conf,
keyent = {hv-hdsfl-03-conf},
author = {S.~{Har-Peled} and K. R. Varadarajan},
title = {High-Dimensional Shape Fitting in Linear Time},
year = 2003,
booktitle = SOCG_2003,
acceptrate = SOCG_2003_AR,
pages = {39--47},
url = {http://sarielhp.org/research/papers/02/pcluster/}
}
@article{hs-rag-11,
author = {S. {Har-Peled} and M. Sharir},
title = {RelativeXXX {\((p,\varepsilon)\)}-Approximations in
Geometry},
volume = 45,
number = 3,
year = 2011,
pages = {462--496},
doi = {10.1007/s00454-010-9248-1},
journal = DCG
}
@article{hv-hdsfl-04,
keyent = {hv-hdsfl-04},
title = {High-Dimensional Shape Fitting in Linear Time},
author = {S. {Har-Peled} and K. R. Varadarajan},
year = 2004,
journal = DCG,
volume = 32,
number = 2,
pages = {269--288},
url = {http://sarielhp.org/research/papers/02/pcluster/}
}
@Unpublished{hv-hdsflt-02-old,
keyent = {hv-hdsflt-02-old},
title = {High-Dimensional Shape Fitting in Linear Time},
author = {S. {Har-Peled} and K. R. Varadarajan},
year = 2002,
url = {http://sarielhp.org/research/papers/02/pcluster/},
note = {Full version:
\url{http://sarielhp.org/research/papers/02/pcluster/}}
}
@inproceedings{hv-pchdu-02,
keyent = {hv-pchdu-02},
author = "S. {Har-Peled} and K. R. Varadarajan",
booktitle = SOCG_2002,
acceptrate = SOCG_2002_AR,
title = "Projective Clustering in High Dimensions using
Coresets",
year = 2002,
pages = {312--318},
url = {http://sarielhp.org/research/papers/01/kflat/}
}
@Article{hw-ensrq-87,
keyent = {hw-ensrq-87},
author = "D. Haussler and E. Welzl",
title = "\(\varepsilon\)-nets and simplex range queries",
journal = dcg,
volume = 2,
year = 1987,
pages = "127--151",
url = {http://dx.doi.org/10.1007/BF02187876},
doi = {10.1007/BF02187876},
keywords = "combinatorial geometry, probabilistic geometry,
probability theory, reporting, counting, half
spaces, simplices, {$d$}-dimensional"
}
@Unpublished{hw-pcmfd-06,
author = {S. {Har-Peled} and Y. Wang},
title = {Partial Curve Matching under the {\Frechet}
Distance},
note = {Manuscript. Available from
\url{http://sarielhp.org/papers/06/part_f}},
year = 2006
}
@InProceedings{hw-sfo-03-conf,
keyent = {hw-sfo-03-conf},
author = {S. {Har-Peled} and Y. Wang},
title = {Shape Fitting with Outliers},
booktitle = SOCG_2003,
acceptrate = SOCG_2003_AR,
pages = {29--38},
url = {http://sarielhp.org/research/papers/02/outliers/},
year = 2002
}
@article{hw-sfo-04,
keyent = {hw-sfo-04},
author = {S.~{Har-Peled} and Y.~Wang},
title = {Shape Fitting with Outliers},
journal = SICOMP,
pages = {269--285},
number = 2,
volume = 33,
year = 2004,
url = {http://epubs.siam.org/sam-bin/dbq/article/42796}
}
@book{hw-tn-65,
keyent = {hw-tn-65},
author = "G. Hardy and E. Wright",
title = "The Theory of Numbers",
edition = "4th",
publisher = "Oxford University Press",
address = "London, England",
year = 1965
}
@inproceedings{hwk-wbvm-94,
author = {T. He and S. Wang and A. Kaufman},
title = {Wavelet-based volume morphing},
booktitle = {VIS '94: Proceedings of the conference on
Visualization '94},
year = 1994,
isbn = {0-7803-2521-4 (SOFTBOUND)},
pages = {85--92},
location = {Washinton, D.C.},
publisher = {IEEE Computer Society Press},
address = {Los Alamitos, CA, USA},
}
@Unpublished{hz-cfsvm-04,
keyent = {hz-cfsvm-04},
author = {S. {Har-Peled} and D. Zimak},
title = {Coresets for {SVM}},
note = {manuscript},
year = 2004
}
@inproceedings{i-aaldg-01,
keyent = {i-aaldg-01},
author = {P. Indyk},
title = {Algorithmic applications of low-distortion geometric
embeddings},
booktitle = FOCS_2001,
year = 2001,
pages = "10--31",
note = "Tutorial"
}
@InProceedings{i-adgpd-04,
keyent = {i-adgpd-04},
author = {P. Indyk},
title = {Algorithms for dynamic goemetric problems over data
streams},
booktitle = STOC_2004,
year = 2004,
url = {http://theory.lcs.mit.edu/~indyk/sfin.ps}
}
@inproceedings{i-annaf-02,
author = "P. Indyk",
title = "Approximate nearest neighbor algorithms for
{\Frechet}~distance via product metrics",
booktitle = SOCG_2002,
year = 2002,
pages = {102--106}
}
@inproceedings{i-drtpp-00,
keyent = {i-drtpp-00},
author = {P. Indyk},
title = {Dimensionality Reduction Techniques for Proximity
Problems},
booktitle = SODA_1999,
year = 2000,
pages = "371--378",
url = {http://theory.lcs.mit.edu/~indyk/proxy99.ps}
}
@inproceedings{i-eabca-04,
keyent = {i-eabca-04},
author = {P. Indyk},
title = {\((1+\varepsilon)\)-approximate Bi-criterion Algorithm
for {$k$}-median on a Stream},
booktitle = STOC_2004,
year = 2004
}
@PhdThesis{i-hdcg-00,
keyent = {i-hdcg-00},
author = {P. Indyk},
title = {{High-Dimensional Computational Geometry}},
school = {Stanford},
year = 2000,
url = {http://theory.lcs.mit.edu/~indyk/thesis.html},
}
@inproceedings{i-stams-99,
keyent = {i-stams-99},
author = "P. Indyk",
title = "Sublinear time algorithms for metric space problems",
booktitle = STOC_1999,
pages = "154--159",
year = 1999
}
@InProceedings{i-stasc-99,
keyent = {i-stasc-99},
author = "P. Indyk",
title = "A sublinear time approximation scheme for clustering
in metric spaces",
booktitle = FOCS_1999,
nickname = "FOCS '99",
note = "100-110",
year = 1999
}
@incollection{ii-pacfa-88,
keyent = {ii-pacfa-88},
author = "H. Imai and M. Iri",
title = "Polygonal approximations of a curve-formulations and
algorithms ",
editor = "G. T. Toussaint",
booktitle = "Computational Morphology",
publisher = "North-Holland",
year = 1988,
pages = "71--86",
antnote = {curve simplification}
}
@article{ik-tgp-92,
author = "Christian Icking and Rolf Klein",
title = "The Two Guards Problem",
journal = IJCGA,
volume = 2,
number = 3,
year = 1992,
pages = "257--285",
url =
"http://wwwpi6.fernuni-hagen.de/Publikationen/ik-tgp-92.pdf",
keywords = "visibility, watchman routes, planar polygons, motion
planning"
}
@InProceedings{iki-awvdr-94,
keyent = {iki-awvdr-94},
author = {M.~Inaba and N.~Katoh and H.~Imai},
title = {Applications of weighted {Voronoi} diagrams and
randomization to variance-based {$k$}-clustering},
booktitle = SOCG_1994,
pages = {332--339},
year = 1994
}
@inproceedings{im-anntr-98,
author = "P. Indyk and R. Motwani",
title = "Approximate Nearest Neighbors: {Towards} Removing
the Curse of Dimensionality",
booktitle = STOC_1998,
year = 1998,
pages = "604--613",
doi = {10.1145/276698.276876}
}
@incollection{im-ldefm-04,
author = "P. Indyk and J. Matou\v{s}ek",
title = "Low-distortion embeddings of finite metric spaces",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press",
pages = "177--196",
year = 2004
}
@Unpublished{in-nnpe-05-old,
author = {P. Indyk and A. Naor},
title = {Nearest neighbor preserving embeddings},
note = {unpublished},
year = 2005
}
@Article{in-nnpe-07,
author = {P. Indyk and A. Naor},
title = {Nearest neighbor preserving embeddings},
journal = TALG,
volume = 3,
issue = 3,
articleno = 31,
pages = {1--12},
year = 2007
}
@unpublished{it-aom-00,
keyent = {it-aom-00},
author = {P. Indyk and M. Thorup},
title = {Approximate {$1$}-median},
year = 2000,
note = {manuscript}
}
@article{j-episc-48,
keyent = {j-episc-48},
author = "F. John",
title = "Extremum problems with inequalities as subsidary
conditions",
journal = "Courant Anniversary Volume",
year = 1948,
pages = "187--204"
}
@Book{j-pca-86,
keyent = {j-pca-86},
author = {I. T. Jolliffe},
title = {Principal Component Analysis},
publisher = {Springer-Verlag},
year = 1986,
series = {Springer series in statistics.},
note = {ISBN: 0387962697}
}
@techreport{j-wdmim-97,
keyent = {j-wdmim-97},
author = "P. Johansson",
title = "On a Weighted Distance Model for Injection Moulding",
type = "Link{\"o}ping Studies in Science and Technology,
Thesis No. 604",
number = "LiU-TEK-LIC-1997:05",
institution = "Division of Applied Mathematics, Link{\"o}ping
University",
address = "Link{\"o}ping, Sweden",
month = feb,
year = 1997,
keywords = "shortest paths, injection molding, weighted region
problem",
annote = "Licentiate thesis"
}
@Article{jl-elmih-84,
keyent = {jl-elmih-84},
author = {W. B. Johnson and J. Lindenstrauss},
title = {Extensions of Lipschitz mapping into Hilbert space},
journal = {Contemporary Mathematics},
year = 1984,
volume = 26,
pages = {189--206}
}
@article{jm-ccfps-94,
keyent = {jm-ccfps-94},
author = "S. Jadhav and A. Mukhopadhyay",
title = "Computing a centerpoint of a finite planar set of
points in linear time",
journal = DCG,
volume = 12,
year = 1994,
pages = "291--312"
}
@inproceedings{jmn-scpef-99,
keyent = {jmn-scpef-99},
author = {H. V. Jagadish and J. Madar and R. T. Ng},
editor = {M.P.~Atkinson and M.E.~Orlowska and P.~Valduriez and
S.B. Zdonik and M.L.~Brodie},
title = {Semantic Compression and Pattern Extraction with
Fascicles},
booktitle = {VLDB'99},
publisher = {Morgan Kaufmann},
year = 1999,
isbn = {1-55860-615-5},
pages = {186--198}
}
@InProceedings{jn-idm-00,
keyent = {jn-idm-00},
author = {H. V. Jagadish and R. T. Ng},
title = {Incompleteness in Data Minning},
booktitle = {Workshop on Research Issues on Data Mining and
Knowledge Discovery (DMKD)},
pages = {1--10},
year = 2000
}
@InProceedings{jv-pdaam-99,
keyent = {jv-pdaam-99},
author = {K. Jain and V. V. Vazirani},
title = {Primal-Dual Approximation Algorithms for Metric
Facility Location and {$k$}-Median Problems},
booktitle = FOCS_1999,
pages = {2--13},
year = 1999,
url = {http://citeseer.nj.nec.com/3752.html}
}
@inproceedings{k-atubv-01,
keyent = {k-atubv-01},
author = {V. Koltun},
title = {Almost tight upper bounds for vertical decomposition
in four dimensions},
booktitle = FOCS_2001,
year = 2001,
pages = "56--65"
}
@article{k-cadm-95,
keyent = {k-cadm-95},
author = "L. Khachiyan",
title = "On the complexity of Approximating determinants in
matrices",
journal = "J. Complexity",
volume = 11,
year = 1995,
pages = "138--153"
}
@Article{k-cmcmd-78,
author = {R. M. Karp},
title = {A Characterization of the Minimum Cycle Mean in a
Digraph},
journal = {Discrete Math.},
year = 1978,
volume = 23,
pages = {309--311}
}
@inproceedings{k-ealdp-89,
author = {Y. Ke},
title = {An efficient algorithm for link-distance problems},
booktitle = SOCG_1989,
year = 1989,
pages = {69--78},
location = {Saarbruchen, West Germany}
}
@InProceedings{k-ecgsp-99,
keyent = {k-ecgsp-99},
author = "S. Kapoor",
title = "Efficient Computation of Geodesic Shortest Paths",
booktitle = "Proc. 31rd Annu. ACM Sympos. Theory Comput.",
year = 1999,
pages = {770--779}
}
@Article{k-hmap-95,
keyent = {k-hmap-95},
author = {H.~W.~Kuhn},
title = {The Hungarian method for the assignment problem},
journal = {Naval Res. Logist. Quart},
year = 1995,
pages = {83--98}
}
@inproceedings{k-itc-02,
author = "J. Kleinberg",
title = "An impossibility theorem for clustering",
booktitle = NIPS_2002,
year = 2002,
url = {http://www.cs.cornell.edu/home/kleinber/nips15.pdf}
}
@inproceedings{k-mas-91,
author = "R. Klein",
title = "Moving Along a Street",
booktitle = "Proc. Computational Geometry: Methods, Algorithms
and Applications",
nickname = "CG '91",
site = "Bern",
series = LNCS,
volume = 553,
publisher = "Springer-Verlag",
year = 1991,
pages = "123--140",
annote = "7th Intern. Workshop Comput. Geom."
}
@InCollection{k-mmp-99,
keyent = {k-mmp-99},
author = {A. Kowalczyk},
title = {Maximal Margin Perceptron},
booktitle = {Advances in Large Margin Classiers},
publisher = {MIT Press},
year = 1999,
pages = {75--114},
editor = {A.J. Smola and P.L. Bartlett and B. Scholkopf and
D. Schuurmans}
}
@article{ks-otbcd-02,
author = {J. M. Keil and J. Snoeyink},
title = {On the Time Bound for Convex Decomposition of Simple
Polygons},
journal = IJCGA,
volume = 12,
number = 3,
year = 2002,
pages = {181--192},
doi = {10.1142/S0218195902000803}
}
@incollection{k-pd-00,
keyent = {k-pd-00},
author = "J. M. Keil",
title = "Polygon Decomposition",
editor = "J.-R. Sack and J. Urrutia",
booktitle = "Handbook of Computational Geometry",
year = 2000,
pages = "491--518"
}
@phdthesis{k-pvawv-89,
author = "Y. Ke",
title = "Polygon visibility algorithms for weak visibility
and link distance problems",
type = "Ph.{D}. Thesis",
school = "Dept. Comput. Sci., Johns Hopkins Univ.",
address = "Baltimore, MD",
year = 1989,
keywords = "doctoral thesis"
}
@Book{k-som-01,
keyent = {k-som-01},
author = {T. Kohonen},
title = {Self-Organizing Maps},
publisher = {Springer, Berlin},
year = 2001,
volume = 30,
series = {Springer Series in Information Sciences}
}
@inproceedings{k-tanns-97,
author = "J. Kleinberg",
title = "Two algorithms for nearest-neighbor search in high
dimensions",
booktitle = STOC_1997,
pages = "599--608",
year = 1997,
doi = {10.1145/258533.258653}
}
@book{k-taocp:sa-97,
keyent = {k-taocp:sa-97},
title = {The Art of Computer Programming: Seminumerical
Algorithms},
author = {D. E. Knuth},
edition = {Third Edition},
year = 1997,
publisher = {Addison-Wesley},
}
@inproceedings{kcp-stpo-92,
author = {J. R. Kent and W. E. Carlson and R. E. Parent},
title = {Shape transformation for polyhedral objects},
booktitle = SIGGRAPH_1992,
year = 1992,
pages = {47--54}
}
@inproceedings{kf-hrtir-94,
keyent = {kf-hrtir-94},
author = "I. Kamel and C. Faloutsos",
title = "Hilbert {R}-tree: {A}n improved {R}-tree using
fractals",
booktitle = "Proc. 20th VLDB Conference",
year = 1994,
pages = "500--510"
}
@inproceedings{kf-oprt-93,
author = {I. Kamel and C. Faloutsos},
title = {On packing {$R$}-trees},
booktitle = {Proc. 2nd Intl. Conf. Info. Knowl. Mang.},
year = 1993,
pages = {490--499},
location = {Washington, D.C., United States}
}
@InProceedings{kg-skgsa-01,
keyent = {kg-skgsa-01},
author = {M. I. Karavelas and L. J. Guibas},
title = {Static and kinetic geometric spanners with
applications},
booktitle = SODA_2001,
pages = {168--176},
year = 2001
}
@article{khmtc-pgbhp-98,
title = {Parallel genetic-based hybrid pattern matching
algorithm for isolated word recognition},
author = {S. Kwong and Q. H. He and K. F. Man and K. S. Tang
and C. W. Chau},
journal = {Int. J. Pattern Recog. Art. Intel.},
volume = 12,
number = 5,
pages = {573--594},
month = {August},
year = 1998
}
@inproceedings{kk-rers-99,
author = "R. Kumar and D. Sivakumar",
title = "Roundness Estimation via Random Sampling",
booktitle = SODA_1999,
year = 1999,
pages = "603--612"
}
@InProceedings{kkmo-oirmc-04,
author = {S. Khot and G. Kindler and E. Mossel and
R. O'Donnell},
title = {Optimal inapproximability results for Max Cut and
other 2-variable CSPs},
booktitle = FOCS_2004,
pages = {146--154},
year = 2004,
note = {To appear in SICOMP}
}
@inproceedings{kks-osmut-05,
author = {M.S. Kim and S.W. Kim and M. Shin},
title = {Optimization of subsequence matching under time
warping in time-series databases},
booktitle = {Proc. ACM symp. Applied comput.},
year = 2005,
isbn = {1-58113-964-0},
pages = {581--586},
location = {Santa Fe, New Mexico},
doi = {10.1145/1066677.1066814}
}
@InProceedings{kl-bbcnn-04,
keyent = {kl-bbcnn-04},
author = {R. Krauthgamer and J. R. Lee},
title = {The black-box complexity of nearest neighbor search},
booktitle = ICALP_2004,
pages = {to appear},
year = 2004
}
@inproceedings{kl-nnsap-04,
keyent = {kl-nnsap-04},
author = {R. Krauthgamer and J. R. Lee},
title = {Navigating nets: simple algorithms for proximity
search},
booktitle = SODA_2004,
year = 2004,
isbn = {0-89871-XXX-X},
pages = {798--807},
location = {New Orleans, Louisiana},
url = {http://dl.acm.org/citation.cfm?id=982792.982913},
address = {Philadelphia, PA, USA},
publisher = {Society for Industrial and Applied Mathematics},
}
@InProceedings{klmn-mdnem-04-conf,
keyent = {klmn-mdnem-04},
author = {R. Krauthgamer and J. R. Lee and M. Mendel and
A. Naor},
title = {Measured descent: A new embedding method for finite
metric spaces},
booktitle = FOCS_2004,
pages = {434--443},
year = 2004
}
@Article{klmn-mdnem-05,
author = {R. Krauthgamer and J. R. Lee and M. Mendel and
A. Naor},
title = {Measured descent: A new embedding method for finite
metric spaces},
journal = {Geom. funct. anal. {(GAFA)}},
year = 2005,
volume = 15,
number = 4,
pages = {839--858},
}
@article{klps-ujrcf-86,
keyent = {klps-ujrcf-86},
author = "K. Kedem and R. Livne and J. Pach and M. Sharir",
title = "On the union of {Jordan} regions and collision-free
translational motion amidst polygonal obstacles",
journal = DCG,
volume = 1,
year = 1986,
pages = "59--71",
keywords = "motion planning, two-dimensional, Jordan curves"
}
@InProceedings{kmnpsw-lsaak-02-old,
keyent = {kmnpsw-lsaak-02},
author = {T.~Kanungo and D.~M.~Mount and N.~S.~Netanyahu and
C.~D.~Piatko and R.~Silverman and A.~Y.~Wu},
title = {A local search approximation algorithm for {$k$}-means
clustering},
booktitle = SOCG_2002,
pages = {10--18},
year = 2002,
url = {http://www.cs.umd.edu/~mount/Papers/kmlocal.pdf}
}
@article{kmnpsw-lsaak-04,
keyent = {kmnpsw-lsaak-02},
author = {T.~Kanungo and D.~M.~Mount and N.~S.~Netanyahu and
C.~D.~Piatko and R.~Silverman and A.~Y.~Wu},
title = {A local search approximation algorithm for {$k$}-means
clustering},
journal = CGTA,
volume = 28,
pages = {89--112},
year = 2004,
url = {http://www.cs.umd.edu/~mount/Papers/kmlocal.pdf}
}
@article{kms-rmrmq-05,
author = {D. Krizanc and P. Morin and M. Smid},
title = {Range mode and range median queries on lists and
trees},
journal = NORDIC_J_COMP,
volume = 12,
number = 1,
year = 2005,
issn = {1236-6064},
pages = {1--17}
}
@article{kmy-amebh-03,
keyent = {kmy-amebh-03},
author = {P. Kumar and J. S. B. Mitchell and E. A. Yildirim},
title = {Approximate minimum enclosing balls in high
dimensions using coresets},
journal = JEALG,
volume = 8,
year = 2003,
issn = {1084-6654},
pages = {1.1},
doi = {10.1145/996546.996548},
url = {http://www.compgeom.com/~piyush/meb/journal.pdf}
}
@InProceedings{kmy-fsehc-03-conf,
keyent = {kmy-fsehc-03-conf},
title = {Fast smallest enclosing hypersphere computation},
author = {P. Kumar and J. S. B. Mitchell and E. A. Yildirim},
booktitle = ALENEX_2003,
year = 2003,
pages = {to appear}
}
@inproceedings{kmz-cbmdq-03,
author = {F. Korn and S. Muthukrishnan and Y. Zhu},
title = {Checks and Balances: Monitoring Data Quality
Problems in Network Traffic Databases.},
booktitle = VLDB_2003,
year = 2003,
pages = {536--547}
}
@article{kor-esann-00,
title = "Efficient Search for Approximate Nearest Neighbor in
High Dimensional Spaces",
author = "E. Kushilevitz and R. Ostrovsky and Y. Rabani",
journal = SICOMP,
volume = 2,
number = 30,
pages = {457--474},
year = 2000,
doi = {10.1137/S0097539798347177},
url = {http://epubs.siam.org/sam-bin/dbq/article/34717}
}
@inproceedings{kor-esann-98-old,
keyent = {kor-esann-98-old},
author = "E. Kushilevitz and R. Ostrovsky and Y. Rabani",
title = "Efficient Search for Approximate Nearest Neighbor in
High Dimensional Spaces",
booktitle = STOC_1998,
year = 1998,
pages = "614--623"
}
@article{kos-ehsro-92,
keyent = {kos-ehsro-92},
author = "M. J. Katz and M. H. Overmars and M. Sharir",
title = "Efficient hidden surface removal for objects with
small union size",
journal = CGTA,
volume = 2,
year = 1992,
pages = "223--234",
keywords = "hidden surface removal",
}
@inproceedings{kp-sudtw-99,
author = {E. J. Keogh and M. J. Pazzani},
title = {Scaling up Dynamic Time Warping to Massive Dataset},
booktitle = {Proc. of the Third Euro. Conf. Princip. Data Mining
and Know. Disc.},
year = 1999,
isbn = {3-540-66490-4},
pages = {1--11}
}
@inproceedings{kr-fnngr-02,
keyent = {kr-fnngr-02},
author = {D. R. Karger and M. Ruhl},
title = {Finding nearest neighbors in growth-restricted
metrics},
booktitle = STOC_2002,
year = 2002,
isbn = {1-58113-495-9},
pages = {741--750},
location = {Montreal, Quebec, Canada},
doi = {10.1145/509907.510013}
}
@inproceedings{kr-nltas-99,
keyent = {kr-nltas-99},
author = {S. G. Kolliopoulos and S. Rao},
title = {A Nearly Linear-Time Approximation Scheme for the
{Euclidean} {$\kappa$}-median Problem},
booktitle = ESA_1999,
year = 1999,
pages = {378--389},
url =
{http://www.cas.mcmaster.ca/~stavros/papers/kmedian.ps}
}
@inproceedings{kr-sidc-92,
author = "A. Kaul and J. Rossignac",
title = "Solid-interpolating deformations: construction and
animation of {PIPs}",
booktitle = "Proc. Eurographics '91",
year = 1991,
pages = "493--505",
comments = "use of Minkowski sums for animation"
}
@article{ks-pvdpt-04,
author = {V. Koltun and M. Sharir},
title = {Polyhedral {Voronoi} Diagrams of Polyhedra in Three
Dimensions},
journal = DCG,
volume = 31,
number = 1,
year = 2004,
pages = {83--124},
doi = {10.1007/s00454-003-2950-5}
}
@InProceedings{ks-bcmlp-96,
keyent = {ks-bcmlp-96},
author = {S. Kahan and J. Snoeyink},
title = {{On the bit complexity of minimum link paths:
Superquadratic algorithms for problems solvable in
linear time}},
booktitle = SOCG_1996,
acceptrate = SOCG_1996_AR,
year = 1996,
pages = {151--158}
}
@InProceedings{ks-lldt-01,
keyent = {ks-lldt-01},
author = {A.R.~Klivans and R.A.~Servedio},
title = {Learning DNF in Time {$2^{\tilde O(n^{1/3})}$}},
booktitle = STOC_2001,
year = 2001,
pages = {258--265}
}
@inproceedings{ks-rers-99,
keyent = {ks-rers-99},
author = "R. Kumar and D. Sivakumar",
title = "Roundness Estimation via Random Sampling",
booktitle = SODA_1999,
pages = "603--612",
year = 1999
}
@article{krs-rmqrp-11,
author = {H. Kaplan and E. Ramos and M. Sharir},
title = {Range Minima Queries with Respect to a Random
Permutation, and Approximate Range Counting},
journal = DCG,
volume = 45,
number = 1,
year = 2011,
pages = {3--33}
}
@inproceedings{ks-rictd-06,
author = {H. Kaplan and M. Sharir},
title = {Randomized incremental constructions of
three-dimensional convex hulls and planar {Voronoi}
diagrams, and approximate range counting},
booktitle = SODA_2006,
year = 2006,
isbn = {0-89871-605-5},
pages = {484--493},
location = {Miami, Florida},
doi = {10.1145/1109557.1109611}
}
@techreport{ksr-sawrp1-91,
keyent = {ksr-sawrp1-91},
author = "M. Kindl and M. Shing and N. Rowe",
title = "A stochastic approach to the weighted-region
problem, {I}: The design of the path annealing
algorithm",
institution = "Computer Science, U. S. Naval Postgraduate School",
address = "Monterey, CA",
year = 1991
}
@techreport{ksr-sawrp2-91,
keyent = {ksr-sawrp2-91},
author = "M. Kindl and M. Shing and N. Rowe",
title = "A stochastic approach to the weighted-region
problem, {II}: Performance enhancement techniques
and experimental results",
institution = "Computer Science, U. S. Naval Postgraduate School",
address = "Monterey, CA",
year = 1991
}
@inproceedings{kss-ltacp-05-old,
keyent = {kss-ltacp-05},
author = {A. Kumar and Y. Sabharwal and S. Sen},
title = {Linear Time Algorithms for Clustering Problems in
Any Dimension},
booktitle = ICALP_2005,
year = 2005
}
@inproceedings{kss-ltacp-05,
title = {Linear Time Algorithms for Clustering Problems in
Any Dimensions},
booktitle = ICALP_2005,
author = {Amit Kumar and Yogish Sabharwal and Sandeep Sen},
editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and
Moti Yung},
series = LNCS,
volume = 3580,
pages = {1374--1385},
publisher = {Springer},
year = 2005,
url = {http://dx.doi.org/10.1007/11523468_111},
doi = {10.1007/11523468_111}
}
@inproceedings{kss-sltaa-04,
author = {Amit Kumar and Yogish Sabharwal and Sandeep Sen},
title = {A Simple Linear Time
{$(1+\varepsilon)$}-Approximation Algorithm
for $k$-Means Clustering in Any Dimensions},
booktitle = FOCS_2004,
pages = {454--462},
publisher = {{IEEE}},
year = {2004},
url = {http://dx.doi.org/10.1109/FOCS.2004.7},
doi = {10.1109/FOCS.2004.7}
}
@InProceedings{kss-sltaa-04-old,
keyent = {kss-sltaa-04},
author = {A. Kumar and Y. Sabharwal and S. Sen},
title = {A Simple linear time {\((1+\varepsilon)\)}-approximation
algorithm for $k$-means clustering in any
dimensions},
booktitle = FOCS_2004,
pages = {454--462},
year = 2004
}
@book{kt-ad-06,
AUTHOR = {J. Kleinberg and E. Tardos},
TITLE = {Algorithm design},
YEAR = 2006,
PUBLISHER = {Addison-Wesley},
ISBN = {0-321-29535-8},
}
@Book{kv-iclt-94,
keyent = {kv-iclt-94},
author = {M. J. Kearns and U. V. Vazirani},
title = {An Introduction to Computational Learning Theory},
publisher = {MIT Press},
year = 1994
}
@InProceedings{kvv-cgbs-00,
keyent = {kvv-cgbs-00},
author = "R. Kannan and S. Vempala and A. Vetta",
title = "On clusterings: good, bad and spectral",
booktitle = FOCS_2000,
year = 2000
}
@article{kw-elepl-92,
author = {J. Kuczynski and H. Wozniakowski},
title = {Estimating the largest eigenvalues by the power and
Lanczos algorithms with a random start},
journal = {SIAM J. Matrix Anal. Appl.},
volume = 13,
number = 4,
year = 1992,
issn = {0895-4798},
pages = {1094--1122},
doi = {10.1137/0613066},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
}
@inproceedings{kwz-bvip-95,
keyent = {kwz-bvip-95},
author = "R. M. Karp and O. Waarts and G. Zweig",
title = "The bit vector intersection problem",
booktitle = FOCS_1995,
year = 1995,
pages = "621--630"
}
@article{ky-ccsas-04,
keyent = {ky-ccsas-04},
author = "P. Kumar and E.A. Yildirim",
title = "Approximating minimum volume enclosing ellipsoids
using core sets",
journal = "J. Opt. Theo. Appl.",
note = "to appear",
year = 2004
}
@article{l-adamp-98,
keyent = {l-adamp-98},
AUTHOR = {J. Luukkainen},
TITLE = {Assouad dimension: antifractal metrization, porous
sets, and homogeneous measures},
JOURNAL = {J. Korean Math. Soc.},
FJOURNAL = {Journal of the Korean Mathematical Society},
VOLUME = 35,
YEAR = 1998,
NUMBER = 1,
PAGES = {23--76},
ISSN = {0304-9914},
CODEN = {JKMSDG},
MRCLASS = {54F45 (28A75)},
MRNUMBER = {99m:54023},
}
@phdthesis{l-adscg-01,
keyent = {l-adscg-01},
author = "S. Langerman",
title = "Algorithms and Data Structures in Computational
Geometry",
school = "Dept. Comp. Sci., Rutgers University",
year = 2001
}
@inproceedings{l-ccm-94,
keyent = {l-ccm-94},
author = "M. J. Longtin",
title = "Cover and concealment in {ModSAF}",
booktitle = "Proc. 4th Conf. on Computer Generated Forces and
Behavioral Representation",
year = 1994,
pages = "239--247"
}
@inproceedings{l-fmscg-02,
author = "N. Linial",
title = "Finite metric spaces -- combinatorics, geometry and
algorithms",
booktitle = "Proc. Int. Cong. Math. III",
pages = "573--586",
year = 2002
}
@Book{l-lawa-98,
keyent = {l-lawa-98},
author = {S. J. Leon},
title = {Linear Algebra with Applications},
publisher = {Prentice Hall},
year = 1998,
edition = {5th}
}
@article{l-lqwia-88,
author = {N. Littlestone},
title = {Learning Quickly When Irrelevant Attributes Abound:
A New Linear-Threshold Algorithm},
journal = {Mach. Learn.},
volume = 2,
number = 4,
year = 1988,
issn = {0885-6125},
pages = {285--318},
doi = {10.1023/A:1022869011914}
}
@article{l-lsqp-82,
keyent = {l-lsqp-82},
author = {S.~Lloyd},
title = {Least squares quantization in PCM},
journal = {IEEE Transactions on Information Theory},
volume = 28,
pages = {129--137},
year = 1982
}
@article{l-ntd-67,
keyent = {l-ntd-67},
AUTHOR = {D. G. Larman},
TITLE = {A new theory of dimension},
JOURNAL = {Proc. London Math. Soc.},
VOLUME = 17,
YEAR = 1967,
PAGES = {178--192},
MRCLASS = {54.70},
MRNUMBER = {34 \#3540},
MRREVIEWER = {E. Nunnally},
}
@inproceedings{l-ocslp-00,
keyent = {l-ocslp-00},
author = "P. Lindstrom",
title = "Out-of-Core Simplification of Large Polygonal
Models",
booktitle = SIGGRAPH_2000,
publisher = "ACM Press / ACM SIGGRAPH / Addison Wesley Longman",
editor = "Kurt Akeley",
pages = "259--262",
year = 2000
}
@Article{l-pggaf-96,
author = {R.~Lohner},
title = {Progress in grid generation via the advancing front
technique},
journal = {Engineering with Computers},
year = 1996,
volume = 12,
pages = {186--210}
}
@article{l-pwwmc-02,
keyent = {l-pwwmc-02},
AUTHOR = {T. J. Laakso},
TITLE = {Plane with {$A\sb \infty$}-weighted metric not
bi-{L}ipschitz embeddable to {$\mathbb{R}\sp N$}},
JOURNAL = {Bull. London Math. Soc.},
FJOURNAL = {The Bulletin of the London Mathematical Society},
VOLUME = 34,
YEAR = 2002,
NUMBER = 6,
PAGES = {667--676},
ISSN = {0024-6093},
CODEN = {LMSBBT},
MRCLASS = {30C62 (28A80 30C65)},
MRNUMBER = {2003h:30029},
MRREVIEWER = {Vasily A. Chernecky},
}
@article{l-roifc-75,
keyent = {l-roifc-75},
author = "L. Lov{\'a}sz",
title = "On the ratio of optimal integral and fractional
covers",
journal = "Discrete Math.",
volume = 13,
year = 1975,
pages = "383--390",
keywords = "approximation"
}
@inproceedings{lc-avcpg-92,
keyent = {lc-avcpg-92},
author = "H. S. Lee and R. C. Chang",
title = "Approximating Vertices of a Convex Polygon with Grid
Points in the Polygon",
booktitle = ISAAC_1992,
series = LNCS,
volume = 650,
publisher = "Springer-Verlag",
year = 1992,
pages = "269--278"
}
@Misc{lgma-00,
keyent = {lgma-00},
title = {Large Geometric Models Archive},
howpublished = {Georgia Tech.},
note =
{\href{http://www.cc.gatech.edu/projects/large_models/index.html}{http://www.cc.gatech.edu/projects/large\_models/index.html}},
key = {LGMA00}
}
@Article{lhhh-esolm-03,
author = {C. Linhart and D. Halperin and I. Hanniel and
S. {Har-Peled}},
title = {An Experimental study of on-line methods for zone
construction in arrangements of lines in the plane},
journal = IJCGA,
year = 2003,
volume = 13,
number = 6,
pages = {463--485}
}
@article{ll-orpr-91,
keyent = {ll-orpr-91},
author = "V. B. Le and D. T. Lee",
title = "Out-of-roundness problem revisited",
journal = "IEEE Trans. Pattern Anal. Mach. Intell.",
volume = "PAMI-13",
number = 3,
year = 1991,
pages = "217--223"
}
@inproceedings{llglm-futwo-97,
author = "S. M. LaValle and D. Lin and L. J. Guibas and
J.-C. Latombe and R. Motwani",
title = "Finding an unpredictable target in a workspace with
obstacles",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
month = apr,
year = 1997,
note = "To appear"
}
@article{llr-ggsaa-95,
author = "N. Linial and E. London and Y. Rabinovich",
title = "The geometry of graphs and some of its algorithmic
applications",
journal = "Combinatorica",
volume = "15(2)",
pages = "215--245",
year = 1995,
}
@article{lls-ibscl-01,
author = {Y. Li and P. M. Long and A. Srinivasan},
title = {Improved Bounds on the Sample Complexity of
Learning.},
journal = {J. Comput. Syst. Sci.},
volume = 62,
number = 3,
year = 2001,
pages = {516--527}
}
@article{llty-gsoak-97,
author = "M. Linial and N. Linial and N. Tishby and G. Yona",
title = "Global self organization of all known protein
sequences reveals inherent biological signatures",
journal = "J. Mol. Biol.",
volume = 268,
pages = "539--556",
year = 1997,
}
@inproceedings{lm-crm-95,
keyent = {lm-crm-95},
author = "M. J. Longtin and D. Megherbi",
title = "Concealed routes in {ModSAF}",
booktitle = "Proc. 5th Conf. on Computer Generated Forces and
Behavioral Representation",
year = 1995,
pages = "305--313"
}
@inproceedings{lms-awspp-97,
author = "M. Lanthier and A. Maheshwari and J.-R. Sack",
title = "Approximating weighted shortest paths on polyhedral
surfaces",
booktitle = SOCG_1997,
year = 1997,
pages = "274--283"
}
@article{ln-elfrmp-04,
keyent = {ln-elfrmp-04},
author = {J. R. Lee and A. Naor},
title = {Extending Lipschitz functions via random metric
partitions},
journal = {Inventiones mathematics},
year = 2004,
note = {to appear}
}
@article{lpc-saspf-02,
author = {J. Lee and S. Park and K. Chwa},
title = {Simple algorithms for searching a polygon with
flashlights},
journal = IPL,
volume = 81,
number = 5,
year = 2002,
issn = {0020-0190},
pages = {265--270},
doi = {10.1016/S0020-0190(01)00235-6},
publisher = {Elsevier}
}
@inproceedings{lpcrk-dmpts-00,
keyent = {lpcrk-dmpts-00},
author = "M. Levoy and K. Pulli and B. Curless and
S. Rusinkiewicz and D. Koller and L. Pereira and
M. Ginzton and S. Anderson and J. Davis and
J. Ginsberg and J. Shade and D. Fulk",
title = "The Digital Michelangelo Project: 3{D} Scanning of
Large Statues",
booktitle = SIGGRAPH_2000,
publisher = "ACM Press / ACM SIGGRAPH / Addison Wesley Longman",
editor = "Kurt Akeley",
pages = "131--144",
year = 2000
}
@InProceedings{lpvv-ccpso-01,
keyent = {lpvv-ccpso-01},
author = {Francis Lazarus and Michel Pocchiola and Gert Vegter
and Anne Verroust},
title = {Computing a canonical polygonal schema of an
orientable triangulated surface},
booktitle = SOCG_2001,
pages = {80--89},
year = 2001
}
@article {ls-ecdmscdm-98,
keyent = {ls-ecdmscdm-98},
AUTHOR = {J. Luukkainen and E. Saksman},
TITLE = {Every complete doubling metric space carries a
doubling measure},
JOURNAL = {Proc. Amer. Math. Soc.},
FJOURNAL = {Proc. Amer. Math. Soc.},
VOLUME = 126,
YEAR = 1998,
NUMBER = 2,
PAGES = {531--534},
ISSN = {0002-9939},
CODEN = {PAMYAR},
MRCLASS = {28A12},
MRNUMBER = {99c:28009},
MRREVIEWER = {Guozhen Lu}
}
@techreport{m-aagsp-9,
keyent = {m-aagsp-93},
author = "J. S. B. Mitchell",
title = "Approximation Algorithms for Geometric Separation
Problems",
institution = "Department of Applied Mathematics, SUNY Stony Brook,
NY",
month = jul,
year = 1993
}
@incollection{m-aaspt-91,
keyent = {m-aaspt-91},
author = "J. S. B. Mitchell",
title = "An algorithmic approach to some problems in terrain
navigation",
editor = "S. Sitharama Iyengar and Alberto Elfes",
booktitle = "Autonomous Mobile Robots: Perception, Mapping, and
Navigation",
publisher = "IEEE Computer Society Press",
address = "Los Alamitos, CA",
year = 1991,
pages = "408--427"
}
@Article{m-agc-00,
keyent = {m-agc-00},
author = {J. Matou{\v s}ek},
title = {On approximate geometric {$k$}-clustering},
journal = DCG,
volume = 24,
pages = {61--84},
year = 2000,
url =
{http://citeseer.nj.nec.com/matousek99approximate.html}
}
@article{m-alla-91,
author = "J. Matou{\v s}ek",
title = "Approximate levels in line arrangements",
journal = SICOMP,
volume = 20,
year = 1991,
pages = "222--227"
}
@inproceedings{m-aogdc-91-old,
keyent = {m-aogdc-91-old},
author = "J. Matou{\v s}ek",
title = "Approximations and optimal geometric
divide-and-conquer",
booktitle = STOC_1991,
year = 1991,
pages = "505--511",
note = "Also to appear in {\em J. Comput. Syst. Sci.}",
keywords = "approximations, {VC}-dimension, shatter function,
derandomization , cutting, partition"
}
@Article{m-aogdc-95,
keyent = {m-aogdc-95},
title = {Approximations and Optimal Geometric
Divide-and-Conquer},
author = {J. Matou{\v{s}}ek},
pages = {203--208},
journal = {J. Comput. Syst. Sci.},
year = 1995,
volume = 50,
number = 2,
preliminary = {STOC::Matousek1991},
source =
{http://theory.lcs.mit.edu/\tildegen{}dmjones/hbp/jcss/jcss.bib}
}
@article{m-apcad-83,
author = "N. Megiddo",
title = "Applying parallel computation algorithms in the
design of serial algorithms",
journal = JACM,
volume = 30,
number = 4,
year = 1983,
pages = "852--865",
keywords = "design of algorithms, parallel computation, binary
search"
}
@Article{m-bleld-90,
keyent = {m-bleld-90},
author = {J. Matou{\v s}ek},
title = {{Bi-Lipschitz} embeddings into low-dimensional
{Euclidean} spaces},
journal = {Comment. Math. Univ. Carolinae},
year = 1990,
volume = 31,
pages = {589--600},
annote = {{814}}
}
@incollection{m-ccpps-91,
keyent = {m-ccpps-91},
author = "J. Matou{\v s}ek",
title = "Computing the center of planar point sets",
editor = "J. E. Goodman and R. Pollack and W. Steiger",
booktitle = "Computational Geometry: Papers from the DIMACS
Special Year",
publisher = AMS,
year = 1991,
pages = "221--230",
keywords = "centerpoint, parametric search, cutting, k-level"
}
@article{m-cen-90,
keyent = {m-cen-90},
author = "J. Matou{\v s}ek",
title = "Construction of {\(\varepsilon\)}-nets",
journal = DCG,
volume = 5,
year = 1990,
pages = "427--448"
}
@book{m-cgitr-94,
author = "K. Mulmuley",
title = {Computational Geometry: An Introduction Through
Randomized Algorithms},
publisher = "Prentice Hall",
year = 1994,
url = {http://www.amazon.com/Computational-Geometry-Introduction-Randomized-Algorithms/dp/0133363635},
isbn = {978-0-13-336363-0},
address = "Englewood Cliffs, NJ",
annote = "Graduate text"
}
@Article{m-ctaec-50,
author = {A.M.~Macbeath},
title = {A compactness theorem for affine equivalence-classes
of convex regions},
journal = {Canad. J. Math},
year = 1950,
volume = 3,
pages = {54--61}
}
@Article{m-ctaec-51,
keyent = {m-ctaec-51},
author = {A. M. Macbeath},
title = {A Compactness theorem for affine equivalence-classes
of convex regions},
journal = {Canad. J. Math.},
year = 1951,
volume = 3,
pages = {54--61}
}
@unpublished{m-drpvd-01-old,
keyent = {m-drpvd-01},
author = {A. Magen},
title = {Dimensionality reductions that preserve volumes and
distance to affine spaces, and its algorithmic
applications},
year = 2001,
note = {Submitted to STOC 2002}
}
@article{m-drlpv-07,
author = {A. Magen},
title = {Dimensionality Reductions in {$\ell_{\mbox{2}}$} that
Preserve Volumes and Distance to Affine Spaces},
journal = DCG,
volume = 38,
number = 1,
year = 2007,
pages = {139--153}
}
@InProceedings{m-drpvd-02-conf,
keyent = {m-drpvd-02},
author = {A.~Magen},
title = {Dimensionality Reductions That Preserve Volumes and
Distance to Affine Spaces, and Their Algorithmic
Applications},
booktitle = RANDOM_2002,
pages = {239--253},
year = 2002
}
@article{m-eahsr-89,
keyent = {m-eahsr-89},
author = "K. Mulmuley",
title = "An efficient algorithm for hidden surface removal",
journal = "Comput. Graph.",
volume = 23,
number = 3,
month = 1989,
year = 1989,
pages = "379--388"
}
@article{m-eahsr-94,
keyent = {m-eahsr-90},
author = "K. Mulmuley",
title = "An efficient algorithm for hidden surface removal,
{II}",
journal = JCSS,
volume = 49,
year = 1994,
pages = {427--453}
}
@article{m-ekpc-95,
keyent = {m-ekpc-95},
author = "J. Matou{\v s}ek",
title = "On enclosing {$k$} points by a circle",
journal = IPL,
volume = 53,
year = 1995,
pages = "217--221"
}
@incollection{m-encg-93,
keyent = {m-encg-93},
author = "J. Matou{\v s}ek",
title = "Epsilon-Nets and Computational Geometry",
editor = "J. Pach",
booktitle = "New Trends in Discrete and Computational Geometry",
series = "Algorithms and Combinatorics",
volume = 10,
publisher = "Springer-Verlag",
address = "Heidelberg",
year = 1993,
pages = "69--89"
}
@Article{m-ept-92,
keyent = {m-ept-92},
author = "J. Matou{\v s}ek",
title = "Efficient partition trees",
journal = dcg,
volume = 8,
year = 1992,
pages = "315--334",
url = {http://dx.doi.org/10.1007/BF02293051},
doi = {10.1007/BF02293051},
keywords = "simplex range searching, crossing number, multilevel
data structure, approximations"
}
@article{m-facpm-96,
keyent = {m-facpm-96},
author = "B. Mirtich",
title = "Fast and Accurate Computation of Polyhedral Mass
Properties",
journal = "J. Graphics Tools",
volume = 1,
number = 2,
year = 1996,
pages = "31--50"
}
@article{m-fppa-90,
keyent = {m-fppa-90},
author = "K. Mulmuley",
title = "A Fast Planar Partition Algorithm, {I}",
journal = "J. Symbolic Comput.",
volume = 10,
number = "3-4",
year = 1990,
pages = "253--280",
}
@Book{m-gd-99,
keyent = {m-gd-99},
author = {J. Matou{\v s}ek},
title = {Geometric Discrepancy},
publisher = {Springer},
url = {http://kam.mff.cuni.cz/~matousek/dg.html},
year = 1999
}
@article{m-gofvc-95,
keyent = {m-gofvc-95},
author = {J. Matou{\v s}ek},
title = "On Geometric Optimization with Few Violated
Constraints",
journal = DCG,
volume = 14,
year = 1995,
pages = "365--384",
url = {http://citeseer.nj.nec.com/matousek94geometric.html}
}
@Article{m-gpud-90,
keyent = {m-gpud-90},
author = {N. Megiddo},
title = {Geometric problems in unbounded dimension},
journal = {J. Symb. Comput.},
year = 1990,
pages = {327--334}
}
@article{m-gsaps-99,
author = "J. S. B. Mitchell",
title = "Guillotine Subdivisions Approximate Polygonal
Subdivisions: {A} Simple Polynomial-Time
Approximation Scheme for Geometric {TSP}, \(k\)-MST,
and Related Problems",
journal = SICOMP,
volume = 28,
year = 1999,
pages = "1298--1309",
url = "http://ams.sunysb.edu/~jsbm/jsbm.html"
}
@incollection{m-gspno-00,
title = {Geometric shortest paths and network optimization},
author = {J. S. B. Mitchell},
booktitle = {Handbook of Computational Geometry},
publisher = {Elsevier},
editor = {J.-R. Sack and J. Urrutia},
pages = {633--701},
year = 2000,
chapter = 15
}
@article{m-lavd-91,
keyent = {m-lavd-91},
author = "K. Mulmuley",
title = "On levels in arrangements and {Voronoi} diagrams",
journal = DCG,
volume = 6,
year = 1991,
pages = "307--338"
}
@Book{m-ldg-02,
keyent = {m-ldg-02},
author = {J. Matou{\v s}ek},
title = {Lectures on Discrete Geometry},
publisher = {Springer},
series = {Grad. Text in Math.},
volume = 212,
year = 2002,
url = {http://kam.mff.cuni.cz/~matousek/dg.html},
doi = {10.1007/978-1-4613-0039-7/}
}
@article{m-ltalp-83,
keyent = {m-ltalp-83},
author = "N. Megiddo",
title = "Linear-time algorithms for linear programming in
{$R^{3}$} and related problems",
journal = SICOMP,
volume = 12,
number = 4,
year = 1983,
pages = "759--776"
}
@article{m-ocfcp-98,
author = {J. Matou{\v s}ek},
title = {On constants for cuttings in the plane},
journal = DCG,
year = 1998,
volume = 20,
pages = "427--448",
doi = {10.1007/PL00009394},
url =
{http://link.springer.com/article/10.1007%2FPL00009394}
}
@Article{m-ocsgp-90,
keyent = {m-ocsgp-90},
author = {N.~Megiddo},
title = {On the complexity of some geometric problems in
unbounded dimension},
journal = {J. Symb. Comput.},
year = 1990,
volume = 10,
pages = {327--334}
}
@article{m-roass-91,
author = "J. Matou{\v s}ek",
title = "Randomized optimal algorithm for slope selection",
journal = IPL,
volume = 39,
year = 1991,
pages = "183--187"
}
@article{m-rph-92,
keyent = {m-rph-92},
author = "J. Matou{\v s}ek",
title = "Reporting points in halfspaces",
journal = CGTA,
volume = 2,
number = 3,
year = 1992,
pages = "169--186"
}
@article{m-rsehc-93,
keyent = {m-rsehc-93},
author = "J. Matou{\v s}ek",
title = "Range searching with efficient hierarchical
cuttings",
journal = DCG,
volume = 10,
number = 2,
year = 1993,
pages = "157--182"
}
@inproceedings{m-smcam-67,
keyent = {m-smcam-67},
author = {J.~MacQueen},
title = {Some methods for classifications and analysis of
multivariate observations},
booktitle = {Proc. fifth Berkeley symp. math. stat. and prob.},
year = 1967,
pages = "281--297",
voluem = 1,
publisher = {Unversity of California Press, Berkeley}
}
@article{m-ssps-87,
keyent = {m-ssps-87},
author = "D. M. Mount",
title = "Storing the subdivision of a polyhedral surface",
journal = DCG,
volume = 2,
year = 1987,
pages = "153--174"
}
@InProceedings{m-tedra-04,
keyent = {m-tedra-04},
author = {G.~L.~Miller},
title = {A time efficient {Delaunay} refinement algorithm},
booktitle = SODA_2004,
pages = {400--409},
year = 2004
}
@book{m-tfc-75,
keyent = {m-tfc-75},
author = "J. R. Munkres",
title = "Topology: {A} first course",
publisher = "Prentice Hall",
address = "Englewood Cliffs, NJ",
year = 1975
}
@book {m-ubut-03,
keyent = {m-ubut-03},
AUTHOR = {J. Matou{\v{s}}ek},
TITLE = {Using the {B}orsuk-{U}lam theorem},
SERIES = {Universitext},
NOTE = {Lectures on topological methods in combinatorics and
geometry, Written in cooperation with Anders
Bj\"orner and G\"unter M. Ziegler},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin},
YEAR = 2003,
PAGES = {xii+196},
ISBN = {3-540-00362-2},
MRCLASS = {55-01 (05-01 52-01 52A35 55M20)},
MRNUMBER = {2004i:55001},
MRREVIEWER = {Zdzis{\l}aw Dzedzej},
}
@article{mh-ldq-96,
author = {C. J. H. McDiarmid and R. B. Hayward},
title = {Large deviations for quicksort},
journal = {J. Algorithms},
volume = 21,
number = 3,
year = 1996,
issn = {0196-6774},
pages = {476--507},
doi = {10.1006/jagm.1996.0055},
publisher = {Academic Press, Inc.},
address = {Duluth, MN, USA},
}
@article{mhgjp-csg-88,
author = "N. Megiddo and S. L. Hakimi and M. R. Garey and
D. S. Johnson and C. H. Papadimitriou",
title = "On the complexity of searching a graph",
journal = JACM,
volume = 35,
year = 1988,
pages = "18--44"
}
@inproceedings{mm-nacsp-97,
keyent = {mm-nacsp-97},
author = "C. Mata and J. S. B. Mitchell",
title = "A new algorithm for computing shortest paths in
weighted planar subdivisions",
booktitle = SOCG_1997,
year = 1997,
pages = "264--273"
}
@Article{mmp-dgp-87,
keyent = {mmp-dgp-87},
author = {J. S.B. Mitchell and D. M. Mount and
C. H. Papadimitriou},
title = {{The discrete geodesic problem}},
journal = SICOMP,
year = 1987,
volume = 16,
pages = {647--668}
}
@inproceedings{mmpssw-ftdlm-91-conf,
keyent = {mmpssw-ftdlm-91},
author = "J. Matou{\v s}ek and N. Miller and J. Pach and
M. Sharir and S. Sifrony and E. Welzl",
title = "Fat triangles determine linearly many holes",
booktitle = FOCS_1991,
year = 1991,
pages = "49--58"
}
@article{mmpssw-ftdlm-94,
author = "J. Matou{\v s}ek and N. Miller and J. Pach and
M. Sharir and S. Sifrony and E. Welzl",
title = {Fat Triangles Determine Linearly Many Holes},
journal = SICOMP,
volume = 23,
number = 1,
year = 1994,
issn = {0097-5397},
pages = {154--169}
}
@article{mmrk-rrmcv-91,
keyent = {mmrk-rrmcv-91},
author = "P. Meer and D. Mintz and A. Rosenfeld and D. Y. Kim",
title = "Robust regrsssion methods for computer vision: {A}
review",
journal = "Intl. J. of Computer Vision",
volume = 6,
year = 1991,
pages = "59--70"
}
@book{mn-idm-98,
keyent = {mn-idm-98},
title = "Invitation to Discrete Mathematics",
author = {J. Matou{\v s}ek and J. Ne{\v s}et{\v r}il},
year = 1998,
ISBN = 0198502079,
publisher = {Oxford Univ Press},
url = {https://global.oup.com/academic/product/an-invitation-to-discrete-mathematics-9780198570424?cc=us&lang=en&}
}
@article{mn-lpcgc-95,
keyent = {mn-lpcgc-95},
author = "K. Mehlhorn and S. N{\"a}her",
title = "{LEDA}: a platform for combinatorial and geometric
computing",
journal = "Commun. ACM",
volume = 38,
year = 1995,
pages = "96--102",
url =
"http://www.mpi-sb.mpg.de/guide/staff/uhrig/leda.html"
}
@Book{mn-lpcgc-99,
keyent = {mn-lpcgc-99},
author = "K. Mehlhorn and S. N{\"a}her",
title = "{LEDA}: {A} platform for combinatorial and geometric
computing",
publisher = {Cambridge University Press},
year = 1999
}
@inproceedings{mnrsy-paall-97,
keyent = {mnrsy-paall-97},
author = "D. M. Mount and N. S. Netanyahu and K. R. Romanik
and R. Silverman and A. Y. Yu",
title = "A Practical Approximation Algorithm for the LMS Line
Estimator",
booktitle = SODA_1997,
month = jan,
year = 1997,
url = {http://www.cs.umd.edu/~mount/Papers/ALMS.ps},
pages = "473--482"
}
@InProceedings{moo-nsfl-05,
author = {E. Mossel and R. O'Donnell and K. Oleszkiewicz},
title = {Noise stability of functions with low influences
invariance and optimality},
booktitle = FOCS_2005,
pages = {21--30},
year = 2005
}
@InProceedings{mop-stac-01,
keyent = {mop-stac-01},
author = {N. Mishra and D. Oblinger and L. Pitt},
title = {Sublinear Time Approximate Clustering},
booktitle = SODA_2001,
pages = {439--447},
year = 2001
}
@InProceedings{mp-cdtwt-99,
keyent = {mp-cdtwt-99},
author = {M. E. Munich and P. Perona},
title = {Continuous Dynamic Time Warping for
Translation-Invariant Curve Alignment with
Applications to Signature Verification},
booktitle = {Proc. of the 7th Inter. Conf. on Computer Vision},
pages = "108--115",
year = 1999
}
@Unpublished{mp-ofsch-97,
keyent = {mp-ofsch-97},
author = "J. Matou{\v s}ek and P. Plech{\' a}{\v c}",
title = {On functional separately convex hulls},
note = {To appear in Discrete Comput. Geom.},
year = 1997
}
@article{mp-omp-03,
author = {R. R. Mettu and C. G. Plaxton},
title = {The Online Median Problem},
journal = SICOMP,
volume = 32,
number = 3,
year = 2003,
issn = {0097-5397},
pages = {816--832},
doi = {10.1137/S0097539701383443},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
}
@inproceedings{mp-otbap-02,
keyent = {mp-otbap-02},
author = {R. Mettu and C. G. Plaxton},
title = {Optimal Time Bounds for Approximate Clustering},
booktitle = {In Proceedings of the 18th Conference on Uncertainty
in Artifical Intelligence},
pages = "344--351",
year = 2002
}
@book{mp-p-69,
keyent = {mp-p-69},
author = "M. Minsky and S. Papert",
title = "Perceptrons",
publisher = "MIT Press, Cambridge, MA",
year = 1969
}
@article{mp-wrpfs-91,
keyent = {mp-wrpfs-91},
author = "J. S.B. Mitchell and C. H. Papadimitriou",
title = "The weighted region problem: finding shortest paths
through a weighted planar subdivision",
journal = JACM,
volume = 38,
year = 1991,
pages = "18--73",
keywords = "weighted, path planning, geodesic distance, shortest
paths, {Voronoi} diagrams, continuous Dijkstra"
}
@Book{mps-lpvaa-98,
keyent = {mps-lpvaa-98},
editor = {E. W. Mayr and H. J. Promel and A. Steger},
title = {Lectures on Proof Verification and Approximation
Algorithms},
publisher = "Springer-Verlag",
year = 1998,
volume = 1367,
url =
{http://link.springer.de/link/service/series/0558/tocs/t1367.htm}
}
@InProceedings{mpw-wwraw-03,
keyent = {mpw-wwraw-03},
author = {G.~L.~Miller and S.~Pav and and N.~Walkington},
title = {When and why {Ruppert's} algorithm works},
booktitle = MRT_2003,
pages = {91--102},
year = 2003
}
@Article{mr-bqs-98,
keyent = {mr-bqs-98},
author = {D.~Malkhi and M.~Reiter},
title = {Byzantine Quorum Systems},
journal = {Distributed Computing},
year = 1998,
volume = 11,
number = 4,
pages = {203--213}
}
@book{mr-ra-95,
keyent = {mr-ra-95},
author = "R. Motwani and P. Raghavan",
title = "Randomized Algorithms",
publisher = "Cambridge University Press",
address = "Cambridge, UK",
url =
{http://us.cambridge.org/titles/catalogue.asp?isbn=0521474655},
year = 1995
}
@inproceedings{mrrss-fidcu-01,
keyent = {mrrss-fidcu-01},
author = "K. Miller and S. Ramaswami and P. Rousseeuw and
T. Sellares and D. L. Souvaine and I. Streinu and
A. Struyf",
title = "Fast implementation of depth contours using
topological sweep",
booktitle = SODA_2001,
pages = "690-699",
year = 2001,
url = "http://citeseer.nj.nec.com/miller01fast.html"
}
@book{ms-atfdn-86,
author = "V. Milman and G. Schechtman",
title = "Asymptotic Theory of Finite Dimensional Normed
Spaces",
year = 1986,
publisher = "Springer-Verlag",
series = "Lectures Notes in Math.",
volume = 1200,
}
@InProceedings{msgc-vccii-97,
keyent = {msgc-vccii-97},
author = {M.~McDonald and D.~Small and C.~Graves and
D.~Cannon},
title = {Virtual collaborative control to improve intelligent
robotic system efficiency and quality},
booktitle = ICRA_1997,
year = 1997,
}
@article{msw-aotp-96,
keyent = {msw-aotp-96},
author = "D. M. Mount and R. Silverman and A. Y. Wu",
title = "On the Area of Overlap of Translated Polygons",
journal = "Computer Vision and Image Understanding: CVIU",
volume = 64,
number = 1,
pages = "53--61",
year = 1996,
url = {http://www.cs.umd.edu/~mount/Papers/overlap.ps}
}
@article{msw-sblp-96,
author = "J. Matou{\v s}ek and M. Sharir and E. Welzl",
title = {A Subexponential Bound for Linear Programming},
journal = {Algorithmica},
volume = {16},
number = {4/5},
pages = {498--516},
year = {1996},
url = {http://dx.doi.org/10.1007/BF01940877},
doi = {10.1007/BF01940877}
}
@inproceedings{msy-crcp-97,
keyent = {msy-crcp-97},
author = "K. Mehlhorn and T. C. Shermer and C. K. Yap",
title = "A Complete Roundness Classification Procedure",
booktitle = SOCG_1997,
year = 1997,
pages = "129--138",
url =
{ftp://cs.nyu.edu/pub/local/yap/metrology/classification.ps.gz}
}
@article{mt-cllfp-82,
keyent = {mt-cllfp-82},
author = "N. Megiddo and A. Tamir",
title = "On the complexity of locating linear facilities in
the plane",
journal = "Oper. Res. Lett.",
volume = 1,
year = 1982,
pages = "194--197"
}
@Book{mu-pcrap-05,
author = {M. Mitzenmacher and U. Upfal},
title = {Probability and Computing -- randomized algorithms
and probabilistic analysis},
publisher = {Cambridge},
year = 2005
}
@article{mv-qmghd-00,
author = "S. A. Mitchell and S. A. Vavasis",
title = "Quality mesh generation in higher dimensions",
journal = SICOMP,
volume = 29,
year = 2000,
pages = "1334--1370"
}
@inproceedings{mv-qmgtd-92i,
author = "S. A. Mitchell and S. A. Vavasis",
title = "Quality mesh generation in three dimensions",
booktitle = SOCG_1992,
year = 1992,
pages = "212--221"
}
@article{mww-deabv-93,
author = "J. Matou{\v s}ek and E. Welzl and L. Wernisch",
title = "Discrepancy and {\(\varepsilon\)}-approximations for
bounded {VC}-dimension",
journal = "Combinatorica",
volume = 13,
year = 1993,
pages = "455--466"
}
@inproceedings{mww-deabv-91-conf,
keyent = {mww-deabv-91},
author = "J. Matou{\v s}ek and E. Welzl and L. Wernisch",
title = "Discrepancy and {\(\varepsilon\)}-approximations for
bounded {VC}-dimension",
booktitle = FOCS_1991,
year = 1991,
pages = "424--430"
}
@TechReport{n-gqovc-98,
keyent = {n-gqovc-98},
author = {Y.~Nesterov},
title = {Global quadratic optimization via conic relaxation},
institution = {Catholic University of Louvaine, Belgium},
year = 1998,
key = {Working paper, CORE}
}
@Book{n-mc-98,
author = {J. R. Norris},
title = {Markov Chains},
publisher = {Cambridge Press},
year = 1998,
series = {Statistical and Probabilistic Mathematics}
}
@inproceedings{ni-gcgar-97,
keyent = {ni-gcgar-97},
author = "J. C. Navas and T. Imielinski",
title = "{GeoCast} -- Geographic Addressing and Routing",
booktitle = "Mobile Computing and Networking",
pages = "66-76",
year = 1997,
url = "citeseer.nj.nec.com/navas97geocast.html"
}
@inproceedings{nppss-lapca-02,
keyent = {nppss-lapca-02},
author = {E. Nevo and J. Pach and R. Pinchasi and M. Sharir
and S. Smorodinsky},
booktitle = SOCG_2002,
title = {Lenses in arrangements of pseudo-circles and their
applications},
pages = "123--132",
year = 2002,
url = {http://www.math.tau.ac.il/~shakhar/lenses.socg02.ps}
}
@Article{nrt-omqfo-99,
keyent = {nrt-omqfo-99},
author = {A.~Nemirovski and C.~Roos and T.~Terlaky},
journal = {Math. Prog.},
title = {On maximization of quadratic forms over intersection
of ellipsoids with common center},
year = 1999,
volume = 86,
number = 3,
series = {A},
pages = {463--473}
}
@article{nt-opg-94,
keyent = {nt-opg-94},
author = "S. C. Ntafos and M. Z. Tsoukalas",
title = "Optimum Placement of Guards",
journal = "Info. Sciences",
year = 1994,
pages = {141--150},
volume = 76
}
@article{nw-gfsiq-93,
keyent = {nw-gfsiq-93},
author = "J. Nievergelt and P. Widmayer",
title = "Guard files: {S}tabbing and intersection queries on
fat spatial objects",
journal = "Comput. J.",
volume = 36,
year = 1993,
pages = "107--116"
}
@article{nw-lcaqs-98,
keyent = {nw-lcaqs-98},
author = "M. Naor and A. Wool",
title = "The Load, Capacity, and Availability of Quorum
Systems",
journal = SICOMP,
volume = 27,
number = 2,
pages = "423--447",
year = 1998,
url = "citeseer.nj.nec.com/naor98load.html"
}
@inproceedings{nz-pindc-02,
title = {Predicting Internet network distance with
coordinates-based approaches},
author = {T. S. E. Ng and H. Zhang},
doi = {10.1109/INFCOM.2002.1019258},
booktitle = INFOCOM_2002,
keywords = {routing-metrics virtual-coordinates},
pages = {170--179},
url =
{http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1019258},
volume = 1,
year = 2002
}
@article{o-aalmsr-97,
keyent = {o-aalmsr-97},
author = "C. F. Olson",
title = "An approximation algorithm for least median of
squares regression",
journal = "Information Processing Letters",
volume = 63,
year = 1997,
pages = "237--241"
}
@book{o-agta-87,
keyent = {o-agta-87},
author = "J. O'Rourke",
title = "Art Gallery Theorems and Algorithms",
series = "The International Series of Monographs on Computer
Science",
publisher = "Oxford University Press",
year = 1987,
url = {http://cs.smith.edu/~orourke/books/art.html}
}
@article{o-fmeb-85,
keyent = {o-fmeb-85},
author = "J. O'Rourke",
title = "Finding minimal enclosing boxes",
journal = "Internat. J. Comput. Inform. Sci.",
volume = 14,
year = 1985,
pages = "183--199",
keywords = "approximation, volume"
}
@book{obsc-stcav-00,
keyent = {obsc-stcav-00},
author = "A. Okabe and B. Boots and K. Sugihara and
S. N. Chiu",
title = "Spatial tessellations: Concepts and applications of
{V}oronoi diagrams",
series = "Probability and Statistics",
edition = "2nd edition",
publisher = {John Wiley \& Sons, Inc.},
address = {New York, NY, USA},
year = 2000,
url = {http://okabe.t.u-tokyo.ac.jp/okabelab/{Voronoi}/}
}
@article{okm-ccs-86,
keyent = {okm-ccs-86},
author = "J. O'Rourke and S. R. Kosaraju and N. Megiddo",
title = "Computing circular separability",
journal = DCG,
volume = 1,
year = 1986,
pages = "105--113"
}
@article{ol-mcp-81,
keyent = {ol-mcp-81},
author = "M. H. Overmars and J. van Leeuwen",
title = "Maintenance of configurations in the plane",
journal = "J. Comput. Syst. Sci.",
volume = 23,
year = 1981,
pages = "166--204"
}
@inproceedings{or-ptasg-00,
keyent = {or-ptasg-00},
title = {Polynomial time approximation schemes for geometric
{$k$}-clustering},
author = {R. Ostrovsky and Y. Rabani},
booktitle = {Proc. 41st Symp. Foundations of Computer Science},
publisher = {IEEE},
pages = {349--358},
month = {Nov},
year = 2000
}
@article{os-snhpd-83,
keyent = {os-snhpd-83},
author = "J. O'Rourke and K. J. Supowit",
title = "Some {NP}-hard polygon decomposition problems",
journal = "IEEE Trans. Inform. Theory",
volume = "IT-30",
year = 1983,
pages = "181--190",
update = "94.09 lambert"
}
@article{osw-dcrch-85,
keyent = {osw-dcrch-85},
author = "T. Ottmann and E. Soisalon-Soininen and D. Wood",
title = "On the definition and computation of rectilinear
convex hulls",
journal = "Inform. Sci.",
volume = 33,
year = 1985,
pages = "157--171"
}
@article{p-aspmt-85,
keyent = {p-aspmt-85},
author = "C. H. Papadimitriou",
title = "An algorithm for shortest-path motion in three
dimensions",
journal = IPL,
volume = 20,
year = 1985,
pages = "259--263",
keywords = "motion planning, path planning, geodesic distance,
shortest paths"
}
@article{p-ilsg-04,
keyent = {p-ilsg-04},
author = {D. Peleg},
title = {Informative Labeling Schemes for Graphs},
journal = {Theoretical Computer Science},
year = 2004,
note = {To appear. Preliminary version appeared in MFCS '00}
}
@Unpublished{p-mephd-04,
keyent = {p-mephd-04},
author = {R. Panigrahy},
title = {Minimum enclosing polytope in high dimensions},
note = {menuscript},
year = 2004
}
@incollection{p-peg-76,
author = "T. D. Parsons",
title = "Pursuit-evasion in a graph",
editor = "Y. Alavi and D. Lick",
booktitle = "Theory and Applications of Graphs",
series = "Lecture Notes Math.",
volume = 642,
publisher = "Springer-Verlag",
address = "Berlin, West Germany",
year = 1976,
pages = "426--441"
}
@Unpublished{p-ruasc-86,
author = {D. Pollard},
title = {Rates of uniform almost-sure convergence for
empirical processes indexed by unbounded classes of
functions},
note = {Manuscript},
year = 1986
}
@article{p-sckmc-81,
keyent = {p-sckmc-81},
author = {D. Pollard},
title = {Strong consistency of {$k$}-means clustering},
journal = {Annals of Statistics},
year = 1981,
volume = 9,
pages = {135--140}
}
@book{p-vcbbs-89,
author = "G. Pisier",
title = "The Volume of Convex Bodies and Banach Space
Geometry",
year = 1989,
publisher = "Cambridge University Press",
series = "Tracts in Math.",
volume = 94,
}
@book{pa-cg-95,
keyent = {pa-cg-95},
author = "J. Pach and P. K. Agarwal",
title = "Combinatorial Geometry",
publisher = "John Wiley \& Sons",
year = 1995,
isbn = "0-471-58890-3",
url = {http://www.addall.com/Browse/Detail/0471588903.html}
}
@Unpublished{pach-pc-98,
keyent = {pach-pc-98},
author = {J. Pach},
title = {personal communication},
note = {personal communication},
year = 1998
}
@unpublished{pah-stesa-01,
keyent = {pah-stesa-01},
title = {{STAR-Tree}: An Efficient Self-Adjusting Index for
Moving Objects},
author = {C. M. Procopiuc and P. K. Agarwal and
S. {Har-Peled}},
year = 2001,
note = {manuscript}
}
@inproceedings{pah-stesa-02,
keyent = {pah-stesa-02},
author = "C.~M. Procopiuc and P. K. Agarwal and
S.~{Har-Peled}",
title = {{STAR-Tree}: An Efficient Self-Adjusting Index for
Moving Objects},
pages = "178--193",
booktitle = ALENEX_2002,
acceptrate = {44\%},
year = 2002,
editor = "D. M. Mount and C. Stein",
volume = 2409,
series = LNCS,
url = {http://sarielhp.org/research/papers/01/star_tree/}
}
@InProceedings{pb-stmss-00,
keyent = {pb-stmss-00},
author = {D. Piponi and G. Borshukov},
title = {Seamless Texture Mapping of Subdivision Surfaces by
Model Pelting and Texture Blending},
booktitle = SIGGRAPH_2000,
pages = {471--478},
year = 2000,
month = {August},
}
@article{pk-wins-00,
keyent = {pk-wins-00},
author = {G. Pottie and W. Kaiser},
title = {Wireless integrated network sensors},
journal = CACM,
volume = 43,
year = 2000,
pages = {51--58}
}
@inproceedings{pl-ecgvd-95,
keyent = {pl-ecgvd-95},
author = "E. Papadopoulou and D. T. Lee",
title = "Efficient computation of the geodesic {Voronoi}
diagram of points in a simple polygon",
booktitle = "Algorithms---ESA '95, Third Annual European
Symposium",
site = "Corfu, Greece",
series = LNCS,
volume = 979,
publisher = "Springer-Verlag",
year = 1995,
pages = "238--251",
issn = "3-540-60313-1"
}
@article{pp-carcd-90,
author = {M. Parizeau and R. Plamondon},
title = {A Comparative Analysis of Regional Correlation,
Dynamic Time Warping, and Skeletal Tree Matching for
Signature Verification},
journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
volume = 12,
number = 7,
year = 1990,
issn = {0162-8828},
pages = {710--717},
doi = {10.1109/34.56215},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@Unpublished{pps-aptg-02,
keyent = {pps-aptg-02},
author = {J.~Pach and R.~Pinchasi and M.~Sharir},
title = {Almost planar topological graphs},
note = {manuscript},
year = 2002
}
@book{ps-cgi-85,
keyent = {ps-cgi-85},
author = "F. P. Preparata and M. I. Shamos",
title = "Computational Geometry: An Introduction",
publisher = "Springer-Verlag",
year = 1985,
keywords = "book",
comments = "corrected and expanded second printing, 1988"
}
@article{ps-gs-89,
keyent = {ps-gs-89},
author = "D. Peleg and A. Sch{\"a}ffer",
title = "Graph spanners",
journal = "J. Graph Theory",
volume = 13,
year = 1989,
pages = "99--116"
}
@article{pt-cfc-03,
keyent = {pt-cfc-03},
author = "J. Pach and G. T{\' o}th",
title = "Conflict free colorings",
journal = DCG,
publisher = "Springer-Verlag",
address = "Berlin",
note = {to appear (The Goodman-Pollack festschrift.)},
year = 2003
}
@article{pt-eplcs-92,
keyent = {pt-eplcs-92},
author = "F. P. Preparata and R. Tamassia",
title = "Efficient point location in a convex spatial
cell-complex",
journal = SICOMP,
volume = 21,
year = 1992,
pages = "267--280"
}
@article{pv-tsvcpt-96,
keyent = {pv-tsvcpt-96},
author = "M. Pocchiola and G. Vegter",
title = "Topologically sweeping visibility complexes via
pseudo-triangulations",
journal = DCG,
volume = 16,
month = dec,
year = 1996,
pages = "419--453",
keywords = "topological sweep, visibility complex, visibility
graph, triangulation, pseudo-triangulation"
}
@article{pw-aqs-95,
keyent = {pw-aqs-95},
author = "D. Peleg and A. Wool",
title = "The Availability of Quorum Systems",
journal = "Information and Computation",
volume = 123,
number = 2,
pages = "210--223",
year = 1995,
url = "citeseer.nj.nec.com/peleg93availability.html"
}
@article{r-ac-79,
keyent = {r-ac-79},
author = "T. J. Rivlin",
title = "Approximating by circles",
journal = "Computing",
volume = 21,
year = 1979,
pages = "93--104"
}
@TechReport{r-cfdps-05,
author = {G. Rote},
title = {Computing the {\Frechet{}} distance between
piecewise smooth curves},
year = 2005,
month = {May},
number = {ECG-TR-241108-01},
pages = 13,
institution = {Freie Universitat, Berlin},
note = {To appear in Comput. Geom. Theory Appl.}
}
@mastersthesis{r-cstst-99,
keyent = {r-cstst-99},
author = "A. Rabinovich",
title = "Computing the Shortest Translation Separating Two
Convex Polytopes in {$\Re^{3}$}",
type = "{M. S.} Thesis",
school = "Dept. Computer Science, Tel Aviv University",
address = "Tel Aviv, Israel",
year = 1999,
keywords = "master thesis"
}
@inproceedings{r-dadsl-00,
keyent = {r-dadsl-00},
author = {E. Ramos},
title = {Deterministic algorithms for {$3$}-D dimaeter and some
$2$-D lower envelopes},
booktitle = SOCG_2000,
pages = "290--299",
year = 2000,
}
@incollection{r-ipbm-97,
keyent = {r-ipbm-97},
author = "P. J. Rousseeuw",
title = "Introduction to positive breakdown methods",
editor = "G. S. Maddala and C. R. Rao",
booktitle = "Handbook of Statistics, Vol 15: Robust Inference",
publisher = "Elsevier",
year = 1997,
pages = "101--121"
}
@article{r-iubdp-97,
keyent = {r-iubdp-97},
author = "E. Ramos",
title = "Intersection of unit-balls and diameter of a point
set in {$R^3$}",
journal = CGTA,
volume = 8,
year = 1997,
pages = "57--65"
}
@inproceedings{r-mfdg-93,
keyent = {r-mfdg-93},
author = "Jean-Pierre Reveilles",
title = "Mathematical foundations of Discrete Geometry",
booktitle = "Proc. 9th European Workshop Comput. Geom. (CG '93)",
year = 1993
}
@book{r-mhtcp-93,
keyent = {r-mhtcp-93},
author = "C. R. Reeves",
title = "Modern Heuristic Techniques for Combinatorial
Problems",
publisher = "Halsted Press",
address = "New York",
year = 1993
}
@article{r-msr-84,
keyent = {r-msr-84},
author = "P. J. Rousseeuw",
title = "Least median of squares regression",
journal = "J. Amer. Statist. Assoc.",
volume = 79,
number = 388,
month = dec,
year = 1984,
pages = "871--880"
}
@INPROCEEDINGS{r-nsaqt-93,
keyent = {r-nsaqt-93},
AUTHOR = "J. Ruppert",
TITLE = "A new and simple algorithm for quality 2-dimensional
mesh generation",
BOOKTITLE = SODA_1993,
YEAR = 1993,
PAGES = "83--92"
}
@incollection{r-pa-76,
keyent = {r-pa-76},
author = "M. O. Rabin",
title = "Probabilistic algorithms",
booktitle = "Algorithms and Complexity: New Directions and Recent
Results",
editor = "J. F. Traub",
publisher = "Academic Press",
year = 1976,
pages = "21--39",
address = {Orlando, FL, USA}
}
@article{r-slcdn-70,
keyent = {r-slcdn-70},
author = "H. Raynaud",
title = "Sur l'enveloppe convex des nuages de points
aleatoires dans {$R^{n}$}",
journal = "J. Appl. Probab.",
volume = 7,
year = 1970,
pages = "35--48",
annote = 163
}
@unpublished{r-ssrnl-01,
keyent = {r-ssrnl-01},
title = {Smooth surface reconstruction in near linear time},
author = {E. Ramos},
year = 2001,
note = {manuscript}
}
@book{r-wcpp-01,
keyent = {r-wcpp-01},
author = {T. Rappaport},
title = {Wireless Communications: Principles and Practice},
year = 2001,
isbn = 0130422320,
publisher = {Prentice Hall PTR}
}
@Article{rl-dsspd-85,
keyent = {rl-dsspd-85},
author = {N. Roussopoulos and D. Leifker},
title = {Direct spatial search on pictorial databases using
packed {R}-trees},
journal = {Proc.\ ACM SIGACT-SIGMOD Conf.\ Principles Database
Systems},
pages = {17--31},
year = 1985
}
@inproceedings{rl-qmprs-00,
keyent = {rl-qmprs-00},
author = "S. Rusinkiewicz and M. Levoy",
title = "{QS}plat: {A} Multiresolution Point Rendering System
for Large Meshes",
booktitle = SIGGRAPH_2000,
publisher = "ACM Press / ACM SIGGRAPH / Addison Wesley Longman",
editor = "Kurt Akeley",
pages = "343--352",
year = 2000
}
@book{rl-rrod-87,
keyent = {rl-rrod-87},
author = "P. J. Rousseeuw and A. M. Leroy",
title = "Robust Regression and Outlier Detection",
publisher = "John Wiley \& Sons",
address = "New York",
year = 1987
}
@article{rlw-rdtrp-91,
keyent = {rlw-rdtrp-91},
author = "U. Roy and C. R. Liu and T. C. Woo",
title = "Review of dimensioning and tolerancing:
{Representation} and processing",
journal = "Comput. Aided Design",
volume = 23,
number = 7,
year = 1991,
pages = "466--483"
}
@inproceedings{rrzm-sgtdr-87,
keyent = {rrzm-sgtdr-87},
author = "R. F. Richbourg and N. C. Rowe and M. J. Zyda and
R. McGhee",
title = "Solving Global Two-Dimensional Routing Problems
Using {Snell's} law",
booktitle = "Proc. IEEE Internat. Conf. Robot. Autom.",
site = "Raleigh, NC",
year = 1987,
pages = "1631--1636"
}
@inproceedings{rs-iassb-98,
keyent = {rs-iassb-98},
author = "S. Rao and W. D. Smith",
title = "Improved approximation schemes for geometric graphs
via ``spanners'' and ``banyans''",
booktitle = STOC_1998,
year = 1998,
pages = {540--550}
}
@article{rs-seubf-94,
keyent = {rs-seubf-94},
author = "J. H. Reif and J. A. Storer",
title = "A single-exponential upper bound for finding
shortest paths in three dimensions",
journal = JACM,
volume = 41,
number = 5,
year = 1994,
pages = "1013--1019",
}
@article{rs-udkhv-63,
keyent = {rs-udkhv-63},
author = "A. R{\'e}nyi and R. Sulanke",
title = "{\"U}ber die konvexe {H{\"u}lle} von {$n$}
zuf{\"a}llig gerw{\"a}hten {Punkten} {I}",
journal = "Z. Wahrsch. Verw. Gebiete",
volume = 2,
year = 1963,
pages = "75--84"
}
@Unpublished{rvw-mapca-04-old,
keyent = {rvw-mapca-04},
author = {L. Rademacher and S. Vempala and G. Wang},
title = {Matrix approximation and projective clustering via
adaptive sampling},
note = {manuscript},
year = 2004
}
@inproceedings{rw-cgro-88,
keyent = {rw-cgro-88},
author = "G. J. E. Rawlins and D. Wood",
title = "Computational geometry with restricted orientations",
booktitle = "Proc. 13th IFIP Conf. System Modelling and
Optimization",
series = "Lecture Notes in Control and Information Science",
volume = 113,
publisher = "Springer-Verlag",
year = 1988,
pages = "375--384"
}
@article{rw-ocfoc-87,
keyent = {rw-ocfoc-87},
author = "G. J. E. Rawlins and D. Wood",
title = "Optimal computation of finitely oriented convex
hulls",
journal = "Inform. Comput.",
volume = 72,
year = 1987,
pages = "150--166"
}
@article{rz-epccm-92,
keyent = {rz-epccm-92},
author = "U. Roy and X. Zhang",
title = "Establishment of a pair of concentric circles with
the minimum radial separation for assessing
roundness error",
journal = "Comput. Aided Design",
volume = 24,
number = 3,
year = 1992,
pages = "161--168"
}
@incollection{s-barga-93,
keyent = {s-barga-93},
author = "R. Seidel",
title = "Backwards Analysis of Randomized Geometric
Algorithms",
editor = "J. Pach",
booktitle = "New Trends in Discrete and Computational Geometry",
series = "Algorithms and Combinatorics",
volume = 10,
publisher = "Springer-Verlag",
year = 1993,
pages = "37--68",
keywords = "survey paper, randomized algorithms, backwards
analysis, Delaunay triangulation, segment
intersection, convex hull, quicksort, linear
programming"
}
@inproceedings{s-capnc-00,
keyent = {s-capnc-00},
author = "I. Streinu",
title = "A combinatorial approach to planar non-colliding
robot arm motion planning",
booktitle = FOCS_2002,
nickname = "FOCS 2000",
site = "Redondo Beach, California",
publisher = "IEEE",
month = nov,
year = 2000,
note = "443--453"
}
@inproceedings{s-ccrs-98,
keyent = {s-ccrs-98},
author = "A. Solan",
title = {Cutting cycles of rods in space},
booktitle = SOCG_1998,
year = 1998,
pages = {135--142}
}
@book{s-cope-04,
author = {A. Schrijver},
isbn = 3540204563,
keywords = {algorithm combinatorial-optimization},
month = {July},
publisher = {Springer},
title = {Combinatorial Optimization : Polyhedra and
Efficiency (Algorithms and Combinatorics)},
year = 2004
}
@PHDTHESIS{s-cpcg-02,
keyent = {s-cpcg-02},
author = {S. Smorodinsky},
title = {Combinatorial Problems in Computational Geometry},
school = {Tel-Aviv University},
year = 2002,
note = {in preperation},
}
@PhdThesis{s-cpcg-03,
keyent = {s-cpcg-03},
author = {S. Smorodinsky},
title = {Combinatorial Problems in Computational Geometry},
school = {School of Computer Science},
year = 2003,
url =
{http://www.math.tau.ac.il/~shakhar/my_papers/phd.ps.gz}
}
@Unpublished{s-cpcg-03-old,
keyent = {s-cpcg-03-old},
author = {S. Smorodinsky},
title = {Combinatorial Problems in Computational Geometry},
note = {Ph.D dissertation, Tel-Aviv University},
year = 2003
}
@InCollection{s-cppcg-00,
keyent = {s-cppcg-00},
author = {M. Smid},
title = {Closest-Point Problems in computational geometry},
editor = "J.-R. Sack and J. Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier",
year = 2000,
pages = {877--935},
address = {Amsterdam, The Netherlands},
}
@article{s-cstre-01,
keyent = {s-cstre-01},
author = "M. Sharir",
title = "The {Clarkson-Shor} Technique Revisited and
Extended",
journal = {Comb., Prob. \& Comput.},
volume = 12,
number = 2,
year = 2003,
pages = {191--201}
}
@misc{s-date-04,
keyent = {s-date-04},
title = "Distributed Approached to Triangulation and
Embedding",
author = "A. Slivkins",
year = 2004,
url =
"http://www.cs.cornell.edu/people/slivkins/embed_frames.ps",
}
@inproceedings{s-date-05,
title = "Distributed Approaches to Triangulation and
Embedding",
author = "A. Slivkins",
year = 2005,
url =
"http://www.cs.cornell.edu/people/slivkins/embed_frames.ps",
booktitle = SODA_2005,
}
@inproceedings{s-der-91,
keyent = {s-der-91},
author = "A. Saalfeld",
title = "{Delaunay} edge refinements",
booktitle = CCCG_1991,
year = 1991,
pages = "33--36"
}
@PhdThesis{s-drmg-97,
keyent = {s-drmg-97},
author = {J.~R. Shewchuk},
title = {{Delaunay} Refinement Mesh Generation},
school = {Carnegie Mellon University},
year = 1997,
url =
{http://www.cs.cmu.edu/~quake-papers/delaunay-refinement.ps.gz}
}
@inproceedings{s-iaalm-06,
author = {T. Sarlos},
title = {Improved Approximation Algorithms for Large Matrices
via Random Projections},
booktitle = FOCS_2006,
year = 2006,
pages = {143--152},
doi = {10.1109/FOCS.2006.37}
}
@book{s-iig-53,
author = "L. Santalo",
title = "Introduction to Integral Geometry",
publisher = "Paris, Hermann",
year = 1953,
}
@Article{s-jalsr-94,
keyent = {s-jalsr-94},
author = {M. Sharir},
title = {On Joints in Arrangements of Lines in Space and
Related Problems},
journal = {J. Comb. Theo.},
year = 1994,
volume = 67,
number = 1,
pages = {89--99},
annote = 225
}
@article{s-ksacs-91,
keyent = {s-ksacs-91},
author = "M. Sharir",
title = "On {$k$}-sets in arrangements of curves and surfaces",
journal = DCG,
volume = 6,
year = 1991,
pages = "593--613"
}
@Misc{s-lmvii-04,
keyent = {s-lmvii-04},
author = {B. Sadri},
title = {Lloyd's method and variants implementation together
with inputs},
year = 2004,
note = {\urlSarielPaper{03/lloyd\_kmeans}}
}
@phdthesis{s-mlppr-87,
author = {S. Suri},
title = {Minimum link paths in polygons and related problems},
school = {Dept. Comput. Sci., Johns Hopkins Univ.},
year = 1987,
address = {Baltimore, MD}
}
@article{s-nhlpg-96,
keyent = {s-nhlpg-96},
AUTHOR = {S. Semmes},
TITLE = {On the nonexistence of bi-{L}ipschitz
parameterizations and geometric problems about
{$A\sb \infty$}-weights},
JOURNAL = {Rev. Mat. Iberoamericana},
FJOURNAL = {Revista Matem\'atica Iberoamericana},
VOLUME = 12,
YEAR = 1996,
NUMBER = 2,
PAGES = {337--410},
ISSN = {0213-2230},
MRCLASS = {30C65 (42B20)},
MRNUMBER = {97e:30040},
MRREVIEWER = {Guy David},
}
@article{s-nlap2-97,
keyent = {s-nlap2-97},
author = "M. Sharir",
title = "A Near-Linear Algorithm for the Planar {$2$}-Center
Problem",
journal = DCG,
volume = 18,
year = 1997,
pages = "125--134"
}
@book{s-opgfg-91,
author = "J. Stolfi",
title = "Oriented Projective Geometry: A Framework for
Geometric Computations",
publisher = "Academic Press",
year = 1991,
keywords = "oriented projective geometry, duality, convexity,
Pl{\"u}cker coordinates"
}
@incollection{s-ri-98,
keyent = {s-ri-98},
author = "S. Schirra",
title = "Robustness Issuess",
editor = "J.-R. Sack and J. Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier",
year = 1999,
note = {to appear}
}
@article{s-rrag-92,
keyent = {s-rrag-92},
author = "T. C. Shermer",
title = "Recent Results in Art Galleries",
journal = "Proc. IEEE",
volume = 80,
number = 9,
month = sep,
year = 1992,
pages = "1384--1399"
}
@book{s-sdsqo-89,
keyent = {s-sdsqo-89},
author = "H. Samet",
title = "Spatial Data Structures: Quadtrees, Octrees, and
Other Hierarchical Methods",
publisher = "Addison-Wesley",
year = 1989
}
@book{s-sfc-94,
author = "H. Sagan",
title = "Space-Filling Curves",
publisher = "Springer-Verlag",
year = 1994
}
@article{s-sfira-91,
keyent = {s-sfira-91},
author = "R. Seidel",
title = "A simple and fast incremental randomized algorithm
for computing trapezoidal decompositions and for
triangulating polygons",
journal = CGTA,
volume = 1,
year = 1991,
pages = "51--64"
}
@article{s-sldps-90,
author = "S. Suri",
title = "On Some Link Distance Problems in a Simple Polygon",
journal = "IEEE Trans. Robot. Autom.",
volume = 6,
year = 1990,
pages = "108--113"
}
@article{s-spacp-87,
keyent = {s-spacp-87},
author = "M. Sharir",
title = "On shortest paths amidst convex polyhedra",
journal = SICOMP,
volume = 16,
year = 1987,
pages = "561--572",
keywords = "shortest paths, polyhedra, convex,
Davenport-Schinzel sequences, {Voronoi} diagrams",
}
@Book{sa-dsstg-95,
keyent = {sa-dsstg-95},
author = {M. Sharir and P. K. Agarwal},
title = {{Davenport-Schinzel} Sequences and Their Geometric
Applications},
year = 1995,
publisher = {Cambridge University Press},
address = {New York},
url =
{http://us.cambridge.org/titles/catalogue.asp?isbn=0521470250}
}
@article{sa-rst-96,
keyent = {sa-rst-96},
author = "R. Seidel and C. R. Aragon",
title = "Randomized search trees",
journal = "Algorithmica",
volume = 16,
year = 1996,
pages = "464--497"
}
@InProceedings{sa-umpsp-01,
keyent = {sa-umpsp-01},
author = {G. Song and N. M. Amato},
title = {Using motion planning to study protein folding
pathways},
booktitle = {RECOMB 2001},
pages = {287--296},
year = 2001,
annote = {biology}
}
@inproceedings{se-tg-03,
keyent = {se-tg-03},
author = "J. Smith and W. Evans",
title = "Triangle Guarding",
booktitle = CCCG_2003,
site = "Halifax",
year = 2003,
pages = "76--80"
}
@article{seo-pcfdr-03,
keyent = {seo-pcfdr-03},
author = "M. Soss and J. Erickson and M. Overmars",
title = "Preprocessing chains for fast dihedral rotations is
hard or even impossible",
journal = CGTA,
year = 2003,
volume = 26,
number = 3,
pages = {235--246}
}
@book{sf-afem-73,
author = "G. Strang and G. Fix",
title = "An Alaysis of the Finite Element Method",
publisher = "Prentice Hall",
address = "Englewood Cliffs, NJ",
year = 1973
}
@article{sg-cmcpt-01,
author = "V. Surazhsky and C. Gotsman",
title = {Controllable morphing of compatible planar
triangulations},
journal = {ACM Trans. Graph.},
volume = 20,
number = 4,
year = 2001,
pages = {203--231}
}
@Unpublished{sg-easmm-01,
keyent = {sg-easmm-01},
author = {E. Shaffer and M. Garland},
title = {Efficient adaptive simplification of massive meshes},
note = {manuscript},
year = 2001
}
@inproceedings{sg-msfuo-01,
author = {V. Surazhsky and C. Gotsman},
title = {Morphing Stick Figures Using Optimized Compatible
Triangulations},
booktitle = {PG '01: Proceedings of the 9th Pacific Conference on
Computer Graphics and Applications},
year = 2001,
pages = 40
}
@article{sg-pba2d-92,
author = "T. Sederberg and E. Greenwood",
title = "A physically based approach to {$2$}-d shape blending",
journal = "Comput. Graph.",
volume = 26,
year = 1992,
pages = "25--34",
note = SIGGRAPH_1992
}
@article{sgwm-2dsbi-93,
author = "T. Sederberg and P. Gao and G. Wang and H. Mu",
title = "$2$-d shape blending: an intrinsic solution to the
vertex path problem",
journal = "Comput Graph.",
volume = 27,
year = 1993,
pages = "15--18",
note = SIGGRAPH_1993
}
@Misc{sharecam-web-02,
keyent = {sharecam-web-02},
title = {http://tele-actor.net/sharecam},
url = {http://tele-actor.net/sharecam},
key = {ShareCam},
year = 2002
}
@inproceedings{sj-wrspp-95,
keyent = {sj-wrspp-95},
author = "M. Smid and R. Janardan",
title = "On the Width and Roundness of a Set of Points in the
Plane",
booktitle = CCCG_1995,
year = 1995,
pages = "193--198"
}
@article{sj-wrspp-99x,
keyent = {sj-wrspp-99x},
author = "M. Smid and R. Janardan",
title = "On the Width and Roundness of a Set of Points in the
Plane",
journal = IJCGA,
year = 1999,
pages = "97--108",
volume = 9,
number = 1,
url =
{http://www.worldscinet.com/ijcga/09/0901/S021819599900008X.html}
}
@InProceedings{sjll-ipcmp-00,
keyent = {sjll-ipcmp-00},
author = {S. Saltenis and C. S. Jensen and S. Leutenegger and
M. Lopez},
title = {Indexing the Positions of Continuously Moving
Objects},
booktitle = "ACM SIGMOD Int.\ Conf.\ on Manag.\ of Data",
pages = {331--342},
year = 2000,
url =
{http://www.cs.auc.dk/research/DP/tdb/TimeCenter/TimeCenterPublications/TR-44.ps.gz}
}
@article{slw-oardc-95,
keyent = {slw-oardc-95},
author = "K. Swanson and D. T. Lee and V. L. Wu",
title = "An optimal algorithm for roundness determination on
convex polygons",
journal = CGTA,
volume = 5,
year = 1995,
pages = "225--235"
}
@TechReport{sp-sqblu-99,
keyent = {sp-sqblu-99},
author = {I.~Stojmenovic and P.~E.~V.~Pena},
title = {A scalable quorum based location update scheme for
routing in ad hoc wireless networks},
institution = {Computer Science, SITE, University of Ottawa},
year = 1999,
month = {December},
note = {TR-99-11}
}
@article{spp-fm-76,
author = {A. Sch{\"o}nhage and M. Paterson and N. Pippenger},
title = {Finding the Median},
journal = JCSS,
volume = 13,
number = 2,
year = 1976,
pages = {184--199}
}
@article{sr-sbuss-95,
author = "M. Shapira and A. Rappoport",
title = "Shape Blending Using the Star-Skeleton
Representation",
journal = "IEEE Comput. Graph. Appl.",
volume = 15,
number = 2,
month = mar,
year = 1995,
pages = "44--50",
}
@inproceedings{srf-rtdim-87,
keyent = {srf-rtdim-87},
author = "T. Sellis and N. Roussopoulos and C. Faloutsos",
title = "The {$\rm R^+$}-tree: {A} dynamic index for
multi-dimensional objects",
booktitle = "Proc. 13th VLDB Conference",
year = 1987,
pages = "507--517"
}
@article{ss-spps-86,
keyent = {ss-spps-86},
author = "M. Sharir and A. Schorr",
title = "On shortest paths in polyhedral spaces",
journal = SICOMP,
volume = 15,
year = 1986,
pages = "193--215",
keywords = "shortest paths, three-dimensional, polyhedra"
}
@InProceedings{ssg-edacc-02,
keyent = {ssg-edacc-02},
author = {D.~Song and A. F. van~der Stappen and K.~Goldberg},
title = {Exact and distributed algorithms for collaborative
camera control},
booktitle = WAFR_2002,
year = 2002,
url =
{http://www.ieor.berkeley.edu/~dzsong/pdfs/dez-sharecam-wafr2002-v24.pdf}
}
@inproceedings{sss-irnns-02,
keyent = {sss-irnns-02},
author = {Y.~Sabharwal and N.~Sharma and S.~Sen},
title = {Improved reductions of nearest neighbors search to
PLEBs with applications to linear-sized approximate
{Voronoi} decopositions},
year = 2002,
pages = {311--323},
booktitle = FSTTCS_2002
}
@article{st-pplup-86,
keyent = {st-pplup-86},
author = "N. Sarnak and R. E. Tarjan",
title = "Planar point location using persistent search trees",
journal = "Commun. ACM",
volume = 29,
number = 7,
month = jul,
year = 1986,
pages = "669--679"
}
@INPROCEEDINGS{stu-pdraa-02,
keyent = {stu-pdraa-02},
AUTHOR = {D. A. Spielman and S.-H. Teng and A. {\"U}ng{\"o}r},
TITLE = "Parallel {Delaunay} refinement: Algorithms and
Analyses",
BOOKTITLE = MRT_2002,
YEAR = 2002,
PAGES = "205--217"
}
@INPROCEEDINGS{stu-tcppspia-04,
keyent = {stu-tcppspia-04},
AUTHOR = {D. A. Spielman and S.-H. Teng and A. {\"U}ng{\"o}r},
TITLE = "Time Complexity of Practical Parallel {Steiner}
Point Insertion Algorithms",
BOOKTITLE = SPAA_2004,
YEAR = 2004,
PAGES = "267--268"
}
@Book{sw-nr-89,
author = {G.A.F. Seber and C.J. Wild},
title = {Nonlinear {R}egression},
publisher = {John Wiley \& Sons},
year = 1989
}
@inproceedings{swcd-mqmo-97,
keyent = {swcd-mqmo-97},
author = "A. P. Sistla and O. Wolfson and S. Chamberlain and
S. Dao",
title = "Modeling and querying moving objects",
booktitle = "Proc. Intl Conf. Data Engineering",
year = 1997,
pages = "422--432"
}
@article{swy-vsmai-75,
keyent = {swy-vsmai-75},
author = "G. Salton and A. Wong and C. S. Yang",
title = "A Vector Space Model for Automatic Indexing",
journal = CACM,
year = 1975,
volume = 18,
pages = "613--620"
}
@inproceedings{sy-pncrr-95,
keyent = {sy-pncrr-95},
author = "T. C. Shermer and C. K. Yap",
title = "Probing for near centers and relative roundness",
booktitle = "Proc. ASME Workshop on Tolerancing and Metrology",
year = 1995
}
@article{sy-smipr-92,
author = "I. Suzuki and M. Yamashita",
title = "Searching for a mobile intruder in a polygonal
region",
journal = SICOMP,
volume = 21,
year = 1992,
pages = "863--888"
}
@inproceedings{t-beald-04,
keyent = {t-beald-04},
author = {K. Talwar},
title = {Bypassing the embedding: algorithms for low
dimensional metrics},
booktitle = STOC_2004,
year = 2004,
pages = {281--290},
location = {Chicago, IL, USA},
doi = {10.1145/1007352.1007399}
}
@article{t-grt-66,
keyent = {t-grt-66},
author = "H. Tverberg",
title = "A generalization of {Radon}'s theorem",
journal = "J. London Math. Soc.",
volume = 41,
year = 1966,
pages = "123--128",
update = "97.11 bibrelex"
}
@article{t-grtii-81,
keyent = {t-grtii-81},
author = "H. Tverberg",
title = "A generalization of {Radon}'s theorem {II}",
journal = "Bull. Australian Math. Soc.",
volume = 24,
year = 1981,
pages = "321--325"
}
@article{t-nbpp-03,
author = {C. D. T{\'o}th},
title = {A Note on Binary Plane Partitions},
journal = DCG,
volume = 30,
number = 1,
year = 2003,
pages = {3--16}
}
@inproceedings{t-nbpp-01-old,
author = {C. D. T'oth},
title = {A note on binary plane partitions},
booktitle = SOCG_2001,
year = 2001,
isbn = {1-58113-357-X},
pages = {151--156},
location = {Medford, Massachusetts, United States},
doi = {10.1145/378583.378652}
}
@Unpublished{t-psmks-99-pre-conf,
keyent = {t-psmks-99-pre-conf},
author = {G. T{\'o}th},
title = {Point sets with many {$k$}-sets},
note = {Monte Verita Conference on Discrete and
Computational Geometry},
year = 1999
}
@phdthesis{t-pssug-90,
keyent = {t-pssug-90},
author = "S. H. Teng",
title = "Points, Spheres, and Separators: a unified geometric
approach to graph partitioning",
school = "School Comp. Sci., Carnegie-Mellon Univ.",
year = 1990,
note = "Report CMU-CS-91-184",
keywords = "doctoral thesis",
update = "97.11 bibrelex"
}
@inproceedings{t-pswmk-00-conf,
keyent = {t-pswmk-00-conf},
author = {G. T{\'o}th},
title = {Point sets with many {$k$}-sets},
year = 2000,
booktitle = SOCG_2000,
pages = "37--42",
year = 2000,
}
@unpublished{t-rklap-99,
keyent = {t-rklap-99},
author = "T. M. Chan",
title = "Remarks on {$k$}-level algorithms in the plane",
year = 1999,
note = {manuscript. {\tt
http://www}\hspace{0.001cm}{\tt.cs.uwaterloo.ca/}\hspace{0.001cm}{\tt{}{}{}{}{}{}{}\protect\raisebox{-0.1cm}{\symbol{'176}}}\hspace{0.001cm}{\tt{tmchan/pub.html}}}
}
@inproceedings{t-sgprc-83,
keyent = {t-sgprc-83},
author = "G. T. Toussaint",
title = "Solving geometric problems with the rotating
calipers",
booktitle = "Proc. IEEE MELECON '83",
site = "Athens, Greece",
year = 1983,
pages = "A10.02/1--4"
}
@article{t-spmcc-85,
author = {\'E. Tardos},
title = {A strongly polynomial minimum cost circulation
algorithm},
journal = {Combinatorica},
volume = 5,
number = 3,
year = 1985,
issn = {0209-9683},
pages = {247--255},
publisher = {Springer},
}
@inproceedings{t-ssps-00,
author = {X. Tan},
title = {Searching a Simple Polygon by a {$k$}-Searcher},
booktitle = ISAAC_2000,
year = 2000,
pages = {503--514}
}
@inproceedings{tb-stvif-99,
author = {G. Turk and J. F. O'Brien},
title = {Shape transformation using variational implicit
functions},
booktitle = {SIGGRAPH '99: Proceedings of the 26th annual
conference on Computer graphics and interactive
techniques},
year = 1999,
pages = {335--342}
}
@inproceedings{thi-splia-90,
keyent = {thi-splia-90},
author = "X.-H. Tan and T. Hirata and Y. Inagaki",
title = "Spatial point location and its applications",
booktitle = "Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms",
series = LNCS,
volume = 450,
publisher = "Springer-Verlag",
year = 1990,
pages = "241--250"
}
@article{thl-tgwsp-98,
author = "L. H. Tseng and P. Heffernan and D. T. Lee",
title = "Two-Guard Walkability of Simple Polygons",
journal = IJCGA,
volume = 8,
number = 1,
year = 1998,
pages = "85--116",
url = "http://www.ece.nwu.edu/~dtlee/IJCGA_twoguard.ps.Z"
}
@InProceedings{tpk-mdptd-01,
keyent = {tpk-mdptd-01},
author = {M. L. Teodoro and G. N. Phillips and L. E. Kavraki},
title = {Molecular Docking: A Problem with Thousands of
Degrees of Freedom},
booktitle = ICRA_2001,
year = 2001,
address = {Seoul, Korea}
}
@inproceedings{tt-cpgpl-97,
keyent = {tt-cpgpl-97},
author = "H. Tamaki and T. Tokuyama",
title = "A Characterization of Planar Graphs by Pseudo-Line
Arrangements",
booktitle = ISAAC_1997,
nickname = "ISAAC '97",
site = "Singapore",
series = LNCS,
volume = 1350,
publisher = "Springer-Verlag",
year = 1997,
pages = "123--132",
annote = 210
}
@article{tt-hcpps-98,
keyent = {tt-hcpps-98},
author = "H. Tamaki and T. Tokuyama",
title = "How to Cut Pseudo-Parabolas into Segments",
journal = DCG,
volume = 19,
year = 1998,
pages = "265--290"
}
@book{tv-vrp-02,
title = {The vehicle routing problem},
publisher = {{SIAM} Monographs on Discrete Mathematics and
Applications},
editor = {P. Toth and D. Vigo},
year = 2002
}
@inproceedings{tz-ado-01-conf,
keyent = {tz-ado-01},
author = {M. Thorup and U. Zwick},
title = {Approximate distance oracles},
booktitle = STOC_2001,
year = 2001,
isbn = {1-58113-349-9},
pages = {183--192},
location = {Hersonissos, Greece},
doi = {10.1145/380752.380798}
}
@incollection{u-agip-00,
keyent = {u-agip-00},
author = "J. Urrutia",
title = "Art Gallery and Illumination Problems",
editor = "J. Sack and J. Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "North-Holland",
year = 2000,
pages = "973--1027",
url =
{http://www.site.uottawa.ca/~jorge/online_papers/Art-Galleries.ps}
}
@article{u-ocnts-09,
author = {A. {\"U}ng{\"o}r},
title = {Off-centers: A new type of {Steiner} points for
computing size-optimal quality-guaranteed {Delaunay}
triangulations},
journal = CGTA,
volume = 42,
number = 2,
year = 2009,
pages = {109--118}
}
@InProceedings{u-ocnts-04-conf,
key = {Ung},
keyent = {u-ocnts-04},
author = {A.~{\"U}ng{\"o}r},
title = {Off-centers: A new type of {Steiner} points for
computing size-optimal quality-guaranteed {Delaunay}
triangulations},
booktitle = LATIN_2004,
note = {See also \cite{u-ocnts-09}},
pages = {152--161},
year = 2004
}
@Article{v-cbseb-05,
author = {J.-L. {Verger-Gaugry}},
title = {Covering a Ball with Smaller Equal Balls in
{$\Re^n$}},
volume = 33,
number = 1,
year = 2005,
pages = {143--155},
journal = DCG,
doi = "10.1007/s00454-004-2916-2"
}
@Article{v-ggwnp-98,
keyent = {v-ggwnp-98},
author = {P. Valtr},
title = {Guarding Galleries where no point sees a small area},
journal = {Israel J. Math},
year = 1998,
volume = 104,
pages = {1--16}
}
@Book{v-lpfe-97,
keyent = {v-lpfe-97},
author = {R. J. Vanderbei},
title = {Linear programming: Foundations and extensions},
publisher = {Kluwer},
year = 1997
}
@book{v-nslt-96,
keyent = {v-nslt-96},
author = "V. Vapnik",
title = "The Nature of Statistical Learning Theory",
publisher = "Springer-Verlag",
address = "New York",
year = 1996
}
@inproceedings{v-oaann-86,
keyent = {v-oaann-86},
author = "P. M. Vaidya",
title = "An optimal algorithm for the all-nearest-neighbors
problem",
booktitle = FOCS_1986,
year = 1986,
pages = "117--122"
}
@article{v-oaann-89,
keyent = {v-oaann-89},
author = "P. M. Vaidya",
title = "An {$O(n \log n)$} algorithm for the
all-nearest-neighbors problem",
journal = DCG,
volume = 4,
year = 1989,
pages = "101--115"
}
@book{v-rpm-04,
author = "S. Vempala",
title = "The Random Projection Method",
volume = 65,
series = "Discret. Math. and Theoret. Comput. Sci.",
publisher = AMS,
year = 2004,
}
@book{v-slt-98,
keyent = {v-slt-98},
author = "V. Vapnik",
title = "Statistical Learning Theory",
publisher = "Springer",
year = 1998
}
@inproceedings{va-aabnb-99,
keyent = {va-aabnb-99},
author = "K. R. Varadarajan and P. K. Agarwal",
title = "Approximation algorithms for bipartite and
non-bipartite matching in the plane",
booktitle = SODA_1999,
year = 1999,
pages = "805--814"
}
@inproceedings{va-aspnp-97,
keyent = {va-aspnp-97},
author = "K. R. Varadarajan and P. K. Agarwal",
title = "Approximating Shortest Paths on an Nonconvex
Polyhedron",
booktitle = FOCS_1997,
nickname = "FOCS '97",
year = 1997,
pages = "To appear"
}
@Unpublished{va-aspp-96-old-old,
keyent = {va-aspp-96-old-old},
author = {K. R. Varadarajan and P. K. Agarwal},
title = {Approximating Shortest Paths on a Polyhedron},
note = {manuscript},
year = 1996
}
@InProceedings{va-aspp-97,
keyent = {va-aspp-97},
title = {Approximating shortest paths on a nonconvex
polyhedron},
year = 1997,
author = {K. R. Varadarajan and P. K. Agarwal},
booktitle = FOCS_1997,
pages = {182--191}
}
@article{vc-ucrfe-71,
keyent = {vc-ucrfe-71},
author = "V. N. Vapnik and A. Y. Chervonenkis",
title = "On the uniform convergence of relative frequencies
of events to their probabilities",
journal = "Theory Probab. Appl.",
volume = 16,
year = 1971,
pages = "264--280"
}
@InProceedings{vh-ssmpc-00,
keyent = {vh-ssmpc-00},
author = {R.~C. Veltkamp and M.~Hagedoorn},
title = {Shape similarity measures, properties, and
constructions},
booktitle = VISUAL_2000,
pages = {467--476},
year = 2000,
volume = 1929,
series = LNCS,
publisher = {Springer},
url =
{http://www.cs.uu.nl/research/techreps/UU-CS-2000-37.html}
}
@article {vk-omdc-87,
keyent = {vk-omdc-87},
AUTHOR = {Vol$'$berg, A. L. and Konyagin, S. V.},
TITLE = {On measures with the doubling condition},
JOURNAL = {Izv. Akad. Nauk SSSR Ser. Mat.},
FJOURNAL = {Izvestiya Akademii Nauk SSSR. Seriya
Matematicheskaya},
VOLUME = 51,
YEAR = 1987,
NUMBER = 3,
PAGES = {666--675},
ISSN = {0373-2436},
MRCLASS = {28A12 (28A75 54E45 54F45)},
MRNUMBER = {88i:28006},
MRREVIEWER = {M. P. Er{\v{s}}ov},
}
@InProceedings{vkkr-ascp-03,
keyent = {vkkr-ascp-03},
author = {W. F. de la Vega and M. Karpinski and C. Kenyon and
Y. Rabani},
title = {Approximation schemes for clustering problems},
booktitle = STOC_2003,
pages = {50--58},
year = 2003,
url =
{http://citeseer.nj.nec.com/delavega03approximation.html}
}
@InProceedings{vl-oslos-02,
keyent = {vl-oslos-02},
author = {E. C. de Verdiere and F.~Lazarus},
title = {Optimal System of Loops on an Orientable Surface},
booktitle = FOCS_2002,
year = 2002,
pages = {627--636}
}
@article{vs-flcas-88,
keyent = {vs-flcas-88},
author = "U. Vishkin and B. Schieber",
title = "On Finding Lowest Common Ancestors: Simplification
and Parallelization",
journal = SICOMP,
pages = "1253--1262",
year = 1988,
volume = 17
}
@InProceedings{vvz-arpsh-02,
keyent = {vvz-arpsh-02},
author = {K. R. Varadarajan and S.~Venkatesh and J.~Zhang},
title = {Approximating the radii of point sets in high
dimensions},
booktitle = FOCS_2002,
note = {to appear},
year = 2002,
url = {http://www.cs.uiowa.edu/~kvaradar/paps/venkat.ps}
}
@inproceedings{vy-cccs-90,
keyent = {vy-cccs-90},
author = "G. Vegter and C. K. Yap",
title = "Computational complexity of combinatorial surfaces",
booktitle = SOCG_1990,
year = 1990,
pages = "102--111"
}
@article {w-hddmms-98,
keyent = {w-hddmms-98},
AUTHOR = {J.-M. Wu},
TITLE = {Hausdorff dimension and doubling measures on metric
spaces},
JOURNAL = {Proc. Amer. Math. Soc.},
FJOURNAL = {Proc. Amer. Math. Soc.},
VOLUME = 126,
YEAR = 1998,
NUMBER = 5,
PAGES = {1453--1459},
ISSN = {0002-9939},
CODEN = {PAMYAR},
MRCLASS = {28A78 (31C15 54E35 54E45)},
MRNUMBER = {99h:28016},
MRREVIEWER = {S. K. Vodop$'$yanov},
}
@Book{w-igt-01,
keyent = {w-igt-01},
author = {D. B. West},
title = {Intorudction to Graph Theory},
publisher = {Prentice Hall},
year = 2001,
edition = {2ed}
}
@incollection{w-sedbe-91a,
keyent = {w-sedbe-91a},
author = "E. Welzl",
title = "Smallest enclosing disks (balls and ellipsoids)",
editor = "H. Maurer",
booktitle = "New Results and New Trends in Computer Science",
series = LNCS,
volume = 555,
publisher = "Springer-Verlag",
year = 1991,
pages = "359--370"
}
@phdthesis{w-smhd-02,
author = "C. Wenk",
title = "Shape Matching in Higher Dimensions",
school = {Dept. of Comput. Sci., Freie Universitat, Berlin},
type = {{PhD} thesis},
year = 2002
}
@incollection{w-stlcn-92,
keyent = {w-stlcn-92},
author = "E. Welzl",
title = "On spanning trees with low crossing numbers",
booktitle = "Data Structures and Efficient Algorithms, Final
Report on the DFG Special Joint Initiative",
series = LNCS,
volume = 594,
publisher = "Springer-Verlag",
year = 1992,
pages = "233--249",
url =
{http://www.inf.ethz.ch/personal/emo/ps-files/LowCross-LNCS594.ps}
}
@article{w-tsplr-57,
keyent = {w-tsplr-57},
author = "W. Warntz",
title = "Transportation, Social Physics, and the Law of
Refraction",
journal = "The Professional Geographer",
volume = 9,
number = 4,
year = 1957,
pages = "2--7",
keywords = "weighted region problem, shortest paths, GIS,
Snell's Law"
}
@Misc{w-udsdi-09,
keyent = {w-udsdi-09},
author = {A. Weber},
title = {Ueber den Standort der Industrien},
year = 1909,
note = {Erster Teil. Reine Theorie der Standorte. Mit einem
mathematischen Anhang von G.PICK. (in German)
. Verlag, J. C. B. Mohr, Tbingen, Germany}
}
@article{w-wphp-93,
keyent = {w-wphp-93},
author = "G. Wesolowsky",
title = "The {Weber} problem: {History} and perspective",
journal = "Location Science",
volume = 1,
year = 1993,
pages = "5--23",
keywords = "facility location, Weber problem"
}
@inproceedings{wah-ocfwu-01,
keyent = {wah-ocfwu-01},
author = "Y. Wang and P. K. Agarwal and S. {Har-Peled}",
title = "Occlusion Culling for Fast Walkthrough in Urban
Areas",
year = 2001,
booktitle = {Eurographics}
}
@InProceedings(wvtp-shsip-97,
AUTHOR = "M. Waldvogel and G. Varghese and J. Turener and
B. Plattner",
TITLE = "Scalable high speed {IP} routing lookups",
BOOKTITLE = "Proc. ACM SIGCOMM 97",
year = "Octeber 1997"
)
@incollection{ww-sg-93,
keyent = {ww-sg-93},
author = "W. Weil and J. A. Wieacker",
title = "Stochastic Geometry",
chapter = "5.2",
editor = "P. M. Gruber and J. M. Wills",
booktitle = "Handbook of Convex Geometry",
volume = "B",
publisher = "North-Holland",
year = 1993,
pages = "1393--1438"
}
@incollection{sw-ig-93,
author = "R. Schneider and J. A. Wieacker",
title = "Integral Geometry",
chapter = "5.1",
editor = "P. M. Gruber and J. M. Wills",
booktitle = "Handbook of Convex Geometry",
volume = "B",
publisher = "North-Holland",
year = 1993,
pages = "1349--1390"
}
@article{y-cmps-85,
author = {A. C. Yao},
title = {On the Complexity of Maintaining Partial Sums},
journal = SICOMP,
volume = 14,
number = 2,
year = 1985,
pages = {277--288}
}
@article{y-hbhere-87,
keyent = {y-hbhere-87},
author = "V. J. Yohai",
title = "High breakdown-point and high efficiency robust
estimates for regression",
journal = "The Annals of Statistics",
volume = 15,
year = 1987,
pages = "642--656"
}
@article{y-lbact-91,
keyent = {y-lbact-91},
author = "A. C. Yao",
title = "Lower bounds for algebraic computation trees with
integer inputs",
journal = SICOMP,
volume = 20,
number = 4,
year = 1991,
pages = "655--668"
}
@inproceedings{y-sttar-82,
author = {A. C. Yao},
title = {Space-time tradeoff for answering range queries},
booktitle = STOC_1982,
year = 1982,
pages = {128--136},
location = {San Francisco, California, United States}
}
@InProceedings{yapv-pmsfk-04,
keyent = {yapv-pmsfk-04},
author = {H. Yu and P.~K. Agarwal and R. Poreddy and
K. R. Varadarajan},
title = {Practical methods for shape fitting and kinetic data
structures using core sets},
booktitle = SOCG_2004,
acceptrate = SOCG_2004_AR,
pages = {263--272},
year = 2004
}
@incollection{yc-imgt-97,
keyent = {yc-imgt-97},
author = "C. K. Yap and E.-C. Chang",
title = "Issues in the metrology of geometric tolerancing",
editor = "J.-P. Laumond and M. H. Overmars",
booktitle = "Robotics Motion and Manipulation",
publisher = "A. K. Peters",
year = 1997,
pages = "393--400"
}
@inproceedings{ykii-avo-88,
keyent = {ykii-avo-88},
author = {P. Yamamoto and K. Kato and K. Imai and H. Imai},
title = {Algorithms for vertical and orthogonal {$L_1$} linear
approximation of points},
booktitle = SOCG_1988,
year = 1988,
pages = {352--361},
url =
{http://portal.acm.org/citation.cfm?id=73429&dl=ACM&coll=portal}
}
@inproceedings{yy-gaddg-85,
author = "A. C. Yao and F. F. Yao",
title = "A general approach to {$D$}-dimensional geometric
queries",
booktitle = STOC_1985,
year = 1985,
pages = "163--168"
}
@inproceedings{ze-fsbi-00,
keyent = {ze-fsbi-00},
author = {A. Zomorodian and H. Edelsbrunner},
title = {Fast software for box intersections},
booktitle = SOCG_2000,
pages = {129--138},
year = 2000,
annote = {{448}}
}
@inproceedings{zmhh-vcuho-97,
keyent = {zmhh-vcuho-97},
author = "H. Zhang and D. Manocha and T. Hudson and K. E. Hoff
III",
title = "Visibility Culling using Hierarchical Occlusion
Maps",
booktitle = SIGGRAPH_1997,
series = "Annual Conference Series",
organization = "ACM SIGGRAPH",
publisher = "ACM Press",
year = 1997,
pages = "77--88"
}
@Article{zs-amves-02,
keyent = {zs-amves-02},
author = {Y.~Zhou and S.~Suri},
title = {Algorithms for a Minimum Volume Enclosing Simplex in
Three Dimensions},
journal = SICOMP,
year = 2002,
volume = 31,
number = 5,
pages = {1339--1357},
url = {http://epubs.siam.org/sam-bin/dbq/article/36399}
}
@techreport{c-bvdcp-86,
author = "L. P. Chew",
title = "Building {Voronoi} diagrams for convex polygons in
linear expected time",
type = "Technical Report",
number = "PCS-TR90-147",
institution = "Dept. Math. Comput. Sci., Dartmouth College",
address = "Hanover, NH",
year = 1986
}
@article{cms-frric-93,
author = "K. L. Clarkson and K. Mehlhorn and R. Seidel",
title = "Four results on randomized incremental
constructions",
journal = CGTA,
volume = 3,
number = 4,
year = 1993,
pages = "185--212"
}
@article{hmwn-pdosa-02,
author = "I. Halperin and B. Ma and H. Wolfson and
R. Nussinov",
title = "Principles of docking: {A}n Overview of search
algorithms and a guide to scoring functions",
journal = "Proteins: Structure, Function, and Genetics",
volume = 47,
pages = {409--443},
year = 2002
}
@inproceedings{sl-fero-02,
author = "S. Seeger and X. Laboureux",
title = "Feature Extraction and Registration: An Overview",
booktitle = "Principles of 3D Image Analysis and Synthesis",
pages = {153--166},
publisher = {Kluwer Academic Publishers},
year = 2002
}
@article{ak-maub-01,
author = "N. Amenta and R. Kolluri",
title = "The medial axis of a union of balls",
journal = CGTA,
volume = 20,
pages = {25--37},
year = 2001
}
@article{cdek-gpmdd-99,
author = "L. P. Chew and D. Dor and A. Efrat and K. Kedem",
title = "Geometric Pattern Matching in {$d$}-dimensional space",
journal = DCG,
volume = 21,
pages = {257--274},
year = 1999
}
@InProceedings{imv-gmunc-99,
author = {P.~Indyk and R.~Motwani and S.~Venkatasubramanian },
title = {Geometric Matching under Noise: Combinatorial Bounds
and Algorithms},
booktitle = SODA_1999,
pages = "457--465",
year = 1999
}
@article{abb-amps-95,
author = {H. Alt and B. Behrends and J. Bl{\"o}mer},
title = {Approximate matching of polygonal shapes},
journal = {Ann. Math. Artif. Intell.},
editor = {Janos Csirik and Horst Bunke},
volume = 13,
pages = {251--266},
year = 1995
}
@article{am-rsps-93,
author = "P. K. Agarwal and J. Matou\v{s}ek",
title = "Ray Shooting and Parametric Search",
journal = SICOMP,
volume = 22,
pages = {540--570},
year = 1993
}
@inproceedings{gmo-pmagp-94,
author = "M. T. Goodrich and J. S. B. Mitchell and
M. W. Orletsky",
title = "Practical methods for approximate geometric pattern
matching under rigid motion",
booktitle = SOCG_1994,
pages = {103--112},
year = 1994
}
@article{aar-msrp-97,
author = {O. Aichholzer and H. Alt and G. Rote},
title = {Matching shapes with a reference point},
journal = IJCGA,
volume = 7,
pages = {349--363},
year = 1997
}
@inproceedings{cs-pmsps-98,
author = "D. Cardoze and L. Schulman",
title = "Pattern matching for spatial point sets",
booktitle = FOCS_1998,
pages = {156--165},
year = 1998
}
@incollection{abgkw-chdgp-03,
author = "H. Alt and P. Brass and M. Godau and C. Knauer and
C. Wenk",
title = "Computing the {Hausdorff} distance of geometric
patterns and shapes",
booktitle = "Discrete and Computational Geometry --- The
Goodman-Pollack Festchrift",
editor = "B. Aronov and S. Basu and J. Pach and M. Sharir",
publisher = "Springer-Verlag",
address = "Heidelberg",
pages = {65--76},
year = 2003
}
@article{a-ltahd-83,
author = "M. J. Atallah",
title = "A linear time algorithm for the {H}ausdorff distance
between convex polygons",
journal = IPL,
volume = 17,
pages = {207--209},
year = 1983
}
@article{cghkkk-gpmem-97,
author = "L. P. Chew and M. T. Goodrich and D. P. Huttenlocher
and K. Kedem and J. M. Kleinberg and D. Kravets",
title = "Geometric pattern matching under {Euclidean} motion",
journal = CGTA,
volume = 7,
pages = {113--124},
year = 1997
}
@article{e-ubids-95,
author = "H. Edelsbrunner",
title = "The Union of Balls and Its Dual Shape",
journal = "Discrete and Computational Geometry",
volume = 13,
pages = {415--440},
year = 1995
}
@Unpublished{h-cncq-05,
author = {S. {Har-Peled}},
title = {Class notes on compressed quadtrees},
note = {\href{http://sarielhp.org/teach/2004/a_aprx/lec/}},
year = 2005
}
@inproceedings{apl-asmdc-01,
author = "A. Amir and E. Porat and M. Lewenstein",
title = "Approximate subset matching with {Don't Cares}",
booktitle = SODA_2001,
pages = {305--306},
year = 2001
}
@book{g-cp-03,
author = {B. Gr{\"u}nbaum},
howpublished = {Hardcover},
isbn = 0387004246,
month = {May},
edition = {2nd},
publisher = {Springer},
title = {Convex Polytopes},
note = {Prepared by V. Kaibel, V. Klee, and G. Ziegler},
url =
{http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20{\&}path=ASIN/0387004246},
year = 2003
}
@article{a-httgl-94,
author = "N. Amenta",
title = "Helly-type theorems and generalized linear
programming",
journal = DCG,
volume = 12,
year = 1994,
pages = "241--261"
}
@inproceedings{sw-cblpr-92,
author = "M. Sharir and E. Welzl",
title = "A combinatorial bound for linear programming and
related problems",
booktitle = STACS_1992,
series = LNCS,
volume = 577,
publisher = "Springer-Verlag",
year = 1992,
pages = "569--579",
address = {London, UK},
doi = {10.1007/3-540-55210-3_213}
}
@ARTICLE{blmn-mrtp-05,
author = {Y. Bartal and N. Linial and M. Mendel and A. Naor},
title = {On metric Ramsey-type phenomena},
journal = {ANN.OF MATH.},
volume = 2,
pages = 162,
url =
{http://www.citebase.org/abstract?id=oai:arXiv.org:math/0406353},
year = 2005
}
@article{ak-cafmf-95,
author = "E. Amaldi and V. Kann",
title = "The complexity and approximability of finding
maximum feasible subsystems of linear relations",
journal = TCS,
volume = 147,
number = "1--2",
pages = "181--210",
year = 1995
}
@inproceedings{c-ldlpv-02-old,
keyent = {c-ldlpv-02},
author = {T. M. Chan},
title = {Low-dimensional linear programming with violations},
booktitle = FOCS_2002,
year = 2002,
pages = {570--579},
url = {http://www.math.uwaterloo.ca/~tmchan/pub.html}
}
@article{abss-haolc-97,
author = {S. Arora and L. Babai and J. Stern and Z. Sweedyk},
title = {The Hardness of Approximate Optima in Lattices,
Codes, and Systems of Linear Equations},
journal = {J. Comput. Syst. Sci.},
volume = 54,
number = 2,
year = 1997,
pages = {317-331}
}
@article{egs-suicu-04,
author = {E. Ezra and D. Halperin and M. Sharir},
title = {Speeding up the incremental construction of the
union of geometric objects in practice},
journal = CGTA,
volume = 27,
number = 1,
year = 2004,
pages = {63--85}
}
@inproceedings{cv-iaags-05-old,
author = {K. L. Clarkson and K. Varadarajan},
title = {Improved approximation algorithms for geometric set
cover},
booktitle = SOCG_2005,
year = 2005,
pages = {135--141},
location = {Pisa, Italy},
doi = {10.1145/1064092.1064115}
}
@article{cv-iaags-07,
author = {K. L. Clarkson and K. R. Varadarajan},
title = {Improved Approximation Algorithms for Geometric Set
Cover},
journal = DCG,
volume = 37,
number = 1,
year = 2007,
pages = {43--58},
doi = {10.1007/s00454-006-1273-8}
}
@inproceedings{bkmt-armrm-05,
author = {P. Bose and E. Kranakis and P. Morin and Y. Tang},
title = {Approximate Range Mode and Range Median Queries},
booktitle = STACS_2005,
year = 2005,
pages = {377--388}
}
@book{s-itc-05,
author = {M. Sipser},
howpublished = {Hardcover},
isbn = 0534950973,
month = {February},
title = {Introduction to the Theory of Computation},
edition = {2ed},
year = 2005
}
@article{ers-hsvcs-05,
author = {G. Even and D. Rawitz and S. Shahar},
title = {Hitting sets when the {VC}-dimension is small},
journal = IPL,
volume = 95,
number = 2,
year = 2005,
pages = {358-362},
doi = {10.1016/j.ipl.2005.03.010}
}
@inproceedings{pst-faafp-91,
author = {S. A. Plotkin and D. B. Shmoys and {\'E} Tardos},
title = {Fast Approximation Algorithms for Fractional Packing
and Covering Problems},
booktitle = FOCS_1991,
year = 1991,
pages = {495-504}
}
@inproceedings{msw-hnlls-90,
author = {J. Matou\v{s}ek and R. Seidel and E. Welzl},
title = {How to net a lot with little: {Small}
{\(\varepsilon\)}-nets for disks and halfspaces},
booktitle = SOCG_1990,
year = 1990,
isbn = {0-89791-362-0},
pages = {16--22},
location = {Berkley, California, United States},
doi = {10.1145/98524.98530}
}
@article{hm-ascpp-85,
author = "D. S. Hochbaum and W. Maas",
title = "Approximation schemes for covering and packing
problems in image processing and {VLSI}",
journal = JACM,
volume = 32,
year = 1985,
pages = "130--136"
}
@article{ejs-ptasg-05,
author = {T. Erlebach and K. Jansen and E. Seidel},
title = {Polynomial-Time Approximation Schemes for Geometric
Intersection Graphs},
journal = SICOMP,
volume = 34,
number = 6,
year = 2005,
pages = {1302--1323},
doi = {10.1137/S0097539702402676}
}
@article{bsty-vdhdc-98,
author = {J. D. Boissonnat and M. Sharir and B. Tagansky and
M. Yvinec},
title = {{Voronoi} Diagrams in Higher Dimensions under
Certain Polyhedral Distance Functions},
journal = DCG,
volume = 19,
number = 4,
year = 1998,
pages = {485--519}
}
@article{ly-hamp-94,
author = {C. Lund and M. Yannakakis},
title = {On the Hardness of Approximating Minimization
Problems},
journal = JACM,
volume = 41,
number = 5,
year = 1994,
pages = {960--981}
}
@article{f-tlasc-98,
author = {U. Feige},
title = {A Threshold of {$\ln n$} for Approximating Set Cover},
journal = JACM,
volume = 45,
number = 4,
year = 1998,
pages = {634--652}
}
@book{v-aa-01,
author = {V. V. Vazirani},
title = {Approximation algorithms},
year = 2001,
isbn = {3-540-65367-8},
publisher = {Springer-Verlag}
}
@Book{h-gaa-11,
author = {S. {Har-Peled}},
title = {Geometric Approximation Algorithms},
publisher = AMS,
series = {Math. Surveys \& Monographs},
volume = 173,
address = {Boston, MA, USA},
year = 2011,
url = {http://sarielhp.org/book/},
doi = {10.1090/surv/173}
}
@Book{h-gaa-11-ext,
author = {S. {Har-Peled}},
title = {Geometric Approximation Algorithms},
publisher = AMS,
year = 2011,
note = {372 pages. \url{http://sarielhp.org/book/}},
}
@Unpublished{h-gaa-10,
author = {S. {Har-Peled}},
title = {Geometric approximation algorithms},
note = {Class notes. Online at
\url{http://sarielhp.org/teach/notes/aprx/}},
url = {http://sarielhp.org/teach/notes/aprx/},
year = 2010
}
@Unpublished{hl-wgscp-08,
author = {S. {Har-Peled} and M. Lee},
title = {Weighted Geometric Set Cover Problems Revisited},
note = {\url{http://sarielhp.org/papers/08/expand_cover/}},
year = 2010
}
@inproceedings{ah-ncsa-10,
author = {M. A. Abam and S. {Har-Peled}},
title = {New Constructions of \textsf{SSPD}s and their
Applications},
url = {http://sarielhp.org/papers/09/sspd/},
booktitle = SOCG_2010,
acceptrate = SOCG_2010_AR,
pages = {192--200},
year = 2010
}
@inproceedings{dhw-afdrc-10-conf,
author = {A. Driemel and S. {Har-Peled} and C. Wenk},
title = {Approximating the {Fr\'{e}chet} Distance for
Realistic Curves in Near Linear Time},
url = {http://arxiv.org/abs/1003.0460},
booktitle = SOCG_2010,
acceptrate = SOCG_2010_AR,
pages = {365--374},
year = 2010
}
@article{dhw-afdrc-12,
author = {A. Driemel and S. {Har-Peled} and C. Wenk},
title = {Approximating the {Fr\'{e}chet} Distance for
Realistic Curves in Near Linear Time},
journal = DCG,
pages = {94--127},
volume = 48,
issue = 1,
year = 2012,
doi = {10.1007/s00454-012-9402-z}
}
@inproceedings{dhtt-ioemo-07,
author = {M. {de Berg} and H. J. Haverkort and S. Thite and
L. Toma},
title = {{I/O}-Efficient Map Overlay and Point Location in
Low-Density Subdivisions},
booktitle = ISAAC_2007,
year = 2007,
pages = {500--511}
}
@proceedings{DBLP:conf/isaac/2007,
editor = {Takeshi Tokuyama},
title = {Algorithms and Computation, 18th International
Symposium, ISAAC 2007, Sendai, Japan, December
17-19, 2007, Proceedings},
booktitle = {ISAAC},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = 4835,
year = 2007,
isbn = {978-3-540-77118-0}
}
@book{z-fem-77,
author = "O. C. Zienkiewicz",
title = "The Finite Element Method",
edition = "3rd",
publisher = "McGraw-Hill",
year = 1977
}
@article{s-aamg-85,
author = "M. S. Shephard",
title = "Automatic and adaptive mesh generation",
journal = "IEEE Trans. Magn.",
volume = "MAG-21",
year = 1985,
pages = "2484--2489"
}
@Unpublished{ckms-arers-06,
author = {E. Cohen and H. Kaplan and Y. Mansour and M. Sharir},
title = {Approximations with relative errors in range spaces
of finite {VC} dimension},
note = {manuscript},
year = 2006
}
@article{bcm-prsss-99,
author = "H. Br{\"o}nnimann and B. Chazelle and J. Matou{\v
s}ek",
title = "Product Range Spaces, Sensitive Sampling, and
Derandomization",
journal = SICOMP,
volume = 28,
year = 1999,
pages = "1552--1575"
}
@phdthesis{b-dga-95,
author = "H. Br{\"o}nnimann",
title = "Derandomization of Geometric Algorithms",
type = "Ph.{D}. Thesis",
school = "Dept. Comput. Sci., Princeton University",
address = "Princeton, NJ",
month = may,
year = 1995,
keywords = "doctoral thesis"
}
@article{m-dcg-96,
author = "J. Matou{\v s}ek",
title = "Derandomization in computational geometry",
journal = JALG,
volume = 20,
year = 1996,
pages = "545--580"
}
@Unpublished{cch-omcpg-08-old,
author = {C. Chekuri and K. Clarkson and S. {Har-Peled}},
title = {On the Multi-Cover Problem in Geometric Settings},
note = {manuscript,
\url{http://sarielhp.org/papers/08/multi_cover}},
url = {http://sarielhp.org/papers/08/multi_cover},
year = 2008
}
@inproceedings{cch-smcpg-09,
author = {C. Chekuri and K. L. Clarkson. and S. {Har-Peled}},
title = {On the set multi-cover problem in geometric
settings},
booktitle = SOCG_2009,
acceptrate = SOCG_2009_AR,
year = 2009,
pages = {341--350},
}
@article{h-dtgpm-92,
author = {D. Haussler},
title = {Decision theoretic generalizations of the {PAC}
model for neural net and other learning
applications},
journal = {Inf. Comput.},
volume = 100,
number = 1,
year = 1992,
pages = {78--150}
}
@article{h-spnsb-95,
author = {D. Haussler},
title = {Sphere packing numbers for subsets of the {Boolean}
{$n$}-cube with bounded {Vapnik-Chervonenkis}
dimension},
journal = {J. Comb. Theory Ser. A},
volume = 69,
number = 2,
year = 1995,
issn = {0097-3165},
pages = {217--232}
}
@article{abet-rdcp-00,
author = "N. Amenta and M. Bern and D. Eppstein and
S.-H. Teng",
title = "Regression Depth and Center Points",
journal = DCG,
volume = 23,
year = 2000,
pages = "305--323"
}
@article{hlw-egta-06,
author = "S. Hoory and N. Linial and A. Wigderson",
title = "Expander Graphs and Their Applications",
journal = "Bulletin Amer. Math. Soc.",
volume = 43,
year = 2006,
pages = "439--561",
url =
"http://www.ams.org/bull/2006-43-04/S0273-0979-06-01126-8/"
}
@article{ass-eccde-08,
author = {N. Alon and O. Schwartz and A. Shapira},
title = {An elementary construction of constant-degree
expanders},
journal = {Combin. Probab. Comput.},
volume = 17,
number = 3,
year = 2008,
issn = {0963-5483},
pages = {319--327},
url = {http://www.cs.tau.ac.il/~asafico/expander.pdf}
}
@article{ar-rcge-94,
author = {N. Alon and Y. Roichman},
title = {Random Cayley Graphs and Expanders},
journal = {Random Struct. Algorithms},
volume = 5,
number = 2,
year = 1994,
pages = {271--285}
}
@ARTICLE{rvw-ewzzg-02,
author = {O. Reingold and S. Vadhan and A. Wigderson},
title = {Entropy waves, the zig-zag graph product, and new
constant-degree expanders and extractors},
journal = {Annals Math.},
year = 2002,
volume = 155,
number = 1,
pages = {157--187}
}
@Unpublished{mn-tcnls-08,
author = {M. Mendel and A. Naor},
title = {Towards a calculus for non-linear spectral gaps},
note = {manuscript},
year = 2008
}
@inproceedings{hm-rm-08,
author = {S. {Har-Peled} and S. Muthukrishnan},
title = {Range Medians},
booktitle = ESA_2008,
acceptrate = ESA_2008_AR,
year = 2008,
pages = {503--514}
}
@inproceedings{aemn-cfamw-06,
author = {C. Amb{\"u}hl and T. Erlebach and M. Mihal{\'a}k and
M. Nunkesser},
title = {Constant-Factor Approximation for Minimum-Weight
(Connected) Dominating Sets in Unit Disk Graphs},
booktitle = APPROX_2006,
year = 2006,
pages = {3--14}
}
@Article{f-tasc-98,
author = {U.~Feige},
title = {A threshold of ln {$n$} for approximating set cover},
journal = JACM,
year = 1998,
volume = 45,
pages = {634--652}
}
@inproceedings{p-cugo-00,
author = {J. Pach},
title = {On the Complexity of the Union of Geometric Objects},
booktitle = {JCDCG},
year = 2000,
pages = {292--307},
url =
{http://www.math.nyu.edu/~pach/publications/tokyo2.ps}
}
@techreport{wz-kacjc-90,
author = "S. Whitesides and R. Zhao",
title = "$K$-Admissible Collections of {Jordan} Curves and
Offsets of Circular Arc Figures",
type = "Technical {Report}",
number = "SOCS 90.08",
institution = "McGill Univ.",
address = "Montreal, PQ",
year = 1990
}
@InCollection{aps-sugo-08,
author = {P. K. Agarwal and J. Pach and M. Sharir},
title = {State of the Union--of Geometric Objects},
booktitle = {Surveys in Discrete and Computational Geometry
Twenty Years Later},
pages = {9--48},
publisher = AMS,
year = 2008,
editor = {J. E. Goodman and J. Pach and R. Pollack},
volume = 453,
series = {Contemporary Mathematics},
doi = {http://dx.doi.org/10.1090/conm/453},
url = {https://users.cs.duke.edu/~pankaj/publications/surveys/union.pdf}
}
@InCollection{n-iscmh-08,
author = {Gabriel Nivasch},
title = {An improved, simple construction of many halving edges},
booktitle = {Surveys in Discrete and Computational Geometry
Twenty Years Later},
pages = {299--305},
publisher = AMS,
year = 2008,
editor = {J. E. Goodman and J. Pach and R. Pollack},
volume = 453,
series = {Contemporary Mathematics},
doi = {http://dx.doi.org/10.1090/conm/453},
url = {http://www.gabrielnivasch.org/academic/publications/many_halving_edges.pdf}
}
@Article{h-chaw-99,
author = "H{\aa}stad, Johan",
title = {Clique is hard to approximate withinn
{$n^{1-\varepsilon}$}},
journal = "Acta Mathematica",
volume = "182",
number = "1",
pages = "105--142",
issn = "1871-2509",
year = {1999},
doi = "10.1007/BF02392825",
url = "http://dx.doi.org/10.1007/BF02392825"
}
@article{bf-apisp-99,
author = {P. Berman and T. Fujito},
title = {On Approximation Properties of the Independent Set
Problem for Low Degree Graphs},
journal = TCS,
volume = 32,
number = 2,
year = 1999,
pages = {115--132}
}
@InProceedings{cc-misr-09,
author = {P. Chalermsook and J. Chuzhoy},
title = {Maximum Independent Set of Rectangles},
booktitle = SODA_2009,
year = 2009,
pages = {892--901}
}
@article{b-aancp-94,
author = "B. S. Baker",
title = "Approximation algorithms for {NP}-complete problems
on planar graphs",
journal = JACM,
volume = 41,
year = 1994,
pages = "153--180",
doi = {10.1145/174644.174650}
}
@inproceedings{h-aisg-98,
author = {M. M. Halld\'{o}rsson},
title = {Approximations of Independent Sets in Graphs},
booktitle = APPROX_1998,
year = 1998,
pages = {1--13}
}
@inproceedings{l-upsda-01,
author = {P. M. Long},
title = {Using the Pseudo-Dimension to Analyze Approximation
Algorithms for Integer Programming},
booktitle = WADS_2001,
series = "Lecture Notes Comput. Sci.",
volume = 2125,
year = 2001,
pages = {26--37},
}
@article{c-ptasp-03,
author = {Chan, Timothy M.},
Xauthor = "T. M. Chan",
title = "Polynomial-time approximation schemes for packing
and piercing fat objects",
journal = JALG,
volume = 46,
number = 2,
pages = "178--189",
year = 2003,
doi = {10.1016/S0196-6774(02)00294-8},
}
@inproceedings{sw-gsta-98,
author = "W. D. Smith and N. C. Wormald",
title = "Geometric separator theorems and applications",
booktitle = FOCS_1998,
pages = "232--243",
year = 1998,
doi = {10.1109/SFCS.1998.743449}
}
@article{ekns-ddsfo-00,
author = "A. Efrat and M. J. Katz and F. Nielsen and
M. Sharir",
title = "Dynamic data structures for fat objects and their
applications",
journal = CGTA,
volume = 15,
year = 2000,
pages = "215--227",
succeeds = "ekns-ddsfo-97",
update = "00.03 smid"
}
@inproceedings{pr-nepen-08,
author = "E. Pyrga and S. Ray",
title = "New existence proofs for {\(\varepsilon\)}-nets",
booktitle = SOCG_2008,
pages = "199--207",
year = 2008
}
@article{aks-lpmis-98,
author = "P. K. Agarwal and {M. van} Kreveld and S. Suri",
title = "Label Placement by Maximum Independent Set in
Rectangles",
journal = CGTA,
year = 1998,
volume = 11,
pages = "209--218"
}
@article{ers-hswvd-05,
author = "G. Even and D. Rawitz and S. Shahar",
title = "Hitting sets when the {VC}-dimension is small",
journal = IPL,
volume = "95(2)",
pages = "358--362",
year = 2005
}
@inproceedings{ac-dcapr-06,
author = "P. Afshani and T. M. Chan",
title = "Dynamic connectivity for axis-parallel rectangles",
booktitle = "Proc. 14th European Sympos. Algorithms",
series = "Lecture Notes Comput. Sci.",
volume = 4168,
pages = "16--27",
year = 2006
}
@article{mbhrr-shudg-95,
author = "M. V. Marathe and H. Breu and H. B. {Hunt III} and
S. S. Ravi and D. J. Rosenkrantz",
title = "Simple heuristics for unit disk graphs",
journal = "Networks",
volume = 25,
year = 1995,
pages = "59--68",
update = "97.07 agarwal"
}
@inproceedings{ky-bsfpc-07,
title = {Beating Simplex for Fractional Packing and Covering
Linear Programs},
author = {C. Koufogiannakis and N. E. Young},
year = 2007,
pages = {494--506},
booktitle = FOCS_2007
}
@inproceedings{lt-stpg-77-bad,
author = "R. J. Lipton and R. E. Tarjan",
title = "A separator theorem for planar graphs",
booktitle = "Proc. GI Conf. Theoret. Comput. Sci.",
year = 1977
}
@article{lt-stpg-79,
author = "R. J. Lipton and R. E. Tarjan",
title = "A separator theorem for planar graphs",
journal = "SIAM J. Appl. Math.",
volume = 36,
year = 1979,
pages = "177--189",
doi = {10.1137/0136016}
}
@article{am-isigc-06,
author = {P. K. Agarwal and N. H. Mustafa},
title = {Independent set of intersection graphs of convex
objects in {2D}},
journal = CGTA,
volume = 34,
number = 2,
year = 2006,
pages = {83-95}
}
@article{c-nmisr-04,
author = "T. M. Chan",
title = "A note on maximum independent sets in rectangle
intersection graphs",
journal = IPL,
volume = 89,
pages = "19--23",
year = 2004
}
@article{ag-cp-60,
author = "E. Asplund and B. Gr{\" u}baum",
title = "On a coloring problem",
journal = "Math. Scand.",
volume = 8,
pages = "181--188",
year = 1960
}
@Unpublished{ch-aamis-08-old,
author = {T. M. Chan and S. {Har-Peled}},
title = {Approximation Algorithms for Maximum Independent Set
of Pseudo-Disks},
note = {Manuscript,
\url{cs.uiuc.edu/~sariel/papers/08/w_indep}},
year = 2008,
url = {http://sarielhp.org/papers/08/w_indep}
}
@InProceedings{ch-aamis-09,
author = {T. M. Chan and S. {Har-Peled}},
title = {Approximation Algorithms for Maximum Independent Set
of Pseudo-Disks},
url = {http://sarielhp.org/papers/08/w_indep},
booktitle = SOCG_2009,
acceptrate = SOCG_2009_AR,
pages = {333--340},
year = 2009
}
@article{ch-aamis-12,
author = {T. M. Chan and S. {Har-Peled}},
title = {Approximation Algorithms for Maximum Independent Set
of Pseudo-Disks},
journal = DCG,
year = 2012,
volume = 48,
issue = 2,
pages = {373--392},
doi = {10.1007/s00454-012-9417-5},
}
@article{ch-aamis-11,
author = {T. M. Chan and S. {Har-Peled}},
title = {Approximation Algorithms for Maximum Independent Set
of Pseudo-Disks},
journal = {CoRR},
volume = {abs/1103.1431},
year = 2011
}
@inproceedings{dh-jydfd-12,
author = {A. Driemel and S. {Har-Peled}},
title = {Jaywalking your Dog -- Computing the {Fr\'{e}chet}
Distance with Shortcuts},
booktitle = SODA_2012,
acceptrate = SODA_2012_AR,
pages = {318--337},
year = 2012,
doi = {10.1137/1.9781611973099.30}
}
@article{dh-jydfd-13,
author = {A. Driemel and S. {Har-Peled}},
title = {Jaywalking your Dog -- Computing the {Fr\'{e}chet}
Distance with Shortcuts},
journal = SICOMP,
year = 2013,
pages = {1830--1866},
doi = {10.1137/120865112},
volume = 42,
number = 5
}
@article{dh-jydfd-11,
author = {A. Driemel and S. {Har-Peled}},
title = {Jaywalking your Dog -- Computing the {Fr\'{e}chet}
Distance with Shortcuts},
journal = {CoRR},
volume = {abs/1107.1720},
year = 2011
}
@Article{twdj-cpwsn-08,
author = {M. T. Thai and F. Wang and D. H. Du and X. Jia},
title = {Coverage problems in wireless sensor networks:
design and analysis},
journal = {Inter. J. Sensor Networks},
year = 2008,
volume = 3,
number = 3,
pages = {191--200},
note = {Special issue on Coverage Problems in Sensor
Networks},
}
@article{ms-cscgl-84,
author = "N. Megiddo and K. J. Supowit",
title = "On the complexity of some common geometric location
problems",
journal = SICOMP,
volume = 13,
number = 1,
year = 1984,
pages = "182--196",
keywords = "NP-completeness, packing, covering, proximity"
}
@inproceedings{dfkvv-clgm-99,
author = {P. Drineas and A. Frieze and R. Kannan and
S. Vempala and V. Vinay},
title = {Clustering in large graphs and matrices},
booktitle = SODA_1999,
year = 1999,
pages = {291--299}
}
@article{ee-rrccp-99,
author = {D. Eppstein and J. Erickson},
title = {Raising Roofs, Crashing Cycles, and Playing Pool:
Applications of a Data Structure for Finding
Pairwise Interactions},
journal = {Discrete {\&} Computational Geometry},
volume = 22,
number = 4,
year = 1999,
pages = {569--592},
}
@inproceedings{ez-cmre-74,
author = {A. Ehrenfeucht and P. Zeiger},
title = {Complexity measures for regular expressions},
booktitle = STOC_1974,
year = 1974,
pages = {75--79},
note = {\url{http://portal.acm.org/citation.cfm?id=803886}},
url = {http://portal.acm.org/citation.cfm?id=803886}
}
@InProceedings{aes-ssena-09,
author = {B. Aronov and E. Ezra and M. Sharir},
title = {Small-size {\(\varepsilon\)}s-Nets for Axis-Parallel
Rectangles and Boxes},
booktitle = STOC_2009,
year = 2009,
url =
{http://www.cs.tau.ac.il/~estere/Research/Eps_Nets/eps_nets.pdf}
}
@InProceedings{v-enuc-09,
author = {K. Varadarajan},
title = {Epsilon Nets and Union Complexity},
booktitle = SOCG_2009,
year = 2009,
note = {To appear.}
}
@inproceedings{mr-pghsp-09,
author = {N. H. Mustafa and S. Ray},
title = {{PTAS} for geometric hitting set problems via local
search},
booktitle = SOCG_2009,
year = 2009,
pages = {17--22}
}
@article{m-dsaa-05,
author = {S. Muthukrishnan},
title = {Data streams: algorithms and applications},
journal = {Found. Trends Theor. Comput. Sci.},
volume = 1,
number = 2,
year = 2005,
pages = {117--236}
}
@incollection{s-eubnf-91,
author = "R. Seidel",
title = "Exact upper bounds for the number of faces in
{$d$}-dimensional {V}oronoi diagrams",
editor = "P. Gritzman and B. Sturmfels",
booktitle = "Applied Geometry and Discrete Mathematics: The
Victor Klee Festschrift",
series = "DIMACS Series in Discrete Mathematics and
Theoretical Computer Science",
volume = 4,
year = 1991,
publisher = AMS,
pages = "517--530",
url = {http://dimacs.rutgers.edu/Volumes/Vol04.html}
}
@incollection{ek-alnfc-03,
Title = {Arbitrarily large neighborly families of congruent
symmetric convex 3-polytopes},
Author = {J. Erickson and S. Kim},
Booktitle = {Discrete Geometry:~In Honor of W. Kuperberg's 60th
Birthday},
Date-Modified= {2008-12-08 17:02:08 -0600},
Editor = {A. Bezdek},
Eprint = {arXiv:math.CO/0106095},
Pages = {267--278},
Publisher = {Marcel-Dekker},
Series = {Lecture Notes Pure Appl. Math.},
Year = 2003
}
@inproceedings{ht-eqsmr-08,
author = {B. Hudson and D. T\"{u}rko\u{g}lu},
title = {An Efficient Query Structure for Mesh Refinement},
booktitle = CCCG_2008,
year = 2008
}
@techreport{ah-dmrqt-07,
title = {Dynamic Mesh Refinement with Quad Trees and
Off-Centers},
author = {U. A. Acar and B. Hudson},
institution = {Carnegie Mellon University},
number = {CMU-CS-07-121},
year = 2007
}
@inproceedings{hmp-svr-06,
author = {B. Hudson and G. Miller and T. Phillips},
title = "Sparse {V}oronoi refinement",
address = {Birmingham, Alabama},
booktitle = "Proceedings of the 15th International Meshing
Roundtable",
year = 2006
}
@article{eu-qtlos-09,
author = {S. Erten and A. {\"U}ng{\"o}r},
TITLE = "Quality Triangulations with Locally Optimal
{Steiner} Points",
JOURNAL = "SIAM Journal on Scientific Computing",
VOLUME = 31,
ISSUE = 3,
PAGES = "2103--2130",
YEAR = 2009
}
@article{sw-ncfmc-06,
author = {M. Sharir and E. Welzl},
journal = SICOMP,
number = 3,
pages = {695--720},
title = {On the Number of Crossing-Free Matchings, Cycles,
and Partitions.},
volume = 36,
year = 2006
}
@article{hs-parss-95,
author = {J. Hershberger and S. Suri},
title = {A pedestrian approach to ray shooting: shoot a ray,
take a walk},
journal = JALG,
volume = 18,
number = 3,
year = 1995,
pages = {403--431}
}
@book{s-fmmds-05,
author = {H. Samet},
title = {Foundations of Multidimensional and Metric Data
Structures},
series = {The Morgan Kaufmann Series in Computer Graphics and
Geometric Modeling},
publisher = {Morgan Kaufmann Publishers Inc.},
year = 2005,
url = {http://dl.acm.org/citation.cfm?id=1076819}
}
@book{bm-gta-76,
author = {J. A. Bondy and U. S. R. Murty},
publisher = {North-Holland},
title = {Graph Theory with Applications},
year = 1976,
url =
{http://www.ecp6.jussieu.fr/pageperso/bondy/books/gtwa/gtwa\
.html}
}
@inproceedings{el-dgig-08,
author = {T. Erlebach and E. J. van Leeuwen},
title = {Domination in Geometric Intersection Graphs},
booktitle = LATIN_2008,
year = 2008,
pages = {747--758}
}
@inproceedings{cc-ahopi-05,
author = {M. Chleb\'{\i}k and J. Chleb\'{\i}kov\'{a}},
title = {Approximation hardness of optimization problems in
intersection graphs of d-dimensional boxes},
booktitle = SODA_2005,
year = 2005,
pages = {267--276}
}
@article{fmz-mgbag-07,
author = {C. Fragoudakis and E. Markou and S. Zachos},
title = {Maximizing the guarded boundary of an Art Gallery is
APX-complete},
journal = CGTA,
volume = 38,
number = 3,
year = 2007,
pages = {170--180}
}
@article{cdkw-spapl-05,
author = {Gruia C{\u{a}}linescu and Adrian Dumitrescu and
Howard J. Karloff and Peng{-}Jun Wan},
title = {Separating Points by Axis-parallel Lines},
journal = IJCGA,
volume = {15},
number = {6},
pages = {575--590},
year = {2005},
url = {http://dx.doi.org/10.1142/S0218195905001865},
doi = {10.1142/S0218195905001865}
}
@Article{t-upnr-05,
author = {H. Tietze},
title = {Uber das Problem der Nachbargeibiete im Raum},
journal = {Monatshefte Math. },
year = 1905,
volume = 15,
pages = {211--216}
}
@book{abcc-tspcs-07,
author = {D. L. Applegate and R. E. Bixby and V. Chvatal and
W. J. Cook},
title = {The Traveling Salesman Problem: A Computational
Study},
publisher = {Princeton University Press},
year = 2007
}
@inproceedings{v-dcamc-98,
author = {K. R. Varadarajan},
title = {A Divide-and-Conquer Algorithm for Min-Cost Perfect
Matching in the Plane},
booktitle = FOCS_1998,
year = 1998,
pages = {320--331}
}
@article{adfg-rftgs-09,
author = {M. A. Abam and M. de Berg and M. Farshi and
J. Gudmundsson},
title = {Region-Fault Tolerant Geometric Spanners},
journal = DCG,
volume = 41,
number = 4,
year = 2009,
pages = {556--582}
}
@article{adfgs-gswps-11,
author = {M. A. Abam and M. de Berg and M. Farshi and
J. Gudmundsson and M. H. M. Smid},
title = {Geometric Spanners for Weighted Point Sets},
journal = {Algorithmica},
volume = 61,
number = 1,
year = 2011,
pages = {207--225}
}
@inproceedings{adfgs-gswps-09-conf,
author = {M. A. Abam and M. de Berg and M. Farshi and
J. Gudmundsson and M. H. M. Smid},
title = {Geometric Spanners for Weighted Point Sets},
booktitle = ESA_2009,
year = 2009,
pages = {190--202}
}
@inproceedings{acfs-psspd-09,
author = {M. A. Abam and P. Carmi and M. Farshi and
M. H. M. Smid},
title = {On the Power of the Semi-Separated Pair
Decomposition},
booktitle = WADS_2009,
year = 2009,
pages = {1--12}
}
@article{bs-ss-07,
author = {B. Bollob\'{a}s and A. Scott},
title = {On separating systems},
journal = {Eur. J. Comb.},
volume = 28,
number = 4,
year = 2007,
issn = {0195-6698},
pages = {1068--1071}
}
@article{r-draqt-95,
author = {J. Ruppert},
title = {A {Delaunay} Refinement Algorithm for Quality
2-Dimensional Mesh Generation},
journal = {J. Algorithms},
volume = 18,
number = 3,
year = 1995,
pages = {548--585}
}
@article{DBLP:journals/jal/Ruppert95,
author = {Jim Ruppert},
title = {A {Delaunay} Refinement Algorithm for Quality
2-Dimensional Mesh Generation},
journal = {J. Algorithms},
volume = 18,
number = 3,
year = 1995,
pages = {548--585}
}
@article{r-draq2d-95,
author = {J. Ruppert},
title = {A {Delaunay} Refinement Algorithm for Quality
2-Dimensional Mesh Generation},
journal = JALG,
volume = 18,
number = 3,
year = 1995,
pages = {548--585}
}
@book{ns-gsn-07,
author = "G. Narasimhan and M. Smid",
title = "Geometric spanner networks",
publisher = "Cambridge University Press",
year = 2007
}
@inproceedings{fk-sgig-07,
author = {M. F{\"u}rer and S. P. Kasiviswanathan},
title = {Spanners for Geometric Intersection Graphs},
booktitle = WADS_2007,
year = 2007,
pages = {312--324}
}
@article{lt-apst-80,
author = {R. J. Lipton and R. E. Tarjan},
title = {Applications of a Planar Separator Theorem},
journal = SICOMP,
volume = 9,
number = 3,
year = 1980,
pages = {615--627},
doi = {10.1137/0209046}
}
@article{mttv-sspnng-97,
author = {G. L. Miller and S. H. Teng and W. P. Thurston and
S. A. Vavasis},
title = {Separators for sphere-packings and nearest neighbor
graphs},
journal = JACM,
volume = 44,
number = 1,
year = 1997,
pages = {1--29},
doi = {10.1145/256292.256294},
}
@article{kg-cgwaceg-92,
author = {M. J. Keil and C. A. Gutwin},
title = {Classes of Graphs Which Approximate the Complete
Euclidean Graph},
journal = DCG,
volume = 7,
year = 1992,
pages = {13--28},
}
@inproceedings{k-aceg-88,
author = {M. J. Keil},
title = {Approximating the Complete Euclidean Graph},
booktitle = SWAT_1988,
year = 1988,
pages = {208--213}
}
@article{dgk-bartc-01,
author = "C. A. Duncan and M. T. Goodrich and S. Kobourov",
title = "Balanced aspect ratio trees: combining the
advantages of k-d trees and octrees",
journal = JALG,
volume = 38,
year = 2001,
pages = "303--333"
}
@inproceedings{fms-aeepw-03,
author = {S. Funke and D. Matijevic and P. Sanders},
title = {Approximating Energy Efficient Paths in Wireless
Multi-hop Networks},
booktitle = ESA_2003,
year = 2003,
pages = {230--241}
}
@article{c-fadsi-88,
author = "B. Chazelle",
title = "A functional approach to data structures and its use
in multidimensional searching",
journal = SICOMP,
volume = 17,
number = 3,
month = jun,
year = 1988,
pages = "427--462"
}
@inproceedings{ahkww-fdcr-06,
author = "B. Aronov and S. {Har-Peled} and C. Knauer and
Y. Wang and C. Wenk",
title = {{Fr\'{e}chet} distance for curves, {R}evisited},
booktitle = ESA_2006,
acceptrate = ESA_2006_AR,
year = 2006,
pages = {52--63}
}
@incollection{a-cgcs-09,
author = {H. Alt},
title = {The Computational Geometry of Comparing Shapes},
booktitle = {Efficient Algorithms: Essays Dedicated to Kurt
Mehlhorn on the Occasion of His 60th Birthday},
year = 2009,
pages = {235--248},
publisher = {Springer-Verlag}
}
@inproceedings{elz-tps-00,
author = {H. Edelsbrunner and D. Letscher and A. Zomorodian},
title = {Topological persistence and simplification},
booktitle = FOCS_2000,
year = 2000,
pages = 454
}
@book{z-tc-05,
author = {A. J. Zomorodian},
title = {Topology for Computing},
year = 2005,
publisher = {Cambridge University Press}
}
@article{degn-tpec-98,
author = "Tamal Dey and H. Edelsbrunner and Sumanta Guha and
Dmitry Nekhayev",
title = "Topology preserving edge contraction. Geometric
combinatorics",
journal = "Publ. Inst. Math. (Beograd) (N.S.)",
volume = 66,
year = 1999,
pages = "23--45"
}
@inproceedings{bksv-rimga-97,
author = {M. de Berg and M. J. Katz and A. F. van der
Stappen and J. Vleugels},
title = "Realistic Input Models for Geometric Algorithms",
booktitle = SOCG_1997,
year = 1997,
pages = "294--303"
}
@book{al-pcg-93,
author = "S. G. Akl and K. A. Lyons",
title = "Parallel Computational Geometry",
publisher = "Prentice Hall",
year = 1993
}
@inproceedings{akmv-sgough-03,
author = {P. K. Agarwal and S. Krishnan and N. H. Mustafa and
S. Venkatasubramanian},
title = {Streaming Geometric Optimization Using Graphics
Hardware},
booktitle = ESA_2003,
year = 2003,
pages = {544--555}
}
@article{olghklp-sgpcg-07,
title = "A Survey of General-Purpose Computation on Graphics
Hardware",
journal = "Computer Graphics Forum",
author = "John D. Owens AND David Luebke AND Naga Govindaraju
AND Mark Harris AND Jens Kruger AND Aaron E. Lefohn
AND Timothy J. Purcell ",
year = 2007,
pages = "80--113",
volume = 26,
number = 1,
}
@inproceedings{bbmdaa-scptf-09,
author = {Pastaki Rad, Milad and Sajedi Badashian, Ali and
Meydanipour, Gelare and Ashurzad Delcheh, Morteza
and Alipour, Mahdi and Afzali, Hamidreza},
title = {A Survey of Cloud Platforms and Their Future},
booktitle = {ICCSA '09: Proceedings of the International
Conference on Computational Science and Its
Applications},
year = 2009,
pages = {788--796}
}
@book{su-hcg-00,
title = "Handbook of Computational Geometry",
editor = "J.-R. Sack and J. Urrutia",
publisher = "North-Holland",
year = 2000
}
@inproceedings{mp-cdtw-99,
author = {M. E. Munich and P. Perona},
title = {Continuous Dynamic Time Warping for
Translation-Invariant Curve Alignment with
Applications to Signature Verification},
booktitle = ICCV_1999,
year = 1999,
pages = {108--115}
}
@inproceedings{skb-fdba-07,
author = {E. Sriraghavendra and K. Karthik and
C. Bhattacharyya},
title = {Fr{\'e}chet Distance Based Approach for Searching
Online Handwritten Documents},
booktitle = ICDAR_2007,
year = 2007,
pages = {461--465}
}
@inproceedings{wsp-anmms-06,
author = "C. Wenk and R. Salas and D. Pfoser",
title = "Addressing the Need for Map-Matching Speed:
Localizing Global Curve-Matching Algorithms",
booktitle = SSDBM_2006,
year = 2006,
pages = "879--888"
}
@article{abg-rsis-08,
author = {B. Aronov and M. de Berg and C. Gray},
title = {Ray shooting and intersection searching amidst fat
convex polyhedra in 3-space},
journal = CGTA,
volume = 41,
number = {1--2},
year = 2008,
pages = {68--76}
}
@article{bkosv-mmp-02,
author = {M. de Berg and M. J. Katz and M. H. Overmars and
{A. F.} {van~der} Stappen and Jules Vleugels},
title = {Models and motion planning},
journal = CGTA,
volume = 23,
number = 1,
year = 2002,
pages = {53--68},
}
@article{gt-salsa-08,
author = {A. Gupta and K. Tangwongsan},
title = {Simpler Analyses of Local Search Algorithms for
Facility Location},
journal = {CoRR},
volume = {abs/0809.2554},
year = 2008,
pages = {arXiv},
ee = {http://arxiv.org/abs/0809.2554},
url = {http://arxiv.org/abs/0809.2554}
}
@article{nz-gmstw-01,
author = {G. Narasimhan and M. Zachariasen},
title = {Geometric Minimum Spanning Trees via Well-Separated
Pair Decompositions},
journal = JEALG,
volume = 6,
year = 2001,
pages = 6
}
@article{aesw-emstb-91,
author = "P. K. Agarwal and H. Edelsbrunner and O. Schwarzkopf
and E. Welzl",
title = "Euclidean minimum spanning trees and bichromatic
closest pairs",
journal = DCG,
volume = 6,
number = 5,
year = 1991,
pages = "407--422"
}
@article{crt-amstw-05,
author = {B. Chazelle and R. Rubinfeld and L. Trevisan},
title = {Approximating the Minimum Spanning Tree Weight in
Sublinear Time},
journal = SICOMP,
volume = 34,
number = 6,
year = 2005,
pages = {1370--1379}
}
@inproceedings{fis-sddsa-05,
author = {G. Frahling and P. Indyk and C. Sohler},
title = {Sampling in dynamic data streams and applications},
booktitle = SOCG_2005,
year = 2005,
pages = {142--149}
}
@article{kln-mstdd-99,
author = {D. Krznaric and C. Levcopoulos and B. J. Nilsson},
title = {Minimum spanning trees in {$d$} dimensions},
journal = NORDIC_J_COMP,
volume = 6,
number = 4,
year = 1999,
pages = {446--461},
}
@inproceedings{bbg-dsfm-08,
author = {K. Buchin and M. Buchin and J. Gudmundsson},
title = {Detecting Single File Movement},
booktitle = SIGSPATIAL_2008,
year = 2008,
pages = {288--297}
}
@inproceedings{bbgll-dcpcs-08,
author = {K. Buchin and M. Buchin and J. Gudmundsson and
Maarten L. and J. Luo},
title = {Detecting Commuting Patterns by Clustering
Subtrajectories},
booktitle = ISAAC_2008,
year = 2008,
pages = {644--655}
}
@inproceedings{bbkrw-wtd-07,
author = {K. Buchin and M. Buchin and C. Knauer and G. Rote
and C. Wenk},
title = {How Difficult is it to Walk the Dog?},
booktitle = EWCG_2007,
year = 2007,
pages = {170--173}
}
@book{z-lp-94,
author = "G. M. Ziegler",
title = "Lectures on Polytopes",
series = "Graduate Texts in Mathematics",
volume = 152,
publisher = "Springer-Verlag",
address = "Heidelberg",
year = 1994
}
@book{g-cp-67,
author = "B. Gr{\"u}nbaum",
title = "Convex Polytopes",
publisher = "John Wiley \& Sons",
year = 1967
}
@book{mg-uulp-06,
title = {Understanding and Using Linear Programming},
author = {J. Matou{\v s}ek and B. G\"{a}rtner},
publisher = {Springer-Verlag},
year = 2006,
url = {http://portal.acm.org/citation.cfm?id=1214763}
}
@article{bcd-npfo-11,
author = {P. Bose and O. Cheong and V. Dujmovi\'{c}},
title = {A Note on the Perimeter of Fat Objects},
journal = CGTA,
volume = 44,
number = 1,
year = 2011,
pages = {1--8}
}
@article{d-ibucfo-08,
author = {M. de Berg},
title = {Improved Bounds on the Union Complexity of Fat
Objects},
journal = DCG,
volume = 40,
number = 1,
year = 2008,
pages = {127--140}
}
@PHDTHESIS{g-cmsbg-99,
author = {M. Godau},
title = {On the complexity of measuring the similarity
between geometric objects in higher dimensions},
school = {Free University of Berlin},
year = 1999
}
@article{ab-cwcsb-10,
author = {H. Alt and M. Buchin},
title = {Can We Compute the Similarity between Surfaces?},
journal = DCG,
volume = 43,
number = 1,
year = 2010,
pages = {78--99}
}
@article{h-riccq-09,
author = {S. {Har-Peled}},
title = {Randomized Incremental Construction of Compressed
Quadtrees},
journal = {CoRR},
volume = {abs/0907.0907},
year = 2009,
ee = {http://arxiv.org/abs/0907.0907}
}
@article{h-astlc-09,
author = {S. {Har-Peled}},
title = {Approximating Spanning Trees with Low Crossing
Number},
journal = {CoRR},
volume = {abs/0907.1131},
year = 2009,
ee = {http://arxiv.org/abs/0907.1131},
url = {http://arxiv.org/abs/0907.1131}
}
@article{h-bffne-09,
author = {S. {Har-Peled}},
title = {Being Fat and Friendly is Not Enough},
journal = {CoRR},
archivePrefix= "arXiv",
eprint = {0908.2369},
primaryClass = "cs.CG",
year = 2009,
ee = {http://arxiv.org/abs/0908.2369}
}
@article{bch-cmfpu-09,
author = {M. de Berg and S. Cabello and S. {Har-Peled}},
title = {Covering Many or Few Points with Unit Disks},
journal = {Theory Comput. Syst.},
volume = 45,
number = 3,
year = 2009,
pages = {446--469},
doi = {10.1007/s00224-008-9135-9}
}
@article{amm-sttan-09,
author = {S. Arya and T. Malamatos and D. M. Mount},
title = {Space-time tradeoffs for approximate nearest
neighbor searching},
journal = JACM,
volume = 57,
number = 1,
year = 2009,
pages = {1--54}
}
@Unpublished{ah-ncsa-09,
author = {M. A. Abam and S. {Har-Peled}},
title = {New Constructions of \textsf{SSPD}s and their
Applications},
note = {\url{http://sarielhp.org/papers/09/sspd/}},
year = 2009
}
@article{ai-nohaa-08,
author = {A. Andoni and P. Indyk},
title = {Near-optimal hashing algorithms for approximate
nearest neighbor in high dimensions},
journal = CACM,
volume = 51,
number = 1,
year = 2008,
pages = {117--122},
doi = {10.1145/1327452.1327494}
}
@inproceedings{ai-nohaa-06,
author = {A. Andoni and P. Indyk},
title = {Near-Optimal Hashing Algorithms for Approximate
Nearest Neighbor in High Dimensions},
booktitle = FOCS_2006,
year = 2006,
pages = {459--468},
doi = {10.1109/FOCS.2006.49},
publisher = {{IEEE} Computer Society}
}
@incollection{c-nnsms-06,
author = {K. L. Clarkson},
editor = {G. Shakhnarovich and T. Darrell and P. Indyk},
title = {Nearest-Neighbor Searching and Metric Space
Dimensions},
booktitle = {Nearest-Neighbor Methods for Learning and Vision:
Theory and Practice},
year = 2006,
pages = {15--59},
publisher = {MIT Press}
}
@inproceedings{mnp-lblsh-06,
author = {R. Motwani and A. Naor and R. Panigrahi},
title = {Lower bounds on locality sensitive hashing},
booktitle = SOCG_2006,
year = 2006,
pages = {154--157},
location = {Sedona, Arizona, USA}
}
@article{mnp-lblsh-07,
author = {R. Motwani and A. Naor and R. Panigrahy},
title = {Lower Bounds on Locality Sensitive Hashing},
journal = {SIAM J. Discrete Math.},
volume = 21,
number = 4,
year = 2007,
pages = {930--935}
}
@book{rh-gsa-01,
author = {A. L. Rosenberg and L. S. Heath},
title = {Graph separators, with applications},
year = 2001,
isbn = {0-306-46464-0},
publisher = {Kluwer Academic Publishers},
address = {Norwell, MA, USA},
}
@InProceedings{a-nllbp-10,
author = {N. Alon},
title = {A non-linear lower bound for planar epsilon-nets},
booktitle = FOCS_2010,
year = 2010
}
@article{a-nllbp-12,
author = {N. Alon},
title = {A Non-linear Lower Bound for Planar Epsilon-nets},
journal = DCG,
year = 2012,
volume = 47,
number = 2,
pages = {235--244},
doi = {10.1007/s00454-010-9323-7}
}
@article{ahsw-hdtpb-10,
author = {P. K. Agarwal and S. {Har-Peled} and M. Sharir and
Y. Wang},
title = {Hausdorff distance under translation for points and
balls},
journal = TALG,
volume = 6,
number = 4,
year = 2010,
pages = {1--26},
doi = {10.1145/1824777.1824791}
}
@inproceedings{bbs-fdsss-10,
author = {K. Buchin and M. Buchin and A. Schulz},
title = {Fr{\'e}chet Distance of Surfaces: Some Simple Hard
Cases},
booktitle = ESA_2010,
year = 2010,
pages = {63--74}
}
@article{hk-annsl-13,
author = {S. {Har-Peled} and N. Kumar},
title = {Approximate Nearest Neighbor Search for
Low-Dimensional Queries},
journal = SICOMP,
year = 2013,
volume = 42,
number = 1,
pages = {138--159},
url = {http://dx.doi.org/10.1137/110852711},
doi = {10.1137/110852711}
}
@article{hk-annsl-10,
author = {S. {Har-Peled} and N. Kumar},
title = {Approximate Nearest Neighbor Search for Low
Dimensional Queries},
journal = {CoRR},
volume = {abs/1007.3296},
year = 2010,
ee = {http://arxiv.org/abs/1007.3296},
}
@inproceedings{gk-nadr-11
,
author = {L.A. Gottlieb and R. Krauthgamer},
title = {A Nonlinear Approach to Dimension Reduction},
booktitle = SODA_2011,
pages = {888--899},
year = {2011}
}
@InProceedings{hk-annsl-11,
author = {S. {Har-Peled} and N. Kumar},
title = {Approximate Nearest Neighbor Search for Low
Dimensional Queries},
booktitle = SODA_2011,
acceptrate = SODA_2011_AR,
pages = {854--867},
year = 2011,
doi = {10.1137/1.9781611973082.67},
}
@article{ov-psmp-04,
author = {R. van Oostrum and R. C. Veltkamp},
title = {Parametric search made practical},
journal = CGTA,
volume = 28,
number = {2-3},
year = 2004,
pages = {75--88}
}
@inproceedings{bbw-eapcm-09,
author = {K. Buchin and M. Buchin and Y. Wang},
title = {Exact algorithms for partial curve matching via the
{Fr{\'e}chet} distance},
booktitle = SODA_2009,
year = 2009,
pages = {645--654}
}
@article{ac-atcfmap-10,
author = {H. Ahn and O. Cheong},
title = {Aligning Two Convex Figures to Minimize Area or
Perimeter},
journal = ALGORITHMICA,
month = {November},
pages = {1--16},
volume = 62,
number = {1--2},
doi = {10.1007/s00453-010-9466-1},
year = 2010
}
@article{sgh-csi-08,
author = {J. Serr{\`a} and E. G{\'o}mez and P. Herrera and
X. Serra},
title = {Chroma Binary Similarity and Local Alignment Applied
to Cover Song Identification},
journal = {IEEE Transactions on Audio, Speech {\&} Language
Processing},
volume = 16,
number = 6,
year = 2008,
pages = {1138--1151}
}
@inproceedings{mdbh-cmpdfd-06,
author = {A. Mascret and T. Devogele and I. Le Berre and
A. H\'{e}naff},
title = {Coastline Matching Process based on the discrete
{Fr\'{e}chet} distance},
booktitle = {Proc. 12th Int. Sym. Spatial Data Handling},
year = 2006,
pages = {383--400}
}
@book{mmy-rs-06,
author = "R. Maronna and D. Martin and V. Yohai ",
title = "Robust Statistics: Theory and Methods",
publisher = "Wiley",
isbn = 0470010924,
year = 2006
}
@article{ay-eeaod-05,
author = {C. Aggarwal and S. Yu},
title = {An effective and efficient algorithm for
high-dimensional outlier detection},
journal = {Int. J. Very Large Data Bases},
volume = 14,
issue = 2,
month = {April},
year = 2005,
pages = {211--221}
}
@inproceedings{hr-fdre-11,
author = {S. {Har-Peled} and B. Raichel},
title = {The {Fr\'{e}chet} Distance Revisited and Extended},
url = {http://sarielhp.org/papers/10/frechet3d/},
booktitle = SOCG_2011,
acceptrate = SOCG_2011_AR,
year = 2011,
pages = {448--457},
publisher = {ACM},
doi = {10.1145/1998196.1998269},
address = {New York, NY, USA}
}
@Unpublished{hr-fdre-11-manuscript,
author = {S. {Har-Peled} and B. Raichel},
title = {The {Fr\'{e}chet} Distance Revisited and Extended},
note = {\url{http://sarielhp.org/papers/10/frechet3d/}},
year = 2011
}
@ARTICLE{hr-fdre-11-arxiv,
author = {{Har-Peled}, S. and {Raichel}, B.},
title = {The {Fr\'{e}chet} Distance Revisited and Extended},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
volume = {abs/1202.5610},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2011
}
@article{hr-fdre-14,
author = {S. {Har-Peled} and B. Raichel},
title = {The {Fr\'{e}chet} Distance Revisited and Extended},
journal = TALG,
year = 2014,
volume = 10,
number = 1,
pages = {3:1--3:22},
articleno = 3,
numpages = 22,
doi = {10.1145/2532646}
}
@article{kn-sjlt-14,
author = {D. M. Kane and J. Nelson},
title = {Sparser Johnson-Lindenstrauss Transforms},
journal = JACM,
year = 2014,
volume = 61,
number = 1,
pages = 4,
doi = {10.1145/2559902}
}
@article{kn-sjlt-10-arxiv,
author = {D.~M. Kane and J. Nelson},
title = {A Sparser {Johnson-Lindenstrauss} Transform},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1012.1577},
primaryClass = "cs.DS",
year = 2010,
month = dec,
note = {\url{http://arxiv.org/abs/1012.1577}}
}
@book{dp-cmara-09,
author = {Devdatt P. Dubhashi and Alessandro Panconesi},
title = {Concentration of Measure for the Analysis of
Randomized Algorithms},
publisher = {Cambridge University Press},
year = {2009},
url =
{http://www.cambridge.org/gb/knowledge/isbn/item2327542/},
isbn = {978-0-521-88427-3},
}
@InCollection{e-spnta-02,
author = {G. Elekes},
title = {Sums versus products in Number Theory, Algebra and
{\Erdos{}} Geometry --- a survey},
booktitle = {Paul {\Erdos{}} and his Mathematics II},
pages = {241--290},
publisher = {Bolyai Math. Soc.},
year = 2002
}
@InCollection{ps-gi-04,
author = {J. Pach and M. Sharir},
title = {Geometric Incidences},
booktitle = {Towards a Theory of Geometric Graphs},
editor = {J. Pach},
series = {Contemporary Mathematics},
volume = 342,
publisher = {Amer. Math. Soc.},
year = 2004,
pages = {185--223}
}
@InProceedings{eas-ibuft-11,
author = {E. Ezra and B. Aronov and M. Sharir},
booktitle = SODA_2005,
title = {Improved Bound for the Union of Fat Triangles},
year = 2011,
pages = {1778--1785}
}
@Unpublished{abes-ibucl-11-del,
author = {B. Aronov and M. de Berg and E. Ezra and
M. Sharir},
title = {Improved bound for the union complexity of locally
fat objects in the plane},
note = {manuscript},
year = 2011
}
@Unpublished{abes-ibufop-11-del,
author = {B. Aronov and M. de Berg and E. Ezra and
M. Sharir},
title = {Improved bound for the union of fat objects in the
plane},
note = {manuscript},
year = 2011
}
@Article{abes-ibulf-14,
author = {B. Aronov and M. de Berg and E. Ezra and M. Sharir},
title = {Improved Bounds for the Union of Locally Fat Objects
in the Plane},
journal = sicomp,
volume = {43},
number = {2},
pages = {543--572},
year = {2014},
url = {http://dx.doi.org/10.1137/120891241},
doi = {10.1137/120891241}
}
@inproceedings{cvz-sfmmm-11,
author = {C. Chekuri and J. Vondr\'{a}k and R. Zenklusen},
title = {Submodular Function Maximization via the Multilinear
Relaxation and Contention Resolution Schemes},
note = {To appear},
booktitle = STOC_2011,
year = 2011
}
@article{aes-ssena-10,
author = {B. Aronov and E. Ezra and M. Sharir},
title = {Small-Size {\(\varepsilon\)}-Nets for Axis-Parallel
Rectangles and Boxes},
journal = SICOMP,
volume = 39,
number = 7,
year = 2010,
pages = {3248--3282},
url = {http://dx.doi.org/10.1137/090762968},
doi = {10.1137/090762968},
}
@inproceedings{dr-fdsc-04,
author = {A. Dumitrescu and G. Rote},
title = {On the {Fr\'echet} Distance of a Set of Curves},
booktitle = CCCG_2004,
year = 2004,
pages = {162--165}
}
@inproceedings{bbklsww-mt-10,
author = {K. Buchin and M. Buchin and {M. van} Kreveld and
M. {L\"offler} and R. I. Silveira and C. Wenk and
L. Wiratma},
title = {Median Trajectories},
booktitle = {Proc. 18th Annual European Symposium on Algorithms
(ESA)},
publisher = {Springer},
year = 2010,
volume = 6346,
pages = {463--474},
doi = {10.1007/978-3-642-15775-2_40}
}
@article{h-q-62,
author = {C. A. R. Hoare},
title = {Quicksort},
journal = {Comput. J.},
volume = 5,
number = 1,
year = 1962,
pages = {10--15}
}
@Book{ws-daa-11,
author = {D. P. Williamson and D. B. Shmoys},
title = {The Design of Approximation Algorithms},
publisher = {Cambridge University Press},
year = 2011
}
@inproceedings{agh-adqcr-11,
author = {R. Agarwal and B. Godfrey and S. {Har-Peled}},
title = {Approximate Distance Queries and Compact Routing in
Sparse Graphs},
year = 2011,
pages = {1754--1762},
booktitle = INFOCOM_2011,
acceptrate = INFOCOM_2011_AR,
doi = {10.1109/INFCOM.2011.5934973},
}
@article{ast-ps-94,
author = "N. Alon and P. Seymour and R. Thomas",
title = "Planar separators",
journal = "SIAM J. Discrete Math.",
volume = 2,
number = 7,
year = 1994,
pages = "184--193"
}
@article{k-mbtdm-91,
author = {V. Kann},
title = {Maximum bounded 3-dimensional matching is MAX
{SNP}-complete},
journal = IPL,
volume = 37,
issue = 1,
month = {January},
year = 1991,
pages = {27--35}
}
@article{mr-irghs-10,
author = {Nabil H. Mustafa and Saurabh Ray},
title = {Improved Results on Geometric Hitting Set Problems},
journal = DCG,
volume = {44},
number = {4},
pages = {883--895},
year = {2010},
doi = {10.1007/s00454-010-9285-9}
}
@article{ccj-udg-90,
author = {B. N. Clark and C. J. Colbourn and D. S. Johnson},
title = {Unit disk graphs},
journal = {Discrete Math.},
volume = 86,
year = 1990,
pages = {165--177}
}
@inproceedings{fp-cinig-11,
author = {J. Fox and J. Pach},
title = {Computing the Independence Number of Intersection
Graphs},
booktitle = SODA_2011,
year = 2011,
pages = {1161--1165}
}
@Unpublished{dh-jydfd-10,
author = {A. Driemel and S. {Har-Peled}},
title = {Jaywalking your Dog -- The {Fr\'{e}chet} Distance
with Shortcuts for Realistic Curves with Noise},
note = {\url{http://sarielhp.org/papers/10/shortcut/}},
year = 2010
}
@article{mssz-fdsl-11,
author = {A. Maheshwari and J.-R. Sack and K. Shahbaz and
H. Zarrabi-Zadeh},
title = {Fr\'{e}chet distance with speed limits},
journal = "Computational Geometry",
volume = 44,
number = 2,
pages = "110--120",
year = 2011,
note = "Special issue of selected papers from the 21st
Annual Canadian Conference on Computational
Geometry",
}
@inproceedings{cdgnw-amm-11,
author = {D. Chen and A. Driemel and L. Guibas and A. Nguyen
and C. Wenk},
title = {Approximate Map Matching with respect to the
{Fr\'{e}chet} Distance},
booktitle = ALENEX_2011,
year = 2011
}
@article{cc-ccopd-07,
author = {M. Chleb\'{\i}k and J. Chleb\'{\i}kov{\'a}},
title = {The Complexity of Combinatorial Optimization
Problems on {$d$}-Dimensional Boxes},
journal = {SIAM J. Discrete Math.},
volume = 21,
number = 1,
year = 2007,
pages = {158--169}
}
@InProceedings{cg-eaahr-11-old,
author = {T. M. Chan and E. Grant},
title = {Exact Algorithms and {APX}-Hardness Results for
Geometric Set Cover},
booktitle = CCCG_2011,
year = 2011
}
@article{cg-eaahr-14,
author = {Timothy M. Chan and Elyot Grant},
title = {Exact algorithms and {APX}-hardness results for
geometric packing and covering problems},
journal = CGTA,
volume = {47},
number = {2},
pages = {112--124},
year = {2014},
doi = {10.1016/j.comgeo.2012.04.001}
}
@book{o-ddds-83,
author = "M. H. Overmars",
title = "The Design of Dynamic Data Structures",
series = LNCS,
volume = 156,
publisher = "Springer-Verlag",
address = "Heidelberg, West Germany",
year = 1983,
keywords = "book"
}
@article{bcg-ffq-13,
author = {M. de Berg and A. F. Cook IV and J. Gudmundsson},
title = {Fast Fr{\'e}chet queries},
journal = CGTA,
volume = 46,
number = 6,
year = 2013,
pages = {747--755}
}
@inproceedings{bcg-ffq-11,
author = {M. de Berg, A. Cook IV, J. Gudmundsson},
title = {Fast Fr\'{e}chet Queries},
booktitle = ISAAC_2011,
year = 2011,
note = {to appear}
}
@article{cg-shdsp-09,
author = {T.-H. H. Chan and A. Gupta},
title = {Small Hop-diameter Sparse Spanners for Doubling
Metrics},
journal = DCG,
volume = 41,
number = 1,
year = 2009,
pages = {28--44},
}
@article{c-tpfgn-08,
author = {B. Chazelle},
title = {Technical perspective: finding a good neighbor, near
and fast},
journal = CACM,
volume = 51,
number = 1,
year = 2008,
pages = 115
}
@book{s-desda-86,
title = {Density estimation for statistics and data analysis},
author = {B.W. Silverman},
series = {Monographs on statistics and applied probability},
year = 1986,
publisher = {Chapman and Hall}
}
@inproceedings{c-opt-10,
author = {T. M. Chan},
title = {Optimal partition trees},
booktitle = SOCG_2010,
year = 2010,
pages = {1--10},
}
@inproceedings{amm-sttas-05,
author = {S. Arya and T. Malamatos and D. M. Mount},
title = {Space-time tradeoffs for approximate spherical range
counting},
booktitle = SODA_2005,
year = 2005,
pages = {535-544}
}
@article{bhst-sqgqi-10,
author = {M. de Berg and H. Haverkort and S. Thite and
L. Toma},
title = {Star-quadtrees and guard-quadtrees: {I/O}-efficient
indexes for fat triangulations and low-density
planar subdivisions},
journal = CGTA,
volume = 43,
issue = 5,
month = {July},
year = 2010,
pages = {493--513},
numpages = 21
}
@article{cdellt-wydwpt-10,
author = {E. W. Chambers and E. {Colin de Verdi{\`e}re} and
J. Erickson and S. Lazard and F. Lazarus and
S. Thite},
title = {Homotopic Fr{\'e}chet distance between curves or,
walking your dog in the woods in polynomial time},
journal = CGTA,
volume = 43,
number = 3,
year = 2010,
pages = {295--311}
}
@inproceedings{cdellt-wydwpt-08-conf,
author = {E. W. Chambers and E. C. de Verdi\`{e}re and
J. Erickson and S. Lazard and F. Lazarus and
S. Thite},
title = {Walking your dog in the woods in polynomial time},
booktitle = SOCG_2008,
year = 2008,
isbn = {978-1-60558-071-5},
location = {College Park, MD, USA},
pages = {101--109},
numpages = 9,
doi = {10.1145/1377676.1377694},
acmid = 1377694,
keywords = {geodesic leash map, homotopic fr\'{e}chet distance},
}
@inproceedings{cl-hh-09,
author = {E. W. Chambers and D. Letscher},
title = {On the Height of a Homotopy},
booktitle = CCCG_2009,
year = 2009
}
@unpublished{cl-ehh-10,
author = {E. W. Chambers and D. Letscher},
title = {Erratum for On the Height of a Homotopy},
url =
{http://mathcs.slu.edu/~chambers/papers/hherratum.pdf},
note =
{\url{http://mathcs.slu.edu/~chambers/papers/hherratum.pdf}},
year = 2010
}
@techreport{em-cdfd-94,
author = {T. Eiter and H. Mannila},
title = {Computing discrete {\Frechet{}} distance},
type = "Tech. Report",
number = {CD-TR 94/64},
institution = {Christian Doppler Lab. Expert Sys., TU Vienna},
address = {Austria},
year = 1994
}
@article{cw-gfdis-10,
author = {A. F. Cook and C. Wenk},
title = {Geodesic {Fr{\'e}chet} Distance Inside a Simple
Polygon},
volume = 7,
issue = 1,
year = 2010,
pages = {9:1--9:19},
articleno = 9,
journal = TALG
}
@article{f-psast-97,
author = "M. S. Floater",
title = "Parameterization and smooth approximation of surface
triangulations",
journal = "Comput. Aided Geom. Design",
volume = 14,
number = 4,
year = 1997,
pages = "231--250"
}
@inproceedings{ss-spmtf-00,
author = "A. Sheffer and E. de Sturler",
title = "Surface parameterization for meshing by
triangulation flattening",
booktitle = "Proc. 9th International Meshing Roundtable",
pages = "161--172",
year = 2000
}
@inproceedings{abt-cbvdrt-08,
author = {B. Aronov and M. de Berg and S. Thite},
title = {The Complexity of Bisectors and {Voronoi} Diagrams
on Realistic Terrains},
booktitle = ESA_2008,
publisher = {Springer},
address = {Berlin, Heidelberg},
year = 2008,
pages = {100-111}
}
@article{ajt-vbra-01,
author = {H. Alani and C. B. Jones and D. Tudhope},
title = {{Voronoi}-based region approximation for
geographical information retrieval with gazetteers},
journal = {Int. J. of Geo. Inf. Sci.},
volume = 15,
number = 4,
pages = {287--306},
year = 2001
}
@inproceedings{dg-tsvdg-08,
author = {M. T. Dickerson and M. T. Goodrich},
title = {Two-site {Voronoi} diagrams in geographic networks},
booktitle = {Proc. 16th ACM SIGSPATIAL int. conf. on
Adv. geo. inf. sys.},
series = {GIS '08},
year = 2008,
pages = {59:1--59:4},
publisher = {ACM},
address = {New York, NY, USA},
}
@inproceedings{pa-cnmwv-06,
author = {J.N. Portela and M.S. Alencar},
booktitle = {Consum. Comm. Net. Conf.},
title = {Cellular network as a multiplicatively weighted
{Voronoi} diagram},
year = 2006,
volume = 2,
pages = {913---917},
publisher = {IEEE},
address = {Washington, DC, USA}
}
@article{cg-frn-10,
author = {R. Cavalli and S. Grigolato},
title = {Influence of characteristics and extension of a
forest road network on the supply cost of forest
woodchips},
journal = {J. Forest Res.},
publisher = {Springer Japan},
pages = {202--209},
volume = 15,
note = {10.1007/s10310-009-0170-4},
year = 2010
}
@article{ts-mpgvd-89,
author = {O. Takahashi and R.J. Schilling},
journal = {IEEE Trans. Robot. Auto.},
title = {Motion planning in a plane using generalized
{Voronoi} diagrams},
year = 1989,
month = {apr},
volume = 5,
number = 2,
pages = {143--150}
}
@inproceedings{kwr-gvdps-97,
author = {R. Kunze and F.-E. Wolter and T. Rausch},
booktitle = {Proc. of Comp. Graph. Int.},
title = {Geodesic {Voronoi} diagrams on parametric surfaces},
year = 1997,
pages = {230--237},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@article{sf-clssf-04,
author = {G. Stylianou and G. Farin},
journal = {IEEE Trans. Vis. Comp. Graphics},
title = {Crest lines for surface segmentation and flattening},
year = 2004,
volume = 10,
number = 5,
pages = {536--544}
}
@article{wdy-paadm-08,
author = {O. Weber and Y. S. Devir and A. M. Bronstein and
M. M. Bronstein and R. Kimmel},
title = {Parallel algorithms for approximation of distance
maps on parametric surfaces},
journal = {ACM Trans. Graph.},
volume = 27,
month = {November},
year = 2008,
pages = {104:1--104:16},
publisher = {ACM}
}
@ARTICLE{jn-osdpv-04,
author = {F. {Jarai-Szabo} and Z. {Neda}},
title = {On the size-distribution of {Poisson} {Voronoi}
cells},
journal = {CoRR},
volume = {abs/cond-mat/0406116},
ee = {http://arxiv.org/abs/cond-mat/0406116},
keywords = {Condensed Matter - Soft Condensed Matter, Condensed
Matter - Statistical Mechanics},
year = 2004,
numpages = 12,
month = jun,
articleno = 0406116,
adsurl = {http://adsabs.harvard.edu/abs/2004cond.mat..6116J},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@book{d-csra-11,
title = {Curve and Surface Reconstruction: Algorithms with
Mathematical Analysis},
author = {Dey, T.K.},
isbn = 9780521175180,
series = {Cambridge Monographs on Applied and Computational
Mathematics},
url = {http://books.google.com/books?id=HriFSQAACAAJ},
year = 2011,
publisher = {Cambridge University Press},
address = "Cambridge, UK",
}
@inproceedings{deg-eeg-08,
author = {O. Devillers and J. Erickson and X. Goaoc},
title = {Empty-ellipse graphs},
booktitle = SODA_2008,
series = {SODA '08},
year = 2008,
pages = {1249--1257},
publisher = {SIAM},
address = {Philadelphia, PA, USA},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347218}
}
@article{mks-ort-08,
author = {E. Moet and {M. J. van} Kreveld and {A. F. van der}
Stappen},
title = {On realistic terrains},
journal = CGTA,
volume = 41,
number = {1-2},
year = 2008,
pages = {48--67}
}
@phdthesis{m-ccvge-08,
author = {E. Moet},
title = {Computation and Complexity of Visibility in
Geometric Environments},
school = {Utrecht University},
year = 2008
}
@article {ss-spcp-08,
author = {Y. Schreiber and M. Sharir},
title = {An Optimal-Time Algorithm for Shortest Paths on a
Convex Polytope in Three Dimensions},
journal = DCG,
pages = {500--579},
volume = 39,
issue = 1,
year = 2008
}
@inproceedings{s-sprp-07,
author = {Y. Schreiber},
title = {Shortest paths on realistic polyhedra},
booktitle = SOCG_2007,
year = 2007,
pages = {74--83},
publisher = {ACM},
address = {New York, NY, USA},
}
@techreport{c-sofl-99,
author = {P. Cappanera},
title = {A Survey on Obnoxious Facility Location Problems},
year = 1999,
institution = {University of Pisa}
}
@article{t-oflg-91,
author = {A. Tamir},
title = {Obnoxious Facility Location on Graphs},
journal = {SIAM J. Discrete Math.},
volume = 4,
number = 4,
year = 1991,
pages = {550--567}
}
@inproceedings{v-wgscq-10,
author = {K. Varadarajan},
title = {Weighted geometric set cover via quasi-uniform
sampling},
booktitle = STOC_2010,
year = 2010,
pages = {641--648}
}
@book{smcscg-nacps-07,
author = {Szab\'{o}, P. G. and Mark\'{o}t, M. Cs. and Csendes,
T. and Specht, E. and Casado, L. G. and Garc\~{a}a,
I.},
title = {New Approaches to Circle Packing in a Square: With
Program Codes (Springer Optimization and Its
Applications)},
year = 2007,
publisher = {Springer-Verlag New York, Inc.},
}
@InProceedings{s-nacpp-01,
title = {New approaches to covering and packing problems},
author = {A. Srinivasan},
booktitle = SODA_2001,
pages = {567--576},
year = 2001
}
@article{ehr-gpnuc-11,
author = {A. Ene and S. {Har-Peled} and B. Raichel},
title = {Geometric Packing under Non-uniform Constraints},
year = 2011,
journal = {CoRR},
volume = {abs/1107.2949},
ee = {http://arxiv.org/abs/1107.2949}
}
@article{cvz-sfmmm-11-arxiv,
author = {C. Chekuri and J. Vondr{\'a}k and R. Zenklusen},
title = {Submodular Function Maximization via the Multilinear
Relaxation and Contention Resolution Schemes},
journal = {CoRR},
volume = {abs/1105.4593},
year = 2011,
ee = {http://arxiv.org/abs/1105.4593},
note = {Preliminary version in STOC 2011}
}
@article{ccelw-scsh-08,
author = {W. W. Chambers and E. C. de Verdi\`{e}re and
J. Erickson and F. Lazarus and K. Whittlesey},
title = {Splitting (complicated) surfaces is hard},
journal = CGTA,
volume = 41,
issue = {1-2},
month = {October},
year = 2008,
pages = {94--110},
numpages = 17,
url = {http://dl.acm.org/citation.cfm?id=1377029.1377082},
doi = {10.1016/j.comgeo.2007.10.010}
}
@inproceedings{dl-clt-09,
author = {T. K. Dey. and K. Li},
title = {Cut locus and topology from surface point data},
booktitle = {Proceedings of the 25th annual symposium on
Computational geometry},
series = SOCG_2009,
year = 2009,
location = {Aarhus, Denmark},
pages = {125--134},
doi = {10.1145/1542362.1542390}
}
@inproceedings{ew-ghhg-05,
author = {J. Erickson and K. Whittlesey},
title = {Greedy optimal homotopy and homology generators},
booktitle = SODA_2005,
series = {SODA '05},
year = 2005,
location = {Vancouver, British Columbia},
pages = {1038--1046},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070581}
}
@inproceedings{gmm-wkd-11,
author = {L. J. Guibas and Q. M{\'e}rigot and D. Morozov},
title = {Witnessed {$k$}-distance},
booktitle = SOCG_2011,
year = 2011,
pages = {57--64}
}
@inproceedings{ak-psotd-01,
author = {O. Aichholzer and H. Krasser},
title = {The point set order type data base: A collection of
applications and results},
booktitle = CCCG_2001,
year = 2001,
pages = {17--20}
}
@article{bp-onclp-92,
author = {I. B{\'a}r{\'a}ny and J. Pach},
title = {On the Number of Convex Lattice Polygons},
journal = {Comb., Prob. Comput.},
volume = 1,
year = 1992,
pages = {295--302}
}
@book{dpv-a-08,
author = {S. Dasgupta and C. H. Papadimitriou and
U. V. Vazirani},
title = {Algorithms},
publisher = {McGraw-Hill},
year = 2008
}
@article{hs-asdch-92,
author = {J. Hershberger and S. Suri},
title = {Applications of a Semi-Dynamic Convex Hull
Algorithm},
journal = {BIT},
volume = 32,
number = 2,
year = 1992,
pages = {249--267}
}
@article{v-srnle-92,
author = "P. Valtr",
title = "Sets in {${\Re}^d$} with No Large Empty Convex
Subsets",
journal = "Discrete Appl. Math.",
volume = 108,
year = 1992,
pages = "115--124"
}
@article{bf-eses-87,
author = "I. B{\'a}r{\'a}ny and Z. F{\"u}redi",
title = "Empty simplices in {Euclidean} space",
journal = "Canad. Math. Bull.",
volume = 30,
year = 1987,
pages = "436--445"
}
@article{h-snec7-83,
author = "J. D. Horton",
title = "Sets with no empty convex {$7$}-gons",
journal = "Canad. Math. Bull.",
volume = 26,
year = 1983,
pages = "482--484"
}
@inproceedings{ckmsv-tpig-10,
author = {J. Cibulka and J. Kyn\v{c}l and V. M{\'e}sz{\'a}ros
and R. Stola\v{r} and P. Valtr},
title = {On Three Parameters of Invisibility Graphs},
booktitle = COCOON_2010,
year = 2010,
pages = {192--198}
}
@article{lm-fscfu-09,
author = {J. Lawrence and W. Morris},
title = {Finite Sets as Complements of Finite Unions of
Convex Sets},
journal = DCG,
volume = 42,
issue = 2,
month = {May},
year = 2009,
pages = {206--218},
numpages = 13
}
@article{dj-oleap-09,
author = {A. Dumitrescu and M. Jiang},
title = {On the largest empty axis-parallel box amidst {$n$}
points},
journal = {CoRR},
volume = {abs/0909.3127v2},
year = 2009
}
@inproceedings{bk-mbers-10,
author = {J. Backer and J. M. Keil},
title = {The Mono- and Bichromatic Empty Rectangle and Square
Problems in All Dimensions},
booktitle = LATIN_2010,
year = 2010,
pages = {14--25}
}
@article{k-ndot-80,
author = "D. G. Kirkpatrick",
title = "A note on {Delaunay} and optimal triangulations",
journal = IPL,
volume = 10,
number = 3,
year = 1980,
pages = "127--128",
keywords = "triangulations, Delaunay triangulations, worst-case
analysis"
}
@inproceedings{cd-dpicp-79,
author = "B. Chazelle and D. P. Dobkin",
title = "Decomposing a polygon into its convex parts",
booktitle = STOC_1979,
year = 1979,
pages = "38--48"
}
@article{eorw-fmakg-92,
author = "D. Eppstein and M. H. Overmars and G. Rote and
G. Woeginger",
title = "Finding minimum area {$k$}-gons",
journal = DCG,
volume = 7,
year = 1992,
pages = "45--58",
keywords = "optimization, reporting"
}
@article{dt-mwcsp-11,
author = {A. Dumitrescu and Cs. D. T{\'o}th},
title = {Minimum Weight Convex Steiner Partitions},
journal = {Algorithmica},
volume = 60,
number = 3,
year = 2011,
pages = {627--652}
}
@article{s-fpaoc-08,
author = {A. Spillner},
title = {A fixed parameter algorithm for optimal convex
partitions},
journal = {J. Discrete Alg.},
volume = 6,
issue = 4,
month = {December},
year = 2008,
pages = {561--569},
numpages = 9
}
@inproceedings{gl-fpamn-04,
author = {M. Grantson and C. Levcopoulos},
title = {A Fixed Parameter Algorithm for the Minimum Number
Convex Partition Problem},
booktitle = JCDCG_2004,
year = 2004,
pages = {83--94},
crossref = {akt-jcdcg-05}
}
@proceedings{akt-jcdcg-05,
editor = {J. Akiyama and M. Kano and X. Tan},
title = JCDCG_2004,
publisher = {Springer},
series = {LNCS},
volume = 3742,
year = 2005
}
@book{cfg-upg-91,
author = "H. P. Croft and K. J. Falconer and R. K. Guy",
title = "Unsolved Problems in Geometry",
publisher = "Springer-Verlag",
series = "Unsolved Problems in Intuitive Mathematics",
volume = {II},
year = 1991
}
@article{abfk-pswen-92,
author = {N. Alon and I. B{\'a}r{\'a}ny and Z. F{\"u}redi and
D. J. Kleitman},
title = {Point Selections and Weak {\(\varepsilon\)}-Nets for
Convex Hulls},
journal = {Combin. Prob. Comput.},
volume = 1,
year = 1992,
pages = {189--200}
}
@article{fmr-mcpcp-01,
author = {T. Fevens and H. Meijer and D. Rappaport},
title = {Minimum convex partition of a constrained point set},
journal = {Discrete Appl. Math.},
volume = 109,
issue = {1-2},
month = {April},
year = 2001,
issn = {0166-218X},
pages = {95--107}
}
@inproceedings{gn-ppslm-06,
author = "J. {Garc\'ia-L\'opez} and C. Nicol\'as",
title = "Planar point sets with large minimum convex
partitions",
booktitle = EWCG_2006,
year = 2006,
pages = {51--54}
}
@inproceedings{su-cppsp-09,
author = {T. Sakai and J. Urrutia},
title = {Convex decompositions of point sets in the plane},
booktitle = {Proc. 7th Japan Conf. on Comput. Geom. and Graphs},
year = 2009
}
@inproceedings{ks-aamcp-06,
author = {C. Knauer and A. Spillner},
title = {Approximation Algorithms for the Minimum Convex
Partition Problem},
booktitle = SWAT_2006,
year = 2006,
pages = {232--241},
crossref = {af-swat-06}
}
@proceedings{af-swat-06,
editor = {L. Arge and R. Freivalds},
booktitle = {Proc. 10th Scand. Workshop Algorithm Theory},
publisher = {Springer},
series = {LNCS},
volume = 4059,
year = 2006,
isbn = {3-540-35753-X},
}
@article{nru-ncdsp-04,
author = {V. {Neumann-Lara} and E. {Rivera-Campo} and
J. Urrutia},
title = {A Note on Convex Decompositions of a Set of Points
in the Plane},
journal = {Graphs Combin.},
volume = 20,
number = 2,
year = 2004,
pages = {223--231}
}
@inproceedings{pt-pqrpd-11,
author = {J. Pach and G. Tardos},
title = {Piercing Quasi-Rectangles: On a Problem of Danzer
and Rogers},
booktitle = WADS_2011,
year = 2011,
pages = 654,
crossref = {DBLP:conf/wads/2011},
}
@proceedings{DBLP:conf/wads/2011,
editor = {F. Dehne and J. Iacono and J.-R. Sack},
booktitle = "Proc. 12th Workshop Algorithms Data Struct.",
publisher = {Springer},
series = {LNCS},
volume = 6844,
year = 2011
}
@article{bw-pd-71,
author = {R. P. Bambah and A. C. Woods},
title = {On a problem of Danzer},
journal = {Pacific J. Math.},
volume = 37,
Number = 2,
year = 1971,
pages = {295--301}
}
@book{bc-id-87,
author = {J. Beck and W. Chen},
title = {Irregularities of Distributions},
volume = 89,
series = {Cambridge Tracts in Mathematics},
publisher = {Cambridge University Press},
year = 1987
}
@incollection{fp-tfsep-92,
author = {Z. F\"uredi and J. Pach},
title = {Traces of finite sets: extremal problems and
geometric applications},
year = 1992,
volume = 3,
series = {Bolyai Society Mathematical Studies},
booktitle = {Extremal Problems for Finite Sets},
editors = {P. Frankl and Z. F\"uredi and G. Katona and
D. Mikl\'os},
pages = {251--282},
publisher = {J\'anos Bolyai Mathematical Society},
address = {Budapest}
}
@article{ckx-iubvc-10,
author = {J. Chen and I. A. Kanj and G. Xia},
title = {Improved upper bounds for vertex cover},
journal = {Theor. Comput. Sci.},
volume = 411,
number = {40-42},
year = 2010,
pages = {3736--3756}
}
@article{him-anntr-12,
author = "S. {Har-Peled} and P. Indyk and R. Motwani",
title = "Approximate Nearest Neighbors: {Towards} Removing
the Curse of Dimensionality",
journal = {Theory Comput.},
pages = {321--350},
articleno = 14,
volume = 8,
year = 2012,
doi = {10.4086/toc.2012.v008a014},
note = {Special issue in honor of Rajeev Motwani}
}
@article{hnss-hwydm-16,
author = {Sariel Har{-}Peled and
Amir Nayyeri and
Mohammad R. Salavatipour and
Anastasios Sidiropoulos},
title = {How to Walk Your Dog in the Mountains with No Magic Leash},
journal = DCG,
volume = {55},
number = {1},
pages = {39--73},
year = {2016},
url = {http://dx.doi.org/10.1007/s00454-015-9737-3},
doi = {10.1007/s00454-015-9737-3},
}
@Unpublished{hnss-hwydm-12-old,
author = {S. {Har-Peled} and A. Nayyeri and M. Salavatipour
and A. Sidiropoulos.},
title = {How to Walk Your Dog in the Mountains with No Magic
Leash},
note = {\url{http://sarielhp.org/papers/11/homotopy/}},
year = 2012
}
@article{fhl-iaamw-08,
author = {U. Feige and M. Hajiaghayi and J. R. Lee},
title = {Improved Approximation Algorithms for Minimum Weight
Vertex Separators},
journal = SICOMP,
volume = 38,
number = 2,
year = 2008,
pages = {629--657}
}
@article{bs-arsbsp-06,
author = {M. de Berg and M. Streppel},
title = "Approximate range searching using binary space
partitions",
journal = CGTA,
volume = 33,
number = 3,
pages = "139--151",
year = 2006,
}
@article{abh-sals-10,
author = {M. Abam and M. de Berg and P. Hachenberger and
A. Zarei},
title = {Streaming Algorithms for Line Simplification},
journal = DCG,
pages = {497--515},
volume = 43,
issue = 3,
year = 2010
}
@inproceedings{bjwyz-spcdfd-08,
author = {S. Bereg and M. Jiang and W. Wang and B. Yang and
B. Zhu},
title = {Simplifying 3D polygonal chains under the discrete
Fr\'{e}chet distance},
booktitle = LATIN_2008,
year = 2008,
pages = {630--641}
}
@article{bbfr-lrufa-04,
author = {R. Bar-Yehuda and K. Bendel and A. Freund and
D. Rawitz},
title = {Local ratio: A unified framework for approximation
algorithms. In Memoriam: Shimon Even 1935-2004},
journal = {ACM Comput. Surv.},
volume = 36,
issue = 4,
month = {December},
year = 2004,
pages = {422--463},
}
@article{DBLP:journals/talg/ChekuriCH12,
author = {Chandra Chekuri and Kenneth L. Clarkson and Sariel
Har-Peled},
title = {On the set multicover problem in geometric settings},
journal = {ACM Transactions on Algorithms},
doi = {10.1145/2390176.2390185}
}
@article{cch-smcpg-12,
author = {C. Chekuri and K. Clarkson and S. {Har-Peled}},
title = {On the set Multi-Cover Problem in Geometric
Settings},
volume = 9,
number = 1,
pages = 9,
journal = TALG,
url = {http://sarielhp.org/papers/08/multi_cover},
year = 2012
}
@article{hl-wgscp-12,
author = {S. {Har-Peled} and M. Lee},
title = {Weighted Geometric Set Cover Problems Revisited},
journal = JOCG,
volume = 3,
number = 1,
pages = {65--85},
url = {http://sarielhp.org/papers/08/expand_cover/},
year = 2012
}
@article{hk-drhrp-11-arxiv,
author = {S. {Har-Peled} and N. Kumar},
title = {Down the Rabbit Hole: Robust Proximity Search in
Sublinear Space},
journal = {CoRR},
volume = {abs/1111.2942},
url = {http://arxiv.org/abs/1111.2942},
year = 2011
}
@article{hk-drhrp-14,
author = {S. {Har-Peled} and N. Kumar},
title = {Down the Rabbit Hole: Robust Proximity Search in
Sublinear Space},
journal = SICOMP,
year = 2014,
volume = 43,
number = 4,
pages = {1486--1511},
doi = {10.1137/130916448},
}
@inproceedings{hk-drhrp-12,
author = {S. {Har-Peled} and N. Kumar},
booktitle = FOCS_2012,
acceptrate = FOCS_2012_AR,
title = {Down the Rabbit Hole: Robust Proximity Search in
Sublinear Space},
year = 2012,
pages = {430--439},
doi = {10.1109/FOCS.2012.31},
}
@article{dht-mcpme-11,
author = {A. Dumitrescu and S. {Har-Peled} and C. D. T{\'o}th},
title = {Minimum Convex Partitions and Maximum Empty
Polytopes},
journal = {CoRR},
volume = {abs/1112.1124},
year = 2011,
ee = {http://arxiv.org/abs/1112.1124},
}
@inproceedings{dht-mcpme-12,
author = {A. Dumitrescu and S. {Har-Peled} and C. D. T{\'o}th},
title = {Minimum Convex Partitions and Maximum Empty
Polytopes},
pages = {213--224},
year = 2012,
booktitle = SWAT_2012,
acceptrate = SWAT_2012_AR,
volume = 7357,
series = LNCS,
editor = {F. Fomin and P. Kaski},
doi = {10.1007/978-3-642-31155-0_19},
}
@article{dhr-oecvd-11,
author = {A. Driemel and S. {Har-Peled} and B. Raichel},
title = {On the Expected Complexity of {Voronoi} Diagrams on
Terrains},
journal = {CoRR},
volume = {abs/1112.0695},
year = 2011,
ee = {http://arxiv.org/abs/1112.0695}
}
@inproceedings{el-pwscu-10,
author = {T. Erlebach and E. J. van Leeuwen},
title = {{PTAS} for Weighted Set Cover on Unit Squares},
booktitle = APPROX_2010,
year = 2010,
pages = {166--177}
}
@inproceedings{cgks-wcpgs-12,
author = {T. M. Chan and E. Grant and J. K{\"o}nemann and
M. Sharpe},
title = {Weighted capacitated, priority, and geometric set
cover via improved quasi-uniform sampling},
booktitle = SODA_2012,
year = 2012,
pages = {1576--1585}
}
@article{ah-ncsa-12,
author = {M. A. Abam and S. {Har-Peled}},
title = {New Constructions of \textsf{SSPD}s and their
Applications},
journal = CGTA,
volume = 45,
number = "5--6",
pages = "200--214",
year = 2012,
doi = {10.1016/j.comgeo.2011.12.003},
ynote = "Special issue for SoCG 2012",
keywords = "Geometric spanners",
keywords = "Separated pair decomposition",
keywords = "Separators"
}
@book{bpr-arag-06,
author = {S. Basu and R. Pollack and M. F. Roy},
title = {Algorithms in Real Algebraic Geometry},
series = {Algorithms and Computation in Mathematics},
publisher = {Springer},
year = 2006,
doi = {10.1007/3-540-33099-2}
}
@article{tz-ado-05,
author = {M. Thorup and U. Zwick},
title = {Approximate distance oracles},
journal = JACM,
volume = 52,
number = 1,
year = 2005,
pages = {1--24}
}
@inproceedings{tz-crs-01,
author = "M.~Thorup and U.~Zwick",
title = "Compact Routing Schemes",
booktitle = SPAA_2001,
address = "Crete Island, Greece",
month = "July",
year = 2001,
pages = "1--10"
}
@article{t-usssp-99,
author = {M. Thorup},
title = {Undirected single-source shortest paths with
positive integer weights in linear time},
journal = {J. ACM},
volume = 46,
number = 3,
month = may,
year = 1999,
pages = {362--394}
}
@inproceedings{pbcg-fspde-09,
author = {M. Potamias and F. Bonchi and C. Castillo and
A. Gionis},
title = {Fast shortest path distance estimation in large
networks},
booktitle = CIKM_2009,
series = {CIKM '09},
year = 2009,
location = {Hong Kong, China},
pages = {867--876}
}
@misc{c-caida-09,
author = "CAIDA",
title = {The Cooperative Association for Internet Data
Analysis},
howpublished = "\url{http://www.caida.org/home/}",
year = 2009
}
@inproceedings{socialnd1,
author = "Yong-Yeol~Ahn and Seungyeop~Han and Haewoon~Kwak and
Sue Moon and Hawoong Jeong",
title = "Analysis of topological characteristics of huge
online social networking services",
booktitle = "Proc. {ACM} International Conference on World Wide
Web {(WWW)}",
address = "Alberta, Canada",
month = "May",
year = 2007,
pages = "835-844"
}
@inproceedings{ahkmj-atcho-07,
author = {Y.Y. Ahn and S. Han and H. Kwak and S. Moon and
H. Jeong},
title = {Analysis of topological characteristics of huge
online social networking services},
booktitle = WWW_2007,
year = 2007,
location = {Banff, Alberta, Canada},
pages = {835--844}
}
@article{zbps-coifr-02,
author = "Y. Zhang and L. Breslau and V. Paxson and
S. Shenker",
title = {On the characteristics and origins of internet flow
rates},
journal = {SIGCOMM Comput. Commun. Rev.},
volume = 32,
issue = 4,
month = {August},
year = 2002,
issn = {0146-4833},
pages = {309--322},
numpages = 14
}
@inproceedings{sgfir-srfn-10,
author = {A. Singla and P. B. Godfrey and K. Fall and
G. Iannaccone and S. Ratnasamy},
title = {Scalable routing on flat names},
booktitle = CoNEXT_2010,
year = 2010,
location = {Philadelphia, Pennsylvania},
pages = {20:1--20:12},
articleno = 20,
numpages = 12
}
@inproceedings{svy-dosg-09,
author = "C.~Sommer and E.~Verbin and W.~Yu",
title = "Distance Oracles for Sparse Graphs",
booktitle = FOCS_2009,
address = "Georgia, USA",
year = 2009,
pages = "703--712",
doi = {10.1109/FOCS.2009.27}
}
@inproceedings{pr-dobtzb-10,
author = "M.~P{\v a}tra{\c s}cu and L.~Roditty",
title = "Distance Oracles Beyond the {T}horup-{Z}wick Bound",
booktitle = FOCS_2010,
address = "Nevada, USA",
year = 2010,
pages = "815--823"
}
@inproceedings{gp-mrrdn-96,
author = "C.~Gavoille and S.~Perennes",
title = "Memory requirement for Routing in Distributed
Networks",
booktitle = PODC_1996,
address = "Pennsylvania, USA",
year = 1996,
pages = "125--133"
}
@inproceedings{fg-lmrur-96,
author = "P.~Fraigniaud and C.~Gavoille",
title = "Local memory requirement of universal routing
schemes",
booktitle = SPAA_1996,
address = "Padua, Italy",
year = 1996,
pages = "183--188"
}
@inproceedings{fg-mrurs-95,
author = "P.~Fraigniaud and C.~Gavoille",
title = "Memory requirement for universal routing schemes",
booktitle = PODC_1995,
address = "Ontario, Canada",
year = 1995,
pages = "223--230"
}
@article{mwqls-ssssc-10,
author = "Y.~Mao and F.~Wang and L.~Qiu and S.~Lam and
J.~Smith",
title = {S4: Small State and Small Stretch Compact Routing
Protocol for Large Static Wireless Networks},
volume = 18,
number = 3,
journal = {IEEE/ACM Trans. Network.},
year = 2010,
pages = {761--774}
}
@phdthesis{f-gcamp-08,
author = "B.~A.~Ford",
title = {{UIA}: A Global Connectivity Architecture for Mobile
Personal Devices},
publisher = "PhD Thesis",
school = {Massachusetts Institute of Technology},
year = "September, 2008"
}
@inproceedings{dhr-ecvdt-12,
author = {A. Driemel and S. {Har-Peled} and B. Raichel},
title = {On the Expected Complexity of {Voronoi} Diagrams on
Terrains},
booktitle = SOCG_2012,
acceptrate = SOCG_2012_AR,
year = 2012,
pages = {101--110},
publisher = {ACM},
address = {New York, NY, USA},
doi = {10.1145/2261250.2261266}
}
@inproceedings{ehr-gpnuc-12,
author = {A. Ene and S. {Har-Peled} and B. Raichel},
title = {Geometric Packing under Non-uniform Constraints},
pages = {11--20},
booktitle = SOCG_2012,
acceptrate = SOCG_2012_AR,
doi = {10.1145/2261250.2261253},
year = 2012,
recent = {TRUE}
}
@inproceedings{hnss-hwydm-12,
author = {S. {Har-Peled} and A. Nayyeri and M. Salavatipour
and A. Sidiropoulos.},
title = {How to Walk Your Dog in the Mountains with No Magic
Leash},
pages = {121--130},
booktitle = SOCG_2012,
acceptrate = SOCG_2012_AR,
year = 2012,
doi = {10.1145/2261250.2261269},
}
@inproceedings{mssz-iapcm-11,
author = {A. Maheshwari and J.-R. Sack and K. Shabaz and
H. Zarrabi-Zadeh},
title = {Improved Algorithms for Partial Curve Matching},
booktitle = ESA_2001,
year = 2011,
pages = {518--529}
}
@article{t-mmpo-98,
author = {J. B. Tenenbaum},
journal = {Adv. Neur. Inf. Proc. Sys. 10},
title = {Mapping a manifold of perceptual observations},
year = 1998,
pages = {682--688}
}
@MISC{bslt-gagem-00,
author = {M. Bernstein and V. De Silva and J. C. Langford and
J. B. Tenenbaum},
title = {Graph Approximations to Geodesics on Embedded
Manifolds},
year = 2000
}
@article{ms-trn-94,
author = {T. Martinetz and K. Schulten},
title = {Topology representing networks},
journal = {Neural Netw.},
issue_date = 1994,
volume = 7,
number = 3,
pages = {507--522},
month = mar,
year = 1994,
publisher = {Elsevier Science Ltd.},
}
@article{ws-ulms-04,
author = {K. Q. Weinberger and L. K. Saul},
title = {Unsupervised Learning of Image Manifolds by
Semidefinite Programming},
journal = {Int. J. Comput. Vision},
issue_date = {October 2006},
volume = 70,
number = 1,
month = oct,
year = 2006,
issn = {0920-5691},
pages = {77--90},
numpages = 14
}
@inproceedings{hkkms-flspp-06,
author = {O. A. {Hall-Holt} and M. J. Katz and P. Kumar and
J. S. B. Mitchell and A. Sityon},
title = {Finding large sticks and potatoes in polygons},
booktitle = SODA_2006,
year = 2006,
pages = {474--483}
}
@article{ms-sphsg-92,
author = {E. A. Melissaratos and D. L. Souvaine},
title = {Shortest Paths Help Solve Geometric Optimization
Problems in Planar Regions},
journal = {SIAM J. Comput.},
volume = 21,
number = 4,
year = 1992,
pages = {601-638},
doi = {10.1137/0221038}
}
@article{b-rplpc-08,
author = "I. B{\'a}r{\'a}ny",
title = "Random points and lattice points in convex bodies",
journal = "Bulletin Amer. Math. Soc.",
volume = 45,
number = 3,
year = 2008,
pages = "339--365",
doi = {https://doi.org/10.1090/S0273-0979-08-01210-X }
}
@article{d-co-04,
author = {Ketan Dalal},
title = {Counting the onion},
journal = {Random Struct. Alg.},
volume = {24},
number = {2},
pages = {155--165},
year = {2004},
url = {http://dx.doi.org/10.1002/rsa.10114},
doi = {10.1002/rsa.10114}
}
@article{apftk-aac-10,
author = {G. Aggarwal and R. Panigrahy and T. Feder and
D. Thomas and K. Kenthapadi and S. Khuller and
A. Zhu},
title = {Achieving anonymity via clustering},
journal = TALG,
pages = {49:1--49:19},
articleno = {49},
numpages = {19},
volume = 6,
number = 3,
year = 2010
}
@article{c-esd-01,
author = {T. M. Chan},
title = {On Enumerating and Selecting Distances},
journal = IJCGA,
volume = 11,
number = 3,
year = 2001,
pages = {291--304},
}
@article{mr-mwtnp-08,
author = {W. Mulzer and G. Rote},
title = {Minimum-weight triangulation is {{NP}-Hard}},
journal = JACM,
volume = 55,
number = 2,
pages = 11,
year = 2008,
doi = {10.1145/1346330.1346336}
}
@article{as-iaglb-11,
author = {S. Ahmadian and C. Swamy},
title = {Improved Approximation Guarantees for Lower-Bounded
Facility Location},
journal = {CoRR},
volume = {abs/1104.3128},
year = 2011,
url = {http://arxiv.org/abs/1104.3128}
}
@article{s-lbfl-10,
author = {Z. Svitkina},
title = {Lower-bounded facility location},
journal = TALG,
volume = 6,
number = 4,
year = 2010,
pages = 69,
doi = {10.1145/1824777.1824789}
}
@article{c-clps-85,
author = "B. Chazelle",
title = "On the convex layers of a planar set",
journal = "IEEE Trans. Inform. Theory",
volume = "IT-31",
number = 4,
month = jul,
year = 1985,
pages = "509--517",
url = {http://dx.doi.org/10.1109/TIT.1985.1057060},
doi = {10.1109/TIT.1985.1057060},
}
@incollection{rs-crsdm-04,
author = "P.J. Rousseeuw and A. Struyf",
title = "Computation of Robust Statistics: Depth, Median, and
Related Measures",
chapter = 57,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
edition = {2nd},
publisher = "CRC Press LLC",
year = 2004,
pages = "1279--1292"
}
@article{amr-sakmm-11,
author = {D. Arthur and B. Manthey and H. R\"{o}glin},
title = {Smoothed Analysis of the {$k$}-Means Method},
journal = JACM,
volume = 58,
number = 5,
year = 2011,
issn = {0004-5411},
pages = {19:1--19:31},
articleno = 19,
numpages = 31,
doi = {10.1145/2027216.2027217}
}
@article{kss-ltasc-10,
author = {Amit Kumar and Yogish Sabharwal and Sandeep Sen},
title = {Linear-time approximation schemes for clustering
problems in any dimensions},
journal = JACM,
volume = 57,
number = 2,
year = 2010,
url = {http://doi.acm.org/10.1145/1667053.1667054},
doi = {10.1145/1667053.1667054}
}
@article{kss-ltasc-10-old,
author = {A. Kumar and Y. Sabharwal and S. Sen},
title = {Linear-time approximation schemes for clustering
problems in any dimensions},
journal = JACM,
volume = 57,
number = 2,
year = 2010
}
@incollection{e-sts-00,
author = "D. Eppstein",
title = "Spanning Trees and Spanners",
editor = "J.-R. Sack and Jorge Urrutia",
booktitle = "Handbook of Computational Geometry",
publisher = "Elsevier",
year = 2000,
pages = "425--461",
annote = "Chapter 9 of su-hcg-00"
}
@inproceedings{z-eadgs-01,
author = {U. Zwick},
title = {Exact and Approximate Distances in Graphs - A
Survey},
booktitle = ESA_2001,
year = 2001,
pages = {33--48}
}
@inproceedings{e-epgt-63,
author = {P. Erd\"{o}s,},
title = {Extremal problems in graph theory},
booktitle = {Theory Graphs Appl., Proc. Symp. Smolenice},
year = 1963,
pages = {29--36}
}
@inproceedings{s-cmsga-91,
author = {J. S. Salowe},
title = {Construction of Multidimensional Spanner Graphs,
with Applications to Minimum Spanning Trees},
booktitle = SOCG_1991,
year = 1991,
pages = {256--261}
}
@article{v-sgagc-91,
author = {P. M. Vaidya},
title = {A Sparse Graph Almost as Good as the Complete Graph
on Points in {$K$} Dimensions},
journal = DCG,
volume = 6,
year = 1991,
pages = {369--381}
}
@inproceedings{ccggp-afmsn-98,
author = {M. Charikar and C. Chekuri and A. Goel and S. Guha
and S. A. Plotkin},
title = {Approximating a Finite Metric by a Small Number of
Tree Metrics},
booktitle = FOCS_1998,
year = 1998,
pages = {379--388}
}
@article{bw-sp-09,
author = {G. A. Brightwell and P. Winkler},
title = {Submodular Percolation},
journal = {SIAM J. Discret. Math.},
volume = 23,
number = 3,
year = 2009,
pages = {1149--1178},
numpages = 30,
doi = {10.1137/07069078X}
}
@Unpublished{aks-rnhde-12,
author = {D. Aiger and H. Kaplan and M. Sharir},
title = {Reporting Neighbors in High-Dimensional Euclidean
Space},
note = {manuscript},
year = 2012
}
@unpublished{hl-pg-12-old,
author = {S. {Har-Peled} and B. Lidicky},
title = {Peeling the grid},
note = {manuscript},
year = 2012
}
@article{hl-pg-13,
author = {S. {Har-Peled} and B. Lidicky},
journal = SIDMA,
title = {Peeling the grid},
volume = 27,
number = 2,
pages = {650--655},
year = 2013,
url = {http://dx.doi.org/10.1137/120892660},
doi = {10.1137/120892660},
}
@unpublished{ehr-fclbn-12,
author = {A. Ene and S. {Har-Peled} and B. Raichel},
title = {Fast Clustering with Lower Bounds: No Customer too
Far, No Shop too Small },
year = 2012,
note = {manuscript}
}
@inproceedings{his-eshd-13,
title = {Euclidean Spanners in High Dimensions},
author = {S. {Har-Peled} and P. Indyk and A. Sidiropoulos},
booktitle = SODA_2013,
acceptrate = SODA_2013_AR,
year = 2013,
pages = {804--809},
doi = {10.1137/1.9781611973105.57}
}
@inproceedings{owz-olblsh-11,
author = {R. O'Donnell and Y. Wu and Y. Zhou},
title = {Optimal lower bounds for locality sensitive hashing
(except when {$q$} is tiny)},
booktitle = ICS,
year = 2011,
pages = {275--283}
}
@Article{p-ltamc-91,
author = {A. P. Punnen},
title = {A linear time algorithm for the maximum capacity
path problem},
journal = {Euro. J. Op. Research},
year = 1991,
volume = 53,
number = 3,
pages = {402--404},
month = {August}
}
@article{h-soir-01,
author = {J. H{\aa}stad},
title = {Some optimal inapproximability results},
journal = JACM,
issue_date = {July 2001},
volume = 48,
number = 4,
month = jul,
year = 2001,
issn = {0004-5411},
pages = {798--859},
numpages = 62
}
@article{pt-gdfce-97,
author = {J. Pach and G. T\'{o}th},
title = {Graphs Drawn with Few Crossings per Edge},
year = 1997,
journal = {Combinatorica},
volume = 17,
issue = 3,
doi = {10.1007/BF01215922},
pages = {427--439}
}
@article{ppst-tgnlg-05,
author = {J. Pach and R. Pinchasi and M. Sharir and
G. T\'{o}th},
title = {Topological Graphs with No Large Grids},
year = 2005,
journal = {Graphs and Combinatorics},
volume = 21,
issue = 3,
doi = {10.1007/s00373-005-0616-1},
pages = {355--364}
}
@article{del-dgrac-11,
author = "W. Didimo and P. Eades and G. Liotta",
title = "Drawing Graphs with Right Angle Crossings",
journal = TCS,
volume = 412,
number = 39,
pages = "5156--5166",
year = 2011,
doi = "10.1016/j.tcs.2011.05.025"
}
@inproceedings{pss-acn-94,
author = {J. Pach and F. Shahrokhi and M. Szegedy},
title = {Applications of the crossing number},
booktitle = SOCG_1994,
year = 1994,
pages = {198--202},
doi = {10.1145/177424.177629}
}
@article{wg-pef-1875,
author = "H. W. Watson and F. Galton",
title = "On the Probability of the Extinction of Families",
journal = "J. Anthrop. Inst. Great Britain",
volume = 4,
pages = {138--144},
year = 1875
}
@article{cs-nwbbs-00,
author = {S. Cho and S. Sahni},
title = {A New Weight Balanced Binary Search Tree},
journal = {Int. J. Found. Comput. Sci.},
volume = 11,
number = 3,
year = 2000,
pages = {485--513}
}
@article{eet-seupr-93,
author = {H. ElGindy and H. Everett and G. Toussaint},
title = {Slicing an ear using prune-and-search},
journal = {Pattern Recogn. Lett.},
volume = 14,
number = 9,
year = 1993,
pages = {719--722}
}
@article{lms-ahsc-94,
author = "C.-Y. Lo and J. Matou{\v s}ek and W. L. Steiger",
title = "Algorithms for ham-sandwich cuts",
journal = DCG,
volume = 11,
year = 1994,
pages = "433--452"
}
@inproceedings{s-pram-79,
author = "A. Sch{\"o}nhage",
title = "On the power of random access machines",
booktitle = ICALP_1979,
series = "Lecture Notes Comput. Sci.",
volume = 71,
year = 1979,
pages = "520--529",
publisher = {Springer-Verlag},
address = {London, UK}
}
@incollection{s-ps-97,
author = "J. Salowe",
title = "Parametric search",
chapter = 37,
editor = "J. E. Goodman and J. O'Rourke",
booktitle = "Handbook of Discrete and Computational Geometry",
publisher = "CRC Press LLC",
address = "Boca Raton, FL",
year = 1997,
pages = "683--698"
}
@article{bs-faad-02,
author = "S. Bespamyatnikh and M. Segal",
title = "Fast Algorithms for Approximating Distances",
journal = ALGORITHMICA,
year = 2002,
volume = 33,
number = 2,
pages = "263--269"
}
@Unpublished{ehr-fclb-12,
author = {A. Ene and B. Raichel and S. {Har-Peled}},
title = {Fast Clustering with Lower Bounds: No Customer too
Far, No Shop too Small},
note = {In
submission. \url{http://sarielhp.org/papers/12/lbc/}},
year = 2012
}
@article{hr-nplta-14,
author = {S. Har{-}Peled and B. Raichel},
title = {Net and Prune: {A} Linear Time Algorithm for
{Euclidean} Distance Problems},
journal = {CoRR},
volume = {abs/1409.7425},
year = {2014},
pages = {},
url = {http://arxiv.org/abs/1409.7425}
}
@unpublished{hr-nplta-12-nouse,
author = {S. {Har-Peled} and B. Raichel},
title = {Net and Prune: A Linear Time Algorithm for {Euclidean}
Distance Problems},
year = 2012,
url = {http://cs.uiuc.edu/~sariel/papers/12/aggregate/},
note = {Manuscript}
}
@article{km-srsac-95,
author = "S. Khuller and Y. Matias",
title = "A simple randomized sieve algorithm for the
closest-pair problem",
journal = "Inform. Comput.",
volume = 118,
year = 1995,
pages = "34--37"
}
@inproceedings{hr-nplta-13,
author = {S. {Har-Peled} and B. Raichel},
title = {Net and Prune: A Linear Time Algorithm for {Euclidean}
Distance Problems},
booktitle = STOC_2013,
acceptrate = STOC_2013_AR,
year = 2013,
pages = {605--614},
publisher = {ACM},
address = {New York, NY, USA},
url = {http://cs.uiuc.edu/~sariel/papers/12/aggregate/},
}
@inproceedings{ac-ohrrt-09,
author = {P. Afshani and T. M. Chan},
title = {Optimal halfspace range reporting in three
dimensions},
booktitle = SODA_2009,
year = 2009,
pages = {180--186},
publisher = {{SIAM}},
address = {Philadelphia, PA, USA}
}
@inproceedings{r-ohdcm-08,
author = {H. R{\"a}cke},
title = {Optimal hierarchical decompositions for congestion
minimization in networks},
booktitle = STOC_2008,
year = 2008,
pages = {255--264}
}
@article{v-sfpc-82,
author = {L. G. Valiant},
title = {A Scheme for Fast Parallel Communication},
journal = {SIAM J. Comput.},
volume = 11,
number = 2,
year = 1982,
pages = {350-361}
}
@inproceedings{ac-fdped-07,
author = {N. Alon and M. Capalbo},
title = {Finding Disjoint Paths in Expanders
Deterministically and Online},
booktitle = FOCS_2007,
year = 2007,
pages = {518--524}
}
@phdthesis{c-cgc-79,
author = "B. Chazelle",
title = "Computational geometry and convexity",
type = "Ph.{D}. Thesis",
school = "Dept. Comput. Sci., Yale Univ.",
address = "New Haven, CT",
year = 1979,
note = "Carnegie-Mellon Univ. Report CS-80-150",
keywords = "doctoral thesis",
comments = "UMI KRA81-10021, 313 pp."
}
@incollection{cd-ocd-85,
author = "B. Chazelle and D. P. Dobkin",
title = "Optimal convex decompositions",
editor = "G. T. Toussaint",
booktitle = "Computational Geometry",
publisher = "North-Holland",
address = "Amsterdam, Netherlands",
year = 1985,
pages = "63--133"
}
@incollection{g-dpcp-83,
author = "D. H. Greene",
title = "The Decomposition of Polygons into Convex Parts",
editor = "F. P. Preparata",
booktitle = "Computational Geometry",
series = "Adv. Comput. Res.",
volume = 1,
publisher = "JAI Press",
address = "Greenwich, Conn.",
year = 1983,
pages = "235--259",
annote = "minimal decomposition; finds optimal in {$O(n^{4})$}
time, constant-factor in {$O(n \log n)$}"
}
@article{k-dpsc-85,
author = "J. M. Keil",
title = "Decomposing a polygon into simpler components",
journal = SICOMP,
volume = 14,
year = 1985,
pages = "799--817",
keywords = "dynamic programming, convex, polygons, star-shaped,
partition, decomposition"
}
@article{cv-drrmp-09,
author = {C. Chekuri and J. Vondr{\'a}k},
title = {Dependent Randomized Rounding for Matroid Polytopes
and Applications},
journal = {CoRR},
volume = {abs/0909.4348},
year = 2009,
ee = {http://arxiv.org/abs/0909.4348},
}
@inproceedings{bgrs-cstp-04,
author = {V. Bil{\`o} and V. Goyal and R. Ravi and M. Singh},
title = {On the Crossing Spanning Tree Problem},
booktitle = APPROX_2004,
year = 2004,
pages = {51--60}
}
@article{ahy-escmp-13-old,
title = {Embeddings of surfaces, curves, and moving points in
{Euclidean} space},
year = 2013,
note = {To appear},
journal = SICOMP,
author = {P. Agarwal and S. {Har-Peled} and H. Yu},
url = {http://sarielhp.org/papers/06/embed/},
recent = {TRUE}
}
@INPROCEEDINGS{la-acdp-04,
author = {J. Lien and N. M. Amato},
title = {Approximate convex decomposition of polygons},
booktitle = SOCG_2004,
year = 2004,
pages = {17--26}
}
@article{ft-fhtui-87,
author = {M. L. Fredman and R. E. Tarjan},
title = {Fibonacci heaps and their uses in improved network
optimization algorithms},
journal = JACM,
volume = 34,
number = 3,
year = 1987,
pages = {596--615}
}
@article{kkt-rltaf-95,
author = {D. R. Karger and P. N. Klein and R. E. Tarjan},
title = {A randomized linear-time algorithm to find minimum
spanning trees},
journal = JACM,
volume = 42,
number = 2,
month = mar,
year = 1995,
pages = {321--328}
}
@article{c-mstai-00,
author = {B. Chazelle},
title = {A minimum spanning tree algorithm with
inverse-Ackermann type complexity},
journal = JACM,
volume = 47,
number = 6,
year = 2000,
pages = {1028--1047}
}
@article{fw-tdams-94,
author = {M. L. Fredman and D. E. Willard},
title = {Trans-Dichotomous Algorithms for Minimum Spanning
Trees and Shortest Paths},
journal = JCSS,
volume = 48,
number = 3,
year = 1994,
pages = {533--551}
}
@inproceedings{m-lbfkd-13,
author = {Q. M{\' e}rigot},
title = {Lower bounds for {$k$}-distance approximation},
booktitle = SOCG_2013,
year = 2013,
pages = {to appear}
}
@inproceedings{aahpy-nnsuu-13,
author = {P. K. Agarwal and B. Aronov and S. {Har-Peled} and
J. M. Phillips and K. Yi and W. Zhang},
title = {Nearest Neighbor Searching Under Uncertainty {II}},
booktitle = PODS_2013,
acceptrate = PODS_2013_AR,
year = 2013,
pages = {115--126},
doi = {10.1145/2463664.2465219}
}
@article{aahpy-nnsuu-16,
author = {Pankaj K. Agarwal and Boris Aronov and Sariel
Har{-}Peled and Jeff M. Phillips and Ke Yi and
Wuzhou Zhang},
title = {Nearest-Neighbor Searching Under Uncertainty {II}},
journal = {{ACM} Trans. Algorithms},
volume = {13},
number = {1},
pages = {3:1--3:25},
year = {2016},
url = {http://doi.acm.org/10.1145/2955098},
doi = {10.1145/2955098}
}
@article{drs-pddd-09,
Author = {N. N. Dalvi and C. R{\'e} and D. Suciu},
Journal = CACM,
Number = 7,
Pages = {86--94},
Title = {Probabilistic databases: Diamonds in the dirt},
Volume = 52,
Year = 2009
}
@Article{d-aspmf-70,
author = {E. A. Dinic},
title = {Algorithm for solution of a problem of maximum flow
in a network with power estimation},
journal = {Soviet Math. Doklady},
year = 1970,
volume = 11,
pages = {1277--1280}
}
@article{ek-tiaen-72,
author = {J. Edmonds and R. M. Karp},
title = {Theoretical Improvements in Algorithmic Efficiency
for Network Flow Problems},
journal = JACM,
volume = 19,
number = 2,
year = 1972,
pages = {248--264}
}
@Article{m-zak-27,
author = {K. Menger},
title = {Zur allgemeinen Kruventheorie},
journal = {Fund. Math.},
year = 1927,
volume = 10,
pages = {96--115}
}
@book{a-mmud-09,
Author = {C. C. Aggarwal},
Publisher = {Springer},
address = "Berlin, Germany",
Title = {Managing and Mining Uncertain Data},
Year = 2009
}
@inproceedings{cxycs-uvdvd-10,
Author = {R. Cheng and X. Xie and M. L. Yiu and J. Chen and
L. Sun},
title = {UV-diagram: A {Voronoi} diagram for uncertain data},
booktitle = ICDE_2010,
year = 2010,
pages = {796--807},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@inproceedings{ls-aiap-07,
Author = {V. Ljosa and A. K. Singh},
Title = {{APLA}: Indexing Arbitrary Probability
Distributions},
Booktitle = ICDE_2007,
Year = 2007,
pages = {946--955},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA}
}
@article{bsi-estkp-08,
Author = {G. Beskales and M. A. Soliman and I. F. IIyas},
Title = {Efficient search for the top-k probable nearest
neighbors in uncertain databases},
pages = {326--339},
volume = {1},
number = {1},
journal = {Proc. VLDB Endow.},
Month = {August},
Year = 2008
}
@inproceedings{cccx-eptkn-2009,
author = {R. Cheng and L. Chen and J. Chen and X. Xie},
title = {Evaluating probability threshold
{$k$}-nearest-neighbor queries over uncertain data},
booktitle = EDBT_2009,
year = 2009,
pages = {672--683},
publisher = {ACM},
address = {New York, NY, USA}
}
@inproceedings{ccmc-pvecn-08,
author = {R. Cheng and J. Chen and M. Mokbel and C. Chow},
title = {Probabilistic Verifiers: Evaluating Constrained
Nearest-Neighbor Queries over Uncertain Data},
booktitle = ICDE_2008,
year = 2008,
pages = {973--982},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA}
}
@inproceedings{se-gvdus-08,
Author = {J. Sember and W. Evans},
Title = {Guaranteed {Voronoi} Diagrams of Uncertain Sites},
Booktitle = CCCG_2008,
pages = {207--210},
Year = 2008,
publisher = {McGill University},
address = {Montreal, QC}
}
@article{ckp-qidmo-04,
author = {R. Cheng and D. V. Kalashnikov and S. Prabhakar},
title = {Querying Imprecise Data in Moving Object
Environments},
journal = TKDE,
volume = 16,
number = 9,
year = 2004,
pages = {1112--1127}
}
@inproceedings{zcmrz-vbnns-13,
Author = {P. Zhang and R. Cheng and N. Mamoulis and M. Renz
and A. Zufile and Y. Tang and T. Emrich},
Title = {Voronoi-based Nearest Neighbor Search for
Multi-Dimensional Uncertain Databases},
Booktitle = ICDE_2013,
Year = 2013,
pages = {158--169},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@inproceedings{bekmr-nppas-11,
Author = {T. Bernecker and T. Emrich and H.-P. Kriegel and
N. Mamoulis and M. Renz and A. Zuefle},
Title = {A Novel Probabilistic Pruning Approach to Speed Up
Similarity Queries in Uncertain Databases},
Booktitle = ICDE_2011,
Year = 2011,
pages = {339--350},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA}
}
@inproceedings{kkr-pnnqu-07,
Author = {H.-P. Kriegel and P. Kunath and M. Renz},
Title = {Probabilistic nearest-neighbor query on uncertain
objects},
Booktitle = DASFAA_2007,
Pages = {337--348},
Year = 2007,
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg}
}
@inproceedings{aesz-nnsuu-12,
Author = {P. K. Agarwal and A. Efrat and S. Sankararaman and
W. Zhang},
Title = {Nearest-neighbor searching under uncertainty},
Booktitle = PODS_2012,
Year = 2012,
pages = {225--236},
publisher = {ACM},
address = {New York, NY, USA}
}
@article{ytxpz-snnsu-10,
author = {S. M. Yuen and Y. Tao and X. Xiao and J. Pei and
D. Zhang},
title = {Superseding Nearest Neighbor Search on Uncertain
Spatial Databases},
journal = TKDE,
year = 2010,
volume = 22,
number = 7,
pages = {1041--1055}
}
@inproceedings{kcs-cppop-11-old,
author = {P. Kamousi and T. M. Chan and S. Suri},
title = {Closest pair and the post office problem for
stochastic points},
booktitle = WADS_2011,
year = 2011,
pages = {548--559}
}
@article{ab-gdt-86,
Author = {P. F. Ash and E. D. Bolker},
Title = {Generalized {D}irichlet Tessellations},
Journal = {Geometriae Dedicata},
Issue = 2,
Volume = 20,
Pages = {209--243},
Year = 1986
}
@article{dsst-mdsp-89,
author = "J. R. Driscoll and N. Sarnak and D. D. Sleator and
R. E. Tarjan",
title = "Making data structures persistent",
journal = "J. Comput. Syst. Sci.",
volume = 38,
year = 1989,
pages = "86--124"
}
@article{gjs-aghrs-96,
author = "P. Gupta and R. Janardan and M. Smid",
title = "Algorithms for generalized halfspace range searching
and other intersection searching problems",
journal = CGTA,
volume = 5,
year = 1996,
pages = "321--340",
annote = "also published (erroneously) in Volume 6 (1996),
pp. 1--19"
}
@inproceedings{hkm-uevsa-91,
author = {D. P. Huttenlocher and K. Kedem and M. Sharir},
title = {The upper envelope of {Voronoi} surfaces and its
applications},
booktitle = SOCG_1991,
year = 1991,
pages = {194--203}
}
@techreport{ckp-richv-12,
author = {P. Cheilaris and E. Khramtcova and E. Papadopoulou},
title = {Randomized incremental construction of the Hausdorff
{Voronoi} diagram of non-crossing clusters},
institution = {University of Lugano},
number = {2012/03},
year = 2012
}
@article{mssz-fdsl-2011,
author = {A. Maheshwari and J.-R. Sack and K. Shahbaz and
H. Zarrabi-Zadeh},
title = {{Fr\'{e}chet} distance with speed limits},
journal = CGTA,
volume = 44,
number = 2,
pages = "110--120",
year = 2011
}
@inproceedings{bds-jnp-13,
author = {M. Buchin and A. Driemel and B. Speckmann},
title = {Computing the {F}r\'echet distance with shortcuts is
{NP}-hard},
booktitle = EWCG_2013,
pages = {43--46},
year = 2013
}
@article{bbmm-fswd-12,
author = {K. Buchin and M. Buchin and W. Meulemans and
W. Mulzer},
title = {Four {S}oviets Walk the Dog---with an Application to
{A}lt's Conjecture},
journal = {arXiv/1209.4403},
year = 2012,
url = {http://arxiv.org/abs/1209.4403}
}
@inproceedings{aaks-dfst-13,
author = {P. K. Agarwal and R. Ben Avraham and H. Kaplan and
M. Sharir},
title = {Computing the Discrete {F}r{\'e}chet Distance in
Subquadratic Time},
booktitle = SODA_2013,
year = 2013,
pages = {156--167},
}
@article{ghms-apsml-93,
author = "L. J. Guibas and J. Hershberger and
J. S. B. Mitchell and J. S. Snoeyink",
title = "Approximating Polygons and Subdivisions with Minimum
Link Paths",
journal = IJCGA,
volume = 3,
number = 4,
month = dec,
year = 1993,
pages = "383--415"
}
@article{bbw-cfdsp-08,
author = {K. Buchin and M. Buchin and C. Wenk},
title = {Computing the {Fr{\'e}chet} distance between simple
polygons},
journal = CGTA,
volume = 41,
number = {1-2},
year = 2008,
pages = {2--20}
}
@article{eis-octmf-76,
author = {S. Even and A. Itai and A. Shamir},
title = {On the Complexity of Timetable and Multicommodity
Flow Problems},
journal = SICOMP,
volume = 5,
number = 4,
year = 1976,
pages = {691-703}
}
@article{hk-amdgp-15,
author = {S. {Har-Peled} and N. Kumar},
title = {Approximating Minimization Diagrams and Generalized
Proximity Search},
journal = SICOMP,
year = 2015,
volume = {44},
number = {4},
pages = {944--974},
url = {http://dx.doi.org/10.1137/140959067},
doi = {10.1137/140959067}
}
@InProceedings{hk-amdgp-13,
author = {S. {Har-Peled} and N. Kumar},
title = {Approximating Minimization Diagrams and Generalized
Proximity Search},
booktitle = FOCS_2013,
acceptrate = FOCS_2013_AR,
year = 2013,
pages = {717--726},
doi = {10.1109/FOCS.2013.82},
}
@article{hk-amdgp-13-arxiv,
author = {S. {Har-Peled} and N. Kumar},
title = {Approximating Minimization Diagrams and Generalized
Proximity Search},
journal = {CoRR},
volume = {abs/1304.0393},
year = 2013,
ee = {http://arxiv.org/abs/1304.0393}
}
@article{bbmm-fswda-12,
author = {K. Buchin and M. Buchin and W. Meulemans and
W. Mulzer},
title = {Four Soviets Walk the Dog - with an Application to
Alt's Conjecture},
journal = {CoRR},
volume = {abs/1209.4403},
year = 2012,
ee = {http://arxiv.org/abs/1209.4403},
}
@Unpublished{fh-cnrac-13,
author = {M. Fleck and S. {Har-Peled}},
title = {Class notes for Introduction to Theory of
Computation ({CS} 373)},
note = {345 pages.
\url{http://sarielhp.org/teach/notes/373/}},
year = 2013
}
@Unpublished{h-cnrac-13,
author = {S. {Har-Peled}},
title = {Class notes for Randomized Algorithms class ({CS}
574)},
note = {179 pages.
\url{http://sarielhp.org/teach/notes/rand_alg/}},
year = 2013
}
@Unpublished{h-cngac-13,
author = {S. {Har-Peled}},
title = {Class notes for graduate algorithms class ({CS}
573)},
note = {265 pages.
\url{http://sarielhp.org/teach/notes/algos/}},
year = 2013
}
@Unpublished{h-cnuac-13,
author = {S. {Har-Peled}},
title = {Class notes for undergraduate algorithms class ({CS}
473)},
note = {347 pages.
\url{http://courses.engr.illinois.edu/cs473/sp2013/w/lec/book.pdf}},
year = 2013
}
@Unpublished{h-ssuac-13,
author = {S. {Har-Peled}},
title = {Slides and schedue for undergraduate algorithms
class ({CS} 473)},
note =
{\url{http://courses.engr.illinois.edu/cs473/sp2013/w/lec/}},
year = 2013
}
@ARTICLE{h-speps-13,
author = {{Har-Peled}, S.},
title = "A Simple Proof of the Existence of a Planar
Separator",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1105.0103},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2013,
month = apr,
adsurl = {http://adsabs.harvard.edu/abs/2011arXiv1105.0103H},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@article{st-epcp-94,
author = "M. Sharir and S. Toledo",
title = "Extremal polygon containment problems",
journal = CGTA,
volume = 4,
year = 1994,
pages = "99--118"
}
@article{ms-fckrp-09,
author = {M. Mendel and C. Schwob},
title = {Fast C-K-R Partitions of Sparse Graphs},
journal = {Chicago J. Theor. Comput. Sci.},
volume = 2009,
year = 2009
}
@article{b-gct-82,
author = "I. B{\'a}r{\'a}ny",
title = "A generalization of {Carath{\'e}odory}'s theorem",
journal = "Discrete Math.",
volume = 40,
year = 1982,
pages = "141--152"
}
@article{k-kdka-36,
author = "P. Koebe",
title = "Kontaktprobleme der konformen {Abbildung}",
journal = "Ber. Verh. S{\"a}chs. Akademie der Wissenschaften
Leipzig, Math.-Phys. Klasse",
volume = 88,
year = 1936,
pages = "141--164"
}
@article{fr-pgnwe-06,
author = {J. Fakcharoenphol and S. Rao},
title = {Planar graphs, negative weight edges, shortest
paths, and near linear time},
journal = JCSS,
volume = 72,
number = 5,
year = 2006,
pages = {868--889},
doi = {10.1016/j.jcss.2005.05.007}
}
@inproceedings{ek-ltamf-13,
author = {D. Eisenstat and P. N. Klein},
title = {Linear-time algorithms for max flow and
multiple-source shortest paths in unit-weight planar
graphs},
booktitle = STOC_2013,
year = 2013,
pages = {735--744},
doi = {10.1145/2488608.2488702}
}
@article{k-ltast-08,
author = {P. N. Klein},
title = {A Linear-Time Approximation Scheme for {TSP} in
Undirected Planar Graphs with Edge-Weights},
journal = SICOMP,
volume = 37,
number = 6,
year = 2008,
pages = {1926--1952},
doi = {10.1137/060649562}
}
@ARTICLE{bptw-betsu-09-arxiv,
author = {J. {B{\"o}ttcher} and {Pruessmann}, K.~P. and
{Taraz}, A. and {W{\"u}rfl}, A.},
title = {Bandwidth, expansion, treewidth, separators, and
universality for bounded degree graphs},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {0910.3014},
primaryClass = "math.CO",
keywords = {Mathematics - Combinatorics},
year = 2009
}
@article{bptw-betsu-10,
author = {J. B{\"o}ttcher and Pruessmann, K.~P. and
Taraz, A. and W{\"u}rfl, A.},
title = {Bandwidth, expansion, treewidth, separators and
universality for bounded-degree graphs},
journal = {Eur. J. Comb.},
issue_date = {July, 2010},
volume = 31,
number = 5,
month = jul,
year = 2010,
pages = {1217--1227},
numpages = 11,
doi = {10.1016/j.ejc.2009.10.010}
}
@article{ght-stgbg-84,
author = {J. R. Gilbert and J. P. Hutchinson and R. E. Tarjan},
title = {A Separator Theorem for Graphs of Bounded Genus},
journal = JALG,
volume = 5,
number = 3,
year = 1984,
pages = {391--407},
doi = {10.1016/0196-6774(84)90019-1}
}
@inproceedings{aks-urmsn-13,
author = {P. K. Agarwal and H. Kaplan and M. Sharir},
title = {Union of random {Minkowski} sums and network
vulnerability analysis},
booktitle = SOCG_2013,
year = 2013,
pages = {177--186}
}
@inproceedings{chkk-nefcg-13,
author = {O. Cheong and S. {Har-Peled} and H. Kim and
H.-S. Kim},
title = {On the Number of Edges of Fan-Crossing Free Graphs},
booktitle = ISAAC_2013,
acceptrate = ISAAC_2013_AR,
doi = {10.1007/978-3-642-45030-3_16},
year = 2013,
pages = {163--173}
}
@article{chkk-nefcg-15,
author = {O. Cheong and S. {Har-Peled} and H. Kim and
H.-S. Kim},
title = {On the Number of Edges of Fan-Crossing Free Graphs},
journal = ALGORITHMICA,
year = 2015,
note = {To appear}
}
@unpublished{ahks-urmsn-13-old,
author = {P. K. Agarwal and S. {Har-Peled} and H. Kaplan and
M. Sharir},
title = {Union of Random {Minkowski} Sums and Network
Vulnerability Analysis},
year = 2013,
note = {Invited to the special issue of DCG for SoCG 2013}
}
@Unpublished{Thie91,
keyent = {Thie91},
author = "T. Thiele",
title = "Diplomarbeit",
note = "Free University Berlin",
year = 1991,
month = "August",
annote = 81
}
@article{krs-omdri-11,
author = {H. Kaplan and E. Ramos and M. Sharir},
title = {The Overlay of Minimization Diagrams in a Randomized
Incremental Construction},
journal = DCG,
volume = 45,
number = 3,
year = 2011,
pages = {371--382},
doi = {10.1007/s00454-010-9324-6}
}
@article{d-dslop-13,
author = {W. Didimo},
title = {Density of straight-line 1-planar graph drawings},
journal = {Inf. Process. Lett.},
volume = 113,
number = 7,
year = 2013,
pages = {236-240},
doi = {10.1016/j.ipl.2013.01.013}
}
@inproceedings{help-ftopg-12,
author = {S.-H. Hong and P. Eades and G. Liotta and
S.-H. Poon},
title = {F{\'a}ry's Theorem for {$1$}-Planar Graphs},
booktitle = COCOON_2012,
year = 2012,
pages = {335--346},
doi = {10.1007/978-3-642-32241-9_29}
}
@article{km-mooih-13,
author = {V. P. Korzhik and B. Mohar},
title = {Minimal Obstructions for {$1$}-Immersions and Hardness
of $1$-Planarity Testing},
journal = JAGT,
volume = 72,
number = 1,
year = 2013,
pages = {30--71},
doi = {10.1002/jgt.21630}
}
@article{aapps-qpglne-1997,
author = "P. K. Agarwal and B. Aronov and J. Pach and
R. Pollack and M. Sharir",
title = "Quasi-planar graphs have a linear number of edges",
journal = COMBINATORICA,
volume = 17,
year = 1997,
pages = "1–-9"
}
@inproceedings{prt-rptg-02,
author = {J. Pach and R. Radoicic and G. T{\'o}th},
title = {Relaxing Planarity for Topological Graphs},
booktitle = JCDCG_2002,
year = 2002,
pages = {221--232},
doi = {10.1007/978-3-540-44400-8_24}
}
@article{prtt-iclfm-06,
author = {J. Pach and R. Radoicic and G. Tardos and
G. T{\'o}th},
title = {Improving the Crossing Lemma by Finding More
Crossings in Sparse Graphs},
journal = DCG,
volume = 36,
number = 4,
year = 2006,
pages = {527--552},
doi = {10.1007/s00454-006-1264-9}
}
@article{fp-nekqp-13,
author = {J. Fox and J. Pach and A. Suk},
title = {The Number of Edges in {$k$}-Quasi-planar Graphs},
journal = SIDMA,
volume = 27,
number = 1,
year = 2013,
pages = {550--561},
doi = {10.1137/110858586}
}
@article{el-racgo-13,
author = {P. Eades and G. Liotta},
title = {Right angle crossing graphs and {$1$}-planarity},
journal = {Disc. Appl. Math.},
volume = 161,
number = {7--8},
year = 2013,
pages = {961--969},
doi = {10.1016/j.dam.2012.11.019}
}
@article{abs-slrdp-12,
author = {E. N. Argyriou and M. A. Bekos and A. Symvonis},
title = {The Straight-Line {RAC} Drawing Problem is
{NP}-Hard},
journal = {J. Graph Alg. Appl.},
volume = 16,
number = 2,
year = 2012,
pages = {569--597},
doi = {10.7155/jgaa.00274}
}
@article{a-mnetg-09,
author = {E. Ackerman},
title = {On the Maximum Number of Edges in Topological Graphs
with no Four Pairwise Crossing Edges},
year = 2009,
journal = DCG,
volume = 41,
number = 3,
doi = {10.1007/s00454-009-9143-9},
publisher = {Springer-Verlag},
keywords = {Geometric graphs; Topological graphs; Discharging
method; Quasi-planar graphs},
pages = {365--375}
}
@article{h-ecrch-11,
author = {S. {Har-Peled}},
title = {On the Expected Complexity of Random Convex Hulls},
journal = {CoRR},
volume = {abs/1111.5340},
year = 2011,
ee = {http://arxiv.org/abs/1111.5340}
}
@article{ae-oacwv-84,
author = {F. Aurenhammer and H. Edelsbrunner},
title = {An optimal algorithm for constructing the weighted
voronoi diagram in the plane},
journal = {Pattern Recognition},
volume = 17,
number = 2,
year = 1984,
pages = {251--257},
doi = {10.1016/0031-3203(84)90064-5}
}
@inproceedings{d-hdvdl-89,
author = {R. Dwyer},
title = {Higher-Dimensional {Voronoi} Diagrams in Linear
Expected Time},
booktitle = SOCG_1989,
year = 1989,
pages = {326--333},
doi = {10.1145/73833.73869}
}
@article{s-atubl-94,
author = {M. Sharir},
title = {Almost Tight Upper Bounds for Lower Envelopes in
Higher Dimensions},
journal = DCG,
volume = 12,
year = 1994,
pages = {327--345},
doi = {10.1007/BF02574384}
}
@inproceedings{hrz-ccnam-02,
author = {S. {Har-Peled} and D. Roth and D. Zimak},
title = {Constraint Classification: A New Approach to
Multiclass Classification},
booktitle = ALT_2002,
acceptrate = {$~$~53\%},
year = 2002,
pages = {365--379},
doi = {10.1007/3-540-36169-3_29}
}
@inproceedings{clm-sga-03-conf,
keyent = {clm-sga-03},
author = {B. Chazelle and D. Liu and A. Magen},
title = {Sublinear geometric algorithms},
year = 2003,
booktitle = STOC_2003,
pages = {531--540}
}
@article{clm-sga-05,
author = {B. Chazelle and D. Liu and A. Magen},
title = {Sublinear Geometric Algorithms},
journal = SICOMP,
volume = 35,
number = 3,
year = 2005,
pages = {627--646},
doi = {10.1137/S009753970444572X}
}
@article{acpsv-motpc-07,
author = {H.-K. Ahn and O. Cheong and C.-D. Park and
C.-S. Shin and A. Vigneron},
title = {Maximizing the overlap of two planar convex sets
under rigid motions},
journal = CGTA,
volume = 37,
number = 1,
year = 2007,
pages = {3--15},
doi = {10.1016/j.comgeo.2006.01.005}
}
@inproceedings{k-avda-88,
author = {R. Klein},
title = {Abstract {Voronoi} Diagrams and their Applications},
booktitle = {Workshop on Computational Geometry},
year = 1988,
pages = {148--157},
doi = {10.1007/3-540-50335-8_31},
}
@article{kln-avdr-09,
author = {R. Klein and E. Langetepe and Z. Nilforoushan},
title = {Abstract {Voronoi} diagrams revisited},
journal = {Comput. Geom.},
volume = 42,
number = 9,
year = 2009,
pages = {885-902},
doi = {10.1016/j.comgeo.2009.03.002},
}
@book{akl-vddt-13,
author = {F. Aurenhammer and R. Klein and D.-T. Lee},
title = {{Voronoi} Diagrams and {Delaunay} Triangulations},
publisher = {World Scientific},
year = 2013,
doi = {10.1142/8685}
}
@inproceedings{p-sbdss-13,
author = {S. Pettie},
title = {Sharp Bounds on {Davenport-Schinzel} Sequences of
Every Order},
booktitle = SOCG_2013,
series = {SoCG '13},
year = 2013,
pages = {319--328},
doi = {10.1145/2462356.2462390}
}
@article{fp-stsga-10,
author = {J. Fox and J. Pach},
journal = {Combin. Probab. \& Comput.},
number = 3,
pages = {371--390},
title = {A Separator Theorem for String Graphs and its
Applications.},
volume = 19,
year = 2010
}
@article{fp-stttr-08,
author = {J. Fox and J. Pach},
title = {Separator theorems and Turán-type results for planar
intersection graphs},
journal = {Adv. Math.},
volume = 219,
issue = 3,
pages = {1070--1080},
year = 2008
}
@article{fp-ansts-13,
author = {J. Fox and J. Pach},
title = {Applications of a New Separator Theorem for String
Graphs},
journal = {Combinatorics, Probability and Computing},
month = 11,
year = 2013,
pages = {1--9},
doi = {10.1017/S0963548313000412}
}
@inproceedings{aw-asmwi-13,
author = {A. Adamaszek and A. Wiese},
title = {Approximation Schemes for Maximum Weight Independent
Set of Rectangles},
booktitle = FOCS_2013,
pages = {400--409},
year = 2013,
doi = {10.1109/FOCS.2013.50}
}
@inproceedings{aw-qmwis-14,
author = {A. Adamaszek and A. Wiese},
title = {A {QPTAS} for maximum weight independent set of
polygons with polylogarithmic many vertices},
booktitle = SODA_2014,
pages = {400--409},
year = 2014,
doi = {10.1137/1.9781611973402.49}
}
@article{sw-sce-13,
author = {J. Sherette and C. Wenk},
title = {Simple Curve Embedding},
journal = {CoRR},
volume = {abs/1303.0821},
year = 2013,
ee = {http://arxiv.org/abs/1303.0821}
}
@article{bds-cfdsn-13,
author = {M. Buchin and A. Driemel and B. Speckmann},
title = {Computing the {Fr{\'e}chet} distance with shortcuts
is NP-hard},
journal = {CoRR},
volume = {abs/1307.2097},
year = 2013,
ee = {http://arxiv.org/abs/1307.2097}
}
@inproceedings{cljl-ifd-11,
author = {E. W. Chambers and D. Letscher and T. Ju and L. Liu},
title = {Isotopic {Fr{\'e}chet} Distance},
booktitle = CCCG_2011,
year = 2011
}
@article{cw-sppps-12,
author = {A. F. Cook and C. Wenk},
title = {Shortest Path Problems on a Polyhedral Surface},
journal = ALGORITHMICA,
note = {to appear},
year = 2012
}
@ARTICLE{bh-svd-14,
author = {V.~V.~S.~P. {Bhattiprolu} and S. {Har-Peled}},
title = {Separating a {Voronoi} Diagram via local search},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1401.0174},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2014,
month = dec,
adsurl = {http://adsabs.harvard.edu/abs/2014arXiv1401.0174B},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@ARTICLE{h-qssp-13,
author = {S. {Har-Peled}},
title = {Quasi-Polynomial Time Approximation Scheme for
Sparse Subsets of Polygons},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1312.1369},
primaryClass = "cs.CG",
year = 2013
}
@unpublished{mrr-qgscp-13,
author = {N. H. Mustafa and R. Raman and S. Ray},
title = {{QPTAS} for Geometric Set-Cover Problems via Optimal
Separators},
note = {unpublished},
year = 2013
}
@ARTICLE{hr-ocrwv-14-arxiv,
author = {S. {Har-Peled} and B. {Raichel}},
title = {On the Complexity of Randomly Weighted {Voronoi}
Diagrams},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1401.1477},
keywords = {Computer Science - Computational Geometry},
year = 2014,
adsurl = {http://adsabs.harvard.edu/abs/2014arXiv1401.1477H}
}
@ARTICLE{hr-ocrwv-15,
author = {S. {Har-Peled} and B. {Raichel}},
title = {On the Complexity of Randomly Weighted {Voronoi}
Diagrams},
journal = DCG,
volume = 53,
number = 3,
pages = {547--568},
year = 2015,
doi = {10.1007/s00454-015-9675-0},
url = {http://sarielhp.org/p/13/random_voronoi/}
}
@unpublished{hr-amopt-14-old,
author = {S. {Har-Peled} and S. Roy},
title = {Approximating the Maximum Overlap of Polygons under
Translation},
year = 2014,
note = {\url{http://sarielhp.org/p/13/max_overlap/}.
Submitted to SoCG 2014.}
}
@book{g-wwr-1869,
title = {Why are Women Redundant?},
author = {W.R. Greg},
lccn = 38037301,
url = {http://books.google.com/books?id=R0aQ36xR1sAC},
year = 1869,
publisher = {Tr{\"u}bner}
}
@article{s-wnrsf-12,
author = "E. Steinlight",
title = "Why Novels are Redundant: Sensation Fiction and the
Overpopulation of Literature",
journal = "ELH",
pages = {501--535},
Volume = 79,
Number = 2,
Year = 2012
}
@inproceedings{h-qssp-14,
author = {S. {Har-Peled}},
title = {Quasi-Polynomial Time Approximation Scheme for
Sparse Subsets of Polygons},
booktitle = SOCG_2014,
acceptrate = SOCG_2014_AR,
doi = {10.1145/2582112.2582157},
year = 2014,
pages = {120--129}
}
@inproceedings{hr-ecrwv-14-invited,
author = {S. {Har-Peled} and B. Raichel},
title = {On the Expected Complexity of Randomly Weighted
{Voronoi} Diagrams},
booktitle = SOCG_2014,
acceptrate = SOCG_2014_AR,
doi = {10.1145/2582112.2582158},
pages = {232--241},
year = 2014,
note = {Invited to DCG special issue of SoCG 2014}
}
@inproceedings{hr-ecrwv-14,
author = {S. {Har-Peled} and B. Raichel},
title = {On the Expected Complexity of Randomly Weighted
{Voronoi} Diagrams},
booktitle = SOCG_2014,
acceptrate = SOCG_2014_AR,
doi = {10.1145/2582112.2582158},
pages = {232--241},
year = 2014
}
@inproceedings{hr-ocrwv-14,
author = {S. {Har-Peled} and B. {Raichel}},
title = {On the Complexity of Randomly Weighted {Voronoi}
Diagrams},
booktitle = SOCG_2014,
acceptrate = SOCG_2014_AR,
year = 2014,
pages = {232--241},
doi = {10.1145/2582112.2582158},
}
@article{kkt-tborh-91,
author = {C. Kaklamanis and D. Krizanc and T. Tsantilas},
title = {Tight bounds for oblivious routing in the hypercube},
journal = {Math. sys. theory},
pages = {223--232},
year = 1991,
volume = 24,
number = 1,
doi = {10.1007/BF02090400}
}
@ARTICLE{ds-rwen-00,
author = {P.~G. {Doyle} and J.~L. {Snell}},
title = {Random Walks and Electric Networks},
journal = {ArXiv Mathematics e-prints},
eprint = {math/0001057},
year = 2000,
url = {http://arxiv.org/abs/math.PR/0001057}
}
@article{z-ldeim-07,
author = {D. Zuckerman},
title = {Linear Degree Extractors and the Inapproximability
of Max Clique and Chromatic Number},
year = 2007,
pages = {103--128},
doi = {10.4086/toc.2007.v003a006},
journal = {Theory of Computing},
volume = 3,
number = 6,
URL = {http://www.theoryofcomputing.org/articles/v003a006}
}
@ARTICLE{mrr-qgscp-14,
author = {N.~H. {Mustafa} and R. {Raman} and S. {Ray}},
title = {{QPTAS} for Geometric Set-Cover Problems via Optimal
Separators},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1403.0835},
primaryClass = "cs.CG",
year = 2014,
url = {http://arxiv.org/abs/1403.0835}
}
@ARTICLE{h-qptas-13,
author = {S. {Har-Peled}},
title = {Quasi-Polynomial Time Approximation Scheme for
Sparse Subsets of Polygons},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1312.1369},
year = 2013,
url = {http://arxiv.org/abs/1312.1369},
}
@Article{br-pp-10,
author = {I. B{\'a}r{\'a}ny and M. Reitzner},
title = {Poisson Polytopes},
journal = {Annals. Prob.},
year = 2010,
volume = 38,
number = 4,
pages = {1507--1531}
}
@article{bdht-mh-05,
author = {{Z.-D.} Bai and L. Devroye and {H.-K.} Hwang and
{T.-H.} Tsai},
title = {Maxima in hypercubes},
journal = {Random Struct. Alg.},
volume = 27,
number = 3,
year = 2005,
pages = {290--309},
doi = {10.1002/rsa.20053}
}
@article{br-ovrp-10,
author = "I. B{\'a}r{\'a}ny and M. Reitzner",
title = "On the variance of random polytopes ",
journal = "Adv. Math.",
volume = 225,
number = 4,
pages = "1986--2001",
year = 2010,
doi = "10.1016/j.aim.2010.04.012"
}
@article{htc-tpkds-13,
author = {{H.-K.} Hwang and {T.-H.} Tsai and {W.-M.} Chen},
title = {Threshold Phenomena in {$k$}-Dominant Skylines of
Random Samples},
journal = SICOMP,
volume = 42,
number = 2,
year = 2013,
pages = {405--441},
doi = {10.1137/110856952}
}
@INCOLLECTION{a-we-08,
TITLE = "Welfare economics",
BOOKTITLE = "The New Palgrave Dictionary of Economics",
AUTHOR = "A. Feldman",
EDITOR = "S. Durlauf and L. Blume",
YEAR = 2008,
PUBLISHER = "Palgrave Macmillan"
}
@article{osw-odcrc-84,
author = {T. Ottmann and E. {Soisalon-Soininen} and D. Wood},
title = {On the Definition and Computation of Rectlinear
Convex Hulls},
journal = {Inf. Sci.},
year = 1984,
pages = {157--171},
volume = 33,
number = 3,
doi = {10.1016/0020-0255(84)90025-2},
}
@inproceedings{bks-so-01,
author = {S. B{\"o}rzs{\"o}nyi and D. Kossmann and K. Stocker},
title = {The Skyline Operator},
booktitle = {ICDE},
year = 2001,
pages = {421--430},
doi = {10.1109/ICDE.2001.914855}
}
@article{klp-fmsv-75,
author = {H. Kung and F. Luccio and F. Preparata},
title = {On Finding the Maxima of a Set of Vectors},
journal = JACM,
volume = 22,
number = 4,
year = 1975,
pages = {469--476},
url = {10.1145/321906.321910},
}
@article{gsg-aamvc-07,
author = {P. Godfrey and R. Shipley and J. Gryz},
title = {Algorithms and analyses for maximal vector
computation},
journal = {VLDB J.},
volume = 16,
number = 1,
year = 2007,
pages = {5--28},
doi = {10.1007/s00778-006-0029-7}
}
@article{hr-ecrwv-14-arxiv,
author = {S. {Har-Peled} and B. Raichel},
title = {On the Expected Complexity of Randomly Weighted
{Voronoi} Diagrams},
journal = {CoRR},
volume = {abs/1401.1477},
year = 2014,
url = {http://arxiv.org/abs/1401.1477}
}
@article{as-soria-92,
author = {F. Aurenhammer and O. Schwarzkopf},
title = {A simple on-line randomized incremental algorithm
for computing higher order {Voronoi} diagrams.},
journal = IJCGA,
year = 1992,
pages = {363--381},
doi = {10.1142/S0218195992000214},
}
@article{v-scrp-05,
author = {V.H. Vu},
title = {Sharp concentration of random polytopes},
journal = GAFA,
year = 2005,
volume = 15,
pages = {1284--1328}
}
@incollection{s-chc-97,
author = {R. Seidel},
title = {Convex Hull Computations},
booktitle = {Handbook of Discrete and Computational Geometry},
editor = "J. E. Goodman and J. O'Rourke",
year = 2004,
pages = {495--512},
publisher = {CRC Press},
}
@article{klm-pipst-10,
Author = {{M. van} Kreveld and M. {L{\"o}ffler} and
J. S. B. Mitchell},
Title = {Preprocessing Imprecise Points and Splitting
Triangulations},
Journal = SICOMP,
Number = 7,
Pages = {2990--3000},
Volume = 39,
Year = 2010
}
@inproceedings{acty-iud-09,
Author = {P. K. Agarwal and {S.-W.} Cheng and Y. Tao and
K. Yi},
Title = {Indexing uncertain data},
Booktitle = PODS_2009,
Pages = {137--146},
Year = 2009
}
@phdthesis{p-sddgs-09,
author = {J.M. Phillips},
title = {Small and Stable Descriptors of Distributions for
Geometric Statistical Problems},
year = 2009,
school = {Dept. Computer Sci.},
publisher = {Duke University}
}
@inproceedings{kcs-smstes-11,
Author = {P. Kamousi and T.M. Chan and S. Suri},
Booktitle = SOCG_2011,
Title = {Stochastic Minimum Spanning Trees in Euclidean
Spaces},
pages = {65--74},
Year = 2011
}
@inproceedings{svy-mlchu-13,
author = {S. Suri and K. Verbeek and H. Yildiz},
title = {On the Most Likely Convex Hull of Uncertain Points},
booktitle = ESA_2013,
year = 2013,
pages = {791--802},
doi = {10.1007/978-3-642-40450-4_67}
}
@inproceedings{zyn-pchqt-12,
author = {Z. Zhao and D. Yan and W. Ng},
title = {A probabilistic convex hull query tool},
booktitle = EDBT_2012,
year = 2012,
pages = {570--573},
doi = {10.1145/2247596.2247668}
}
@inproceedings{ms-loq-92,
author = "J. Matou{\v s}ek and O. Schwarzkopf",
title = "Linear optimization queries",
booktitle = SOCG_1992,
year = 1992,
pages = "16--25",
keywords = "separation, linear programming, prune-and-search"
}
@article{asw-actp-08,
author = {P.K. Agarwal and M. Sharir and E. Welzl},
title = {Algorithms for Center and Tverberg Points},
journal = TALG,
volume = 5,
number = 1,
month = dec,
year = 2008,
pages = {5:1--5:20}
}
@incollection{j-hrctt-93,
author = {J. Eckhoff},
title = {Helly, Radon, and {Carath{\'e}odory} Type Theorems},
editor = {P. M. Gruber and J. M. Wills},
booktitle = {Handbook of Convex Geometry},
publisher = {North-Holland},
year = 1993,
pages = {389--448},
}
@article{c-chfda-93,
title = {Cutting hyperplanes for divide-and-conquer},
author = {B. Chazelle},
year = 1993,
journal = DCG,
volume = 9,
number = 1,
doi = {10.1007/BF02189314},
pages = {145--158}
}
@InProceedings{b-danns-96,
author = {S. N. Bespamyatnikh},
title = {Dynamic algorithms for approximate neighbor
searching},
booktitle = CCCG_1996,
url =
{http://www.cccg.ca/proceedings/1996/cccg1996_0042.pdf},
pages = {252--257},
year = 1996
}
@article{ip-ocks-01,
author = {R. Impagliazzo and R. Paturi},
title = {On the Complexity of {$k$}-{SAT}},
journal = JCSS,
volume = 62,
number = 2,
year = 2001,
pages = {367--375},
doi = {10.1006/jcss.2000.1727}
}
@article{ipz-wphse-01,
author = {R. Impagliazzo and
R. Paturi and
F. Zane},
title = {Which Problems Have Strongly Exponential Complexity?},
journal = JCSS,
volume = {63},
number = {4},
pages = {512--530},
year = {2001},
doi = {10.1006/jcss.2001.1774}
}
@article{m-rhtp-76,
author = "G. L. Miller",
title = "Riemann's Hypothesis and Tests for Primality",
Journal = JCSS,
year = 1976,
pages = "300--317",
volume = 13,
number = 3
}
@article{r-patp-80,
author = "M. O. Rabin",
title = "Probabilistic algorithm for testing primality ",
journal = "J. Number Theory",
volume = 12,
number = 1,
pages = "128--138",
year = 1980
}
@book{dw-cdsta-13,
author = {D.-Z. Du and P.-J. Wan},
title = {Connected dominating set: {Theory} and applications},
doi = {10.1007/978-1-4614-5242-3},
series = {Opt. and Apps.},
publisher = {Springer},
volume = 77,
year = 2013
}
@article{a-ocpls-70,
author = {E.M. Andreev},
title = {On Convex Polyhedra in Lobachevsky Spaces},
pages = {413--440},
doi = {10.1070/SM1970v010n03ABEH001677},
journal = {Sbornik: Mathematics},
month = apr,
volume = 10,
year = 1970
}
@inproceedings{bhn-gltlp-01,
author = {B. Brod\'{e}n and M. Hammar and B. J. Nilsson},
title = {Guarding lines and {$2$}-link polygons is {APX-Hard}},
booktitle = CCCG_2001,
pages = {45--48},
year = 2001
}
@article{gmm-snaml-94,
author = {G. Galbiati and F. Maffioli and A. Morzenti},
title = {A short note on the approximability of the maximum
leaves spanning tree problem},
doi = {10.1016/0020-0190(94)90139-2},
journal = IPL,
month = oct,
number = 1,
pages = {45--49},
volume = 52,
year = 1994
}
@article{chr-fpuvp-14,
author = {H.-C. Chang and S. {Har-Peled} and B. {Raichel}},
title = {From Proximity to Utility: A {Voronoi} Partition of
{Pareto} Optima},
journal = {CoRR},
volume = {abs/1404.3403},
year = 2014,
ee = {http://arxiv.org/abs/1404.3403}
}
@article{dht-mcpme-14,
author = {A. Dumitrescu and S. {Har-Peled} and
C. D. {T{\'o}th}},
title = {Minimum Convex Partitions and Maximum Empty
Polytopes},
journal = JOCG,
volume = 5,
number = 1,
year = 2014,
pages = {86--103},
url = {http://jocg.org/index.php/jocg/article/view/112}
}
@article{agr-ratsp-01,
author = {N. M. Amato and M. T. Goodrich and E. A. Ramos},
title = {A Randomized Algorithm for Triangulating a Simple
Polygon in Linear Time},
doi = {10.1007/s00454-001-0027-x},
journal = DCG,
volume = 26,
number = 2,
year = 2001,
pages = {245--265}
}
@article{lp-esppr-84,
author = "D. T. Lee and F. P. Preparata",
title = "Euclidean shortest paths in the presence of
rectilinear barriers",
journal = "Networks",
volume = 14,
year = 1984,
pages = "393--410",
doi = {10.1002/net.3230140304},
keywords = "triangulations"
}
@inproceedings{abtszs-osacp-96,
author = {D. Avis and P. Bose and G. T. Toussaint and
T. C. Shermer and B. Zhu and J. Snoeyink},
title = {On the Sectional Area of Convex Polytopes},
booktitle = SOCG_1996,
acceptrate = SOCG_1996_AR,
year = 1996,
pages = {411--412}
}
@article{v-gosaf-14,
author = {A. Vigneron},
title = {Geometric optimization and sums of algebraic
functions},
journal = TALG,
volume = 10,
number = 1,
year = 2014,
articleno = 4,
pages = {4:1--4:20},
url = {10.1145/2532647}
}
@article{acky-ocprm-14,
author = {H.-K. Ahn and S.-W. Cheng and H. J. Kweon and
J. Yon},
title = {Overlap of convex polytopes under rigid motion},
journal = CGTA,
volume = 47,
number = 1,
year = 2014,
pages = {15--24},
doi = {10.1016/j.comgeo.2013.08.001}
}
@article{acr-mocpt-13,
author = {H.-K. Ahn and S.-W. Cheng and I. Reinbacher},
title = {Maximum overlap of convex polytopes under
translation},
journal = CGTA,
volume = 46,
number = 5,
year = 2013,
pages = {552--565},
doi = {10.1016/j.comgeo.2011.11.003}
}
@article{cl-smurm-13,
author = {S.-W. Cheng and C.-K. Lam},
title = {Shape matching under rigid motion},
journal = CGTA,
volume = 46,
number = 6,
year = 2013,
pages = {591--603},
doi = {10.1016/j.comgeo.2013.01.002}
}
@article{hr-amopt-14-arxiv,
author = {S. {Har-Peled} and S. Roy},
title = {Approximating the Maximum Overlap of Polygons under
Translation},
year = 2014,
journal = {CoRR},
volume = {abs/1406.5778},
url = {http://arxiv.org/abs/1406.5778}
}
@article{ahsyz-chuu-14-arxiv,
author = {P. K. Agarwal and S. {Har-Peled} and S. Suri and
H. Yildiz and W. Zhang},
title = {Convex Hulls under Uncertainty},
journal = {CoRR},
volume = {abs/1406.6599},
year = 2014,
ee = {http://arxiv.org/abs/1406.6599},
}
@inproceedings{hr-amopt-14,
author = {Sariel Har{-}Peled and Subhro Roy},
editor = {Andreas S. Schulz and Dorothea Wagner},
title = {Approximating the Maximum Overlap of Polygons under
Translation},
booktitle = ESA_2014,
acceptrate = ESA_2015_AR,
series = LNCS,
volume = {8737},
pages = {542--553},
publisher = {Springer},
year = {2014},
url = {http://dx.doi.org/10.1007/978-3-662-44777-2_45},
doi = {10.1007/978-3-662-44777-2_45},
}
@inproceedings{ahsyz-chuu-14,
author = {P. K. Agarwal and S. {Har-Peled} and S. Suri and
H. {Y{\i}l{}d{\i}z} amd W. Zhang},
title = {Convex Hulls under Uncertainty},
booktitle = ESA_2014,
acceptrate = ESA_2015_AR,
year = 2014,
pages = {37--48},
doi = {10.1007/978-3-662-44777-2_4}
}
@inproceedings{ast-stgem-90,
author = {N. Alon and P. Seymour and R. Thomas},
title = {A separator theorem for graphs with an excluded
minor and its applications},
booktitle = STOC_1990,
year = 1990,
pages = {293--299},
doi = {10.1145/100216.100254}
}
@article{e-dtmcg-00,
author = {D. Eppstein},
title = {Diameter and treewidth in minor-closed graph
families},
journal = ALGORITHMICA,
volume = 27,
pages = {275--291},
year = 2000,
doi = {10.1007/s004530010020}
}
@article{hmrrr-nasnp-98,
author = "H. B. Hunt and M.V. Marathe and V. Radhakrishnan
and S. S. Ravi and D. J. Rosenkrantz and R. E
Stearns",
title = {{NC}-Approximation Schemes for {NP}- and
{PSPACE}-Hard Problems for Geometric Graphs},
journal = JALG,
volume = 26,
number = 2,
pages = "238--274",
year = 1998,
doi = {10.1006/jagm.1997.0903}
}
@inproceedings{k-racp-72,
author = {R. M. Karp},
title = {Reducibility Among Combinatorial Problems},
booktitle = {Complexity of Computer Computations},
year = 1972,
pages = {85--103},
url =
{http://www.cs.berkeley.edu/$\sim$luca/cs172/karp.pdf}
}
@article{ccj-udg-91,
author = {B. N. Clark and C. J. Colbourn and D. S. Johnson},
title = {Unit Disk Graphs},
journal = {Discrete Math.},
volume = 86,
number = {1--3},
month = jan,
year = 1991,
pages = {165--177},
numpages = 13,
doi = {10.1016/0012-365X(90)90358-O},
publisher = {Elsevier Science Publishers B. V.}
}
@phdthesis{f-mpafo-92,
author = {{A. F. van~der} {Stappen}},
title = {Motion Planning Amidst Fat Obstacles},
school = {Utrecht University},
year = 1992,
address = {Netherlands},
url = {http://www.staff.science.uu.nl/~stapp101/PhDThesis_AFvanderStappen.pdf}
}
@article{c-cftcp-87,
author = "B. Chazelle",
title = "Computing on a free tree via complexity-preserving
mappings",
journal = "Algorithmica",
volume = 2,
year = 1987,
pages = "337--361"
}
@unpublished{c-enkci-04,
author = {K. L. Clarkson},
title = {On the Expected Number of {$k$}-sets of
Coordinate-Wise Independent Points},
note = {manuscript},
url = {http://cm.bell-labs.com/who/clarkson/cwi_ksets/p.pdf},
year = 2004
}
@ARTICLE{ahks-urmsn-13-arxiv,
author = {P. K. Agarwal and S. {Har-Peled} and H. Kaplan and
M. Sharir},
title = "{Union of Random {Minkowski} Sums and Network
Vulnerability Analysis}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1310.5647},
primaryClass = "cs.CG",
year = 2013,
month = oct,
url = {http://arxiv.org/abs/1310.5647}
}
@article{fmmt-dmotd-01,
author = {T. Fukuda and Y. Morimoto and S. Morishita and
T. Tokuyama},
title = {Data mining with optimized two-dimensional
association rules},
journal = TODS,
volume = 26,
number = 2,
pages = {179--213},
year = 2001
}
@article{fpt-opcpn-81,
author = {R. J. Fowler and M. S. Paterson and S. L. Tanimoto},
title = {Optimal packing and covering in the plane are
{NP}-complete},
journal = IPL,
volume = 12,
number = 3,
pages = {133--137},
year = 1981,
publisher = {Elsevier}
}
@INPROCEEDINGS{kmp-artp-98,
author = {S. Khanna and S. Muthukrishnan and M. Paterson},
title = {On approximating rectangle tiling and packing},
booktitle = SODA_1998,
year = 1998,
pages = {384--393}
}
@article{ia-fccmc-83,
author = {H. Imai and T. Asano},
title = {Finding the connected components and a maximum
clique of an intersection graph of rectangles in the
plane},
journal = JALG,
volume = 4,
number = 4,
pages = {310--323},
year = 1983,
publisher = {Elsevier}
}
@article{bdmr-eaatp-01,
author = "P. Berman and B. {DasGupta} and S. Muthukrishnan
and S. Ramaswami",
title = "Efficient Approximation Algorithms for Tiling and
Packing Problems with Rectangles ",
journal = JALG,
volume = 41,
number = 2,
pages = "443--470",
year = 2001
}
@inproceedings{lno-racna-02,
author = {L. {Lewin-Eytan} and J. Naor and A. Orda},
title = {Routing and Admission Control in Networks with
Advance Reservations},
booktitle = APPROX_2002,
year = 2002,
pages = {215--228},
series = LNCS,
volume = 2462
}
@ARTICLE{n-fsbhd-00,
author = {F. Nielsen},
title = {Fast stabbing of boxes in high dimensions},
journal = TCS,
year = 2000,
volume = 246,
pages = {53--72},
number = {1--2},
doi = {10.1016/S0304-3975(98)00336-3}
}
@article{df-rbsdm-92,
author = {J. S. Doerschler and H. Freeman},
title = {A rule-based system for dense-map name placement},
journal = CACM,
volume = 35,
number = 1,
pages = {68--79},
year = 1992
}
@inproceedings{lsw-car-97,
author = {B. Lent and A. Swami and J. Widom},
title = {Clustering association rules},
booktitle = ICDE_1997,
pages = {220--231},
year = 1997,
doi = {10.1109/ICDE.1997.581756},
organization = {IEEE}
}
@Misc{s-pc-14,
author = {J. Soto},
howpublished = {personal communication},
year = 2014
}
@inproceedings{c-cmisr-11,
author = {P. Chalermsook},
title = {Coloring and Maximum Independent Set of Rectangles},
booktitle = APPROX_RAND_2011,
year = 2011,
pages = {123--134},
doi = {10.1007/978-3-642-22935-0_11},
series = LNCS,
volume = 6845,
publisher = {Springer}
}
@inproceedings{agkkw-ptasw-98,
author = {S. Arora and M. Grigni and D. Karger and P. Klein
and A. Woloszyn},
title = {A polynomial-time approximation scheme for weighted
planar graph {TSP}},
booktitle = SODA_1998,
year = 1998,
pages = {33--41},
publisher = {SIAM}
}
@ARTICLE{aw-asmwi-13-arxiv,
author = {A. {Adamaszek} and A. {Wiese}},
title = "{Approximation schemes for maximum weight
independent set of rectangles}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1307.1774},
volume = {abs/1307.1774},
primaryClass = "cs.DS",
year = 2013
}
@incollection{fmp-acggi-00,
author = "L. de Floriani and P. Magillo and E, Puppo",
title = "Applications of Computational Geometry to Geographic
Information Systems",
editor = "J.-R. Sack and J. Urrutia",
booktitle = "Handbook of computational geometry",
publisher = "North Holland",
pages = "333--388",
year = 2000,
}
@inproceedings{va-oamis-99,
author = {B. Verweij and K. Aardal},
title = {An optimisation algorithm for maximum independent
set with applications in map labelling},
booktitle = ESA_1999,
pages = {426--437},
year = 1999
}
@inproceedings{aglw-ciglu-13,
author = {A. Anagnostopoulos and F. Grandoni and S. Leonardi
and A. Wiese},
title = {Constant Integrality Gap {LP} Formulations of
Unsplittable Flow on a Path},
booktitle = IPCO_2013,
year = 2013,
pages = {25--36},
doi = {10.1007/978-3-642-36694-9_3}
}
@inproceedings{bsw-cfaau-11,
author = {P. Bonsma and J. Schulz and A. Wiese},
title = {A Constant Factor Approximation Algorithm for
Unsplittable Flow on Paths},
booktitle = FOCS_2011,
year = 2011,
pages = {47--56},
doi = {10.1109/FOCS.2011.10}
}
@article{kn-iscpi-90,
author = {J. Kratochv{\'\i}l and J. Ne{\v{s}}et{\v{r}}il},
title = {Independent set and clique problems in
intersection-defined classes of graphs},
journal = {Comment. Math. Univ. Carolinae},
volume = 31,
number = 1,
pages = {85--93},
year = 1990,
publisher = {Charles University}
}
@incollection{c-c-05,
author = {B. Chazelle},
title = {Cuttings},
editor = {D. P. Mehta and S. Sahni},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman \& HAL/CRC},
chapter = 25,
year = 2005,
url =
{\url{http://www.cs.princeton.edu/~chazelle/pubs/cuttings.pdf}}
}
@inproceedings{nhk-rpmwi-05,
author = "T. Nieberg and J. Hurink and W. Kern",
title = "A robust {PTAS} for maximum weight independent set in
unit disk graphs",
booktitle = "Proc. 30th Int. Workshop Graph-Theoretic Concepts in
Comput. Sci.",
volume = 3353,
series = "Lecture Notes Comput. Sci.",
pages = "214--221",
year = 2005
}
@ARTICLE{bk-udgrn-98,
author = {H. Breu and D. G. Kirkpatrick},
title = {Unit disk graph recognition is {NP}-hard},
journal = CGTA,
year = 1998,
volume = 9,
pages = {3--24},
number = {1--2},
month = jan
}
@article{sss-rsgn-03,
author = {M. Schaefer and E. Sedgwick and
D. {\v{S}}tefankovi{\v{c}}},
title = {Recognizing string graphs in {NP}},
journal = JCSS,
volume = 67,
number = 2,
pages = {365--380},
year = 2003,
publisher = {Elsevier}
}
@article{t-ntasa-96,
author = {B. Tagansky},
title = {A New Technique for Analyzing Substructures in
Arrangements of Piecewise Linear Surfaces},
journal = DCG,
year = 1996,
volume = 16,
number = 4,
pages = {455--479},
doi = {10.1007/BF02712877},
}
@article{kk-iagsg-11,
author = {J. King and D. Kirkpatrick},
title = {Improved Approximation for Guarding Simple Galleries
from the Perimeter},
journal = DCG,
issue_date = {September 2011},
volume = 46,
number = 2,
month = sep,
year = 2011,
pages = {252--269},
numpages = 18,
doi = {10.1007/s00454-011-9352-x},
publisher = {Springer-Verlag New York, Inc.}
}
@Article{pt-tlbse-13,
author = {J. Pach and G. Tardos},
title = {Tight lower bounds for the size of epsilon-nets},
journal = JAMS,
year = 2013,
volume = 26,
pages = {645--658},
}
@article{bgo-lssp-07,
author = {J.{-}D. Boissonnat and L. J. Guibas and S. Oudot},
title = {Learning smooth shapes by probing},
journal = CGTA,
year = 2007,
volume = 37,
number = 1,
pages = {38--58},
doi = {10.1016/j.comgeo.2006.05.008}
}
@Unpublished{ehs-ogpcd-14,
author = {D. Eppstein and S. Har{-}Peled and A. Sidiropoulos},
title = {On the Greedy Permutation and Counting Distances},
note = {manuscript},
year = 2014
}
@article{ahks-urmsn-14,
author = {P. K. Agarwal and S. Har{-}Peled and H. Kaplan and
M. Sharir},
title = {Union of Random {Minkowski} Sums and Network
Vulnerability Analysis},
journal = DCG,
year = 2014,
volume = 52,
number = 3,
pages = {551--582},
doi = {10.1007/s00454-014-9626-1},
}
@article{c-wspdl-08,
author = {T. M. Chan},
title = {Well-separated pair decomposition in linear time?},
journal = IPL,
year = 2008,
volume = 107,
number = 5,
pages = {138--141},
doi = {10.1016/j.ipl.2008.02.008},
timestamp = {Sun, 05 Oct 2014 17:42:45 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/ipl/Chan08},
}
@Article{b-cnn-41,
author = {R. L. Brooks},
title = {On colouring the nodes of a network},
journal = {Math. Proc. Cambridge Phil. Soc.},
year = 1941,
volume = 37,
number = 2,
pages = {194--197},
month = apr,
}
@Article{no-ndg-11,
author = {J. {Ne{\v s}et{\v r}il} and P. {Ossona de Mendez}},
title = {On nowhere dense graphs},
journal = EJC,
year = 2011,
volume = 32,
number = 4,
pages = {600--617}
}
@InProceedings{gks-dfopndg-14,
author = {M. Grohe and S. Kreutzer and S. Siebertz},
title = {Deciding first-order properties of nowhere dense
graphs},
booktitle = STOC_2014,
year = 2014,
pages = {89--98},
doi = {10.1145/2591796.2591851},
}
@inproceedings{dh-bncbf-05,
author = {E. Demaine and M. Hajiaghayi},
title = {Bidimensionality: New Connections Between FPT
Algorithms and {PTAS}s},
booktitle = SODA_2005,
year = 2005,
location = {Vancouver, British Columbia},
pages = {590--601},
numpages = 12,
}
@inproceedings{dh-gefmg-05,
author = {E. D. Demaine and Mohammad Taghi Hajiaghayi},
title = {Graphs excluding a fixed minor have grids as large
as treewidth, with combinatorial and algorithmic
applications through bidimensionality},
booktitle = SODA_2005,
year = 2005,
pages = {682--689}
}
@InProceedings{dgks-asfodop-06,
author = {A. Dawar and M. Grohe and S. Kreutzer and
N. Schweikardt},
title = {Approximation schemes for first-order definable
optimisation problems},
booktitle = LICS_2006,
year = 2006,
pages = {411--420},
}
@article{dhm-aacd-10,
author = {E. Demaine and M. Hajiaghayi and B. Mohar},
title = {Approximation algorithms via contraction
decomposition},
journal = COMBINATORICA,
pages = {533--552},
volume = 30,
number = 5,
year = 2010
}
@inproceedings{dhk-cdmfg-11,
author = {E. Demaine and M. Hajiaghayi and Ken-ichi
Kawarabayashi},
title = {Contraction decomposition in {$h$}-minor-free graphs
and algorithmic applications},
booktitle = STOC_2011,
year = 2011,
pages = {441--450}
}
@article{i-samwi-01,
author = {P. Indyk},
title = {A Small Approximately Min-Wise Independent Family of
Hash Functions},
journal = JALG,
year = 2001,
volume = 38,
number = 1,
pages = {84--90},
doi = {10.1006/jagm.2000.1131}
}
@article{t-egbnl-75,
author = "R. E. Tarjan",
title = "Efficiency of a good but not linear set union
algorithm",
journal = JACM,
volume = 22,
year = 1975,
pages = "215--225"
}
@techreport{ss-empae-85,
author = "J. T. Schwartz and M. Sharir",
title = "Efficient motion planning algorithms in environments
of bounded local complexity",
type = "Report",
number = 164,
institution = "Dept. Comput. Sci., Courant Inst. Math. Sci., New
York Univ.",
address = "New York, NY",
year = 1985
}
@article{sobv-mpelo-98,
author = {A. F. van der Stappen and M. H. Overmars and M. de
Berg and J. Vleugels},
title = {Motion Planning in Environments with Low Obstacle
Density},
journal = DCG,
year = 1998,
volume = 20,
number = 4,
pages = {561--587},
doi = {10.1007/PL00009402}
}
@phdthesis{v-ffrim-97,
author = "J. Vleugels",
title = "On Fatness and Fitness --- Realistic Input Models
for Geometric Algorithms",
type = "Ph.{D}. Thesis",
school = "Dept. Comput. Sci., Univ. Utrecht",
address = "Utrecht, The Netherlands",
year = 1997,
keywords = "doctoral thesis"
}
@phdthesis{d-raapg-13,
author = {A. Driemel},
title = {Realistic Analysis for Algorithmic Problems on
Geographical Data},
school = {Utrecht University},
year = 2013,
url = {http://repository.tue.nl/761554}
}
@article{sv-rslde-96,
author = {O. Schwarzkopf and J. Vleugels},
title = {Range Searching in Low-Density Environments},
journal = IPL,
year = 1996,
volume = 60,
number = 3,
pages = {121--127},
doi = {10.1016/S0020-0190(96)00154-8}
}
@inproceedings{brs-kcqbb-12,
author = {M. de Berg and M. Roeloffzen and B. Speckmann},
title = {Kinetic Compressed Quadtrees in the Black-Box Model
with Applications to Collision Detection for
Low-Density Scenes},
booktitle = ESA_2012,
year = 2012,
pages = {383--394},
doi = {10.1007/978-3-642-33090-2_34}
}
@article{apv-aaklc-05,
author = {P. K. Agarwal and M. Procopiuc and
K. R. Varadarajan},
title = {Approximation Algorithms for a {$k$}-Line Center},
journal = ALGORITHMICA,
year = {2005},
volume = {42},
number = {3-4},
pages = {221--230},
doi = {10.1007/s00453-005-1166-x}
}
@article{abbkm-mcasp-13,
author = {T. Asano and K. Buchin and M. Buchin and M. Korman
and W. Mulzer and G. Rote and A. Schulz},
title = {Memory-constrained algorithms for simple polygons},
journal = CGTA,
year = {2013},
volume = {46},
number = {8},
pages = {959--969},
doi = {10.1016/j.comgeo.2013.04.005}
}
@article{abbkm-mcasp-14,
author = {T. Asano and K. Buchin and M. Buchin and M. Korman
and W. Mulzer and G. Rote and A. Schulz},
title = {Reprint of: {M}emory-constrained algorithms for simple
polygons},
journal = CGTA,
year = {2014},
volume = {47},
number = {3},
pages = {469--479},
doi = {10.1016/j.comgeo.2013.11.004}
}
@article{mp-ssls-80,
author = {J. I. Munro and M. Paterson},
title = {Selection and Sorting with Limited Storage},
journal = TCS,
year = {1980},
volume = {12},
pages = {315--323},
doi = {10.1016/0304-3975(80)90061-4}
}
@article{bg-cavs-11,
author = {Y. Brise and B. G{\"{a}}rtner},
title = {Clarkson's algorithm for violator spaces},
journal = CGTA,
year = {2011},
volume = {44},
number = {2},
pages = {70--81},
doi = {10.1016/j.comgeo.2010.09.003}
}
@article{gmrs-vssa-08,
author = {B. G{\"a}rtner and J. Matou{\v s}ek and
L. R{\"u}st and P. {\v S}kovro{\v n}},
title = {Violator spaces: {S}tructure and algorithms},
journal = {Discrete Appl. Math.},
year = {2008},
volume = {156},
number = {11},
pages = {2124--2141},
doi = {10.1016/j.dam.2007.08.048}
}
@inproceedings{gmrs-vssa-06,
author = {B. G{\"{a}}rtner and J. Matou{\v s}ek and
L. R{\"{u}}st and P. {\v S}kovro{\v n}},
title = {Violator Spaces: {S}tructure and Algorithms},
booktitle = ESA_2006,
year = {2006},
pages = {387--398},
doi = {10.1007/11841036_36}
}
@PhdThesis{s-amop-07,
author = {P. {\v S}kovro{\v n}},
title = {Abstract models of optimization problems},
school = {Charles University},
year = 2007,
note = {\url{http://kam.mff.cuni.cz/~xofon/thesis/diplomka.pdf}}
}
@PhdThesis{r-tpmlc-07,
author = {L. Y. R{\"u}st},
title = {The {$P$}-Matrix Linear Complementarity Problem --
Generalizations and Specializations},
school = {ETH},
year = 2007,
note = {Diss. ETH No. 17387},
doi = {10.3929/ethz-a-005466758}
}
@article{i-sdpge-06,
author = {P. Indyk},
title = {Stable distributions, pseudorandom generators,
embeddings, and data stream computation},
journal = JACM,
year = {2006},
volume = {53},
number = {3},
pages = {307--323},
doi = {10.1145/1147954.1147955}
}
@InProceedings{mrr-sahsg-14,
author = {N. H. Mustafa and R. Raman and S. Ray},
title = {Settling the {APX}-hardness Status for Geometric Set
Cover},
booktitle = FOCS_2014,
year = 2014,
pages = {541--550},
doi = {10.1109/FOCS.2014.64},
}
@article{c-csgaf-10,
author = {K. L. Clarkson},
title = {Coresets, sparse greedy approximation, and the
Frank-Wolfe algorithm},
journal = TALG,
year = {2010},
volume = {6},
number = {4},
doi = {10.1145/1824777.1824783}
}
@inproceedings{cg-epgig-09,
author = {J. Chalopin and D. Gon{\c{c}}alves},
title = {Every planar graph is the intersection graph of
segments in the plane: extended abstract},
booktitle = STOC_2009,
pages = {631--638},
year = 2009,
doi = {10.1145/1536414.1536500}
}
@article{m-nossg-14,
author = {J. Matou{\v s}ek},
title = {Near-Optimal Separators in String Graphs},
journal = {Combin., Prob. {\&} Comput.},
year = 2014,
volume = 23,
number = 1,
pages = {135--139},
doi = {10.1017/S0963548313000400}
}
@article{cg-spfge-14,
author = {S. Cabello and D. Gajser},
title = {Simple {PTAS}'s for families of graphs excluding a
minor},
journal = {CoRR},
volume = {abs/1410.5778},
year = {2014},
url = {http://arxiv.org/abs/1410.5778}
}
@article{cg-spfge-15,
author = {Sergio Cabello and David Gajser},
title = {Simple {PTAS}'s for families of graphs excluding a
minor},
journal = {Disc. App. Math.},
volume = {189},
pages = {41--48},
year = {2015},
url = {http://dx.doi.org/10.1016/j.dam.2015.03.004},
doi = {10.1016/j.dam.2015.03.004},
timestamp = {Fri, 29 May 2015 12:42:03 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/dam/CabelloG15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{b-ibucf-08,
author = {M. de Berg},
title = {Improved Bounds on the Union Complexity of Fat Objects},
journal = DCG,
volume = {40},
number = {1},
pages = {127--140},
year = {2008},
doi = {10.1007/s00454-007-9029-7}
}
@article{cr-btb-15,
author = {Daniel W. Cranston and
Landon Rabern},
title = {Brooks' Theorem and Beyond},
journal = {J. Graph Theo.},
volume = {80},
number = {3},
pages = {199--225},
year = {2015},
doi = {10.1002/jgt.21847}
}
@ARTICLE{cr-btb-14-old,
author = {D.~W. {Cranston} and L. {Rabern}},
title = {Brooks' Theorem and Beyond},
journal = {ArXiv e-prints},
eprint = {1403.0479},
primaryClass = "math.CO",
keywords = {Mathematics - Combinatorics, 05C15},
year = 2014,
month = mar,
adsurl = {http://adsabs.harvard.edu/abs/2014arXiv1403.0479C},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@article{s-pgp-89,
author = {S. S. Skiena},
title = {Problems in geometric probing},
journal = ALGORITHMICA,
volume = 4,
pages = {599--605},
year = 1989
}
@misc{w-afm-14,
author = "Wikipedia",
title = "Atomic force microscopy --- Wikipedia{,} The Free
Encyclopedia",
year = 2014,
url = "http://en.wikipedia.org/w/index.php?title=Atomic_force_microscopy"
}
@article{bqg-afm-86,
title = {Atomic Force Microscope},
author = {G. Binnig and C. F. Quate and Ch. Gerber},
journal = {Phys. Rev. Lett.},
volume = {56},
issue = {9},
pages = {930--933},
numpages = {0},
year = {1986},
month = {Mar},
publisher = {American Physical Society},
doi = {10.1103/PhysRevLett.56.930},
url = {http://link.aps.org/doi/10.1103/PhysRevLett.56.930}
}
@article{cy-sfp-87,
title = {Shape from probing},
author = {R. Cole and C. K. Yap},
journal = JALG,
volume = {8},
number = {1},
pages = {19--38},
year = {1987}
}
@incollection{s-grp-97,
author = {S. S. Skiena},
title = {Geometric reconstruction problems},
booktitle = {Handbook of Discrete and Computational Geometry},
editor = {J. E. Goodman and J. O'Rourke},
chapter = 26,
pages = {481--490},
publisher = {CRC Press LLC},
address = {Boca Raton, FL},
year = 1997
}
@inproceedings{skgtb-spmtm-09,
author = {R. M. Smelik and K. J. De Kraker and
S. A. Groenewegen and T. Tutenel and R. Bidarra},
title = {A Survey of Procedural Methods for Terrain
Modelling},
booktitle = {Proc. of the CASA Work. 3D Adv. Media Gaming Simul.},
year = 2009
}
@book{m-fgn-83,
author = {B. B. Mandelbrot},
title = {The fractal geometry of nature},
publisher = {Macmillan},
year = 1983
}
@book{at-imss-10,
author = {L.-E. Andersson and N. F. Stewart},
title = {Introduction to the Mathematics of Subdivision
Surfaces},
publisher = {SIAM},
year = 2010
}
@article{b-gasd-82,
author = {J. F. Blinn},
title = {A Generalization of Algebraic Surface Drawing},
journal = TGRP,
volume = 1,
pages = {235--256},
year = 1982
}
@inproceedings{pasfg-eppam-13,
title = {An efficient proximity probing algorithm for
metrology},
author = {F. Panahi and A. Adler and {A. F. van der} Stappen and
K. Goldberg},
booktitle = {Proc. IEEE Int. Conf. Autom. Sci. Engin. (CASE)},
pages = {342--349},
year = {2013},
}
@article{k-ctach-12,
author = {B. Kalantari},
title = {A Characterization Theorem and An Algorithm for {A}
Convex Hull Problem},
journal = {CoRR},
volume = {abs/1204.1873},
year = {2012},
url = {http://arxiv.org/abs/1204.1873}
}
@article{mb-sccp-84,
author = {J. M. Mulvey and M. P. Beck},
title = {Solving capacitated clustering problems},
journal = {Euro. J. Oper. Res.},
volume = 18,
pages = {339--348},
year = 1984
}
@article{a-pdpaa-87,
author = {F. Aurenhammer},
title = {Power Diagrams: Properties, Algorithms and Applications},
journal = SICOMP,
volume = {16},
number = {1},
pages = {78--96},
year = {1987}
}
@Unpublished{hk-rpsbs-14-unpublished,
author = {S. {Har-Peled} and N. Kumar},
title = {Robust Proximity Search for Balls using Sublinear
Space},
note = {\url{http://sarielhp.org/p/13/bann/}},
year = 2014
}
@ARTICLE{hk-rpsbs-14-arxiv,
author = {S. {Har-Peled} and N. {Kumar}},
title = "{Robust Proximity Search for Balls using Sublinear
Space}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1401.1472},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2014,
month = jan,
adsurl = {http://adsabs.harvard.edu/abs/2014arXiv1401.1472H},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@inproceedings{hk-rpsbs-14,
author = {S. Har{-}Peled and N. Kumar},
title = {Robust Proximity Search for Balls Using Sublinear
Space},
booktitle = FSTTCS_2014,
acceptrate = FSTTCS_2014_AR,
series = {LIPIcs},
volume = {29},
pages = {315--326},
year = {2014},
doi = {10.4230/LIPIcs.FSTTCS.2014.315}
}
@ARTICLE{jcly-srqpd-11,
author = {J. Jestes and G. Cormode and F. Li and K. Yi},
journal = {IEEE Trans. Know. Data Eng.},
title = {Semantics of ranking queries for probabilistic data},
year = {2011},
volume = {23},
number = {12},
pages = {1903--1917}
}
@article{hkm-uevsa-93,
author = {D. P. Huttenlocher and K. Kedem and M. Sharir},
title = {The upper envelope of {Voronoi} surfaces and its
applications},
journal = DCG,
volume = {9},
number = {1},
year = {1993},
pages = {267--291}
}
@inproceedings{chr-fpuvp-15-old,
author = {H.-C. Chang and S. {Har-Peled} and B. {Raichel}},
title = {From Proximity to Utility: {A} {Voronoi} Partition of
{Pareto} Optima},
booktitle = SOCG_2015,
acceptrate = SOCG_2015_AR,
year = 2015,
note = {To appear}
}
@inproceedings{chr-fpuvp-15,
author = {H.-C. Chang and S. {Har-Peled} and B. {Raichel}},
title = {From Proximity to Utility: {A} {Voronoi} Partition
of {Pareto} Optima},
booktitle = SOCG_2015,
acceptrate = SOCG_2015_AR,
deleditor = {L. Arge and J.. Pach},
series = {LIPIcs},
volume = {34},
pages = {689--703},
delpublisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = {2015},
doi = {10.4230/LIPIcs.SOCG.2015.689}
}
@article{chr-puvpp-16,
author = {Hsien{-}Chih Chang and Sariel Har{-}Peled and
Benjamin Raichel},
title = {From Proximity to Utility: {A} Voronoi Partition of
Pareto Optima},
journal = DCG,
volume = {56},
number = {3},
pages = {631--656},
year = {2016},
url = {http://dx.doi.org/10.1007/s00454-016-9808-0},
doi = {10.1007/s00454-016-9808-0},
timestamp = {Mon, 05 Sep 2016 19:00:16 +0200},
biburl =
{http://dblp.dagstuhl.de/rec/bib/journals/dcg/ChangHR16},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{h-sppus-15-old,
author = {S. {Har-Peled}},
title = {Shortest Path in a Polygon using Sublinear Space},
booktitle = SOCG_2015,
acceptrate = SOCG_2015_AR,
year = 2015,
note = {To appear}
}
@inproceedings{h-sppus-15,
author = {S. Har{-}Peled},
deleditor = {L. Arge and J. Pach},
title = {Shortest Path in a Polygon using Sublinear Space},
booktitle = SOCG_2015,
acceptrate = SOCG_2015_AR,
series = {LIPIcs},
volume = {34},
pages = {111--125},
delpublisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = {2015},
doi = {10.4230/LIPIcs.SOCG.2015.111}
}
@inproceedings{hkmr-seps-15-old,
author = {S. {Har-Peled} and N. Kumar and D. Mount and
B. Raichel},
title = {Space Exploration via Proximity Search},
booktitle = SOCG_2015,
acceptrate = SOCG_2015_AR,
year = 2015,
note = {To appear}
}
@inproceedings{hkmr-seps-15,
author = {S. {Har-Peled} and N. Kumar and D. Mount and
B. Raichel},
deleditor = {L. Arge and J. Pach},
title = {Space Exploration via Proximity Search},
booktitle = SOCG_2015,
acceptrate = SOCG_2015_AR,
series = {LIPIcs},
volume = 34,
pages = {374--389},
delpublisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = 2015,
doi = {10.4230/LIPIcs.SOCG.2015.374}
}
@article{hkmr-seps-16,
author = {Sariel Har{-}Peled and
Nirman Kumar and
David M. Mount and
Benjamin Raichel},
title = {Space Exploration via Proximity Search},
journal = DCG,
volume = {56},
number = {2},
pages = {357--376},
year = {2016},
url = {http://dx.doi.org/10.1007/s00454-016-9801-7},
doi = {10.1007/s00454-016-9801-7}
}
@article{h-sppsp-14,
author = {S. Har{-}Peled},
title = {Shortest Path in a Polygon using Sublinear Space},
journal = {CoRR},
volume = {abs/1412.0779},
year = {2014},
url = {http://arxiv.org/abs/1412.0779}
}
@article{g-eadch-72,
author = {R. L. Graham},
title = {An Efficient Algorithm for Determining the Convex
Hull of a Finite Planar Set},
journal = IPL,
volume = {1},
number = {4},
pages = {132--133},
year = {1972},
doi = {10.1016/0020-0190(72)90045-2}
}
@article{ph-chfsp-77,
author = {F. P. Preparata and S. J. Hong},
title = {Convex hulls of finite sets of points in two and
three dimensions},
journal = CACM,
volume = {20},
number = {2},
year = {1977},
pages = {87--93}
}
@article{c-oosch-96,
title = {Optimal output-sensitive convex hull algorithms in
two and three dimensions},
author = {T. M. Chan},
year = {1996},
journal = DCG,
volume = {16},
issue = {4},
pages = {361--368}
}
@article{cm-dosch-95,
author = {B. Chazelle and J. Matou{\v{s}}ek},
title = {Derandomizing an output-sensitive convex hull
algorithm in three dimensions},
journal = CGTA,
volume = {5},
number = {1},
pages = {27--32},
year = {1995}
}
@article{ks-upcha-86,
author = {D. G. Kirkpatrick and R. Seidel},
title = {The ultimate planar convex hull algorithm?},
journal = SICOMP,
volume = {15},
number = {1},
year = {1986},
pages = {287--299}
}
@inproceedings{s-chdch-86,
author = "R. Seidel",
title = "Constructing higher-dimensional convex hulls at
logarithmic cost per face",
booktitle = STOC_1986,
year = 1986,
pages = "404--413",
keywords = "convex hull, incidence graph, polyhedra, linear
programming, {$d$}-dimensional, output dependent"
}
@phdthesis{l-diicg-09,
author = {M. L\"{o}ffler},
title = {Data Imprecision in Computational Geometry},
year = {2009},
school = {Dept. Computer Sci.},
publisher = {Utrecht University}
}
@article{em-chpll-13,
author = "E. Ezra and W. Mulzer",
title = "Convex hull of points lying on lines in {$o(n \log
n)$} time after preprocessing",
journal = CGTA,
volume = "46",
number = "4",
pages = "417--434",
year = "2013",
}
@inproceedings{aaalp-aus-11,
author = "P. Afshani and P.K. Agarwal and L. Arge and K.G. Larsen
and J.M. Phillips",
title = "{(Approximate)} uncertain skylines",
booktitle = ICDT_2011,
year = "2011",
pages = "186--196",
}
@article{kcs-cppop-14,
author = {P. Kamousi and T. M. Chan and S. Suri},
title = {Closest Pair and the Post Office Problem for
Stochastic Points},
journal = CGTA,
issue_date = {February, 2014},
volume = {47},
number = {2},
month = feb,
year = {2014},
issn = {0925-7721},
pages = {214--223},
doi = {10.1016/j.comgeo.2012.10.010},
publisher = {Elsevier Science Publishers B. V.},
address = {Amsterdam, The Netherlands, The Netherlands},
}
@article{p-apchs-14,
author = {P. P{\'{e}}rez{-}Lantero},
title = {Area and Perimeter of the Convex Hull of Stochastic
Points},
journal = {CoRR},
volume = {abs/1412.5153},
year = {2014},
url = {http://arxiv.org/abs/1412.5153}
}
@inproceedings{wz-tsfud-14,
author = {H. Wang and W. Zhang},
title = {The {$\tau$}-skyline for uncertain data},
booktitle = CCCG_2014,
year = 2014,
pages = {326--331}
}
@inproceedings{jlj-gcotp-11,
author = {A. J{\o}rgensen and M. L\"{o}ffler and J. Phillips},
title = {Geometric computations on indecisive points},
booktitle = WADS_2011,
year = {2011},
pages = {536--547}
}
@article{eos-calha-86,
author = "H. Edelsbrunner and J. O'Rourke and R. Seidel",
title = "Constructing arrangements of lines and hyperplanes
with applications",
journal = SICOMP,
volume = 15,
year = 1986,
pages = "341--363",
keywords = "design of algorithms, combinatorial geometry,
construction, incrementation, geometric
transformations, incidence graph, arrangements,
{$d$}-dimensional",
comments = "buggy proof fixed in \cite{ess-ztha-91}"
}
@inproceedings{bgmr-ilsgh-15,
author = {N. Bus and S. Garg and N. H. Mustafa and S. Ray},
editor = {E. W. Mayr and N. Ollinger},
title = {Improved Local Search for Geometric Hitting Set},
booktitle = STACS_2015,
series = {LIPIcs},
volume = {30},
pages = {184--196},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = {2015},
doi = {10.4230/LIPIcs.STACS.2015.184}
}
@Book{no-s-12,
author = {J. Ne{\v s}et{\v r}il and P. {Ossona de Mendez}},
title = {Sparsity -- Graphs, Structures, and Algorithms},
publisher = {Springer},
year = 2012,
volume = 28,
series = {Alg. Combin.},
doi = {10.1007/978-3-642-27875-4}
}
@article{g-ltwem-03,
author = {M. Grohe},
title = {Local Tree-Width, Excluded Minors, and Approximation
Algorithms},
year = 2003,
journal = COMBINATORICA,
volume = 23,
number = 4,
pages = {613--632},
publisher = {Springer-Verlag},
doi = {10.1007/s00493-003-0037-9}
}
@Article{no-gcbe1-08,
author = {J. {Ne{\v s}et{\v r}il} and P. {Ossona de Mendez}},
title = {Grad and classes with bounded expansion {I}.
Decompositions},
journal = EJC,
year = 2008,
volume = 29,
number = 3,
pages = {760--776},
doi = {10.1016/j.ejc.2006.07.013},
}
@Article{ no-gcbe2-08,
author = {J. {Ne{\v s}et{\v r}il} and P. {Ossona de Mendez}},
title = {Grad and classes with bounded expansion
{II}. Algorithmic aspects},
journal = EJC,
year = 2008,
number = 3,
volume = 29,
pages = {777--791},
doi = {10.1016/j.ejc.2006.07.014},
}
@InProceedings{h-cha-96-old,
author = {J. H{\r a}stad},
title = {Clique is Hard to Approximate Within {$n^{1-\epsilon}$}},
booktitle = FOCS_1996,
year = 1996,
pages = {627--636}
}
@ARTICLE{hq-aaldg-15-arxiv,
author = {{Har-Peled}, S. and {Quanrud}, K.},
title = "Approximation Algorithms for Low-Density Graphs",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1501.00721},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2015,
month = jan,
adsurl = {http://adsabs.harvard.edu/abs/2015arXiv150100721H},
adsnote = {Provided by the SAO/NASA Astrophysics Data System},
url = {http://arxiv.org/abs/1501.00721}
}
@inproceedings{hq-aapel-15,
author = {S. Har{-}Peled and K. Quanrud},
title = {Approximation Algorithms for Polynomial-Expansion
and Low-Density Graphs},
booktitle = ESA_2015,
acceptrate = ESA_2015_AR,
del_editor = {Nikhil Bansal and Irene Finocchi},
series = LNCS,
volume = {9294},
pages = {717--728},
del_publisher= {Springer},
year = {2015},
doi = {10.1007/978-3-662-48350-3_60}
}
@InProceedings{prs-semig-94,
author = {S. Plotkin and S. Rao and W.D. Smith},
title = {Shallow Excluded Minors and Improved Graph
Decompositions},
booktitle = soda_1994,
pages = {462--470},
year = 1994,
url = {http://dl.acm.org/citation.cfm?id=314464.314625},
}
@article{aaikl-gsac-01,
author = "O. Aichholzer and F. Aurenhammer and C. Icking and
R. Klein and E. Langetepe and G. Rote",
title = "Generalized self-approaching curves",
journal = "Disc. App. Math.",
volume = 109,
number = {1-2},
pages = {3--24},
year = 2001
}
@inproceedings{gip-aapss-99,
author = "D. Goldman and S. Istrail and C. H. Papadimitriou",
title = "Algorithmic Aspects of Protein Structure Similarity",
booktitle = FOCS_1999,
pages = "512--522",
year = "1999"
}
@inproceedings{ks-mcspf-94,
author = "A. Kolinski and J. Skolnick",
title = "Monte Carlo simulations of protein folding: Lattice
model and interaction scheme.",
booktitle = "Proteins",
volume = "18",
pages = "338--352",
year = "1994"
}
@article{s-lisps-89,
author = "J. S. Salowe",
title = "{$L_\infty$} interdistance selection by parametric
search",
journal = IPL,
volume = 30,
pages = {9--14},
year = 1989
}
@inproceedings{b-wwdtt-14,
author = {K. Bringmann},
title = {Why Walking the Dog Takes Time: Frechet Distance Has
No Strongly Subquadratic Algorithms Unless {SETH}
Fails},
booktitle = FOCS_2014,
pages = {661--670},
year = {2014},
doi = {10.1109/FOCS.2014.76}
}
@inproceedings{agm-nalio-14,
author = {S. Arora and R. Ge and A. Moitra},
title = {New Algorithms for Learning Incoherent and
Overcomplete Dictionar +ies},
booktitle = COLT_2014,
pages = {779--806},
year = {2014}
}
@inproceedings{cw-msbc2-13,
author = {E. W. Chambers and Y. Wang},
title = {Measuring similarity between curves on {$2$}-manifolds
via homotopy area},
booktitle = SOCG_2013,
pages = {425--434},
year = {2013},
doi = {10.1145/2462356.2462375}
}
@article{ht-ept-74,
author = {J. E. Hopcroft and R. E. Tarjan},
title = {Efficient Planarity Testing},
journal = JACM,
volume = {21},
number = {4},
pages = {549--568},
year = {1974},
doi = {10.1145/321850.321852}
}
@incollection{b-tends-67,
author = "H. Blum",
title = "A transformation for extracting new descriptors of
shape",
editor = "W. Wathen-Dunn",
booktitle = "Models for the Perception of Speech and Visual Form",
publisher = "MIT Press",
year = 1967,
pages = "362--380",
url = {http://pageperso.lif.univ-mrs.fr/~edouard.thiel/rech/1967-blum.pdf}
}
@inproceedings{gstwv-olnp-01,
author = {B. G{\"{a}}rtner and J. Solymosi and
F. Tschirschnitz and E. Welzl and P. Valtr},
title = {One line and {$n$} points},
booktitle = STOC_2001,
pages = {306--315},
year = 2001,
doi = {10.1145/380752.380814}
}
@inproceedings{km-eaesp-88,
author = "S. Kapoor and S. N. Maheshwari",
title = "Efficient algorithms for {Euclidean} shortest path
and visibility problems with polygonal obstacles",
booktitle = SOCG_1988,
year = 1988,
pages = "172--182",
doi = {10.1145/73393.73411},
}
@article{cc-mpga-07,
author = {T. M. Chan and E. Y. Chen},
title = {Multi-Pass Geometric Algorithms},
journal = DCG,
volume = {37},
number = {1},
pages = {79--102},
year = {2007},
doi = {10.1007/s00454-006-1275-6}
}
@inproceedings{kms-srsdp-13,
author = {P. N. Klein and
S. Mozes and
C. Sommer},
title = {Structured recursive separator decompositions for planar graphs in
linear time},
booktitle = STOC_2013,
pages = {505--514},
delpublisher = {{ACM}},
year = {2013},
doi = {10.1145/2488608.2488672}
}
@article{cegs-sessr-91,
author = "B. Chazelle and H. Edelsbrunner and L. J. Guibas and
M. Sharir",
title = "A singly-exponential stratification scheme for real
semi-algebraic varieties and its applications",
journal = TCS,
volume = 84,
year = 1991,
pages = "77--105",
keywords = "cell decomposition, random sampling, triangulation"
}
@article{k-atubv-04,
author = {V. Koltun},
title = {Almost tight upper bounds for vertical
decompositions in four dimensions},
journal = JACM,
volume = {51},
number = {5},
pages = {699--730},
year = {2004},
doi = {10.1145/1017460.1017461}
}
@inproceedings{ct-oda23-15,
author = {T. M. Chan and K. Tsakalidis},
title = {Optimal Deterministic Algorithms for 2-d and 3-d
Shallow Cuttings},
booktitle = SOCG_2015,
pages = {719--732},
year = {2015},
crossref = {DBLP:conf/compgeom/2015},
doi = {10.4230/LIPIcs.SOCG.2015.719}
}
@inproceedings{r-orrrs-99,
author = {E. A. Ramos},
title = {On Range Reporting, Ray Shooting and \emph{k}-Level
Construction},
booktitle = SOCG_1999,
pages = {390--399},
year = {1999},
doi = {10.1145/304893.304993}
}
@article{c-dds3c-10,
author = {T. M. Chan},
title = {A dynamic data structure for 3-D convex hulls and
2-D nearest neighbor queries},
journal = JACM,
volume = {57},
number = {3},
year = {2010},
doi = {10.1145/1706591.1706596}
}
@inproceedings{c-adsrh-14,
author = {E. Cohen},
title = {All-distances sketches, revisited: {HIP} estimators
for massive graphs analysis},
booktitle = PODS_2014,
pages = {88--99},
deleditor = {Richard Hull and Martin Grohe},
delpublisher = {{ACM}},
year = {2014},
doi = {10.1145/2594538.2594546}
}
@article{ams-sscch-94,
author = "B. Aronov and J. Matou{\v s}ek and M. Sharir",
title = "On the sum of squares of cell complexities in
hyperplane arrangements",
journal = "J. Combin. Theory Ser. A",
volume = 65,
year = 1994,
pages = "311--321"
}
@article{br-cpcs-52,
author = {R. P. Bambah and C. A. Rogers},
title = {Covering the Plane with Convex Sets},
volume = {s1-27},
number = {3},
pages = {304--314},
year = {1952},
doi = {10.1112/jlms/s1-27.3.304},
URL = {http://jlms.oxfordjournals.org/content/s1-27/3/304.short},
eprint = {http://jlms.oxfordjournals.org/content/s1-27/3/304.full.pdf+html},
journal = {J. London Math. Soc.}
}
@article{n-ocpp-62,
author = {A.B.J. Novikoff},
title = {On Convergence Proofs on Perceptrons},
booktitle = {Proc. Symp. Math. Theo. Automata},
pages = {615--622},
timestamp = {2010-03-09T02:56:24.000+0100},
volume = 12,
year = 1962
}
@ARTICLE{bhr-sagps-15,
author = {A. {Blum} and S. {Har-Peled} and B. {Raichel}},
title = "{Sparse Approximation via Generating Point Sets}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1507.02574},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2015,
month = jul,
adsurl = {http://adsabs.harvard.edu/abs/2015arXiv150702574B},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@ARTICLE{ehs-agcds-15,
author = {D. {Eppstein} and S. {Har-Peled} and
A. {Sidiropoulos}},
title = "{Approximate Greedy Clustering and Distance
Selection for Graph Metrics}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1507.01555},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2015,
month = jul
}
@inproceedings{dggt-scch-15,
author = {O. Devillers and M. Glisse and X. Goaoc and
R. Thomasse},
title = {On the Smoothed Complexity of Convex Hulls},
booktitle = SOCG_2015,
pages = {224--238},
year = {2015},
doi = {10.4230/LIPIcs.SOCG.2015.224}
}
@inproceedings{c-gacm-10,
author = {B. Chazelle},
deleditor = {D. G. Kirkpatrick and J. S. B. Mitchell},
title = {A geometric approach to collective motion},
booktitle = SOCG_2010,
pages = {117--126},
publisher = {{ACM}},
year = {2010},
doi = {10.1145/1810959.1810983}
}
@article{c-cbf-14,
author = {B. Chazelle},
title = {The Convergence of Bird Flocking},
journal = JACM,
volume = {61},
number = {4},
pages = {21:1--21:35},
year = {2014},
doi = {10.1145/2629613}
}
@inproceedings{c-gf-10,
author = {B, Chazelle},
title = {The geometry of flocking},
booktitle = SOCG_2010,
pages = {19--28},
year = {2010},
doi = {10.1145/1810959.1810963}
}
@ARTICLE{p-ctd-13,
author = {P. Papasoglu},
title = "Contracting thin disks",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1309.2967},
primaryClass = "math.DG",
keywords = {Mathematics - Differential Geometry, 53C23},
year = 2013,
month = sep,
adsurl = {http://adsabs.harvard.edu/abs/2013arXiv1309.2967P},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@ARTICLE{cr-clr2s-13,
author = {G.~R. {Chambers}, and R. {Rotman}},
title = "{Contracting loops on a {Riemannian} {$2$}-surface}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1311.2995},
primaryClass = "math.DG",
keywords = {Mathematics - Differential Geometry, Mathematics -
Geometric Topology, 53C23},
year = 2013,
month = nov,
adsurl = {http://adsabs.harvard.edu/abs/2013arXiv1311.2995C},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@inproceedings{lsh-mbrcf-65,
author = {P. M. {Lewis II} and R. E. Stearns and J. Hartmanis},
title = {Memory bounds for recognition of context-free and
context-sensitive languages},
booktitle = FOCS_1965,
pages = {191--202},
delpublisher = {{IEEE} Computer Society},
year = {1965},
doi = {10.1109/FOCS.1965.14}
}
@article{r-okdtn-15,
author = {N. Rubin},
title = {On Kinetic Delaunay Triangulations: A Near-Quadratic
Bound for Unit Speed Motions},
journal = JACM,
issue_date = {June 2015},
volume = {62},
number = {3},
month = jun,
year = {2015},
issn = {0004-5411},
pages = {25:1--25:85},
articleno = {25},
numpages = {85},
doi = {10.1145/2746228},
acmid = {2746228},
delpublisher = {ACM},
deladdress = {New York, NY, USA},
keywords = {Computational geometry, Delaunay triangulation,
Voronoi diagram, combinatorial complexity, discrete
changes, geometric arrangements, kinetic data
structures, moving points},
}
@InBook{m-ombd-89,
author = {C. {McDiarmid}},
ALTeditor = {J. Siemons},
title = {Surveys in Combinatorics},
chapter = {On the method of bounded differences},
publisher = {Cambridge University Press},
year = {1989}
}
@incollection{sw-csg-10,
author = {R. Schneider and W. Weil},
title = {Classical stochastic geometry},
editor = {W. S. Kendall and I. Molchanov},
booktitle = {New Perspectives in Stochastic Geometry},
year = {2010},
publisher = {Oxford University Press},
address = "London, England",
pages = {606},
isbn = {978-0-19-923257-4}
}
@incollection{r-rp-10,
author = {M. Reitzner},
title = {Random polytopes},
editor = {W. S. Kendall and I. Molchanov},
booktitle = {New Perspectives in Stochastic Geometry},
year = {2010},
publisher = {Oxford University Press},
address = "London, England",
pages = {606},
isbn = {978-0-19-923257-4}
}
@incollection{c-t-10,
author = {P. Calka},
title = {Tessellations},
editor = {W. S. Kendall and I. Molchanov},
booktitle = {New Perspectives in Stochastic Geometry},
year = {2010},
publisher = {Oxford University Press},
address = "London, England",
pages = {606},
isbn = {978-0-19-923257-4}
}
@article{bht-vmrtl-10,
author = {M. {de Berg} and H. J. Haverkort and
C. P. Tsirogiannis},
title = {Visibility Maps of Realistic Terrains have Linear
Smoothed Complexity},
journal = JOCG,
volume = {1},
number = {1},
pages = {57--71},
year = {2010},
url = {http://jocg.org/index.php/jocg/article/view/12}
}
@Article{lwqba-rldmp-15,
author = "Lea, J. S. E. and Wetherbee, B. M. and Queiroz,
N. and Burnie, N. and Aming, C. and Sousa, L. L.
and Mucientes, G. R. and Humphries, N. E. and
Harvey, G. M. and Sims, D. W. and Shivji, M. S.",
title = "Repeated, long-distance migrations by a philopatric
predator targeting highly contrasting ecosystems",
journal = "Scientific Reports",
year = "2015",
month = "Jun",
day = "09",
delpublisher = "Macmillan Publishers Limited SN -",
volume = "5",
pages = "11202 EP -",
delnote = "Article",
note = "\url{http://dx.doi.org/10.1038/srep11202}",
doi = {10.1038/srep11202}
}
@Misc{t-frmt-85,
author = {W. Thurston},
title = {The finite Riemann mapping theorem},
year = 1985,
note = {Invited talk at Int. Sympos. at Purdue University on
the occasion of the proof of the Bieberbach
conjecture}
}
@inproceedings{dimv-sccsc-14,
author = {E. D. Demaine and P. Indyk and S. Mahabadi and
A. Vakilian},
title = {On Streaming and Communication Complexity of the Set
Cover Problem},
del_editor = {Fabian Kuhn},
booktitle = DISC_2014,
series = LNCS,
volume = {8784},
pages = {484--498},
publisher = {Springer},
year = {2014},
doi = {10.1007/978-3-662-45174-8_33},
}
@inproceedings{n-ccasp-02,
title = {The communication complexity of approximate set
packing and covering},
author = {N. Nisan},
booktitle = ICALP_2002,
pages = {868--875},
year = {2002},
publisher = {Springer}
}
@article{gw-ceaas-97,
author = {T. Grossman and A. Wool},
title = {Computational experience with approximation
algorithms for the set covering problem},
journal = {Euro. J. Oper. Res.},
volume = {101},
number = {1},
pages = {81--92},
year = {1997},
del_publisher= {Elsevier}
}
@inproceedings{sg-mcsma-09,
author = {B. Saha and L. Getoor},
title = {On Maximum Coverage in the Streaming Model {\&}
Application to Multi-topic Blog-Watch},
booktitle = SDM,
year = {2009},
pages = {697--708},
del_author = {Barna Saha and Lise Getoor}
}
@inproceedings{ckt-mcmr-10,
author = {F. Chierichetti and R. Kumar and A. Tomkins},
title = {Max-cover in map-reduce},
booktitle = WWW_2010,
pages = {231--240},
year = {2010},
doi = {10.1145/1772690.1772715},
delpublisher = {{ACM}},
deleditor = {Michael Rappa and Paul Jones and Juliana Freire and
Soumen Chakrabarti},
delauthor = {Flavio Chierichetti and Ravi Kumar and Andrew
Tomkins}
}
@inproceedings{ckw-scavl-10,
author = {G. Cormode and H. J. Karloff and A. Wirth},
title = {Set cover algorithms for very large datasets},
booktitle = CIKM_2010,
pages = {479--488},
year = {2010},
doi = {10.1145/1871437.1871501},
delpublisher = {{ACM}},
delauthor = {Graham Cormode and Howard J. Karloff and Anthony
Wirth},
deleditor = {Jimmy Huang and Nick Koudas and Gareth J. F. Jones
and Xindong Wu and Kevyn Collins{-}Thompson and
Aijun An},
}
@inproceedings{kmvv-fgams-13,
author = {R. Kumar and B. Moseley and S. Vassilvitskii and
A. Vattani},
title = {Fast greedy algorithms in {MapReduce} and streaming},
booktitle = SPAA_2013,
pages = {1--10},
year = {2013},
doi = {10.1145/2486159.2486168},
delauthor = {Ravi Kumar and Benjamin Moseley and Sergei
Vassilvitskii and Andrea Vattani},
deleditor = {Guy E. Blelloch and Berthold V{\"{o}}cking},
delpublisher = {{ACM}}
}
@inproceedings{er-sssc-14,
author = {Y. Emek and A. Ros{\'{e}}n},
title = {Semi-Streaming Set Cover},
booktitle = ICALP_2014,
series = LNCS,
volume = {8572},
pages = {453--464},
year = {2014},
doi = {10.1007/978-3-662-43948-7_38},
delpublisher = {Springer},
delauthor = {Yuval Emek and Adi Ros{\'{e}}n},
deleditor = {Javier Esparza and Pierre Fraigniaud and Thore
Husfeldt and Elias Koutsoupias}
}
@inproceedings{cw-igpcs-16,
author = {A. Chakrabarti and T. Wirth},
title = {Incidence Geometries and the Pass Complexity of
Semi-Streaming Set Cover},
booktitle = SODA_2016,
year = 2016,
note = {To appear. Preprint %
\href{http://arxiv.org/abs/1507.04645}{arXiv:1507.04645}
},
delauthor = {Chakrabarti, Amit and Wirth, Tony},
}
@incollection{gm-lbqer-07,
author = {S. Guha and A. McGregor},
title = {Lower bounds for quantile estimation in random-order
and multi-pass streaming},
booktitle = ICALP_2007,
pages = {704--715},
year = {2007},
series = LNCS,
volume = {4596},
publisher = {Springer},
delauthor = {Guha, Sudipto and McGregor, Andrew}
}
@incollection{gm-tlbsp-08,
author = {S. Guha and A. McGregor},
title = {Tight lower bounds for multi-pass stream computation
via pass elimination},
booktitle = ICALP_2008,
volume = {5125},
pages = {760--772},
year = {2008},
series = LNCS,
publisher = {Springer},
delauthor = {Guha, Sudipto and McGregor, Andrew}
}
@inproceedings{go-slbmg-13,
author = {V. Guruswami and K. Onak},
title = {Superlinear lower bounds for multipass graph
processing},
booktitle = CCC_2013,
pages = {287--298},
year = {2013},
doi = {10.1109/CCC.2013.37},
delorganization= {IEEE},
delpublisher = {{IEEE}},
delauthor = {Guruswami, Venkatesan and Onak, Krzysztof},
}
@article{ams-acskr-06,
author = {N. Alon and D. Moshkovitz and S. Safra},
title = {Algorithmic construction of sets for
{$k$}-restrictions},
journal = TALG,
volume = {2},
number = {2},
pages = {153--177},
year = {2006},
delpublisher = {ACM},
delauthor = {Alon, Noga and Moshkovitz, Dana and Safra, Shmuel},
}
@InProceedings{rs-sbepl-97,
author = {R. Raz and S. Safra},
title = {A Sub-Constant Error-Probability Low-Degree Test,
and a Sub-Constant Error-Probability {PCP}
Characterization of {NP}},
booktitle = STOC_1997,
year = 1997,
pages = {475--484},
doi = {10.1145/258533.258641},
}
@article{bjks-isads-04,
author = {Z. Bar{-}Yossef and T. S. Jayram and R. Kumar and
D. Sivakumar},
title = {An information statistics approach to data stream
and communication complexity},
journal = JCSS,
volume = {68},
number = {4},
pages = {702--732},
year = {2004},
doi = {10.1016/j.jcss.2003.11.006},
delauthor = {Ziv Bar{-}Yossef and T. S. Jayram and Ravi Kumar and
D. Sivakumar},
}
@article{ks-pccsi-92,
author = {B. Kalyanasundaram and G. Schintger},
title = {The probabilistic communication complexity of set
intersection},
journal = SIDMA,
volume = {5},
number = {4},
pages = {545--557},
year = {1992},
delpublisher = {SIAM},
delauthor = {Kalyanasundaram, Bala and Schintger, Georg},
}
@article{r-dcd-92,
author = {A. A. Razborov},
title = {On the distributional complexity of disjointness},
journal = TCS,
volume = {106},
number = {2},
pages = {385--390},
year = {1992},
delpublisher = {Elsevier},
delauthor = {Razborov, Alexander A.}
}
@article{hk-nammb-73,
author = {J. E. Hopcroft and R. M. Karp},
title = {An {$n^{5/2}$} Algorithm for Maximum Matchings in
Bipartite Graphs},
journal = SICOMP,
volume = {2},
issue = {4},
pages = {225–-231},
year = {1973}
}
@MastersThesis{i-aamkp-09,
author = {M. T. Islam},
title = {Approximation algorithms for minimum knapsack
problem},
school = {Dept. Math \& Comp. Sci., Univ. Lethbridge},
year = 2009,
note = {\url{https://www.uleth.ca/dspace/handle/10133/1304}},
url = {https://www.uleth.ca/dspace/handle/10133/1304}
}
@inproceedings{cr-orcpl-04-old,
author = {A. Chakrabarti and O. Regev},
title = {An optimal randomised cell probe lower bound for
approximate nearest neighbour searching},
booktitle = FOCS_2004,
pages = {473--482},
year = {2004},
delorganization= {IEEE}
}
@article{cr-orcpl-10,
author = {A. Chakrabarti and O. Regev},
title = {An Optimal Randomized Cell Probe Lower Bound for
Approximate Nearest Neighbor Searching},
journal = SICOMP,
issue_date = {January 2010},
volume = {39},
number = {5},
month = feb,
year = {2010},
issn = {0097-5397},
pages = {1919--1940},
numpages = {22},
doi = {10.1137/080729955},
delpublisher = {Society for Industrial and Applied Mathematics},
deladdress = {Philadelphia, PA, USA}
}
@inproceedings{p-ebnns-06,
author = {R. Panigrahy},
title = {Entropy based nearest neighbor search in high
dimensions},
booktitle = SODA_2006,
pages = {1186--1195},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109688},
organization = {ACM}
}
@Book{sdi-nnmlv-06,
author = {G. Shakhnarovich and T. Darrell and P. Indyk},
title = {Nearest-Neighbor Methods in Learning and Vision:
Theory and Practice},
year = 2006,
series = "Neur. Info. Proc.",
publisher = {The MIT Press},
url =
{https://mitpress.mit.edu/books/nearest-neighbor-methods-learning-and-vision}
}
@article{clmw-rpca-11,
author = {E. J. Cand{\`e}s and X. Li and Y. Ma and J. Wright},
title = {Robust principal component analysis?},
journal = JACM,
volume = {58},
number = {3},
pages = {11},
year = {2011},
doi = {10.1145/1970392.1970395},
delpublisher = {ACM}
}
@inproceedings{mnss-akfnn-14,
author = {W. Mulzer and H. L. Nguy{\^{e}}n and P. Seiferth and
Y. Stein},
title = {Approximate {$k$}-flat Nearest Neighbor Search},
booktitle = STOC_2015,
pages = {783--792},
year = {2015},
doi = {10.1145/2746539.2746559}
}
@inproceedings{aikn-alnnh-09,
author = {A. Andoni and P. Indyk and R. Krauthgamer and
H. L. N{guy{\~{{\^{e}}}}n}},
title = {Approximate line nearest neighbor in high
dimensions},
booktitle = SODA_2009,
pages = {293--301},
year = {2009},
doi = {10.1137/1.9781611973068.33},
delorganization= {Society for Industrial and Applied Mathematics}
}
@inproceedings{m-anlsh-15,
author = {Mahabadi, Sepideh},
title = {Approximate Nearest Line Search in High Dimensions},
booktitle = SODA_2015,
series = {SODA '15},
year = {2015},
location = {San Diego, California},
pages = {337--354},
numpages = {18},
url = {http://dl.acm.org/citation.cfm?id=2722129.2722154},
acmid = {2722154},
publisher = {SIAM},
}
@inproceedings{m-anlsh-15-old,
author = {S. Mahabadi},
title = {Approximate nearest line search in high dimensions},
booktitle = SODA_2015,
pages = {337--354},
year = {2015},
delorganization= {SIAM}
}
@article{he-scump-07,
author = {J. Hays and A. A. Efros},
title = {Scene completion using millions of photographs},
journal = {Trans. Graphics},
volume = {26},
number = {3},
pages = {4},
year = {2007},
doi = {10.1145/1276377.1276382},
delpublisher = {ACM}
}
@inproceedings{ainr-blsh-14,
title = {Beyond Locality-Sensitive Hashing},
author = {A. Andoni and P. Indyk and H. L. N{guy{\~{{\^{e}}}}n} and
I. Razenshteyn},
booktitle = SODA_2014,
pages = {1018--1028},
year = {2014},
doi = {10.1137/1.9781611973402.76},
deleditor = {C. Chekuri},
delpublisher = {{SIAM}}
}
@article{csw-fmasp-99,
author = {Francis Y. L. Chin and Jack Snoeyink and Cao An
Wang},
delauthor = "F. Chin and J. Snoeyink and C. A. Wang",
title = "Finding the Medial Axis of a Simple Polygon in
Linear Time",
journal = DCG,
volume = 21,
number = 3,
year = 1999,
pages = "405--420",
doi = {10.1007/PL00009429}
}
@article{mr-sroms-96,
author = {I. J. Munro and V. Raman},
title = {Selection from Read-Only Memory and Sorting with
Minimum Data Movement},
journal = TCS,
volume = {165},
number = {2},
pages = {311--323},
year = {1996},
doi = {10.1016/0304-3975(95)00225-1}
}
@article{a-ipaec-12,
author = {T. Asano},
title = {In-place Algorithm for Erasing a Connected Component in a Binary Image},
journal = TCS,
volume = {50},
number = {1},
pages = {111--123},
year = {2012},
doi = {10.1007/s00224-011-9335-6}
}
@article{amrw-cwsag-11,
author = {T. Asano and W. Mulzer and G. Rote and Y. Wang},
title = {Constant-Work-Space Algorithms for Geometric
Problems},
journal = JOCG,
volume = {2},
number = {1},
pages = {46--68},
year = {2011},
url = {http://jocg.org/index.php/jocg/article/view/30}
}
@inproceedings{ar-oddha-15,
author = {A. Andoni and I. Razenshteyn},
title = {Optimal Data-Dependent Hashing for Approximate Near
Neighbors},
booktitle = STOC_2015,
pages = {793--801},
year = {2015},
doi = {10.1145/2746539.2746553}
}
@article{swcsr-mimde-09,
author = {J. A. C. Sterne and I. R. White and J. B. Carlin and
M. Spratt and P. Royston and M. G. Kenward and
A. M. Wood and J. R. Carpenter},
title = {Multiple imputation for missing data in
epidemiological and clinical research: potential and
pitfalls},
journal = {BMJ},
volume = {338},
pages = {b2393},
year = {2009},
doi = "10.1136/bmj.b2393",
delpublisher = {BMJ Publishing Group Ltd}
}
@article{cfvrs-mdmdi-13,
author = {F. Cismondi and A. S. Fialho and S. M. Vieira and
S. R. Reti and J. M. C. Sousa and S. N. Finkelstein},
title = {Missing data in medical databases: Impute, delete or
classify?},
journal = {AI in Medicine},
volume = {58},
number = {1},
pages = {63--72},
year = {2013},
doi = {10.1016/j.artmed.2013.01.003},
delpublisher = {Elsevier}
}
@article{wcnk-shmde-13,
author = {B. J. Wells and K. M. Chagin and A. S. Nowacki and
M. W. Kattan},
title = {Strategies for handling missing data in electronic
health record derived data},
journal = {eGEMs},
volume = {1},
number = {3},
year = {2013},
doi = {10.13063/2327-9214.1035},
delpublisher = {Academy Health}
}
@InCollection{adiim-lshus-06,
author = {A. Andoni and M. Datar and N. Immorlica and P. Indyk
and V. S. Mirrokni},
title = {Locality-sensitive hashing using stable
distributions},
booktitle = {Nearest-Neighbor Methods in Learning and Vision:
Theory and Practice},
editor = {T. Darrell and P. Indyk and G. Shakhnarovich},
publisher = {MIT Press},
pages = {61--72},
year = 2006,
url = {https://graphics.stanford.edu/courses/cs468-06-fall/Papers/13\%20lsh06.pdf}
}
@article{n-zcal-15,
author = {Gabriel Nivasch},
title = {On the zone of a circle in an arrangement of lines},
journal = {CoRR},
volume = {abs/1503.03462},
year = {2015},
url = {http://arxiv.org/abs/1503.03462},
timestamp = {Thu, 09 Apr 2015 11:33:20 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/Nivasch15},
}
@article{npt-vpad-14,
author = {Gabriel Nivasch and J{\'{a}}nos Pach and G{\'{a}}bor
Tardos},
title = {The visible perimeter of an arrangement of disks},
journal = CGTA,
volume = {47},
number = {1},
pages = {42--51},
year = {2014},
doi = {10.1016/j.comgeo.2013.08.006},
timestamp = {Tue, 17 Sep 2013 17:25:12 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/comgeo/NivaschPT14},
}
@ARTICLE{dn-ssspe-15,
author = {{Dvo{\v{r}}{\'{a}}k}, Z. and {Norin}, S.},
title = "{Strongly sublinear separators and polynomial
expansion}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1504.04821},
primaryClass = "math.CO",
keywords = {Mathematics - Combinatorics, 05C42, G.2.2},
year = 2015,
month = apr,
url = {http://arxiv.org/abs/1504.04821},
adsurl = {http://adsabs.harvard.edu/abs/2015arXiv150404821D},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@article{gn-vhdpq-15,
author = {Sathish Govindarajan and Gabriel Nivasch},
title = {A Variant of the Hadwiger-Debrunner {$(p,
q)$}-Problem in the Plane},
journal = {Discrete {\&} Computational Geometry},
volume = {54},
number = {3},
pages = {637--646},
year = {2015},
url = {http://dx.doi.org/10.1007/s00454-015-9723-9},
doi = {10.1007/s00454-015-9723-9},
timestamp = {Mon, 07 Sep 2015 15:04:51 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/dcg/GovindarajanN15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{nppz-nddvc-13,
author = {Gabriel Nivasch and
J{\'{a}}nos Pach and
Rom Pinchasi and
Shira Zerbib},
title = {The number of distinct distances from a vertex of a convex polygon},
journal = JOCG,
volume = {4},
number = {1},
pages = {1--12},
year = {2013},
url = {http://jocg.org/index.php/jocg/article/view/103},
timestamp = {Tue, 16 Apr 2013 09:56:07 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/jocg/NivaschPPZ13},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{bn-ubc-12,
author = {Boris Bukh and Gabriel Nivasch},
title = {Upper bounds for centerlines},
journal = JOCG,
volume = {3},
number = {1},
pages = {20--30},
year = {2012},
url = {http://jocg.org/index.php/jocg/article/view/80},
timestamp = {Tue, 29 May 2012 10:43:10 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/jocg/BukhN12},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{bmn-sspf-10,
author = {Boris Bukh and Jir{\'{\i}} Matou{\v s}ek and Gabriel
Nivasch},
title = {Stabbing Simplices by Points and Flats},
journal = DCG,
volume = {43},
number = {2},
pages = {321--338},
year = {2010},
url = {http://dx.doi.org/10.1007/s00454-008-9124-4},
doi = {10.1007/s00454-008-9124-4},
timestamp = {Fri, 19 Feb 2010 13:55:46 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/dcg/BukhMN10},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{n-ibntd-10,
author = {Gabriel Nivasch},
title = {Improved bounds and new techniques for {Davenport--Schinzel} sequences
and their generalizations},
journal = JACM,
volume = {57},
number = {3},
year = {2010},
url = {http://doi.acm.org/10.1145/1706591.1706597},
doi = {10.1145/1706591.1706597},
timestamp = {Mon, 12 Apr 2010 10:13:46 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/jacm/Nivasch10},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{ns-ebitr-09,
author = {Gabriel Nivasch and
Micha Sharir},
title = {Eppstein's bound on intersecting triangles revisited},
journal = {J. Comb. Theory, Ser. {A}},
volume = {116},
number = {2},
pages = {494--497},
year = {2009},
url = {http://dx.doi.org/10.1016/j.jcta.2008.07.003},
doi = {10.1016/j.jcta.2008.07.003},
timestamp = {Wed, 11 Feb 2009 13:52:12 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/jct/NivaschS09},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{bmn-lbwen-09,
author = {Boris Bukh and Jir{\'{\i}} Matou{\v s}ek and Gabriel
Nivasch},
editor = {John Hershberger and Efi Fogel},
title = {Lower bounds for weak epsilon-nets and
stair-convexity},
booktitle = SOCG_2009,
pages = {1--10},
publisher = {{ACM}},
year = {2009},
url = {http://doi.acm.org/10.1145/1542362.1542365},
doi = {10.1145/1542362.1542365}
}
@article{aknss-wenic-08,
author = {Noga Alon and Haim Kaplan and Gabriel Nivasch and
Micha Sharir and Shakhar Smorodinsky},
title = {Weak {\(\varepsilon\)}-nets and interval chains},
journal = JACM,
volume = {55},
number = {6},
year = {2008},
url = {http://doi.acm.org/10.1145/1455248.1455252},
doi = {10.1145/1455248.1455252}
}
@article{n-sgfge-06,
author = {Gabriel Nivasch},
title = {The Sprague-Grundy function of the game {Euclid}},
journal = {Discrete Mathematics},
volume = {306},
number = {21},
pages = {2798--2800},
year = {2006},
url = {http://dx.doi.org/10.1016/j.disc.2006.04.020},
doi = {10.1016/j.disc.2006.04.020}
}
@article{n-cdus-04,
author = {Gabriel Nivasch},
title = {Cycle detection using a stack},
journal = {Inf. Process. Lett.},
volume = {90},
number = {3},
pages = {135--140},
year = {2004},
url = {http://dx.doi.org/10.1016/j.ipl.2004.01.016},
doi = {10.1016/j.ipl.2004.01.016}
}
@article{t-rssvl-96,
Author = {R. Tibshirani},
Title = {Regression shrinkage and selection via the lasso},
Journal = {J. Royal Stat. Soc. Series B},
Number = {1},
Pages = {267--288},
Volume = {58},
Year = {1996},
url = {http://statweb.stanford.edu/~tibs/lasso/lasso.pdf}
}
@article{t-rssvl-11,
author = {Tibshirani, Robert},
title = {Regression shrinkage and selection via the lasso: a
retrospective},
journal = {J. Royal Stat. Soc. Series B},
volume = {73},
number = {3},
publisher = {Blackwell Publishing Ltd},
issn = {1467-9868},
url = {http://dx.doi.org/10.1111/j.1467-9868.2011.00771.x},
doi = {10.1111/j.1467-9868.2011.00771.x},
pages = {273--282},
keywords = {l1-penalty, Penalization, Regularization},
year = {2011},
}
@article{cds-adbp-98,
author = {Scott Shaobing Chen and David L. Donoho and Michael
A. Saunders},
title = {Atomic Decomposition by Basis Pursuit},
journal = SISC,
volume = {20},
number = {1},
pages = {33--61},
year = {1998},
url = {http://dx.doi.org/10.1137/S1064827596304010},
doi = {10.1137/S1064827596304010}
}
@article{d-cs-06,
author = {David L. Donoho},
title = {Compressed sensing},
journal = TIT,
volume = {52},
number = {4},
pages = {1289--1306},
year = {2006},
url = {http://dx.doi.org/10.1109/TIT.2006.871582},
doi = {10.1109/TIT.2006.871582},
timestamp = {Mon, 31 Oct 2011 17:05:18 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/tit/Donoho06},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{wygsm-rfrsr-09,
author = {Wright, John and Yang, Allen Y and Ganesh, Arvind
and Sastry, Shankar S and Ma, Yi},
title = {Robust face recognition via sparse representation},
journal = {IEEE Trans. Pattern Anal. Machine Intel.},
volume = {31},
number = {2},
pages = {210--227},
year = {2009},
publisher = {IEEE},
doi = {10.1109/TPAMI.2008.79}
}
@article{crt-rupes-06,
author = {Candes, E. J. and Romberg, J. and Tao, T.},
title = {Robust Uncertainty Principles: Exact Signal
Reconstruction from Highly Incomplete Frequency
Information},
journal = TIT,
issue_date = {February 2006},
volume = {52},
number = {2},
month = feb,
year = {2006},
issn = {0018-9448},
pages = {489--509},
numpages = {21},
url = {http://dx.doi.org/10.1109/TIT.2005.862083},
doi = {10.1109/TIT.2005.862083},
publisher = {IEEE Press},
address = {Piscataway, NJ, USA},
keywords = {Convex optimization, duality in optimization, free
probability, image reconstruction, linear
programming, random matrices, sparsity,
total-variation minimization, trigonometric
expansions, uncertainty principle},
}
@article{n-sasls-95,
author = {Natarajan, Balas Kausik},
title = {Sparse Approximate Solutions to Linear Systems},
journal = SICOMP,
issue_date = {April 1995},
volume = {24},
number = {2},
month = apr,
year = {1995},
issn = {0097-5397},
pages = {227--234},
numpages = {8},
url = {http://dx.doi.org/10.1137/S0097539792240406},
doi = {10.1137/S0097539792240406},
publisher = {Society for Industrial and Applied Mathematics},
address = {Philadelphia, PA, USA},
keywords = {linear systems, sparse solutions},
}
@article{dma-aga-97,
author = {Davis, G. and Mallat, S. and Avellaneda, M.},
title = {Adaptive greedy approximations},
year = {1997},
issn = {0176-4276},
journal = {Constructive Approx.},
volume = {13},
number = {1},
doi = {10.1007/BF02678430},
url = {http://dx.doi.org/10.1007/BF02678430},
publisher = {Springer-Verlag},
keywords = {41A10; Matching pursuit; Adaptive approximations;
Greedy algorithms; D enoising; Overcomplete signal
representation; Time frequency analysis},
pages = {57--98},
language = {English}
}
@inproceedings{fkt-vsh-15,
author = {Dean P. Foster and Howard J. Karloff and Justin
Thaler},
title = {Variable Selection is Hard},
editor = {Peter Gr{\"{u}}nwald and Elad Hazan and Satyen Kale},
booktitle = COLT_2015,
series = {{JMLR} Proceedings},
volume = {40},
pages = {696--709},
publisher = {JMLR.org},
year = {2015},
url = {http://jmlr.org/proceedings/papers/v40/Foster15.html}
}
@inproceedings{pw-pfsa-10,
author = {Mihai Patrascu and Ryan Williams},
title = {On the Possibility of Faster {SAT} Algorithms},
year = {2010},
booktitle = SODA_2010,
pages = {1065--1075},
editor = {Moses Charikar},
publisher = {{SIAM}},
url = {http://dx.doi.org/10.1137/1.9781611973075.86},
doi = {10.1137/1.9781611973075.86}
}
@Article{fpp-hdpgg-90,
author = "Hubert de Fraysseix and J{\'{a}}nos Pach and Richard
Pollack",
title = "How to draw a planar graph on a grid",
journal = "Combinatorica",
volume = "10",
number = "1",
pages = "41--51",
year = "1990",
URL = "http://dx.doi.org/10.1007/BF02122694",
doi = "10.1007/BF02122694",
}
@article{f-slrpg-48,
author = "I. F{\'a}ry",
title = "On Straight Lines Representation of Planar Graphs",
journal = "Acta Sci. Math. Szeged",
volume = 11,
year = 1948,
pages = "229--233",
keywords = "graph drawing"
}
@article{chkk-onefc-15,
author = {O. Cheong and S. Har{-}Peled and H. Kim
and H. Kim},
title = {On the Number of Edges of Fan-Crossing Free Graphs},
journal = ALGORITHMICA,
volume = {73},
number = {4},
pages = {673--695},
year = {2015},
url = {http://dx.doi.org/10.1007/s00453-014-9935-z},
doi = {10.1007/s00453-014-9935-z}
}
@article{h-sppss-16,
author = {Sariel Har{-}Peled},
title = {Shortest path in a polygon using sublinear space},
journal = JOCG,
volume = {7},
number = {2},
pages = {19--45},
year = {2016},
url = {http://jocg.org/index.php/jocg/article/view/256},
timestamp = {Fri, 18 Dec 2015 18:39:45 +0100},
biburl = {http://dblp.dagstuhl.de/rec/bib/journals/jocg/Har-Peled16},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{hr-nplta-15,
author = {Sariel Har{-}Peled and Benjamin Raichel},
title = {Net and Prune: A Linear Time Algorithm for Euclidean
Distance Problems},
journal = JACM,
issue_date = {December 2015},
volume = {62},
number = {6},
month = dec,
year = {2015},
issn = {0004-5411},
pages = {44:1--44:35},
articleno = {44},
numpages = {35},
url = {http://doi.acm.org/10.1145/2831230},
doi = {10.1145/2831230},
acmid = {2831230},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Clustering, linear time, nets, optimization},
}
@article{u-tpg-51,
author = {P. Ungar},
title = {A theorem on planar graphs},
journal = {J. London Math. Soc.},
volume = 26,
year = 1951,
pages = {256--262}
}
@inproceedings{s-ibope-15,
author = {Saladi Rahul},
editor = {Piotr Indyk},
title = {Improved Bounds for Orthogonal Point Enclosure Query
and Point Location in Orthogonal Subdivisions in {$\Re^3$}},
booktitle = SODA_2015,
pages = {200--211},
publisher = {{SIAM}},
year = {2015},
url = {http://dx.doi.org/10.1137/1.9781611973730.15},
doi = {10.1137/1.9781611973730.15}
}
@article{r-arcr-15,
author = {Saladi Rahul},
title = {Approximate Range Counting Revisited},
journal = {CoRR},
volume = {abs/1512.01713},
year = {2015},
url = {http://arxiv.org/abs/1512.01713},
timestamp = {Sat, 02 Jan 2016 11:38:49 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/corr/Rahul15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{mttv-gsfem-98,
author = {Gary L. Miller and
Shang{-}Hua Teng and
William P. Thurston and
Stephen A. Vavasis},
title = {Geometric Separators for Finite-Element Meshes},
journal = {{SIAM} J. Scientific Computing},
volume = {19},
number = {2},
pages = {364--386},
year = {1998},
url = {http://dx.doi.org/10.1137/S1064827594262613},
doi = {10.1137/S1064827594262613},
timestamp = {Tue, 28 Jul 2015 16:55:51 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/siamsc/MillerTTV98},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@ARTICLE{m-sgs-13,
author = {{Matou{\v s}ek}, J.},
title = "{String graphs and separators}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1311.5048},
primaryClass = "math.CO",
keywords = {Mathematics - Combinatorics, Computer Science -
Computational Geometry, 05C62},
year = 2013,
month = nov,
adsurl = {http://adsabs.harvard.edu/abs/2013arXiv1311.5048M},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}
@BOOK{s-icptd-05,
title = {Introduction to Circle Packing: The Theory of
Discrete Analytic Functions},
author = {Kenneth Stephenson},
publisher = {Cambridge University Press},
year = {2005},
month = {4},
edition = {1},
isbn = {9780521823562},
url = {http://amazon.com/o/ASIN/0521823560/},
totalpages = {370},
timestamp = {2016.01.09},
}
@inproceedings{aegkp-bcppg-14,
author = {J. Alam and D. Eppstein and M. T. Goodrich and
S. G. Kobourov and S. Pupyrev},
editor = {Christian A. Duncan and Antonios Symvonis},
title = {Balanced Circle Packings for Planar Graphs},
booktitle = {Graph Drawing - 22nd International Symposium, {GD}
2014, W{\"{u}}rzburg, Germany, September 24-26,
2014, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8871},
pages = {125--136},
publisher = {Springer},
year = {2014},
url = {http://dx.doi.org/10.1007/978-3-662-45803-7_11},
doi = {10.1007/978-3-662-45803-7_11},
timestamp = {Thu, 27 Nov 2014 15:55:52 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/gd/AlamEGKP14},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{bdeg-gcgd-15,
author = {M. J. Bannister and W. E. Devanny and D. Eppstein
and M. T. Goodrich},
title = {The Galois Complexity of Graph Drawing: Why
Numerical Solutions are Ubiquitous for
Force-Directed, Spectral, and Circle Packing
Drawings},
journal = {J. Graph Algorithms Appl.},
volume = {19},
number = {2},
pages = {619--656},
year = {2015},
url = {http://dx.doi.org/10.7155/jgaa.00349},
doi = {10.7155/jgaa.00349}
}
@article{s-hce-92,
author = {O. Schramm},
title = {How to cage an egg},
journal = {Invent. Math.},
pages = {543--560},
volume = 107,
year = 1992
}
@PHDTHESIS{s-cppac-90,
author = {{Schramm}, O.},
title = "Combinatorically Prescribed Packings and
Applications to Conformal and Quasiconformal Maps",
school = {Princeton},
year = 1990
}
@Unpublished{l-grg-09,
author = "L. Lov{\'a}sz",
title = {Geometric Representations of Graphs},
note = {\url{http://www.cs.elte.hu/~lovasz/geomrep.pdf}},
year = {2009}
}
@article{m-ptcpa-93,
author = {B. Mohar},
title = {A polynomial time circle packing algorithm},
journal = {Discrete Math.},
volume = {117},
number = {1-3},
pages = {257--263},
year = {1993},
url = {http://dx.doi.org/10.1016/0012-365X(93)90340-Y},
doi = {10.1016/0012-365X(93)90340-Y}
}
@article{hm-padra-15,
author = {Sariel Har{-}Peled and Sepideh Mahabadi},
title = {Proximity in the Age of Distraction: {R}obust
Approximate Nearest Neighbor Search},
journal = {CoRR},
volume = {abs/1511.07357},
year = {2015},
url = {http://arxiv.org/abs/1511.07357},
timestamp = {Tue, 01 Dec 2015 19:22:34 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/corr/Har-PeledM15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@Unpublished{hm-padra-15-why-oh-why-did-i-type-it,
author = {Sariel Har{-}Peled and Sepideh Mahabadi},
title = {Proximity in the age of distraction: {Robust}
approximate nearest neighbor search},
note = {in submission},
year = 2015
}
@article{him-aslr-16-arxiv,
author = {Sariel Har{-}Peled and Piotr Indyk and Sepideh
Mahabadi},
title = {Approximate Sparse Linear Regression},
journal = {CoRR},
volume = {abs/1609.08739},
year = {2016},
url = {http://arxiv.org/abs/1609.08739}
}
@Unpublished{him-aslr-16,
author = {Sariel Har{-}Peled and Piotr Indyk and Sepideh
Mahabadi},
title = {Approximate Sparse Linear Regression},
note = {in submission},
year = 2016
}
@Unpublished{himv-ttbss-16-old,
author = {Sariel Har{-}Peled and Piotr Indyk and Sepideh
Mahabadi and Ali Vakilian },
title = {Towards Tight Bounds for the Streaming Set Cover
Problem},
note = {Submitted to PODS 2016},
year = 2016
}
@inproceedings{bhr-sagps-16,
author = {Avrim Blum and Sariel Har{-}Peled and Benjamin
Raichel},
editor = {Robert Krauthgamer},
title = {Sparse Approximation via Generating Point Sets},
booktitle = SODA_2016,
acceptrate = SODA_2016_AR,
pages = {548--557},
publisher = {{SIAM}},
year = {2016},
url = {http://dx.doi.org/10.1137/1.9781611974331.ch40},
doi = {10.1137/1.9781611974331.ch40}
}
@inproceedings{hks-akltd-16,
author = {Sariel Har{-}Peled and Haim Kaplan and Micha Sharir},
editor = {Robert Krauthgamer},
title = {Approximating the \emph{k}-Level in
Three-Dimensional Plane Arrangements},
booktitle = SODA_2016,
acceptrate = SODA_2016_AR,
pages = {1193--1212},
publisher = {{SIAM}},
year = {2016},
url = {http://dx.doi.org/10.1137/1.9781611974331.ch83},
doi = {10.1137/1.9781611974331.ch83},
}
@article{hkrs-fspap-97,
author = {M. R. Henzinger and P. Klein and S. Rao and
S. Subramanian},
title = {Faster shortest-path algorithms for planar graphs},
journal = JCSS,
volume = 55,
issue = 1,
month = {August},
year = 1997,
issn = {0022-0000},
pages = {3--23},
numpages = 21,
doi = {10.1006/jcss.1997.1493}
}
@ARTICLE{hq-naape-16-arxiv,
author = {{Har-Peled}, S. and {Quanrud}, K.},
title = {Notes on Approximation Algorithms for
Polynomial-Expansion and Low-Density Graphs},
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1603.03098},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2016,
month = mar,
url = {http://arxiv.org/abs/1603.03098}
}
@article{k-niir-56,
author = {J. L. Kelly},
title = {A New Interpretation of Information Rate},
journal = {Bell Sys. Tech. J.},
doi = {10.1002/j.1538-7305.1956.tb03809.x},
url =
{http://dx.doi.org/10.1002/j.1538-7305.1956.tb03809.x},
year = {1956},
month = {jul},
publisher = {IEEE},
volume = {35},
number = {4},
pages = {917--926},
}
@article{glpw-fdsdms-15,
author = {Mina Ghashami and Edo Liberty and Jeff M. Phillips
and David P. Woodruff},
title = {Frequent Directions : Simple and Deterministic
Matrix Sketching},
journal = {CoRR},
volume = {abs/1501.01711},
year = {2015},
url = {http://arxiv.org/abs/1501.01711}
}
@inproceedings{gp-redlr-14,
author = {Mina Ghashami and Jeff M. Phillips},
editor = {Chandra Chekuri},
title = {Relative Errors for Deterministic Low-Rank Matrix
Approximations},
booktitle = SODA_2014,
pages = {707--717},
publisher = {{SIAM}},
year = {2014},
url = {http://dx.doi.org/10.1137/1.9781611973402.53},
doi = {10.1137/1.9781611973402.53}
}
@inproceedings{l-sdms-13,
author = {Edo Liberty},
title = {Simple and deterministic matrix sketching},
booktitle = KDD_2013,
pages = {581--588},
publisher = {{ACM}},
year = {2013},
url = {http://doi.acm.org/10.1145/2487575.2487623},
doi = {10.1145/2487575.2487623},
editor = {Inderjit S. Dhillon and Yehuda Koren and Rayid Ghani
and Ted E. Senator and Paul Bradley and Rajesh
Parekh and Jingrui He and Robert L. Grossman and
Ramasamy Uthurusamy},
}
@article{mg-fre-82,
author = {Jayadev Misra and David Gries},
title = {Finding Repeated Elements},
journal = {Sci. Comput. Program.},
volume = {2},
number = {2},
pages = {143--152},
year = {1982},
url = {http://dx.doi.org/10.1016/0167-6423(82)90012-0},
doi = {10.1016/0167-6423(82)90012-0}
}
@inproceedings{gdp-ipmsg-14,
author = {Mina Ghashami and Amey Desai and Jeff M. Phillips},
editor = {Andreas S. Schulz and Dorothea Wagner},
title = {Improved Practical Matrix Sketching with Guarantees},
booktitle = ESA_2014,
series = LNCS,
volume = {8737},
pages = {467--479},
publisher = {Springer},
year = {2014},
url = {http://dx.doi.org/10.1007/978-3-662-44777-2_39},
doi = {10.1007/978-3-662-44777-2_39}
}
@article{dgp-ipmsg-16,
author = {Amey Desai and Mina Ghashami and Jeff M. Phillips},
title = {Improved Practical Matrix Sketching with Guarantees},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {28},
number = {7},
pages = {1678--1690},
year = {2016},
url = {http://dx.doi.org/10.1109/TKDE.2016.2539943},
doi = {10.1109/TKDE.2016.2539943}
}
@inproceedings{p-sk-13,
author = {Jeff M. Phillips},
editor = {Sanjeev Khanna},
title = {{\(\varepsilon\)}-Samples for Kernels},
booktitle = SODA_2013,
pages = {1622--1632},
publisher = {{SIAM}},
year = {2013},
url = {http://dx.doi.org/10.1137/1.9781611973105.116},
doi = {10.1137/1.9781611973105.116}
}
@inproceedings{pz-ssrs-15,
author = {Jeff M. Phillips and Yan Zheng},
editor = {Kamalika Chaudhuri and Claudio Gentile and Sandra
Zilles},
title = {Subsampling in Smoothed Range Spaces},
booktitle = ALT_2015,
series = LNCS,
volume = {9355},
pages = {224--238},
publisher = {Springer},
year = {2015},
url = {http://dx.doi.org/10.1007/978-3-319-24486-0_15},
doi = {10.1007/978-3-319-24486-0_15},
}
@article{p-cs-16,
author = {Jeff M. Phillips},
title = {Coresets and Sketches},
journal = {CoRR},
volume = {abs/1601.00617},
year = {2016},
url = {http://arxiv.org/abs/1601.00617},
timestamp = {Mon, 01 Feb 2016 15:36:05 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/corr/Phillips16},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{pvz-lbnhm-16,
author = {Jeff M. Phillips and Elad Verbin and Qin Zhang},
title = {Lower Bounds for Number-in-Hand Multiparty
Communication Complexity, Made Easy},
journal = SICOMP,
volume = {45},
number = {1},
pages = {174--196},
year = {2016},
url = {http://dx.doi.org/10.1137/15M1007525},
doi = {10.1137/15M1007525}
}
@article{pt-adlom-16,
author = {Jeff M. Phillips and Pingfan Tang},
title = {Approximate Distribution of {L1} Median on Uncertain
Data},
journal = {CoRR},
volume = {abs/1601.00630},
year = {2016},
url = {http://arxiv.org/abs/1601.00630}
}
@article{glp-efdas-16,
author = {Mina Ghashami and
Edo Liberty and
Jeff M. Phillips},
title = {Efficient Frequent Directions Algorithm for Sparse Matrices},
journal = {CoRR},
volume = {abs/1602.00412},
year = {2016},
url = {http://arxiv.org/abs/1602.00412}
}
@article{cp-reegk-16,
author = {Di Chen and
Jeff M. Phillips},
title = {Relative Error Embeddings for the Gaussian Kernel Distance},
journal = {CoRR},
volume = {abs/1602.05350},
year = {2016},
url = {http://arxiv.org/abs/1602.05350}
}
@article{aahpy-nnsuu-16-arxiv,
author = {Pankaj K. Agarwal and
Boris Aronov and
Sariel Har{-}Peled and
Jeff M. Phillips and
Ke Yi and
Wuzhou Zhang},
title = {Nearest-Neighbor Searching Under Uncertainty {II}},
journal = {CoRR},
volume = {abs/1606.00112},
year = {2016},
url = {http://arxiv.org/abs/1606.00112}
}
@inproceedings{pwz-gikde-15,
author = {Jeff M. Phillips and Bei Wang and Yan Zheng},
title = {Geometric Inference on Kernel Density Estimates},
editor = {Lars Arge and J{\'{a}}nos Pach},
booktitle = SOCG_2015,
series = {LIPIcs},
volume = {34},
pages = {857--871},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = {2015},
url = {http://dx.doi.org/10.4230/LIPIcs.SOCG.2015.857},
doi = {10.4230/LIPIcs.SOCG.2015.857}
}
@inproceedings{zp-lebsk-15,
author = {Yan Zheng and Jeff M. Phillips},
title = {L{\(\infty\)} Error and Bandwidth Selection for
Kernel Density Estimates of Large Data},
editor = {Longbing Cao and Chengqi Zhang and Thorsten Joachims
and Geoffrey I. Webb and Dragos D. Margineantu and
Graham Williams},
booktitle = KDD_2015,
pages = {1533--1542},
publisher = {{ACM}},
year = {2015},
url = {http://doi.acm.org/10.1145/2783258.2783357},
doi = {10.1145/2783258.2783357},
timestamp = {Mon, 10 Aug 2015 09:06:02 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/kdd/ZhengP15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{gpp-skpca-15,
author = {Mina Ghashami and
Daniel Perry and
Jeff M. Phillips},
title = {Streaming Kernel Principal Component Analysis},
journal = {CoRR},
volume = {abs/1512.05059},
year = {2015},
url = {http://arxiv.org/abs/1512.05059},
timestamp = {Sat, 02 Jan 2016 11:38:49 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/GhashamiPP15},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{gpl-cmadd-14,
author = {Mina Ghashami and Jeff M. Phillips and Feifei Li},
title = {Continuous Matrix Approximation on Distributed Data},
journal = {{PVLDB}},
volume = {7},
number = {10},
pages = {809--820},
year = {2014},
url = {http://www.vldb.org/pvldb/vol7/p809-ghashami.pdf}
}
@article{lpw-ekcsp-14,
author = {Jian Li and Jeff M. Phillips and Haitao Wang},
title = {{$\epsilon$}-Kernel
Coresets for Stochastic Points},
journal = {CoRR},
volume = {abs/1411.0194},
year = {2014},
url = {http://arxiv.org/abs/1411.0194},
timestamp = {Mon, 01 Dec 2014 14:32:13 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/journals/corr/LiPW14a},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{aaalp-aus-13,
author = {Peyman Afshani and Pankaj K. Agarwal and Lars Arge
and Kasper Green Larsen and Jeff M. Phillips},
title = {(Approximate) Uncertain Skylines},
journal = {Theory Comput. Syst.},
volume = {52},
number = {3},
pages = {342--366},
year = {2013},
url = {http://dx.doi.org/10.1007/s00224-012-9382-7},
doi = {10.1007/s00224-012-9382-7}
}
@article{achpw-ms-13,
author = {Pankaj K. Agarwal and
Graham Cormode and
Zengfeng Huang and
Jeff M. Phillips and
Zhewei Wei and
Ke Yi},
title = {Mergeable summaries},
journal = {{ACM} Trans. Database Syst.},
volume = {38},
number = {4},
pages = {26},
year = {2013},
url = {http://doi.acm.org/10.1145/2500128},
doi = {10.1145/2500128}
}
@inproceedings{adp-rccud-13,
author = {Amirali Abdullah and Samira Daruki and Jeff
M. Phillips},
title = {Range counting coresets for uncertain data},
editor = {Guilherme Dias da Fonseca and Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and Timothy M. Chan and
Rolf Klein},
booktitle = SOCG_2013,
pages = {223--232},
publisher = {{ACM}},
year = {2013},
url = {http://doi.acm.org/10.1145/2462356.2462388},
doi = {10.1145/2462356.2462388},
timestamp = {Fri, 30 Jan 2015 14:53:40 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/conf/compgeom/AbdullahDP13},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{zppv-rtits-13,
author = {Yang Zhao and Neal Patwari and Jeff M. Phillips and
Suresh Venkatasubramanian},
editor = {Tarek F. Abdelzaher and Kay R{\"{o}}mer and Raj
Rajkumar},
title = {Radio tomographic imaging and tracking of stationary
and moving people via kernel distance},
booktitle = {12th Int. Conf. Info. Proc. Sensor Networks},
pages = {229--240},
publisher = {{ACM}},
year = {2013},
url = {http://doi.acm.org/10.1145/2461381.2461410},
doi = {10.1145/2461381.2461410},
timestamp = {Thu, 20 Nov 2014 17:32:13 +0100},
biburl =
{http://dblp.uni-trier.de/rec/bib/conf/ipsn/ZhaoPPV13},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{zjpl-qekde-13,
author = {Yan Zheng and Jeffrey Jestes and Jeff M. Phillips
and Feifei Li},
editor = {Kenneth A. Ross and Divesh Srivastava and Dimitris
Papadias},
title = {Quality and efficiency for kernel density estimates
in large data},
booktitle = {Proceedings of the {ACM} {SIGMOD} International
Conference on Management of Data, {SIGMOD} 2013, New
York, NY, USA, June 22-27, 2013},
pages = {433--444},
publisher = {{ACM}},
year = {2013},
url = {http://doi.acm.org/10.1145/2463676.2465319},
doi = {10.1145/2463676.2465319}
}
@article{jplt-rltd-12,
author = {Jeffrey Jestes and Jeff M. Phillips and Feifei Li
and Mingwang Tang},
title = {Ranking Large Temporal Data},
journal = {{PVLDB}},
volume = {5},
number = {11},
pages = {1412--1423},
year = {2012},
url =
{http://vldb.org/pvldb/vol5/p1412_jeffreyjestes_vldb2012.pdf}
}
@inproceedings{dpsv-epdco-12,
author = {Hal Daum{\'{e}} III and Jeff M. Phillips and Avishek
Saha and Suresh Venkatasubramanian},
editor = {Nader H. Bshouty and Gilles Stoltz and Nicolas
Vayatis and Thomas Zeugmann},
title = {Efficient Protocols for Distributed Classification
and Optimization},
booktitle = {Algorithmic Learning Theory - 23rd International
Conference, {ALT} 2012, Lyon, France, October 29-31,
2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7568},
pages = {154--168},
publisher = {Springer},
year = {2012},
url = {http://dx.doi.org/10.1007/978-3-642-34106-9_15},
doi = {10.1007/978-3-642-34106-9_15},
timestamp = {Mon, 15 Oct 2012 16:28:00 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/conf/alt/DaumePSV12},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{jpgj-uvheo-12,
author = {Fangxiang Jiao and Jeff M. Phillips and Yaniv Gur
and Chris R. Johnson},
editor = {Helwig Hauser and Stephen G. Kobourov and Huamin Qu},
title = {Uncertainty visualization in {HARDI} based on
ensembles of {ODF}s},
booktitle = {2012 {IEEE} Pacific Visualization Symposium,
PacificVis 2012, Songdo, Korea (South), February 28
- March 2, 2012},
pages = {193--200},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {http://dx.doi.org/10.1109/PacificVis.2012.6183591},
doi = {10.1109/PacificVis.2012.6183591}
}
@inproceedings{tlpj-etmdp-12,
author = {Mingwang Tang and Feifei Li and Jeff M. Phillips and
Jeffrey Jestes},
editor = {Anastasios Kementsietsidis and Marcos Antonio Vaz
Salles},
title = {Efficient Threshold Monitoring for Distributed
Probabilistic Data},
booktitle = {{IEEE} 28th International Conference on Data
Engineering {(ICDE} 2012), Washington, DC, {USA}
(Arlington, Virginia), 1-5 April, 2012},
pages = {1120--1131},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {http://dx.doi.org/10.1109/ICDE.2012.34},
doi = {10.1109/ICDE.2012.34},
timestamp = {Mon, 23 May 2016 12:16:24 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/conf/icde/TangLPJ12},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{adpv-snlms-12,
author = {Arvind Agarwal and Hal Daum{\'{e}} III and Jeff
M. Phillips and Suresh Venkatasubramanian},
editor = {Jilles Vreeken and Charles Ling and Mohammed Javeed
Zaki and Arno Siebes and Jeffrey Xu Yu and Bart
Goethals and Geoffrey I. Webb and Xindong Wu},
title = {Sensor Network Localization for Moving Sensors},
booktitle = {12th {IEEE} International Conference on Data Mining
Workshops, {ICDM} Workshops, Brussels, Belgium,
December 10, 2012},
pages = {202--209},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {http://dx.doi.org/10.1109/ICDMW.2012.123},
doi = {10.1109/ICDMW.2012.123},
timestamp = {Wed, 17 Sep 2014 19:35:15 +0200},
biburl =
{http://dblp.uni-trier.de/rec/bib/conf/icdm/AgarwalDPV12},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{achpw-ms-12,
author = {Pankaj K. Agarwal and
Graham Cormode and
Zengfeng Huang and
Jeff M. Phillips and
Zhewei Wei and
Ke Yi},
editor = {Michael Benedikt and
Markus Kr{\"{o}}tzsch and
Maurizio Lenzerini},
title = {Mergeable summaries},
booktitle = {Proceedings of the 31st {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, {PODS} 2012, Scottsdale, AZ, USA,
May 20-24, 2012},
pages = {23--34},
publisher = {{ACM}},
year = {2012},
url = {http://doi.acm.org/10.1145/2213556.2213562},
doi = {10.1145/2213556.2213562},
timestamp = {Thu, 23 Jun 2016 15:53:28 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/pods/AgarwalCHPWY12},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{pvz-lbnhm-12,
author = {Jeff M. Phillips and
Elad Verbin and
Qin Zhang},
editor = {Yuval Rabani},
title = {Lower bounds for number-in-hand multiparty communication complexity,
made easy},
booktitle = SODA_2012,
pages = {486--501},
publisher = {{SIAM}},
year = {2012},
url = {http://portal.acm.org/citation.cfm?id=2095158&CFID=63838676&CFTOKEN=79617016},
timestamp = {Wed, 12 Feb 2014 17:08:16 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/conf/soda/PhillipsVZ12},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{dpsv-plcdd-12,
author = {Hal Daum{\'{e}} III and Jeff M. Phillips and Avishek
Saha and Suresh Venkatasubramanian},
editor = {Neil D. Lawrence and Mark A. Girolami},
title = {Protocols for Learning Classifiers on Distributed
Data},
booktitle = {Proceedings of the Fifteenth International
Conference on Artificial Intelligence and
Statistics, {AISTATS} 2012, La Palma, Canary
Islands, April 21-23, 2012},
series = {{JMLR} Proceedings},
volume = {22},
pages = {282--290},
publisher = {JMLR.org},
year = {2012},
url =
{http://jmlr.csail.mit.edu/proceedings/papers/v22/daume12.html}
}
@article{ahr-ecvdt-16,
author = {Anne Driemel and Sariel Har{-}Peled and Benjamin
Raichel},
title = {On the Expected Complexity of {Voronoi} Diagrams on
Terrains},
journal = TALG,
volume = 12,
number = 3,
pages = 37,
year = 2016,
url = {http://doi.acm.org/10.1145/2846099},
doi = {10.1145/2846099}
}
@inproceedings{bh-svdls-16,
author = {Vijay V. S. P. Bhattiprolu and Sariel Har{-}Peled},
title = {Separating a {Voronoi} Diagram via Local Search},
editor = {S{\'{a}}ndor P. Fekete and Anna Lubiw},
booktitle = SOCG_2016,
acceptrate = SOCG_2016_AR,
series = {LIPIcs},
volume = 51,
pages = {18:1--18:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
year = 2016,
url = {http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.18},
doi = {10.4230/LIPIcs.SoCG.2016.18},
timestamp = {Wed, 15 Jun 2016 18:16:30 +0200},
biburl =
{http://dblp.dagstuhl.de/rec/bib/conf/compgeom/BhattiproluH16},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{himv-ttbss-16,
author = {Sariel Har{-}Peled and Piotr Indyk and Sepideh
Mahabadi and Ali Vakilian},
editor = {Tova Milo and Wang{-}Chiew Tan},
title = {Towards Tight Bounds for the Streaming Set Cover
Problem},
booktitle = PODS_2016,
acceptrate = PODS_2016_AR,
pages = {371--383},
publisher = {{ACM}},
year = {2016},
url = {http://doi.acm.org/10.1145/2902251.2902287},
doi = {10.1145/2902251.2902287}
}
@inproceedings{e-ssraw-13,
author = {Esther Ezra},
title = {Small-size relative
{$(p,\varepsilon)$}-approximations for well-behaved
range spaces},
editor = {Guilherme Dias da Fonseca and Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and Timothy M. Chan and
Rolf Klein},
booktitle = SOCG_2013,
pages = {233--242},
publisher = {{ACM}},
year = 2013,
url = {http://doi.acm.org/10.1145/2462356.2462363},
doi = {10.1145/2462356.2462363}
}
@inproceedings{cps-astar-09,
author = {Venkatesan T. Chakaravarthy and
Vinayaka Pandit and
Yogish Sabharwal},
title = {Analysis of sampling techniques for association rule mining},
editor = {Ronald Fagin},
booktitle = {Database Theory - {ICDT} 2009, 12th International Conference, St.
Petersburg, Russia, March 23-25, 2009, Proceedings},
series = {{ACM} International Conference Proceeding Series},
volume = 361,
pages = {276--283},
publisher = {{ACM}},
year = 2009,
url = {http://doi.acm.org/10.1145/1514894.1514927},
doi = {10.1145/1514894.1514927}
}
@inproceedings{pkk-dbod-11,
author = {Vinayaka Pandit and Sreyash Kenkre and Arindam Khan},
title = {Discovering Bucket Orders from Data},
booktitle = {Proc. 11th {SIAM} Int. Conf. Data Mining {SDM}},
pages = {872--883},
publisher = {{SIAM} / Omnipress},
year = {2011},
url = {http://dx.doi.org/10.1137/1.9781611972818.75},
doi = {10.1137/1.9781611972818.75}
}
@article{phl-mpsnh-16,
author = {Yasha Pushak and Warren Hare and Yves Lucet},
title = {Multiple-path selection for new highway alignments
using discrete algorithms},
journal = {Euro. J. Oper. Research},
volume = 248,
number = 2,
pages = {415--427},
year = 2016,
url = {http://dx.doi.org/10.1016/j.ejor.2015.07.039},
doi = {10.1016/j.ejor.2015.07.039}
}
@article{sst-ibkst-01,
author = {Micha Sharir and
Shakhar Smorodinsky and
G{\'{a}}bor Tardos},
title = {An Improved Bound for \emph{k}-Sets in Three Dimensions},
journal = DCG,
volume = {26},
number = {2},
pages = {195--204},
year = {2001},
url = {http://dx.doi.org/10.1007/s00454-001-0005-3},
doi = {10.1007/s00454-001-0005-3}
}
@article{m-plah-93,
author = "S. Meiser",
title = "Point Location in Arrangements of Hyperplanes",
journal = "Information Comput.",
volume = "106",
number = "2",
pages = "286--303",
year = "1993",
issn = "0890-5401",
doi = "10.1006/inco.1993.1057",
url =
"http://www.sciencedirect.com/science/article/pii/S0890540183710576",
}
@article{l-nplah-04,
author = "D. Liu",
title = "A note on point location in arrangements of
hyperplanes",
journal = IPL,
volume = "90",
number = "2",
pages = "93--95",
year = "2004",
issn = "0020-0190",
doi = "10.1016/j.ipl.2004.01.010",
url =
"http://www.sciencedirect.com/science/article/pii/S0020019004000213",
}
@Misc{k-vcdlp-12,
author = {J. Kyn{\v c}l},
title = {{V}apnik-{C}hervonenkis dimension of lines in the
plane},
month = {June},
year = 2012,
note = {\href{http://mathoverflow.net/questions/98412/vapnik-chervonenkis-dimension-of-lines-in-the-plane}{http://mathoverflow.net/questions/\allowbreak{}98412/vapnik-chervonenkis-dimension-of-lines-in-the-plane}},
OPTannote = {}
}
@article{kx-fptas-15,
author = {Konstantinos Koiliaris and Chao Xu},
title = {A Faster Pseudopolynomial Time Algorithm for Subset
Sum},
journal = {CoRR},
volume = {abs/1507.02318},
year = {2015},
url = {http://arxiv.org/abs/1507.02318}
}
@article{hks-akltd-16-arxiv,
author = {S. Har{-}Peled and H. Kaplan and M. Sharir},
title = {Approximating the $k$-Level
in Three-Dimensional Plane Arrangements},
journal = {CoRR},
volume = {\href{http://arxiv.org/abs/1601.04755}{abs/1601.04755}},
year = {2016},
url = {http://arxiv.org/abs/1601.04755}
}
@article{hks-akltd-16-arxiv-old,
author = {S. Har{-}Peled and H. Kaplan and M. Sharir},
title = {Approximating the {\textdollar}k{\textdollar}-Level
in Three-Dimensional Plane Arrangements},
journal = {CoRR},
volume = {abs/1601.04755},
year = {2016},
url = {http://arxiv.org/abs/1601.04755}
}
@inproceedings{aaimv-dnnp-13,
author = {Sofiane Abbar and Sihem Amer{-}Yahia and Piotr Indyk
and Sepideh Mahabadi and Kasturi R. Varadarajan},
title = {Diverse near neighbor problem},
booktitle = SOCG_2013,
pages = {207--214},
publisher = {{ACM}},
year = {2013},
url = {http://doi.acm.org/10.1145/2462356.2462401},
doi = {10.1145/2462356.2462401},
editor = {Guilherme Dias da Fonseca and Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and Timothy M. Chan and
Rolf Klein},
}
@Article{bm-ocesp-04,
author = {{John} M. {Boyer} and {Wendy} J. {Myrvold}},
title = {On the Cutting Edge: Simplified O(n) Planarity by
Edge Addition},
journal = {J. Graph Alg. \& Appl.},
year = {2004},
volume = {8},
number = {3},
pages = {241--273},
doi = {10.7155/jgaa.00091}
}
@inproceedings{nw-aspbr-16,
author = {Giorgi Nadiradze and Andreas Wiese},
title = {On approximating strip packing with a better ratio
than 3/2},
deleditor = {Robert Krauthgamer},
booktitle = SODA_2016,
pages = {1491--1510},
publisher = {{SIAM}},
year = {2016},
url = {http://dx.doi.org/10.1137/1.9781611974331.ch102},
doi = {10.1137/1.9781611974331.ch102}
}
@inproceedings{aw-qptdg-15,
author = {A. Adamaszek and A. Wiese},
deleditor = {Piotr Indyk},
title = {A quasi-{PTAS} for the Two-Dimensional Geometric
Knapsack Problem},
booktitle = SODA_2015,
pages = {1491--1505},
publisher = {{SIAM}},
year = {2015},
url = {http://dx.doi.org/10.1137/1.9781611973730.98},
doi = {10.1137/1.9781611973730.98}
}
@article{ab-lcc-09,
author = {G. Ambrus and I. B\'ar\'any},
title = {Longest convex chains},
journal = {Rand. Struct. \& Alg.},
volume = {35},
number = {2},
delpublisher = {Wiley Subscription Services, Inc., A Wiley Company},
issn = {1098-2418},
url = {http://dx.doi.org/10.1002/rsa.20269},
doi = {10.1002/rsa.20269},
pages = {137--162},
year = {2009}
}
@inproceedings{hm-padra-17,
author = {Sariel Har{-}Peled and Sepideh Mahabadi},
title = {Proximity in the Age of Distraction: Robust
Approximate Nearest Neighbor Search},
booktitle = SODA_2017,
pages = {1--15},
doi = {10.1137/1.9781611974782.1},
URL = {http://epubs.siam.org/doi/abs/10.1137/1.9781611974782.1},
eprint = {http://epubs.siam.org/doi/pdf/10.1137/1.9781611974782.1},
acceptrate = SODA_2017_AR
}
@techreport{fmp-csua-91,
author = "R. Freimer and J. S. B. Mitchell and C. D. Piatko",
title = "On the complexity of shattering using arrangements",
type = "Technical {Report}",
number = "TR~91-1197",
institution = "Dept. Comput. Sci., Cornell Univ.",
address = "Ithaca, NY",
month = apr,
year = 1991,
url = {https://ecommons.cornell.edu/handle/1813/7037},
keywords = "arrangements, separation, NP-hardness,
approximation"
}
@inproceedings{dhms-sspsp-01,
author = {O. Devillers and F. Hurtado and M. Mora and
C. Seara},
title = {Separating several point sets in the plane},
booktitle = CCCG_2001,
pages = {81--84},
year = {2001},
url = {http://www.cccg.ca/proceedings/2001/seara-3649.ps.gz}
}
@article{nah-sso2-02,
author = {Subhas C. Nandy and Tetsuo Asano and Tomohiro
Harayama},
title = {Shattering a set of objects in {2D}},
journal = {Disc. Appl. Math.},
volume = {122},
number = {1-3},
pages = {183--194},
year = {2002},
url = {http://dx.doi.org/10.1016/S0166-218X(01)00315-8},
doi = {10.1016/S0166-218X(01)00315-8}
}
@article{w-agass-82,
author = {L. A. Wolsey},
title = {An analysis of the greedy algorithm for the
submodular set covering problem},
journal = {Combinatorica},
volume = {2},
number = {4},
pages = {385--393},
year = {1982},
url = {http://dx.doi.org/10.1007/BF02579435},
doi = {10.1007/BF02579435},
fullauthor = {Laurence A. Wolsey},
}
@article{m-jctbf-84,
author = {Ryuji Maehara},
title = {The {Jordan} Curve Theorem Via the {Brouwer} Fixed
Point Theorem},
journal = {Amer. Math. Month.},
volume = {91},
number = {10},
pages = {641--643},
publisher = {Math. Assoc. Amer.},
year = {1984},
ISSN = {00029890, 19300972},
doi = {10.2307/2323369},
URL = {http://www.jstor.org/stable/2323369},
}
@inproceedings{bbv-aspcd-16,
author = {S. Bandyapadhyay and S. Bhowmick and K.
R. Varadarajan},
title = {Approximation Schemes for Partitioning: Convex
Decomposition and Surface Approximation},
booktitle = SODA_2015,
deleditor = {Piotr Indyk},
pages = {1457--1470},
publisher = {{SIAM}},
year = {2015},
url = {http://dx.doi.org/10.1137/1.9781611973730.96},
doi = {10.1137/1.9781611973730.96}
}
@inproceedings{mp-opapf-15,
author = {D. Marx and M. Pilipczuk},
title = {Optimal Parameterized Algorithms for Planar Facility
Location Problems Using Voronoi Diagrams},
booktitle = ESA_2015,
series = LNCS,
volume = {9294},
pages = {865--877},
publisher = {Springer},
year = {2015},
url = {http://dx.doi.org/10.1007/978-3-662-48350-3_72},
doi = {10.1007/978-3-662-48350-3_72},
deleditor = {Nikhil Bansal and Irene Finocchi},
}
@ARTICLE{hm-lshhr-17,
author = {{Har-Peled}, S. and {Mahabadi}, S.},
title = "{{LSH} on the Hypercube Revisited}",
journal = {ArXiv e-prints},
archivePrefix= "arXiv",
eprint = {1704.02546},
primaryClass = "cs.CG",
keywords = {Computer Science - Computational Geometry},
year = 2017,
month = apr,
adsurl = {http://adsabs.harvard.edu/abs/2017arXiv170402546H},
adsnote = {Provided by the SAO/NASA Astrophysics Data System}
}