Finding the Shortest Watchman Route in a Simple Polygon

Approximation algorithms for geometric tour and network design problems (extended abstract)

Proceedings of the eleventh annual symposium on Computational geometry

A competitive strategy for learning a polygon

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithms for TSP with neighborhoods in the plane

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Computing multiple watchman routes

WEA'08 Proceedings of the 7th international conference on Experimental algorithms

Quality of monitoring of stochastic events by periodic and proportional-share scheduling of sensor coverage

ACM Transactions on Sensor Networks (TOSN)