New sparseness results on graph spanners
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A new algorithm for computing shortest paths in weighted planar subdivisions (extended abstract)
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
Sparse communication networks and efficient routing in the plane (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Approximate distance oracles for geometric graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computing a threaded quadtree from the Delaunay triangulation in linear time
Nordic Journal of Computing
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
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Approximating Geometric Bottleneck Shortest Paths
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
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
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Fast Algorithm for Approximating the Detour of a Polygonal Chain
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Constructing Plane Spanners of Bounded Degree and Low Weight
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Geometric Spanners for Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
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
A fast algorithm for approximating the detour of a polygonal chain
Computational Geometry: Theory and Applications
On greedy geographic routing algorithms in sensing-covered networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Compact routing on euclidian metrics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Impact of Sensing Coverage on Greedy Geographic Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
The density of iterated crossing points and a gap result for triangulations of finite point sets
Proceedings of the twenty-second annual symposium on Computational geometry
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Localized algorithms for energy efficient topology in wireless ad hoc networks
Mobile Networks and Applications
Spatial energy balancing through proactive multipath routing in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Good triangulations yield good tours
Computers and Operations Research
Local properties of geometric graphs
Computational Geometry: Theory and Applications
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms (TALG)
Minimum weight convex Steiner partitions
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
Energy-efficient topology control for three-dimensional sensor networks
International Journal of Sensor Networks
Geometric Spanner of Objects under L1 Distance
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Spanners of Additively Weighted Point Sets
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Computing the Greedy Spanner in Near-Quadratic Time
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Computational Geometry: Theory and Applications
Light orthogonal networks with constant geometric dilation
Journal of Discrete Algorithms
On Spanners of Geometric Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A simple and efficient kinetic spanner
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Journal of Discrete Algorithms
Stochastic Geometry and Wireless Networks: Volume II Applications
Foundations and Trends® in Networking
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
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
Improved multi-criteria spanners for ad-hoc networks under energy and distance metrics
INFOCOM'10 Proceedings of the 29th conference on Information communications
Plane spanners of maximum degree six
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Balancing degree, diameter and weight in Euclidean spanners
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Almost all Delaunay triangulations have stretch factor greater than π/2
Computational Geometry: Theory and Applications
On the stretch factor of Delaunay triangulations of points in convex position
Computational Geometry: Theory and Applications
A simulation environment for ad hoc networks using sector subdivision
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Improved local algorithms for spanner construction
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
On a family of strong geometric spanners that admit local routing strategies
Computational Geometry: Theory and Applications
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Approximate shortest path queries using Voronoi duals
Transactions on computational science IX
Spanners of additively weighted point sets
Journal of Discrete Algorithms
Improved upper bound on the stretch factor of delaunay triangulations
Proceedings of the twenty-seventh annual symposium on Computational geometry
Competitive routing in the half-θ6-graph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Local algorithms for autonomous robot systems
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Dynamic delaunay triangulation for wireless ad hoc network
APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
Experimental study of geometric t-spanners
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Geographical construction of scale-free networks with both short path lengths and hops
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Communication-efficient construction of the plane localized delaunay graph
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Embedding point sets into plane graphs of small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Sparse geometric graphs with small dilation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
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
Compact and low delay routing labeling scheme for Unit Disk Graphs
Computational Geometry: Theory and Applications
Diamond triangulations contain spanners of bounded degree
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On bounded degree plane strong geometric spanners
Journal of Discrete Algorithms
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
Improved local algorithms for spanner construction
Theoretical Computer Science
Computational Geometry: Theory and Applications
Some properties of k-Delaunay and k-Gabriel graphs
Computational Geometry: Theory and Applications
On a family of strong geometric spanners that admit local routing strategies
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
On generalized diamond spanners
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The stretch factor of L1- and L∞-delaunay triangulations
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Kinetic data structures for all nearest neighbors and closest pair in the plane
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
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
On certain geometric properties of the Yao---Yao graphs
Journal of Combinatorial Optimization
Approximated algorithms for the minimum dilation triangulation problem
Journal of Heuristics
| Hi-index | 0.01 |