A. V. Pyatkin

1.1k total citations
63 papers, 404 citations indexed

About

A. V. Pyatkin is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Artificial Intelligence. According to data from OpenAlex, A. V. Pyatkin has authored 63 papers receiving a total of 404 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computational Theory and Mathematics, 17 papers in Electrical and Electronic Engineering and 11 papers in Artificial Intelligence. Recurrent topics in A. V. Pyatkin's work include Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (19 papers) and graph theory and CDMA systems (15 papers). A. V. Pyatkin is often cited by papers focused on Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (19 papers) and graph theory and CDMA systems (15 papers). A. V. Pyatkin collaborates with scholars based in Russia, United Kingdom and Norway. A. V. Pyatkin's co-authors include A. V. Kel’manov, Fedor V. Fomin, Sergey Kitaev, Serge Gaspers, Igor Razgon, Fabrizio Grandoni, È. Kh. Gimadi, Magnús M. Halldórsson, Hajo Broersma and Viresh Patel and has published in prestigious journals such as Pattern Recognition Letters, SIAM Journal on Optimization and Discrete Applied Mathematics.

In The Last Decade

A. V. Pyatkin

52 papers receiving 389 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
A. V. Pyatkin Russia	12	231	93	72	65	56	63	404
Shlomi Rubinstein Israel	10	166 0.7×	53 0.6×	102 1.4×	108 1.7×	22 0.4×	14	314
Naomi Nishimura Canada	12	300 1.3×	79 0.8×	17 0.2×	180 2.8×	33 0.6×	34	385
Imrich Vrt’o Slovakia	12	270 1.2×	30 0.3×	89 1.2×	149 2.3×	57 1.0×	60	437
Daniel Dadush Netherlands	10	160 0.7×	92 1.0×	32 0.4×	35 0.5×	20 0.4×	37	282
Thomas Andreae Germany	10	275 1.2×	32 0.3×	38 0.5×	78 1.2×	47 0.8×	39	365
Lap Chi Lau Hong Kong	13	328 1.4×	57 0.6×	29 0.4×	365 5.6×	21 0.4×	43	633
Miroslav Chlebík Slovakia	12	357 1.5×	29 0.3×	33 0.5×	125 1.9×	10 0.2×	28	518
Zeev Nutov Israel	17	639 2.8×	52 0.6×	61 0.8×	517 8.0×	31 0.6×	93	801
Karl Heinz Borgwardt Germany	6	97 0.4×	31 0.3×	37 0.5×	34 0.5×	12 0.2×	14	217
Jochen Alber Germany	11	373 1.6×	74 0.8×	8 0.1×	193 3.0×	20 0.4×	17	455

Countries citing papers authored by A. V. Pyatkin

Since Specialization

Citations

This map shows the geographic impact of A. V. Pyatkin'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 A. V. Pyatkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites A. V. Pyatkin more than expected).

Fields of papers citing papers by A. V. Pyatkin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by A. V. Pyatkin. 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 A. V. Pyatkin. The network helps show where A. V. Pyatkin may publish in the future.

Co-authorship network of co-authors of A. V. Pyatkin

This figure shows the co-authorship network connecting the top 25 collaborators of A. V. Pyatkin. A scholar is included among the top collaborators of A. V. Pyatkin 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 A. V. Pyatkin. A. V. Pyatkin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Pyatkin, A. V., et al.. (2024). New Tools to Study 1-11-Representation of Graphs. Graphs and Combinatorics. 40(5).

Kitaev, Sergey, et al.. (2023). On semi-transitive orientability of split graphs. Information Processing Letters. 184. 106435–106435. 2 indexed citations

Pyatkin, A. V., et al.. (2018). The maximum number of induced open triangles in graphs of a given order. Optimization Letters. 13(8). 1927–1935. 4 indexed citations

Kitaev, Sergey & A. V. Pyatkin. (2018). Word-Representable Graphs: a Survey. Journal of Applied and Industrial Mathematics. 12(2). 278–296. 3 indexed citations

Pyatkin, A. V., Daniel Aloise, & Nenad Mladenović. (2017). NP-Hardness of balanced minimum sum-of-squares clustering. Pattern Recognition Letters. 97. 44–45. 2 indexed citations

Pyatkin, A. V., et al.. (2016). Convergecast scheduling problem in case of given aggregation tree: The complexity status and some special cases. 1–6. 5 indexed citations

Eremeev, Anton V., A. V. Kel’manov, & A. V. Pyatkin. (2016). On the complexity of some Euclidean optimal summing problems. Doklady Mathematics. 93(3). 286–288. 1 indexed citations

Kel’manov, A. V. & A. V. Pyatkin. (2015). NP-hardness of some Quadratic Euclidean 2-clustering problems. Doklady Mathematics. 92(2). 634–637. 6 indexed citations

Halldórsson, Magnús M., Sergey Kitaev, & A. V. Pyatkin. (2015). Semi-transitive orientations and word-representable graphs. Discrete Applied Mathematics. 201. 164–171. 17 indexed citations

10.

Pyatkin, A. V.. (2012). Triangle-free2P3-free graphs are 4-colorable. Discrete Mathematics. 313(5). 715–720. 5 indexed citations

11.

Bonsma, Paul, Hajo Broersma, Viresh Patel, & A. V. Pyatkin. (2011). The complexity of finding uniform sparsest cuts in various graph classes. Journal of Discrete Algorithms. 14. 136–149. 4 indexed citations

12.

Avgustinovich, S. V., et al.. (2011). On Square-Free Permutations. Strathprints: The University of Strathclyde institutional repository (University of Strathclyde). 16(1). 3–10. 3 indexed citations

13.

Pyatkin, A. V.. (2010). On complexity of a choice problem of the vector subset with the maximum sum length. Journal of Applied and Industrial Mathematics. 4(4). 549–552. 3 indexed citations

14.

Kel’manov, A. V. & A. V. Pyatkin. (2009). Complexity of certain problems of searching for subsets of vectors and cluster analysis. Computational Mathematics and Mathematical Physics. 49(11). 1966–1971. 18 indexed citations

15.

Pyatkin, A. V.. (2007). Subdivided trees are integral sum graphs. Discrete Mathematics. 308(9). 1749–1750. 1 indexed citations

16.

Fomin, Fedor V., Serge Gaspers, & A. V. Pyatkin. (2006). Finding a minimum feedback vertex set in time O(1.7548 n. 4 indexed citations

17.

Bodlaender, Hans L., Hajo Broersma, Fedor V. Fomin, A. V. Pyatkin, & Gerhard J. Woeginger. (2004). Radio Labeling with Preassigned Frequencies. SIAM Journal on Optimization. 15(1). 1–16. 6 indexed citations

18.

Bodlaender, Hans L., et al.. (2002). Radio labeling with pre-assigned frequencies. University of Twente Research Information. 1(1636). 322–3. 1 indexed citations

19.

Pyatkin, A. V.. (2002). 6‐regular 4‐critical graph. Journal of Graph Theory. 41(4). 286–291. 2 indexed citations

20.

Pyatkin, A. V.. (1998). Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most 3. Discrete Mathematics. 185(1-3). 275–278. 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