D. S. Malyshev

659 total citations
77 papers, 305 citations indexed

About

D. S. Malyshev is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, D. S. Malyshev has authored 77 papers receiving a total of 305 indexed citations (citations by other indexed papers that have themselves been cited), including 65 papers in Computational Theory and Mathematics, 22 papers in Discrete Mathematics and Combinatorics and 15 papers in Geometry and Topology. Recurrent topics in D. S. Malyshev's work include Advanced Graph Theory Research (54 papers), Graph Labeling and Dimension Problems (34 papers) and Limits and Structures in Graph Theory (20 papers). D. S. Malyshev is often cited by papers focused on Advanced Graph Theory Research (54 papers), Graph Labeling and Dimension Problems (34 papers) and Limits and Structures in Graph Theory (20 papers). D. S. Malyshev collaborates with scholars based in Russia, United States and United Kingdom. D. S. Malyshev's co-authors include Vadim Lozin, O. V. Pochinka, V. E. Alekseev, Pãnos M. Pardalos, P. M. Pardalos, Alexander Tiskin, Boris Goldengorin, Nikolai Yu. Zolotykh, Pãnos M. Pardalos and В. З. Гринес and has published in prestigious journals such as Theoretical Computer Science, Chaos An Interdisciplinary Journal of Nonlinear Science and Discrete Applied Mathematics.

In The Last Decade

D. S. Malyshev

63 papers receiving 290 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
D. S. Malyshev Russia 10 269 110 84 45 31 77 305
Luis Goddyn Canada 11 286 1.1× 171 1.6× 113 1.3× 62 1.4× 42 1.4× 30 372
Jochen Harant Germany 13 408 1.5× 151 1.4× 75 0.9× 112 2.5× 68 2.2× 62 448
Glenn Hurlbert United States 11 233 0.9× 161 1.5× 87 1.0× 98 2.2× 15 0.5× 45 322
Ajai Kapoor Italy 10 213 0.8× 84 0.8× 59 0.7× 25 0.6× 42 1.4× 16 263
V. E. Alekseev Russia 9 242 0.9× 97 0.9× 52 0.6× 54 1.2× 78 2.5× 24 297
Mohamed H. El-Zahar Canada 10 237 0.9× 154 1.4× 68 0.8× 120 2.7× 24 0.8× 23 329
Phyllis Zweig Chinn United States 4 227 0.8× 35 0.3× 59 0.7× 58 1.3× 91 2.9× 11 286
Tomáš Kaiser Czechia 12 348 1.3× 194 1.8× 73 0.9× 109 2.4× 59 1.9× 60 404
H. Tracy Hall United States 7 207 0.8× 50 0.5× 44 0.5× 133 3.0× 47 1.5× 20 238
Attila Sali Hungary 9 82 0.3× 129 1.2× 104 1.2× 39 0.9× 38 1.2× 47 238

Countries citing papers authored by D. S. Malyshev

Since Specialization
Citations

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

Fields of papers citing papers by D. S. Malyshev

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of D. S. Malyshev

This figure shows the co-authorship network connecting the top 25 collaborators of D. S. Malyshev. A scholar is included among the top collaborators of D. S. Malyshev 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 D. S. Malyshev. D. S. Malyshev 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.
Malyshev, D. S., et al.. (2024). A new and faster representation for counting integer points in parametric polyhedra. Computational Optimization and Applications. 92(3). 811–861.
2.
Malyshev, D. S., et al.. (2024). On efficient algorithms for bottleneck path problems with many sources. Optimization Letters. 18(5). 1273–1283. 1 indexed citations
3.
Malyshev, D. S., et al.. (2023). On diameter $5$ trees with the maximum number of matchings. Sbornik Mathematics. 214(2). 273–284. 1 indexed citations
4.
Malyshev, D. S., et al.. (2023). Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems. Optimization Letters. 18(1). 73–103. 1 indexed citations
5.
Malyshev, D. S., et al.. (2022). A New Proof of a Result Concerning a Complete Description of $$ (n, n + 2) $$-Graphs with Maximum Value of the Hosoya Index. Mathematical Notes. 111(1-2). 258–272. 5 indexed citations
6.
Malyshev, D. S.. (2021). The vertex colourability problem for $$\{claw,butterfly\}$$-free graphs is polynomial-time solvable. Optimization Letters. 15(2). 311–326.
7.
Malyshev, D. S., et al.. (2020). Trees without twin-leaves with smallest number of maximal independent sets. Discrete Mathematics and Applications. 30(1). 53–67. 1 indexed citations
8.
Malyshev, D. S., et al.. (2018). A method of graph reduction and its applications. Discrete Mathematics and Applications. 28(4). 249–258.
9.
Malyshev, D. S., et al.. (2018). The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. Discrete Optimization. 29. 103–110. 3 indexed citations
10.
Malyshev, D. S.. (2018). The weighted coloring problem for two graph classes characterized by small forbidden induced structures. Discrete Applied Mathematics. 247. 423–432. 7 indexed citations
11.
Malyshev, D. S.. (2017). Complexity classification of the edge coloring problem for a family of graph classes. Discrete Mathematics and Applications. 27(2). 2 indexed citations
12.
Malyshev, D. S., et al.. (2017). On the number of maximal independent sets in complete q -ary trees. Discrete Mathematics and Applications. 27(5). 311–318.
13.
Malyshev, D. S., et al.. (2017). The computational complexity of three graph problems for instances with bounded minors of constraint matrices. Discrete Applied Mathematics. 227. 13–20. 4 indexed citations
14.
Malyshev, D. S., et al.. (2016). Two complexity results for the vertex coloring problem. Discrete Applied Mathematics. 219. 158–166. 14 indexed citations
15.
Malyshev, D. S., et al.. (2016). The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. Journal of Global Optimization. 68(3). 601–622. 3 indexed citations
16.
Malyshev, D. S.. (2015). A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs. Discrete Applied Mathematics. 203. 117–126. 2 indexed citations
17.
Lozin, Vadim & D. S. Malyshev. (2015). Vertex coloring of graphs with few obstructions. Discrete Applied Mathematics. 216. 273–280. 26 indexed citations
18.
Malyshev, D. S.. (2015). The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs. Discrete Mathematics. 338(11). 1860–1865. 13 indexed citations
19.
20.
Malyshev, D. S.. (2011). On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number. Discrete Mathematics and Applications. 21(5-6). 4 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 Luis Goddyn Breakdown of academic impact, for papers by Jochen Harant Breakdown of academic impact, for papers by Glenn Hurlbert Breakdown of academic impact, for papers by Ajai Kapoor Breakdown of academic impact, for papers by V. E. Alekseev Breakdown of academic impact, for papers by Mohamed H. El-Zahar Breakdown of academic impact, for papers by Phyllis Zweig Chinn Breakdown of academic impact, for papers by Tomáš Kaiser Breakdown of academic impact, for papers by H. Tracy Hall Breakdown of academic impact, for papers by Attila Sali
Rankless by CCL
2026