Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. - Alexey Baburin; Edward Gimadi (OR, 2004)

Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight. - Alexey Baburin; Edward Gimadi (OR, 2006)

NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. - Edward Gimadi; Alexey Baburin; Alexei N. Glebov; Artem V. Pyatkin (Electron. Notes Discret. Math., 2006)

Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. - Yury Glazkov; Alexey Baburin; Edward Gimadi; Federico Della Croce; Vangelis Th. Paschos (Electron. Notes Discret. Math., 2006)

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. - Alexey Baburin; Federico Della Croce; Edward Gimadi; Y. V. Glazkov; Vangelis Th. Paschos (Discret. Appl. Math., 2009)