1. G. Ausiello, B. Escoffier, J. Monnot, and V. Th. Paschos, “Reoptimization of minimum and maximum traveling salesman’s tours,” Algorithmic Theory, SWAT 2006, Lect. Notes Comput. Sci., 4059, 196–207, Springer, Berlin (2006).
2. H. J. Bockenhauer, L. Forlizzi, J. Hromkovic, et al., “On the approximability of TSP on local modifications of optimal solved instances,” Algorithmic Oper. Res., 2(2), 83–93 (2007).
3. H. J. Bockenhauer, J. Hromkovic, T. Momke, and P. Widmayer, “On the hardness of reoptimization,” in: Proc. 34th Intern. Conf. on Current Trends in Theory and Practice of Computer Science (SOF-SEM 2008), Lect. Notes Comput. Sci., 4910, 50–65, Springer, Berlin (2008).
4. B. Escoffier, M. Milanic, and V. Paschos, “Simple and fast reoptimizations for the Steiner tree problem,” Algorithmic Operations Research, 4(2), 86–94 (2009).
5. C. Archetti, L. Bertazzi, and M. G. Speranza, “Reoptimizing the travelling salesman problem,” Networks, 42(3), 154–159 (2003).