Results and Publications

D. Karapetyan, A.J. Parkes, G. Gutin, and A. Gagarin,
"Patternbased approach to the workflow satisfiability problem with userindependent constraints,"
J. Artificial Intelligence Research
66 (2019), pp. 85122.

D. Karapetyan, A. Gagarin, and G. Gutin,
"Pattern Backtracking Algorithm for the Workflow Satisfiability Problem,"
Proc. 9th International Frontiers of Algorithmics Workshop (FAW 2015),
J. Wang and C. Yap (Eds.), 2015,
LNCS 9130, Springer,
pp. 138149.

A. Gagarin, P. Corcoran,
"Multiple domination models for placement of electric vehicle charging stations in road networks,"
Computers & Operations Research
96 (2018), pp. 6979.
A. Gagarin, P. Corcoran,
"kDomination models for placement of electric vehicle charging stations in road networks,"
8th International Conference on Computational Logistics ICCL 2017
(booklet of abstracts), 2017, Southampton (UK), pp. 3031.

I. Spasić, P. Corcoran, A. Gagarin, and A. Buerki,
"Head to head: Semantic similarity of multiword terms,"
IEEE Access
6 (2018), pp. 2054520557.

J. Crampton, A. Gagarin, G. Gutin, M. Jones, and M. Wahlström,
"On the Workflow Satisfiability Problem with ClassIndependent Constraints for Hierarchical Organizations,"
ACM Transactions on Privacy and Security (TOPS)
19 (2016), no. 3, Article 8, pp. 8:18:29 (supplementary materials).
J. Crampton, A. Gagarin, G. Gutin, and M. Jones,
"On the Workflow Satisfiability Problem with ClassIndependent Constraints,"
Proc. 10th International Symposium on Parameterized and Exact Computation (IPEC 2015),
Th. Husfeldt and I. Kanj (Eds.), 2015,
LIPICS Vol. 43, Schloss Dagstuhl  Leibniz Center for Informatics,
pp. 6677 (supplementary materials).

R. Rajkumar, P. Devi, and A. Gagarin,
"Classification of finite groups with toroidal or projectiveplanar permutability graphs,"
Communications in Algebra
44 (2016), no. 9, pp. 37053726.

A. Gagarin and V. Zverovich,
"The probabilistic approach to limited packings in graphs,"
Discrete Appl. Math.
184 (2015) pp. 146153.
A. Gagarin and V. Zverovich,
"Bounds and algorithms for limited packings in graphs,"
Proc. 9th International Colloquium on Graph Theory and Combinatorics (ICGT 2014),
Grenoble, France, 2014, paper no. 27 (4 pages).

D. Cohen, J. Crampton, A. Gagarin, G. Gutin, and M. Jones,
"Algorithms for the workflow satisfiability problem engineered for counting constraints,"
J. Combinatorial Optimization
32 (2016), no. 1, pp. 324.
D. Cohen, J. Crampton, A. Gagarin, G. Gutin, and M. Jones,
"Engineering Algorithms for Workflow Satisfiability Problem
with UserIndependent Constraints,"
Proc. 8th International Frontiers of Algorithmics Workshop (FAW 2014),
J. Chen, J.E. Hopcroft, and J. Wang (Eds.), 2014,
LNCS 8497, Springer,
pp. 4859.

D. Cohen, J. Crampton, A. Gagarin, G. Gutin, and M. Jones,
"Iterative Plan Construction for the Workflow Satisfiability Problem,"
J. Artificial Intelligence Research
51 (2014), pp. 555577.
 A. Gagarin and V. Zverovich,
"The bondage number of graphs on topological surfaces and Teschner's conjecture,"
Discrete Math.
313 (2013), no. 6, pp. 796808.

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. 45, pp. 604611.
 A. Gagarin and V. Zverovich, "Upper bounds
for the bondage number of graphs on topological surfaces,"
Discrete Math.
313 (2013), no. 11, pp. 11321137.
 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. 975982.
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 (AINA 2009),
pp. 10371042.
 A. Gagarin, A. Poghosyan, and V.E. Zverovich,
"Upper bounds for alphadomination parameters,"
Graphs Combin.
25 (2009), no. 4, pp. 513520.
 A. Gagarin, G. Labelle, P. Leroux, and T. Walsh, "Structure and enumeration of
twoconnected graphs with prescribed threeconnected components,"
Adv. in Appl. Math.
43 (2009), no. 1, pp. 4674.
 A. Gagarin, W. Myrvold, and J. Chambers,
"The obstructions for toroidal graphs with no K_{3,3}'s," (full paper)
Discrete Math.
309 (2009), no. 11, pp. 36253631.
A. Gagarin, W. Myrvold, and J. Chambers, "Forbidden minors and subdivisions for
toroidal graphs with no K_{3,3}'s," (extended abstract)
Electron. Notes Discrete Math. 22 (2005), pp. 151156.
 A. Gagarin, "Improved upper bounds for the ktuple domination number,"
Australas. J. Combin. 41 (2008), pp. 257261.
 A. Gagarin and V.E. Zverovich, "A generalised upper bound
for the ktuple domination number,"
Discrete Math. 308 (2008), no. 56, pp. 880885.
 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 highthroughput screening,"
Bioinformatics 23 (2007), no. 13, pp. 16481657
(supplementary materials available online).
 A. Gagarin, G. Labelle, and P. Leroux, "Counting unlabelled
toroidal graphs with no K_{3,3}subdivisions," (full paper)
Adv. in Appl. Math. 39 (2007), no. 1, pp. 5175.
A. Gagarin, G. Labelle, and P. Leroux,
"The structure and unlabelled enumeration of toroidal graphs with no K_{3,3}'s,"
(extended abstract)
Electron. Notes Discrete Math. 24 (2006), pp. 6976.
 A. Gagarin, G. Labelle, and P. Leroux,
"The structure of K_{3,3}subdivisionfree toroidal graphs,"
Discrete Math. 307 (2007), no. 23, pp. 29933005.
 A. Gagarin, V. Makarenkov, and P. Zentilli,
"Using clustering techniques to improve hit selection in highthroughput screening,"
J. Biomol. Screen. 11 (2006), no. 8, pp. 903914.
 V. Makarenkov, D. Kevorkov, P. Zentilli, A. Gagarin, N. Malo, and R. Nadon,
"HTSCorrector : software for the statistical analysis and correction of experimental
highthroughput screening data," (applications note)
Bioinformatics 22 (2006), no. 11, pp. 14081409.
 A. Gagarin, D. Kevorkov, V. Makarenkov, and P. Zentilli,
"Comparison of two methods for detecting and correcting systematic error in highthroughput 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. 241249.
 A. Gagarin and W. Kocay,
"Embedding graphs containing K_{5}subdivisions,"
Ars Combin. 64 (2002), pp. 3349.
 A.V. Gagarin and I.E. Zverovich, "Hereditary classes of line graphs,"
Ars Combin. 48 (1998), pp. 161172.
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 stronglyhereditary classes of graphs, (in Russian)
MSc Thesis, Faculty of Mechanics and Mathematics, Belarusian State University, Minsk, Belarus, 1994
(advisor  Igor E. Zverovich).