On the all-pairs Euclidean short path problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Beta-skeletons have unbounded dilation
Computational Geometry: Theory and Applications
On the Spanning Ratio of Gabriel Graphs and beta-skeletons
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Optimal spanners for axis-aligned rectangles
Computational Geometry: Theory and Applications
The minimum Manhattan network problem: approximations and exact solutions
Computational Geometry: Theory and Applications
Good triangulations yield good tours
Computers and Operations Research
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
Combinatorial network abstraction by trees and distances
Theoretical Computer Science
Light orthogonal networks with constant geometric dilation
Journal of Discrete Algorithms
Additive Spanners for Circle Graphs and Polygonal Graphs
Graph-Theoretic Concepts in Computer Science
On Spanners of Geometric Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Small stretch (α,β)-spanners in the streaming model
Theoretical Computer Science
A simple and efficient kinetic spanner
Computational Geometry: Theory and Applications
The minimum Manhattan network problem: Approximations and exact solutions
Computational Geometry: Theory and Applications
Randomized 3-D Routing in Fully- and Partially-Covered Sensor Networks
Mobile Networks and Applications
Light orthogonal networks with constant geometric dilation
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Small stretch spanners in the streaming model: new algorithms and experiments
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Plane spanners of maximum degree six
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
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
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Improved upper bound on the stretch factor of delaunay triangulations
Proceedings of the twenty-seventh annual symposium on Computational geometry
Spectral Sparsification of Graphs
SIAM Journal on Computing
Competitive routing in the half-θ6-graph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Small stretch spanners on dynamic graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Upper bound on dilation of triangulations of cyclic polygons
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Combinatorial network abstraction by trees and distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A linear time algorithm for constructing tree 4-spanner in 2-trees
CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
Distance approximating trees: complexity and algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Collective tree 1-spanners for interval graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Collective tree spanners and routing in AT-free related graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Diamond triangulations contain spanners of bounded degree
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Collective additive tree spanners for circle graphs and polygonal graphs
Discrete Applied Mathematics
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
Proceedings of the twenty-ninth annual symposium on Computational geometry
On the spanning ratio of theta-graphs
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |