default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry: Theory and Applications, Volume 60
Volume 60, January 2017
- David Rappaport:
Guest Editor's foreword. 1 - Timothy M. Chan, Zahed Rahmati
:
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points. 2-7 - Ahmad Biniaz, Paul Liu, Anil Maheshwari, Michiel H. M. Smid:
Approximation algorithms for the unit disk cover problem in 2D and 3D. 8-18 - J. Mark Keil, Joseph S. B. Mitchell, Dinabandhu Pradhan, Martin Vatshelle:
An algorithm for the maximum weight independent set problem on outerstring graphs. 19-25 - Behnam Hatami, Hamid Zarrabi-Zadeh:
A streaming algorithm for 2-center with outliers in high dimensions. 26-36 - Timothy M. Chan, Dimitrios Skrepetos:
Dynamic data structures for approximate Hausdorff distance in the word RAM. 37-44 - Prosenjit Bose, Sander Verdonschot:
Flips in edge-labelled pseudo-triangulations. 45-54
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-08 22:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
