Andrei Gagarin

612 total citations
34 papers, 352 citations indexed

About

Andrei Gagarin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Andrei Gagarin has authored 34 papers receiving a total of 352 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 8 papers in Computer Networks and Communications and 7 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Andrei Gagarin's work include Advanced Graph Theory Research (18 papers), Complexity and Algorithms in Graphs (7 papers) and Graph Labeling and Dimension Problems (6 papers). Andrei Gagarin is often cited by papers focused on Advanced Graph Theory Research (18 papers), Complexity and Algorithms in Graphs (7 papers) and Graph Labeling and Dimension Problems (6 papers). Andrei Gagarin collaborates with scholars based in Canada, United Kingdom and India. Andrei Gagarin's co-authors include Padraig Corcoran, Vladimir Makarenkov, Nathalie Malo, Robert Nadon, Vadim Zverovich, Sajid Hussain, Laurence T. Yang, William L. Kocay, Gregory Gutin and Mark Jones and has published in prestigious journals such as Bioinformatics, IEEE Access and Computers & Operations Research.

In The Last Decade

Andrei Gagarin

32 papers receiving 335 citations

Peers

Andrei Gagarin
Chandrabose Aravindan India
Sean T. McQuade United States
Moon Jung Chung United States
Pedro Pereira Portugal
Chiun‐Chieh Hsu Taiwan
Maryam Abbasi Portugal
Chandrabose Aravindan India
Andrei Gagarin
Citations per year, relative to Andrei Gagarin Andrei Gagarin (= 1×) peers Chandrabose Aravindan

Countries citing papers authored by Andrei Gagarin

Since Specialization
Citations

This map shows the geographic impact of Andrei Gagarin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrei Gagarin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrei Gagarin more than expected).

Fields of papers citing papers by Andrei Gagarin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrei Gagarin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrei Gagarin. The network helps show where Andrei Gagarin may publish in the future.

Co-authorship network of co-authors of Andrei Gagarin

This figure shows the co-authorship network connecting the top 25 collaborators of Andrei Gagarin. A scholar is included among the top collaborators of Andrei Gagarin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andrei Gagarin. Andrei Gagarin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lewis, Rhyd, Padraig Corcoran, & Andrei Gagarin. (2023). Methods for determining cycles of a specific length in undirected graphs with edge weights. Journal of Combinatorial Optimization. 46(5).
2.
Miroshnychenko, Ivan, et al.. (2022). IMPROVEMENT OF THE IMAGE CLUSTERIZATION METHOD. 24. 79–86. 3 indexed citations
3.
Corcoran, Padraig & Andrei Gagarin. (2021). Heuristics for k-domination models of facility location problems in street networks. Computers & Operations Research. 133. 105368–105368. 6 indexed citations
4.
Karapetyan, Daniel, Andrew Parkes, Gregory Gutin, & Andrei Gagarin. (2019). Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. Repository@Nottingham (University of Nottingham). 10 indexed citations
5.
Crampton, Jason, Andrei Gagarin, Gregory Gutin, & Mark Jones. (2015). On the Workflow Satisfiability Problem with Class-independent Constraints. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations
6.
Gagarin, Andrei & Vadim Zverovich. (2014). The probabilistic approach to limited packings in graphs. Discrete Applied Mathematics. 184. 146–153. 3 indexed citations
7.
Gagarin, Andrei & Vadim Zverovich. (2013). The bondage number of graphs on topological surfaces and Teschner’s conjecture. Discrete Mathematics. 313(6). 796–808. 1 indexed citations
8.
Gagarin, Andrei, et al.. (2011). Randomized algorithms and upper bounds for multiple domination in graphs and networks. Discrete Applied Mathematics. 161(4-5). 604–611. 7 indexed citations
9.
Gagarin, Andrei & Vadim Zverovich. (2011). Upper bounds for the bondage number of graphs on topological surfaces. Discrete Mathematics. 313(11). 1132–1137. 5 indexed citations
10.
Gagarin, Andrei. (2009). Structure and enumeration of two-connected graphs with prescribed three-connected components. 8 indexed citations
11.
Gagarin, Andrei, Sajid Hussain, & Laurence T. Yang. (2009). Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Networks. 3. 1037–1042. 7 indexed citations
12.
Gagarin, Andrei, et al.. (2008). Improved upper bounds for the k-tuple domination number. Australas. J Comb.. 41. 257–262. 1 indexed citations
13.
Gagarin, Andrei, Wendy Myrvold, & John L. C. Chambers. (2008). The obstructions for toroidal graphs with no K3,3’s. Discrete Mathematics. 309(11). 3625–3631. 5 indexed citations
14.
Gagarin, Andrei, Gilbert Labelle, & Pierre Leroux. (2007). The structure of K3,3-subdivision-free toroidal graphs. Discrete Mathematics. 307(23). 2993–3005. 2 indexed citations
15.
Gagarin, Andrei, Gilbert Labelle, & Pierre Leroux. (2007). Counting unlabelled toroidal graphs with no K3,3-subdivisions. Advances in Applied Mathematics. 39(1). 51–75. 3 indexed citations
16.
Gagarin, Andrei & Vadim Zverovich. (2007). A generalised upper bound for the k-tuple domination number. Discrete Mathematics. 308(5-6). 880–885. 14 indexed citations
17.
Gagarin, Andrei, et al.. (2006). Using Clustering Techniques to Improve Hit Selection in High-Throughput Screening. SLAS DISCOVERY. 11(8). 903–914. 16 indexed citations
18.
Gagarin, Andrei, et al.. (2003). Embeddings of Small Graphs on the Torus. 5(2). 351–371. 8 indexed citations
19.
Gagarin, Andrei & William L. Kocay. (2002). Embedding Graphs Containing K5-Subdivisions.. Ars Combinatoria. 64. 33. 13 indexed citations
20.
Gagarin, Andrei, et al.. (1998). Hereditary classes of line graphs.. Ars Combinatoria. 48. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Chandrabose Aravindan Breakdown of academic impact, for papers by Sean T. McQuade Breakdown of academic impact, for papers by Moon Jung Chung Breakdown of academic impact, for papers by Pedro Pereira Breakdown of academic impact, for papers by Chiun‐Chieh Hsu Breakdown of academic impact, for papers by Maryam Abbasi
Rankless by CCL
2026