Results and Publications
- A. Gagarin and V. Zverovich,
"The bondage number of graphs on topological surfaces and Teschner's conjecture,"
Discrete Math.
313 (2013), no. 6, pp. 796-808.
- A. Gagarin and V. Zverovich, "Upper bounds
for the bondage number of graphs on topological surfaces,"
Discrete Math.
313 (2013), no. 11, pp. 1132-1137.
-
A. Gagarin, A. Poghosyan, and V. Zverovich,
"Randomized algorithms and upper bounds for multiple domination in graphs and networks,"
Discrete Appl. Math.
161 (2013), no. 4-5, pp. 604-611.
- A. Gagarin, S. Hussain, and L.T. Yang,
"Distributed hierarchical
search for balanced energy consumption routing spanning trees in Wireless Sensor Networks," (full paper)
J. Parallel Distrib. Comput.
70 (2010), no. 9, pp. 975-982.
A. Gagarin, S. Hussain, and L.T. Yang,
"Distributed
search for balanced energy consumption spanning trees in Wireless Sensor Networks," (extended abstract)
Proc. 23d International Conference on Advanced Information Networking and
Applications Workshops (WAINA 2009),
pp. 1037-1042.
- A. Gagarin, A. Poghosyan, and V.E. Zverovich,
"Upper bounds for alpha-domination parameters,"
Graphs Combin.
25 (2009), no. 4, pp. 513-520.
- A. Gagarin, G. Labelle, P. Leroux, and T. Walsh, "Structure and enumeration of
two-connected graphs with prescribed three-connected components,"
Adv. in Appl. Math.
43 (2009), no. 1, pp. 46-74.
- A. Gagarin, W. Myrvold, and J. Chambers,
"The obstructions for toroidal graphs with no K3,3's," (full paper)
Discrete Math.
309 (2009), no. 11, pp. 3625-3631.
A. Gagarin, W. Myrvold, and J. Chambers, "Forbidden minors and subdivisions for
toroidal graphs with no K3,3's," (extended abstract)
Electron. Notes Discrete Math. 22 (2005), pp. 151-156.
- A. Gagarin, "Improved upper bounds for the k-tuple domination number,"
Australas. J. Combin. 41 (2008), pp. 257-261.
- A. Gagarin and V.E. Zverovich, "A generalised upper bound
for the k-tuple domination number,"
Discrete Math. 308 (2008), no. 5-6, pp. 880-885.
- V. Makarenkov, P. Zentilli, D. Kevorkov, A. Gagarin, N. Malo, and R. Nadon,
"An efficient method for the detection and elimination of systematic error in high-throughput screening,"
Bioinformatics 23 (2007), no. 13, pp. 1648-1657
(supplementary materials available on-line).
- A. Gagarin, G. Labelle, and P. Leroux, "Counting unlabelled
toroidal graphs with no K3,3-subdivisions," (full paper)
Adv. in Appl. Math. 39 (2007), no. 1, pp. 51-75.
A. Gagarin, G. Labelle, and P. Leroux,
"The structure and unlabelled enumeration of toroidal graphs with no K3,3's,"
(extended abstract)
Electron. Notes Discrete Math. 24 (2006), pp. 69-76.
- A. Gagarin, G. Labelle, and P. Leroux,
"The structure of K3,3-subdivision-free toroidal graphs,"
Discrete Math. 307 (2007), no. 23, pp. 2993-3005.
- A. Gagarin, V. Makarenkov, and P. Zentilli,
"Using clustering techniques to improve hit selection in high-throughput screening,"
J. Biomol. Screen. 11 (2006), no. 8, pp. 903-914.
- V. Makarenkov, D. Kevorkov, P. Zentilli, A. Gagarin, N. Malo, and R. Nadon,
"HTS-Corrector : software for the statistical analysis and correction of experimental
high-throughput screening data," (applications note)
Bioinformatics 22 (2006), no. 11, pp. 1408-1409.
- A. Gagarin, D. Kevorkov, V. Makarenkov, and P. Zentilli,
"Comparison of two methods for detecting and correcting systematic error in high-throughput screening data,"
Data Science and Classification, V. Batagelj, H.-H. Bock, A. Ferligoj, and A. Ziberna (Eds.), 2006, Series: Studies in Classification, Data Analysis, and Knowledge Organization,
Springer, pp. 241-249.
- A. Gagarin and W. Kocay,
"Embedding graphs containing K5-subdivisions,"
Ars Combin. 64 (2002), pp. 33-49.
- A.V. Gagarin and I.E. Zverovich, "Hereditary classes of line graphs,"
Ars Combin. 48 (1998), pp. 161-172.
Theses
- A. Gagarin,
Discrete convexities and the problem of a minimum graph generator, (in French)
MSc Thesis, Laboratoire Leibniz, IMAG, National Polytechnic Institute (INPG) and
Université Joseph Fourier, Grenoble, France, 1996
(advisors - Pierre Duchet and Charles Payan).
- A. Gagarin,
Line transformations of strongly-hereditary classes of graphs, (in Russian)
MSc Thesis, Faculty of Mechanics and Mathematics, Belarusian State University, Minsk, Belarus, 1994
(advisor - Igor E. Zverovich).