Dr Andrei Gagarin

2024

• Dijkstra, L., Gagarin, A., Corcoran, P. and Lewis, R. 2024. Digraphs and k-domination models for facility location problems in road networks: Greedy heuristics. Presented at: International Network Optimization Conference 2024, Dublin, Ireland, 11-13 March 2024Proceedings of the 11th International Network Optimization Conference (INOC). OpenProceedings pp. 22-27., (10.48786/inoc.2024.05)

2023

• Lewis, R., Corcoran, P. and Gagarin, A. 2023. Methods for determining cycles of a specific length in undirected graphs with edge weights. Journal of Combinatorial Optimization 46, article number: 29. (10.1007/s10878-023-01091-w)
• Gagarin, A. and Kocay, W. L. 2023. Embedding K3,3 and K5 on the double torus. Discrete Applied Mathematics (10.1016/j.dam.2023.05.018)

2022

• Dijkstra, L., Gagarin, A. and Zverovich, V. 2022. Weighted domination models and randomized heuristics. Presented at: 2022 International Network Optimization Conference (INOC), Aachen, Germany, 1-4 March 2022.

2021

• Corcoran, P. and Gagarin, A. 2021. Heuristics for k-domination models of facility location problems in street networks. Computers and Operations Research 133, article number: 105368. (10.1016/j.cor.2021.105368)
• Zverovich, V., Gagarin, A. and Poghosyan, A. 2021. Graph models for backbone sets and limited packings in networks. In: Zverovich, V. ed. Modern Applications of Graph Theory. Oxford: Oxford University Press, pp. 213-274.
• Zverovich, V., Corcoran, P. and Gagarin, A. 2021. Graph models for optimization problems in road networks. In: Zverovich, V. ed. Modern Applications of Graph Theory. Oxford: Oxford University Press, pp. 275-336.

2020

• Corcoran, P., Mooney, P. and Gagarin, A. 2020. A distributed location obfuscation method for online route planning. Computers and Security 95, article number: 101850. (10.1016/j.cose.2020.101850)
• Gagarin, A. and Kocay, W. 2020. Embedding K5 and K3,3 on orientable surfaces. Presented at: 18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Ischia, Italy (online), 14-16 September 2020.

2019

• Karapetyan, D., Parkes, A. J., Gutin, G. and Gagarin, A. 2019. Pattern-based approach to the workflow satisfiability problem with user-independent constraints. Journal of Artificial Intelligence Research 66, pp. 85-122. (10.1613/jair.1.11339)
• Zverovich, V. and Gagarin, A. 2019. Embedding graphs on topological surfaces. In: Zverovich, V. ed. Research Topics in Graph Theory and Its Applications. Cambridge: Cambridge Scholars Publishing, pp. 169-198.

2018

• Gagarin, A. and Corcoran, P. 2018. Multiple domination models for placement of electric vehicle charging stations in road networks. Computers and Operations Research 96, pp. 69-79. (10.1016/j.cor.2018.03.014)
• Spasic, I., Corcoran, P., Gagarin, A. and Buerki, A. 2018. Head to head: Semantic similarity of multi-word terms. IEEE Access 6, pp. 20545-20557. (10.1109/ACCESS.2018.2826224)
• Anitha, T., Rajkumar, R. and Gagarin, A. 2018. The complement of proper power graphs of finite groups. Palestine Journal of Mathematics 7(2), pp. 579-597.

2017

• Gagarin, A. and Corcoran, P. 2017. k-Domination models for placement of electric vehicle charging stations in road networks. Presented at: 8th International Conference on Computational Logistics, Southampton, United Kingdom, 18-20 October 2017.

2016

• Crampton, J., Gagarin, A., Gutin, G., Jones, M. and Wahlstrom, M. 2016. On the workflow satisfiability problem with class-independent constraints for hierarchical organizations. ACM Transactions on Privacy and Security (TOPS) 19(3), article number: 8. (10.1145/2988239)
• Cohen, D., Crampton, J., Gagarin, A., Gutin, G. and Jones, M. 2016. Algorithms for the workflow satisfiability problem engineered for counting constraints. Journal of Combinatorial Optimization 32, pp. 3-24. (10.1007/s10878-015-9877-7)
• Rajkumar, R., Devi, P. and Gagarin, A. 2016. Classification of finite groups with toroidal or projective-planar permutability graphs. Communications in Algebra 44(9), pp. 3705-3726. (10.1080/00927872.2015.1087004)

2015

• Gagarin, A. and Zverovich, V. 2015. The probabilistic approach to limited packings in graphs. Discrete Applied Mathematics 184, pp. 146-153. (10.1016/j.dam.2014.11.017)
• Karapetyan, D., Gagarin, A. and Gutin, G. 2015. Pattern backtracking algorithm for the workflow satisfiability problem with user-independent constraints. Presented at: FAW 2015: 9th International Workshop on Frontiers in Algorithmics, Guilin, China, 3-5 July 2015 Presented at Wang, J. and Yap, C. eds.Frontiers in Algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings, Vol. 9130. Springer Verlag pp. 138-149., (10.1007/978-3-319-19647-3_13)
• Crampton, J., Gagarin, A., Gutin, G. and Jones, M. 2015. On the workflow satisfiability problem with class-independent constraints. Leibniz International Proceedings in Informatics (LIPIcs) 43, pp. 66-77. (10.4230/LIPIcs.IPEC.2015.66)

2014

• Cohen, D., Crampton, J., Gagarin, A., Gutin, G. and Jones, M. 2014. Iterative plan construction for the workflow satisfiability problem. Journal of Artificial Intelligence Research 51, pp. 555-577. (10.1613/jair.4435)
• Cohen, D., Crampton, J., Gagarin, A., Gutin, G. and Jones, M. 2014. Engineering algorithms for workflow satisfiability problem with user-independent constraints. Presented at: FAW 2014: 8th International Workshop on Frontiers in Algorithmics, Zhangjiajie, China, 28-30 June 2014 Presented at Chen, J., Hopcroft, J. E. and Wang, J. eds.Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings, Vol. 8497. Lecture Notes in Computer Science Springer Verlag pp. 48-59., (10.1007/978-3-319-08016-1_5)