Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2006 | ||
---|---|---|

7 | 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 |

6 | 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) |

5 | EE | Edward Gimadi: Asymptotically optimal approach for solving some hard discrete optimization problems. Electronic Notes in Discrete Mathematics 27: 33-34 (2006) |

4 | 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) |

2005 | ||

3 | EE | Edward Gimadi: On Some Probability Inequalities for Some Discrete Optimization Problems. OR 2005: 283-289 |

2004 | ||

2 | EE | Alexey Baburin, Edward Gimadi: Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. OR 2004: 343-351 |

2001 | ||

1 | EE | Edward Gimadi, Natalie Kairan: Multi-index axial assignment problem on single-cyclic permutations. Electronic Notes in Discrete Mathematics 10: 125-128 (2001) |

1 | Alexey Baburin | [2] [4] [6] [7] |

2 | Federico Della Croce | [4] |

3 | Yury Glazkov | [4] |

4 | Nikolai Glebov | [6] |

5 | Natalie Kairan | [1] |

6 | Vangelis Th. Paschos | [4] |

7 | Artem Pyatkin | [6] |