Discrete Mathematics and Applications

Aims & Scope

Discrete Mathematics and Applications provides the latest information on the development of discrete mathematics in Russia to a world-wide readership.

The journal contains papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics.

Discrete Mathematics and Applications covers various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.

The journal is published bimonthly, simultaneously with the Russian edition as a cover-to-cover translation.

Issues contain, in addition to original articles and reviews in the above-mentioned subject areas, reviews of books published in and outside Russia and information notes.

Articles written in the English-language are most welcome!

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	0.3
2024	0.30

SJR (SCImago Journal Rank)

Year	Value
2024	0.195

Quartile

Year	Value
2024	Q4

h-index

Year	Value
2024	16

Journal Rank

Year	Value
2024	21504

Journal Citation Indicator

Year	Value
2024	27

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• On insecurity of cryptosystems based on generalized Reed-Solomon codes

  Citation: 129

  Authors: V. M., S. O.

• Kerdock code in a cyclic form

  Citation: 111

  Authors: A. A.

• A public-key cryptosystem based on binary Reed-Muller codes

  Citation: 87

  Authors: V. M.

• On perfect codes in deletion and insertion metric

  Citation: 86

  Authors: V. I.

• Bent functions on a finite Abelian group

  Citation: 36

  Authors: O. A., A. A., V. V.

• On the entropy values of hereditary classes of graphs

  Citation: 35

  Authors: V. E.

• Approximate algorithms to pack rectangles into several strips

  Citation: 34

  Authors: S. N.

• Bent functions from a finite abelian group into a finite abelian group

  Citation: 26

  Authors: V.I.

• On large deviations of branching processes in a random environment: geometric distribution of descendants

  Citation: 23

  Authors: M. V.

• Properties of bent functions of q-valued logic over finite fields

  Citation: 20

  Authors: A. S.

---