Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Browse by All Cardiff Authors

[up] Up a level
Number of items: 26.

Dijkstra, Lukas, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Zverovich, Vadim 2025. Weighted domination models and randomized heuristics. Utilitas Mathematica 123 , pp. 61-86. 10.61091/um123-05
file

Altafini, Diego ORCID: https://orcid.org/0000-0002-6559-2372, Pezzica, Camilla ORCID: https://orcid.org/0000-0002-0512-7591, Bleil De Souza, Clarice ORCID: https://orcid.org/0000-0001-7823-1202, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706, Rosenberg, Ges, Gunner, Sam and Tryfonas, Theo 2024. DECIDE: An outcome-driven decision support system for urban-regional planning. Presented at: Networks, Markets & People (NMP) International Symposium: Communities, Institutions and Enterprises towards post-humanism epistemologies and AI challenges, Reggio Calabria, Italy, 22-24 May 2024. Published in: Calabrò, Francesco, Madureira, Livia, Carlo Morabito, Francesco and José Piñeira Mantiñán, María eds. Networks, Markets & People: Communities, Institutions and Enterprises Towards Post-humanism Epistemologies and AI Challenges. Lecture Notes in Networks and Systems , vol.4 (1186) Springer, Cham, pp. 91-100. 10.1007/978-3-031-74679-6_9
Item availability restricted.
file

Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Kocay, William L. 2024. Embedding K3,3 and K5 on the double torus. Discrete Applied Mathematics 354 , pp. 29-47. 10.1016/j.dam.2023.05.018
file

Dijkstra, Lukas, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706, Corcoran, Padraig ORCID: https://orcid.org/0000-0001-9731-3385 and Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X 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 2024. Proceedings of the 11th International Network Optimization Conference (INOC). OpenProceedings, pp. 22-27. 10.48786/inoc.2024.05
file

Altafini, Diego ORCID: https://orcid.org/0000-0002-6559-2372, Pezzica, Camilla ORCID: https://orcid.org/0000-0002-0512-7591, Bleil De Souza, Clarice ORCID: https://orcid.org/0000-0001-7823-1202, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706, Williams, Madlen, Thomas, James, Gunner, Sam and Tryfonas, Theo 2024. The spatial logic of e-mobility commutes within urban areas. Presented at: uSIM2024 - Shaping Net Zero Policies with Building Simulation The 4th IBPSA-Scotland Conference, Edinburgh, Scotland, 25 November 2024.
file

Lewis, R. ORCID: https://orcid.org/0000-0003-1046-811X, Corcoran, P. ORCID: https://orcid.org/0000-0001-9731-3385 and Gagarin, A. ORCID: https://orcid.org/0000-0001-9749-9706 2023. Methods for determining cycles of a specific length in undirected graphs with edge weights. Journal of Combinatorial Optimization 46 , 29. 10.1007/s10878-023-01091-w
file

Dijkstra, Lukas, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Zverovich, Vadim 2022. Weighted domination models and randomized heuristics. Presented at: 2022 International Network Optimization Conference (INOC), Aachen, Germany, 1-4 March 2022.
file

Corcoran, Padraig ORCID: https://orcid.org/0000-0001-9731-3385 and Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 2021. Heuristics for k-domination models of facility location problems in street networks. Computers and Operations Research 133 , 105368. 10.1016/j.cor.2021.105368
file

Zverovich, Vadim, Corcoran, Padraig ORCID: https://orcid.org/0000-0001-9731-3385 and Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 2021. Graph models for optimization problems in road networks. Zverovich, Vadim, ed. Modern Applications of Graph Theory, Oxford: Oxford University Press, pp. 275-336.

Zverovich, Vadim, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Poghosyan, Anush 2021. Graph models for backbone sets and limited packings in networks. Zverovich, Vadim, ed. Modern Applications of Graph Theory, Oxford: Oxford University Press, pp. 213-274.

Corcoran, Padraig ORCID: https://orcid.org/0000-0001-9731-3385, Mooney, Peter and Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 2020. A distributed location obfuscation method for online route planning. Computers and Security 95 , 101850. 10.1016/j.cose.2020.101850

Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Kocay, William 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.
file

Karapetyan, Daniel, Parkes, Andrew J., Gutin, Gregory and Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 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
file

Zverovich, Vadim and Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 2019. Embedding graphs on topological surfaces. Zverovich, Vadim, ed. Research Topics in Graph Theory and Its Applications, Cambridge: Cambridge Scholars Publishing, pp. 169-198.

Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Corcoran, Padraig ORCID: https://orcid.org/0000-0001-9731-3385 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
file

Spasic, Irena ORCID: https://orcid.org/0000-0002-8132-3885, Corcoran, Padraig ORCID: https://orcid.org/0000-0001-9731-3385, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Buerki, Andreas ORCID: https://orcid.org/0000-0003-2151-3246 2018. Head to head: Semantic similarity of multi-word terms. IEEE Access 6 , pp. 20545-20557. 10.1109/ACCESS.2018.2826224
file

Anitha, T., Rajkumar, R. and Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 2018. The complement of proper power graphs of finite groups. Palestine Journal of Mathematics 7 (2) , pp. 579-597.
file

Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Corcoran, Padraig ORCID: https://orcid.org/0000-0001-9731-3385 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. International Conference on Computational Logistics.
Item availability restricted.
file

Crampton, Jason, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706, Gutin, Gregory, Jones, Mark and Wahlstrom, Magnus 2016. On the workflow satisfiability problem with class-independent constraints for hierarchical organizations. ACM Transactions on Privacy and Security (TOPS) 19 (3) , 8. 10.1145/2988239
file

Cohen, D., Crampton, J., Gagarin, A. ORCID: https://orcid.org/0000-0001-9749-9706, 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
file

Rajkumar, R., Devi, P. and Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 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
file

Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Zverovich, Vadim 2015. The probabilistic approach to limited packings in graphs. Discrete Applied Mathematics 184 , pp. 146-153. 10.1016/j.dam.2014.11.017
file

Crampton, Jason, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706, Gutin, Gregory and Jones, Mark 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
file

Karapetyan, Daniel, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706 and Gutin, Gregory 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. Published in: Wang, Jianxin and Yap, Chee eds. Frontiers in Algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings. Lecture Notes in Computer Science. , vol.9130 Springer Verlag, pp. 138-149. 10.1007/978-3-319-19647-3_13
file

Cohen, David, Crampton, Jason, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706, Gutin, Gregory and Jones, Mark 2014. Iterative plan construction for the workflow satisfiability problem. Journal of Artificial Intelligence Research 51 , pp. 555-577. 10.1613/jair.4435
file

Cohen, David, Crampton, Jason, Gagarin, Andrei ORCID: https://orcid.org/0000-0001-9749-9706, Gutin, Gregory and Jones, Mark 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. Published in: Chen, Jainer, Hopcroft, John E. and Wang, Jianxin eds. Frontiers in Algorithmics: 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings. Lecture Notes in Computer Science. Lecture Notes in Computer Science , vol.8497 Springer Verlag, pp. 48-59. 10.1007/978-3-319-08016-1_5
file

This list was generated on Sat Nov 8 12:11:03 2025 GMT.


Maintained by Cardiff University IT