List of Topics:
Location Research Breakthrough Possible @S-Logix pro@slogix.in

Office Address

Social List

Prikladnaya Diskretnaya Matematika - Tomsk State University | 2024 Impact Factor:0.737 | Cite Score:0.4 | Q4

Prikladnaya Diskretnaya Matematika Journal With Cite Score

Cite Score and Journal Rank of Prikladnaya Diskretnaya Matematika

  • About: Prikladnaya Diskretnaya Matematika (Applied Discrete Mathematics) is a peer-reviewed academic journal focused on the application of discrete mathematics to various fields of science and engineering.
  • Objective: The primary objective of Prikladnaya Diskretnaya Matematika is to advance the field of discrete mathematics by publishing high-quality research articles, technical papers, and reviews that explore both theoretical and practical aspects of discrete mathematics. The journal emphasizes applications in areas such as computer science, operations research, cryptography, network theory, and combinatorial optimization.
  • Interdisciplinary Approach: The journal adopts an interdisciplinary approach by integrating research from discrete mathematics with applications in computer science, engineering, and related fields. This approach encourages the development of new methods and solutions that address complex problems across various domains.
  • Impact and Significance: Prikladnaya Diskretnaya Matematika is significant for its role in bridging the gap between theoretical discrete mathematics and its practical applications. It serves as a valuable resource for researchers, practitioners, and educators who are involved in the application of discrete mathematics to real-world problems. The journals focus on both theoretical advancements and practical implementations ensures its relevance and impact in the field.

  • Editor-in-Chief:  Cheremushkin, Aleksandr Vasilevich

  • Scope: The Prikladnaya Diskretnaya Matematika journal, also known as "Applied Discrete Mathematics," focuses on various aspects of discrete mathematics and its applications. The journal is known for publishing research that contributes to both theoretical advancements and practical applications of discrete mathematics.
  • 1. Graph Theory: Research on properties and applications of graphs, including graph algorithms, network design, and graph coloring.
  • Combinatorics: Studies on combinatorial structures, counting methods, and combinatorial optimization problems.
  • Discrete Optimization: Research on optimization problems where the variables are discrete, including integer programming, combinatorial optimization, and algorithmic strategies.
  • Discrete Geometry: Studies on geometric problems that involve discrete structures, including lattice points, geometric configurations, and computational geometry.
  • Algorithm Design and Analysis: Research on algorithms for discrete problems, including complexity analysis, algorithmic techniques, and data structures.
  • Cryptography and Information Security: Studies on discrete mathematics applications in cryptography, including encryption algorithms, security protocols, and cryptographic protocols.
  • Number Theory: Research on properties of integers and their applications, including prime numbers, modular arithmetic, and computational number theory.
  • Discrete Probability: Studies on probabilistic models involving discrete structures, including random graphs, stochastic processes, and probabilistic algorithms.
  • Discrete Dynamical Systems: Research on systems that evolve over discrete time steps, including discrete-time dynamical models, chaos theory, and system stability.
  • Discrete Mathematics in Operations Research: Studies on applications of discrete mathematics in operations research, including scheduling, logistics, and decision-making problems.
  • Mathematical Logic: Research on logic within discrete mathematics, including formal systems, proofs, and computational logic.
  • Applied Combinatorics: Studies on combinatorial methods applied to real-world problems, including design theory, error-correcting codes, and network optimization.
  • Computational Complexity: Research on the complexity of discrete computational problems, including complexity classes, reductions, and intractability.
  • Graph Algorithms: Studies on algorithms for graph-related problems, including shortest paths, network flows, and graph traversal techniques
  • Latest Research Topics for PhD in Computer Science
    •

  • Print ISSN:  20710410

    Electronic ISSN:  23112263

  • Abstracting and Indexing:  Scopus

  • Imapct Factor 2024:  0.737

  • Subject Area and Category:   Computer Science, Computational Theory and Mathematics, Signal Processing, Mathematics, Applied Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science

  • Publication Frequency:  

  • H Index:  7

  • Best Quartile:

    Q1:  

    Q2:  

    Q3:  

    Q4:  Applied Mathematics

  • Cite Score:  0.4

  • SNIP:  0.266

  • Journal Rank(SJR):  0.135