dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Alexey Baburin Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos: Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Discrete Applied Mathematics 157(9): 1988-1992 (2009)
2006
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexey Baburin, Edward Gimadi: Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight. OR 2006: 215-220
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdward Gimadi, Alexey Baburin, Nikolai Glebov, Artem V. 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)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYury 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexey Baburin, Edward Gimadi: Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. OR 2004: 343-351

Coauthor Index

1Federico Della Croce [2] [5]
2Edward Gimadi [1] [2] [3] [4] [5]
3Y. V. Glazkov [5]
4Yury Glazkov [2]
5Nikolai Glebov [3]
6Vangelis Th. Paschos [2] [5]
7Artem V. Pyatkin [3]

Last update Sun May 27 04:04:01 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page