Succinct Greedy Graph Drawing in the Hyperbolic Plane
Graph Drawing
Greedy routing with guaranteed delivery using Ricci flows
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Succinct Greedy Geometric Routing in the Euclidean Plane
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On convex greedy embedding conjecture for 3-connected planar graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A generalized greedy routing algorithm for 2-connected graphs
Theoretical Computer Science
Distributed computation of virtual coordinates for greedy routing in sensor networks
Discrete Applied Mathematics
GD'10 Proceedings of the 18th international conference on Graph drawing
Greedy routing via embedding graphs onto semi-metric spaces
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Memoryless routing in convex subdivisions: Random walks are optimal
Computational Geometry: Theory and Applications
Embedding stacked polytopes on a polynomial-size grid
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On succinct convex greedy drawing of 3-connected plane graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A lower bound on greedy embedding in euclidean plane
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Schnyder greedy routing algorithm
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Succinct greedy drawings do not always exist
GD'09 Proceedings of the 17th international conference on Graph Drawing
Shifting strategy for geometric graphs without geometry
Journal of Combinatorial Optimization
An optimal greedy routing algorithm for triangulated polygons
Computational Geometry: Theory and Applications
Greedy routing via embedding graphs onto semi-metric spaces
Theoretical Computer Science
Hi-index | 0.00 |
N/A