51 – 60 of 61
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2002
-
Mark
Approximate distance oracles revisited
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Improved algorithms for constructing fault-tolerant spanners
(
- Contribution to journal › Article
-
Mark
Lower bounds for approximate polygon decomposition and minimum gap
(
- Contribution to journal › Article
-
Mark
Approximate distance oracles for geometric graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Optimal algorithms for complete linkage clustering in d dimensions
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fast greedy algorithms for constructing sparse geometric spanners
(
- Contribution to journal › Article
- 1999
-
Mark
Close Approximations of Minimum Rectangular Coverings
(
- Contribution to journal › Article
-
Mark
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 1997
-
Mark
A linear-time approximation algorithm for minimum rectangular coverings
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding