On Euclidean spanner graphs with small degree
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A fast algorithm for constructing sparse Euclidean spanners
SCG '94 Proceedings of the tenth 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
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Improved Greedy Algorithms for Constructing Sparse Geometric Spanners
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
New Results of Fault Tolerant Geometric Spanners
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Placing an abnoxious facility in geometric networks
Nordic Journal of Computing
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Geometric spanners with few edges and degree five
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Fully dynamic geometric spanners
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computing a minimum-dilation spanning tree is NP-hard
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On bounded leg shortest paths problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for fully dynamic geometric spanners and geometric routing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse geometric graphs with small dilation
Computational Geometry: Theory and Applications
I/O-efficient algorithms for computing planar geometric spanners
Computational Geometry: Theory and Applications
Well-separated pair decomposition in linear time?
Information Processing Letters
Computing a minimum-dilation spanning tree is NP-hard
Computational Geometry: Theory and Applications
An Optimal Dynamic Spanner for Doubling Metric Spaces
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Fault-tolerant spanners for general graphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Spanners of complete k-partite geometric graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Fault Tolerant Spanners for General Graphs
SIAM Journal on Computing
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
On spanners of geometric graphs
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Sparse geometric graphs with small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Fast pruning of geometric spanners
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
Geometric spanners with few edges and degree five
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.00 |