Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Rectangle covers revisited computationally
Journal of Experimental Algorithmics (JEA)
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters
A Scheme for Computing Minimum Covers within Simple Regions
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Linear-time 3-approximation algorithm for the r-star covering problem
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Optimal cover of points by disks in a simple polygon
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Rectangle covers revisited computationally
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Optimal Cover of Points by Disks in a Simple Polygon
SIAM Journal on Computing
Approximate partitioning of 2D objects into orthogonally convex components
Computer Vision and Image Understanding
| Hi-index | 0.00 |