1. Online dial-a-ride problems: Minimizing the completion time;Ascheuer,2000
2. On salesmen, repairmen, spiders, and other traveling agents;Ausiello,2000
3. Algorithms for the on-line travelling salesman;Ausiello;Algorithmica,2001
4. Algorithms for the on-line quota traveling salesman problem;Ausiello;Information Processing Letters,2004
5. G. Ausiello, V. Bonifaci, L. Laura, The online prize-collecting traveling salesman problem, Technical Report TR 08-06, Department of Computer and Systems Science, University of Rome “La Sapienza”, Rome, Italy, 2006