Journal of Experimental Algorithmics (JEA)
Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity aspects of two-dimensional data compression
Nordic Journal of Computing
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Rectangle covers revisited computationally
Journal of Experimental Algorithmics (JEA)
Note on covering monotone orthogonal polygons with star-shaped polygons
Information Processing Letters
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Linear-time 3-approximation algorithm for the r-star covering problem
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Parsimonious rule generation for a nature-inspired approach to self-assembly
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Algorithms and theory of computation handbook
A nearly optimal algorithm for covering the interior of an Art Gallery
Pattern Recognition
A Sensor Placement Algorithm for a Mobile Robot Inspection Planning
Journal of Intelligent and Robotic Systems
Beyond triangulation: covering polygons with triangles
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Inspection planning in the polygonal domain by Self-Organizing Map
Applied Soft Computing
Rectangle covers revisited computationally
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The class cover problem with boxes
Computational Geometry: Theory and Applications
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
| Hi-index | 0.00 |