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
Region-fault tolerant geometric spanners
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A rounding algorithm for approximating minimum Manhattan networks
Theoretical Computer Science
Minimum weight convex Steiner partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Constructing minimum-interference networks
Computational Geometry: Theory and Applications
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
A simple and efficient kinetic spanner
Proceedings of the twenty-fourth annual symposium on Computational geometry
Well-separated pair decomposition in linear time?
Information Processing Letters
Distributed algorithms for ultrasparse spanners and linear size skeletons
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
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
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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
Geometric spanners with small chromatic number
Computational Geometry: Theory and Applications
Feed-links for network extensions
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Light orthogonal networks with constant geometric dilation
Journal of Discrete Algorithms
Proceedings of the twenty-fifth annual symposium on Computational geometry
On Spanners of Geometric Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Experimental study of geometric t-spanners
Journal of Experimental Algorithmics (JEA)
On the dilation spectrum of paths, cycles, and trees
Computational Geometry: Theory and Applications
Algorithms for graphs of bounded treewidth via orthogonal range searching
Computational Geometry: Theory and Applications
Computing the dilation of edge-augmented graphs in metric spaces
Computational Geometry: Theory and Applications
On the Power of the Semi-Separated Pair Decomposition
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Connect the Dot: Computing Feed-Links with Minimum Dilation
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A simple and efficient kinetic spanner
Computational Geometry: Theory and Applications
ACM Transactions on Algorithms (TALG)
Computing geometric minimum-dilation graphs is NP-hard
GD'06 Proceedings of the 14th international conference on Graph drawing
Experimental study of geometric t-spanners: a running time comparison
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Dilation-optimal edge deletion in polygonal cycles
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Geometric spanners with small chromatic number
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
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)
Journal of Discrete Algorithms
New constructions of SSPDs and their applications
Proceedings of the twenty-sixth annual symposium on Computational geometry
Local computation of nearly additive spanners
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Additive spanners and (α, β)-spanners
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
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
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
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
Planar hop spanners for unit disk graphs
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
Connections between theta-graphs, delaunay triangulations, and orthogonal surfaces
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
kthorder geometric spanners for wireless ad hoc networks
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
On a family of strong geometric spanners that admit local routing strategies
Computational Geometry: Theory and Applications
Property testing
Property testing
Spanners of additively weighted point sets
Journal of Discrete Algorithms
Stochastic minimum spanning trees in euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry
Improved upper bound on the stretch factor of delaunay triangulations
Proceedings of the twenty-seventh annual symposium on Computational geometry
The euclidean bottleneck steiner path problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Quickest paths in anisotropic media
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
The MST of symmetric disk graphs is light
Computational Geometry: Theory and Applications
Narrow-Shallow-Low-Light Trees with and without Steiner Points
SIAM Journal on Discrete Mathematics
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
Exact and approximation algorithms for computing the dilation spectrum of paths, trees, and cycles
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
New constructions of SSPDs and their applications
Computational Geometry: Theory and Applications
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
The MST of symmetric disk graphs is light
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
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
On plane constrained bounded-degree spanners
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Linear-size approximations to the vietoris-rips filtration
Proceedings of the twenty-eighth annual symposium on Computational geometry
Improved local algorithms for spanner construction
Theoretical Computer Science
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
Bounding interference in wireless ad hoc networks with nodes in random position
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Computational Geometry: Theory and Applications
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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
GD'12 Proceedings of the 20th international conference on Graph Drawing
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
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
Fast query structures in anisotropic media
Theoretical Computer Science
Quickest path queries on transportation network
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Output-sensitive well-separated pair decompositions for dynamic point sets
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Modeling and detecting community hierarchies
SIMBAD'13 Proceedings of the Second international conference on Similarity-Based Pattern Recognition
Minimum weight Euclidean t-spanner is NP-hard
Journal of Discrete Algorithms
On the stretch factor of the theta-4 graph
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
On the spanning ratio of theta-graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
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.00 |