DISCRETE MATHEMATICS
Scope & Guideline
Navigating the landscape of theoretical computer science.
Introduction
Aims and Scopes
- Graph Theory:
A central theme in the journal, covering topics such as graph coloring, Hamiltonian paths, graph spectra, and various graph invariants. This area examines the properties of graphs and their interactions with other mathematical structures. - Combinatorial Designs and Codes:
Research on combinatorial designs, including block designs and codes, is prominent. This includes studies on error-correcting codes, linear codes, and the construction of combinatorial objects with specific properties. - Combinatorial Optimization:
The journal publishes works on optimization problems within discrete structures, exploring algorithms, complexity, and various optimization techniques applied to combinatorial problems. - Algebraic Combinatorics:
A focus on the interplay between algebra and combinatorial structures, including topics like symmetric functions, polynomial invariants, and representation theory as they relate to discrete mathematics. - Discrete Probability and Random Structures:
Research involving probabilistic methods applied to combinatorial structures, including random graphs and their properties. This area examines how randomness influences the behavior of discrete systems. - Discrete Geometry:
This area encompasses studies on geometric properties of discrete structures, including arrangements of points, polytopes, and geometric combinatorics. - Matroid Theory:
An exploration of matroids and their applications in various combinatorial contexts, including independence structures and their generalizations. - Algorithmic Discrete Mathematics:
The journal features research focused on algorithms related to discrete structures, including complexity analysis and algorithm design for combinatorial problems.
Trending and Emerging
- Complex Networks and Graph Theory:
An increasing number of papers focus on complex networks, exploring their properties and applications in various fields, including computer science, biology, and social sciences. - Quantum Codes and Quantum Information Theory:
Research on quantum error-correcting codes and their applications in quantum computing and communication has gained momentum, reflecting the growing interest in quantum information science. - Graph Spectra and Eigenvalue Problems:
There is a noticeable trend towards exploring the spectral properties of graphs and their implications for various combinatorial problems, indicating a deeper integration of linear algebra with graph theory. - Parameterized Complexity and Algorithms:
An emerging area of interest involves the study of parameterized complexity in graph problems, which reflects a growing focus on fine-grained complexity analysis. - Topological Combinatorics:
Research in topological combinatorics is on the rise, particularly in the context of studying properties of spaces through combinatorial methods. - Applications of Combinatorics in Data Science:
The application of combinatorial techniques to data science, machine learning, and algorithmic design is becoming increasingly prominent, indicating a shift towards interdisciplinary research. - Randomized Algorithms and Probabilistic Methods:
The use of randomized algorithms and probabilistic methods in discrete settings is trending, showcasing the effectiveness of randomness in solving combinatorial problems.
Declining or Waning
- Classical Combinatorial Enumeration:
While enumeration techniques remain relevant, the focus on traditional counting problems has waned as researchers explore more complex structures and probabilistic approaches. - Traditional Graph Algorithms:
The study of classical graph algorithms, such as those for finding shortest paths or spanning trees, appears to be less emphasized in favor of more advanced techniques and applications in network theory. - Elementary Number Theory:
Research directly related to elementary number theory and its combinatorial aspects has become less prominent, as the journal appears to favor more structured and graph-theoretic approaches. - Simple Combinatorial Structures:
The focus on basic combinatorial structures and their properties has decreased as more complex and high-dimensional structures gain attention in the literature.
Similar Journals
JOURNAL OF COMBINATORIAL DESIGNS
Exploring Innovative Designs in Discrete MathematicsJOURNAL OF COMBINATORIAL DESIGNS, published by Wiley, is a leading peer-reviewed journal that serves as a vital platform for researchers in the field of discrete mathematics and combinatorics. With an impressive Q1 ranking in the 2023 category, it stands at the forefront of academic discourse, showcasing significant developments and innovative research from 1993 to 2024. The journal is dedicated to the study of combinatorial designs, including their applications in various scientific disciplines, which enhances its relevance among mathematicians and applied scientists alike. Although it operates on a traditional subscription model, the journal continues to attract high-quality submissions, as evidenced by its Scopus rank of #40 out of 92 in Discrete Mathematics and Combinatorics, placing it in the 57th percentile. Its commitment to advancing knowledge in combinatorial theory and applications makes it an essential resource for professionals, researchers, and students seeking to deepen their understanding and contribute to this dynamic field.
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE
Advancing Knowledge at the Intersection of Mathematics and ComputingDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, published by DISCRETE MATHEMATICS THEORETICAL COMPUTER SCIENCE in France, stands as a significant open-access journal since 1997, publishing innovative research articles within the intersecting disciplines of discrete mathematics and theoretical computer science. With an ISSN of 1462-7264 and an E-ISSN of 1365-8050, this journal aims to provide a platform for scholarly discourse and dissemination of knowledge, making it accessible to a global audience. It is recognized for its contributions, achieving a Q2 ranking in both Computer Science (Miscellaneous) and Discrete Mathematics and Combinatorics, alongside a Q3 ranking in Theoretical Computer Science as of 2023. The journal’s rigorous selection process ensures that only high-quality research is published, promoting advancements in these critical areas of study. Researchers, professionals, and students alike can benefit from its comprehensive articles that not only enhance theoretical understanding but also foster practical applications in the ever-evolving landscape of computer science.
Australasian Journal of Combinatorics
Connecting Innovators in Combinatorial ResearchThe Australasian Journal of Combinatorics, published by the CENTRE DISCRETE MATHEMATICS & COMPUTING, serves as a vital platform for researchers and professionals engaged in the dynamic field of discrete mathematics and combinatorics. With an ISSN of 2202-3518 and an E-ISSN of the same, this journal has been committed to open access since 2014, ensuring that groundbreaking research is readily available to a global audience. Based in Australia, specifically at the Department of Mathematics, University of Queensland, this journal spans the years from 1996 to 2024, showcasing the evolution of combinatorial research over nearly three decades. Recognized in the 2023 category quartiles as Q3 in Discrete Mathematics and Combinatorics, it ranks 68th out of 92 in Scopus, reflecting its growing influence despite its current percentile of 26th. The Australasian Journal of Combinatorics is dedicated to fostering innovative research and theoretical development, making it a valuable resource for academics and students alike.
JOURNAL OF COMBINATORIAL THEORY SERIES A
Advancing the Frontiers of Combinatorial Insight.JOURNAL OF COMBINATORIAL THEORY SERIES A, published by Academic Press Inc. Elsevier Science, stands as a pivotal platform for researchers in the realm of combinatorial mathematics and theoretical computer science. With an impact factor that underscores its influence and a well-respected reputation reflected in its rapid ascent to Q1 rankings in discrete mathematics and computational theory, this journal serves as a critical resource for academics seeking to advance their understanding of complex combinatorial structures and algorithms.
Founded in 1971, the journal covers a wide spectrum of topics within combinatorial theory, providing a robust forum for innovative research and theoretical advancements until 2025. Including a strong position in the Scopus rankings—notably, it ranks #10 out of 92 in discrete mathematics—the journal is essential for both emerging scholars and established professionals committed to pushing the boundaries of mathematical and computational inquiry. Researchers are encouraged to submit their findings to this esteemed publication, as it offers a non-open-access model that ensures rigorous peer review and high visibility within the academic community.
Journal of Combinatorics
Innovating Solutions in Graphs and DesignsJournal of Combinatorics is a premier academic journal dedicated to advancing the field of combinatorial theory and its applications. Published by INT PRESS BOSTON, INC, it aims to provide a robust platform for researchers, professionals, and students to disseminate their findings and engage with cutting-edge developments in combinatorics. With a focus on high-quality, peer-reviewed articles, the journal fosters rigorous mathematical discussions surrounding various facets of combinatorial structures, graph theory, design theory, and combinatorial optimization. Although currently not available as an Open Access journal, the Journal of Combinatorics plays a vital role in enriching the mathematical sciences and serves as an essential resource for academics seeking to stay updated with the latest trends in combinatorial research. By maintaining a commitment to excellence and innovation, this journal is indispensable for anyone looking to deepen their understanding in this critical area of study.
Discrete Analysis
Pioneering Open Access in Mathematical ResearchDiscrete Analysis, published by ALLIANCE DIAMOND OPEN ACCESS JOURNALS, is a pioneering open access journal that has been contributing to the fields of Algebra, Number Theory, Discrete Mathematics, Combinatorics, Geometry, and Topology since its inception in 2016. Based in the United Kingdom, this journal is highly regarded, holding a prestigious Q1 ranking across key mathematical disciplines as of 2023, which underscores its influence and reputation within the academic community. With rigorous peer-review standards and an accessible platform, Discrete Analysis is dedicated to disseminating high-quality research that fosters advancements in mathematical theory and application. By embracing the open access model, the journal ensures that scholarly work is readily available to researchers, professionals, and students alike, promoting greater collaboration and innovation in mathematical research. For up-to-date insights and contributions in the field, Discrete Analysis is an essential resource.
Contributions to Discrete Mathematics
Fostering collaboration and discovery in discrete research.Contributions to Discrete Mathematics, published by the Department of Mathematics and Statistics at the University of Calgary, serves as a vital platform for disseminating innovative research within the dynamic field of discrete mathematics and combinatorics. Established in 2008, this journal has rapidly gained recognition, currently holding a Q3 classification in discrete mathematics and combinatorics for 2023. As it aims to foster academic dialogue and share groundbreaking discoveries, the journal showcases high-quality peer-reviewed articles that cover a range of topics, from theoretical explorations to practical applications. Although it currently operates under a traditional subscription model, there is a growing commitment to enhancing access options, ensuring that critical knowledge is available to researchers and practitioners alike. With its notable Scopus ranking of #50 out of 92 within its category, this journal is positioned as an important resource for students, academics, and industry professionals who seek to stay at the forefront of discrete mathematics research.
Discrete Mathematics Algorithms and Applications
Exploring New Dimensions in Algorithms and Their Applications.Discrete Mathematics Algorithms and Applications, published by World Scientific Publishing Co Pte Ltd, stands as a pivotal resource in the field of discrete mathematics and combinatorics since its inception in 2009, with a convergence period extending to 2024. The journal holds an esteemed position within its category, ranked in the Q3 quartile according to latest metrics, recognized for its qualitative contributions to the academic community. With an ISSN of 1793-8309 and an E-ISSN of 1793-8317, it serves as a vital conduit for disseminating innovative research focused on algorithms and their applications within discrete mathematics. Although currently not an open access journal, it provides access to valuable insights and findings that are crucial for researchers, professionals, and students seeking to advance their understanding and application of discrete mathematical concepts. Based in Singapore, the journal continues to promote rigorous scholarly discourse and is a key publication for those involved in advancing the discipline.
DESIGNS CODES AND CRYPTOGRAPHY
Empowering the Future of Secure Computing and DesignDesigns, Codes and Cryptography is a renowned peer-reviewed journal published by Springer, dedicated to the interdisciplinary fields of applied mathematics, computer science, and discrete mathematics. With an exceptional impact factor, this journal is recognized for its high-quality research contributions and currently holds a prestigious Q1 ranking in multiple categories, including Applied Mathematics and Theoretical Computer Science, as of 2023. Featuring an extensive range of articles from 1991 to 2024, the journal serves as a pivotal platform for professionals, researchers, and students alike, focusing on innovative developments in coding theory, cryptography, and their practical applications in computing and secure communication. The journal's scope encompasses theoretical foundations, as well as algorithmic and applied aspects, making it an essential resource for advancing knowledge in the rapidly evolving fields of computer science and mathematics.
Prikladnaya Diskretnaya Matematika
Connecting Scholars with Cutting-Edge Computational Insights.Prikladnaya Diskretnaya Matematika, published by the PUBLISHING HOUSE SCIENTIFIC & TECHNICAL LITERATURE in the Russian Federation, serves as a vital resource for scholars and practitioners in the realms of applied mathematics, computational theory, and discrete mathematics. With an ISSN of 2071-0410 and an E-ISSN of 2311-2263, this journal has been actively contributing to the academic discourse since its inception in 2016, with expectations to continue until at least 2024. Although currently positioned in the Q4 category across several disciplines—including applied mathematics, computational theory, and signal processing—this journal offers a unique opportunity for researchers to contribute to an evolving field, despite facing competitive rankings in the Scopus database. The open access nature of the journal reflects a commitment to disseminating knowledge broadly, albeit details regarding access options remain unspecified. As a publication dedicated to fostering innovation and collaboration in theoretical and practical applications, Prikladnaya Diskretnaya Matematika plays an important role in advancing mathematical theories and practices, making it pertinent for those engaged in research and application within these critical domains.