Dmitrii V. Ṗasechnik

13.2k total citations
66 papers, 777 citations indexed

About

Dmitrii V. Ṗasechnik is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Dmitrii V. Ṗasechnik has authored 66 papers receiving a total of 777 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Discrete Mathematics and Combinatorics, 27 papers in Computational Theory and Mathematics and 26 papers in Electrical and Electronic Engineering. Recurrent topics in Dmitrii V. Ṗasechnik's work include graph theory and CDMA systems (25 papers), Finite Group Theory Research (23 papers) and Coding theory and cryptography (17 papers). Dmitrii V. Ṗasechnik is often cited by papers focused on graph theory and CDMA systems (25 papers), Finite Group Theory Research (23 papers) and Coding theory and cryptography (17 papers). Dmitrii V. Ṗasechnik collaborates with scholars based in Netherlands, Singapore and United Kingdom. Dmitrii V. Ṗasechnik's co-authors include Etienne de Klerk, Alexander Schrijver, Renata Sotirov, Edith Elkind, Sergey Shpectorov, Joost P. Warners, А. А. Иванов, Yanqin Bai, Gelasio Salazar and Ákos Seress and has published in prestigious journals such as IEEE Transactions on Information Theory, European Journal of Operational Research and Mathematical Programming.

In The Last Decade

Dmitrii V. Ṗasechnik

60 papers receiving 683 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Dmitrii V. Ṗasechnik Netherlands 14 448 246 185 164 161 66 777
Ron Aharoni Israel 19 799 1.8× 90 0.4× 423 2.3× 131 0.8× 89 0.6× 103 1.0k
Peter Butkovič United Kingdom 16 879 2.0× 136 0.6× 36 0.2× 97 0.6× 143 0.9× 46 1.0k
Jim Lawrence United States 13 237 0.5× 44 0.2× 129 0.7× 81 0.5× 47 0.3× 31 619
Jon Folkman United States 11 413 0.9× 97 0.4× 257 1.4× 130 0.8× 77 0.5× 20 723
Ivo G. Rosenberg Canada 13 491 1.1× 42 0.2× 66 0.4× 83 0.5× 170 1.1× 115 758
N. Sauer Canada 12 532 1.2× 28 0.1× 308 1.7× 116 0.7× 297 1.8× 47 893
Paul C. Kainen United States 15 299 0.7× 30 0.1× 53 0.3× 95 0.6× 272 1.7× 56 718
Shachar Lovett United States 15 353 0.8× 40 0.2× 151 0.8× 125 0.8× 402 2.5× 103 680
W. T. Trotter United States 15 760 1.7× 29 0.1× 524 2.8× 118 0.7× 61 0.4× 41 1.0k
Fabrice Rouillier France 13 552 1.2× 64 0.3× 27 0.1× 41 0.3× 65 0.4× 40 785

Countries citing papers authored by Dmitrii V. Ṗasechnik

Since Specialization
Citations

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

Fields of papers citing papers by Dmitrii V. Ṗasechnik

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Dmitrii V. Ṗasechnik

