Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Traversing a set of points with a minimum number of turns
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Covering a set of points with a minimum number of turns
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
On covering points with minimum turns
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Covering paths for planar point sets
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.89 |