| |
| 2006 | ||
|---|---|---|
| 4 | EE | Alexey Baburin, Edward Gimadi: Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight. OR 2006: 215-220 |
| 3 | EE | Edward Gimadi, Alexey Baburin, Nikolai Glebov, Artem Pyatkin: NP-hardness and approximation algorithms for solving Euclidean problem of finding a maximum total weight subset of vectors. Electronic Notes in Discrete Mathematics 27: 29-31 (2006) |
| 2 | EE | Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos: Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. Electronic Notes in Discrete Mathematics 27: 35-36 (2006) |
| 2004 | ||
| 1 | EE | Alexey Baburin, Edward Gimadi: Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. OR 2004: 343-351 |
| 1 | Federico Della Croce | [2] |
| 2 | Edward Gimadi | [1] [2] [3] [4] |
| 3 | Yury Glazkov | [2] |
| 4 | Nikolai Glebov | [3] |
| 5 | Vangelis Th. Paschos | [2] |
| 6 | Artem Pyatkin | [3] |