This figure shows the co-authorship network connecting the top 25 collaborators of Dmitrii V. Ṗasechnik. A scholar is included among the top collaborators of Dmitrii V. Ṗasechnik 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 Dmitrii V. Ṗasechnik. Dmitrii V. Ṗasechnik 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.
Margulies, Susan S., Shmuel Onn, & Dmitrii V. Ṗasechnik. (2014). On the complexity of Hilbert refutations for partition. Journal of Symbolic Computation. 66. 70–83. 1 indexed citations
2.
Avis, David, et al.. (2014). Computing symmetry groups of polyhedra. LMS Journal of Computation and Mathematics. 17(1). 565–581. 15 indexed citations
3.
Elkind, Edith, Dmitrii V. Ṗasechnik, & Yair Zick. (2013). Dynamic weighted voting games. Adaptive Agents and Multi-Agents Systems. 515–522. 4 indexed citations
4.
Elkind, Edith, Dmitrii V. Ṗasechnik, & Michael Wooldridge. (2013). Strategic considerations in the design of committees. Adaptive Agents and Multi-Agents Systems. 439–446.
5.
Gravin, Nick, Jean B. Lasserre, Dmitrii V. Ṗasechnik, & Sinai Robins. (2012). The Inverse Moment Problem for Convex Polytopes. Discrete & Computational Geometry. 48(3). 596–621. 16 indexed citations
6.
Basu, Saugata, Dmitrii V. Ṗasechnik, & Marie-Françoise Roy. (2010). Bounding the Betti numbers and computing the Euler–Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials. Journal of the European Mathematical Society. 12(2). 529–553. 4 indexed citations
7.
Elkind, Edith & Dmitrii V. Ṗasechnik. (2009). Computing the nucleolus of weighted voting games. Symposium on Discrete Algorithms. 327–335. 19 indexed citations
8.
Klerk, Etienne de, Michael Newman, Dmitrii V. Ṗasechnik, & Renata Sotirov. (2008). On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs. European Journal of Combinatorics. 30(4). 879–888. 5 indexed citations
9.
Filaseta, Michael, Angel Kumchev, & Dmitrii V. Ṗasechnik. (2007). On the Irreducibility of a Truncated Binomial Expansion. Rocky Mountain Journal of Mathematics. 37(2). 5 indexed citations
10.
Klerk, Etienne de & Dmitrii V. Ṗasechnik. (2006). A note on the stability number of an orthogonality graph. European Journal of Combinatorics. 28(7). 1971–1979. 11 indexed citations
11.
Busygin, Stanislav & Dmitrii V. Ṗasechnik. (2003). On ~chi(G)-alpha(G)>0 gap recognition and alpha(G)-upper bounds. Electronic colloquium on computational complexity. 1 indexed citations
12.
Иванов, А. А. & Dmitrii V. Ṗasechnik. (2003). c-Extensions of the F4(2)-building. Discrete Mathematics. 264(1-3). 91–110. 2 indexed citations
13.
Fra, Alberto Del, Dmitrii V. Ṗasechnik, & Antonio Pasini. (1997). A New Family of Extended Generalized Quadrangles. European Journal of Combinatorics. 18(2). 155–169. 4 indexed citations
14.
Иванов, А. А., Dmitrii V. Ṗasechnik, & Sergey Shpectorov. (1996). Non-Abelian Representations of Some Sporadic Geometries. Journal of Algebra. 181(2). 523–557. 11 indexed citations
15.
Ṗasechnik, Dmitrii V., et al.. (1996). Classification of 2 −quasi−invariant subsets. Ars Combinatoria. 42(7). 65–76.
16.
Ṗasechnik, Dmitrii V., et al.. (1996). The Universal Covers of the Sporadic Semibiplanes. European Journal of Combinatorics. 17(7). 595–604. 1 indexed citations
17.
Ṗasechnik, Dmitrii V., et al.. (1995). Subsets close to invariant subsets for group actions. Proceedings of the American Mathematical Society. 123(8). 2283–2295. 6 indexed citations
18.
Ṗasechnik, Dmitrii V.. (1995). The triangular extensions of a generalized quadrangle of order {$(3,3)$}. Bulletin of the Belgian Mathematical Society - Simon Stevin. 2(5). 14 indexed citations
19.
Ṗasechnik, Dmitrii V.. (1994). Geometric characterization of the sporadic groups Fi22, Fi23, and Fi24. Journal of Combinatorial Theory Series A. 68(1). 100–114. 11 indexed citations
20.
Ṗasechnik, Dmitrii V.. (1991). Dual Linear Extensions of Generalised Quadrangles. European Journal of Combinatorics. 12(6). 541–548. 8 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

Rankless by CCL
2026