1. A. A. Ageev, A. E. Baburin, E. Kh. Gimadi, and N. M. Korkishko, “Constant-Factor Approximation Algorithms for Finding Two Edge Disjoint Hamiltonian Cycles of Extremal Weight,” in Proceedings of All-Russia Conference on Optimization Problems and Economical Applications, Omsk, 2003 (Izd. Dom Nasledie, Omsk, 2003), pp. 9–12.
2. A. E. Baburin, E. Kh. Gimadi, and N. M. Korkishko, “Approximate Algorithms for Finding Two Edge-Disjoint Hamiltonian Cycles of Minimal Weight,” Diskret. Anal. Issled. Oper., Ser. 2, 11(1), 11–25 (2004).
3. A. I. Serdyukov, “Some Extremal Bypasses in Graphs,” Upravlyaemye Sistemy (Inst. Mat., Novosibirsk), No. 17, 76–79 (1978).
4. A. I. Serdyukov, “An Algorithm with an Estimate for the Traveling Salesman Problem of the Maximum,” Upravlyaemye Sistemy (Inst. Mat., Novosibirsk), No. 25, 80–86 (1984).
5. A. E. Baburin, E. Kh. Gimadi, and N. M. Korkishko, “Algorithms with Performance Quarantees for a Metric Problem of Finding Two Edge-Disjoint Hamiltonian Circuits of Minimum Total Weight,” in Operations Research Proceedings (Springer, Berlin, 2004), pp. 316–323.