Computational geometry: an introduction
Computational geometry: an introduction
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
Minimum spanning trees in k-dimensional space
SIAM Journal on Computing
Approximating the complete Euclidean graph
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
A sparse graph almost as good as the complete graph on points in K dimensions
Discrete & Computational Geometry
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Euclidean minimum spanning trees and bichromatic closest pairs
Discrete & Computational Geometry
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Euclidean spanners: short, thin, and lanky
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximate nearest neighbor queries revisited
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient algorithms for constructing fault-tolerant geometric spanners
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Algorithms for dynamic closest pair and n-body potential fields
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Minimum spanning trees in d dimensions
Nordic Journal of Computing
Approximation algorithms for the bottleneck stretch factor problem
Nordic Journal of Computing
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for the Bottleneck Stretch Factor Problem
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Well-separated pair decomposition for the unit-disk graph metric and its applications
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
Journal of Experimental Algorithmics (JEA)
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Deformable spanners and applications
Computational Geometry: Theory and Applications
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Matching point sets with respect to the Earth Mover's Distance
Computational Geometry: Theory and Applications
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Well-separated pair decomposition in linear time?
Information Processing Letters
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Deformable spanners and applications
Computational Geometry: Theory and Applications
Path oracles for spatial networks
Proceedings of the VLDB Endowment
Dynamic algorithms for approximating interdistances
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Spanners of complete k-partite geometric graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Journal of Discrete Algorithms
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Property testing
Property testing
On spanners of geometric graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Matching point sets with respect to the earth mover’s distance
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An optimal-time construction of sparse Euclidean spanners with tiny diameter
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Spanners for geometric intersection graphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Sparse Euclidean Spanners with Tiny Diameter
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |