1. Competitive analysis for dynamic multiperiod uncapacitated routing problems;Angelelli;Networks,2007
2. N. Ascheuer, S. O. Krumke, J. Rambau, Online dial-a-ride problems: minimizing the completion time, in: Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2000, pp. 639–650.
3. Algorithms for the on-line travelling salesman;Ausiello;Algorithmica,2001
4. The online TSP against fair adversaries;Blom;INFORMS J. Comput.,2001
5. S. Heinz, S.O. Krumke, N. Megow, J. Rambau, A. Tuschscherer, T. Vredeveld, The online target date assignment problem, in: Proceedings of the Third Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science, vol. 3879, Springer, Berlin, 2005, pp. 230–243.