A sparse graph almost as good as the complete graph on points in K dimensions
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
Optimally sparse spanners in 3-dimensional Euclidean space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A fast algorithm for constructing sparse Euclidean spanners
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for some geometric graph problems in higher dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient Construction of a Bounded Degree Spanner with Low Weight
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Efficient algorithms for constructing fault-tolerant geometric spanners
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Sparse communication networks and efficient routing in the plane (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed 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
Distributed Spanner with Bounded Degree for Wireless Ad Hoc Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
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
I/O-Efficient Shortest Path Queries in Geometric Spanners
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Tree-Approximations for the Weighted Cost-Distance Problem
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Improved Algorithm for the Minimum Manhattan Network Problem
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Representing Graph Metrics with Fewest Edges
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Algorithms for the Bottleneck Stretch Factor Problem
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Generalized Self-Approaching Curves
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Approximating a minimum Manhattan network
Nordic Journal of Computing
Fault-tolerant geometric spanners
Proceedings of the nineteenth annual symposium on Computational geometry
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
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
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
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Approximating geometric bottleneck shortest paths
Computational Geometry: Theory and Applications
Finding the best shortcut in a geometric network
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Lower bound for sparse Euclidean spanners
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Localized topology control for heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Deformable spanners and applications
Computational Geometry: Theory and Applications
The minimum Manhattan network problem: approximations and exact solutions
Computational Geometry: Theory and Applications
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On bounded leg shortest paths problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric Spanner of Objects under L1 Distance
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
Graph-Theoretic Concepts in Computer Science
Experimental study of geometric t-spanners
Journal of Experimental Algorithmics (JEA)
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
The minimum Manhattan network problem: Approximations and exact solutions
Computational Geometry: Theory and Applications
Deformable spanners and applications
Computational Geometry: Theory and Applications
On Euclidean vehicle routing with allocation
Computational Geometry: Theory and Applications
Efficient construction of low weight bounded degree planar spanner
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Light orthogonal networks with constant geometric dilation
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Experimental study of geometric t-spanners: a running time comparison
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Journal of Discrete Algorithms
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Balancing degree, diameter and weight in Euclidean spanners
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Property testing
Property testing
Approximating minimum manhattan networks in higher dimensions
ESA'11 Proceedings of the 19th European conference on Algorithms
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
The minimum manhattan network problem: a fast factor-3 approximation
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Experimental study of geometric t-spanners
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
Fast pruning of geometric spanners
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Half-space proximal: a new local test for extracting a bounded dilation spanner of a unit disk graph
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Local construction of planar spanners in unit disk graphs with irregular transmission ranges
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
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
On the power of the semi-separated pair decomposition
Computational Geometry: Theory and Applications
Proceedings of the twenty-ninth annual symposium on Computational geometry
Sparse Euclidean Spanners with Tiny Diameter
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Optimal euclidean spanners: really short, thin and lanky
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
New doubling spanners: better and simpler
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |