Combinatorics and Graph Theory with Applications in Computer Science
A special issue of Axioms (ISSN 2075-1680). This special issue belongs to the section "Mathematical Analysis".
Deadline for manuscript submissions: 30 June 2026 | Viewed by 23
Special Issue Editors
Interests: graph theory and combinatorics; algorithms and algorithm design; data science and machine learning; artificial intelligence and generative AI; pedagogy in computer science and mathematics; interdisciplinary applications in computer science mathematics
Interests: graph theory and its applications in computer science; hypergraphs and mixed hypergraph colorings; graph polynomials and statistical modeling; data analysis and machine learning; mathematics education and artificial intelligence
Interests: graph theory; lattice theory; discrete mathematics; applications of algebraic structures in computer science
Interests: cybersecurity; blockchain; artificial intelligence; data science and analytics; algorithms and computational methods; graph theory and combinatorics; pedagogy in computer science mathematics
Special Issue Information
Dear Colleagues,
Combinatorics and graph theory serve as fundamental pillars of modern computer science, providing the essential language and tools to model, analyze, and solve a vast spectrum of computational challenges. From the architecture of communication networks and the flow of data to the complexities of biological systems and social interactions, discrete structures are ubiquitous. The design of efficient algorithms to process these structures is a central goal in computer science, creating a deep and fruitful symbiosis between these mathematical and computational disciplines.
This Special Issue, titled “Combinatorics and Graph Theory with Applications in Computer Science”, aims to highlight the latest advancements at this critical intersection. We seek to gather high-quality, original research that presents novel theoretical results in combinatorics and graph theory, as well as innovative applications that address significant challenges in computer science.
We welcome submissions on a broad range of topics, including, but not limited to, the following:
- Design and analysis of graph algorithms.
- Combinatorial optimization and approximation algorithms.
- Structural, extremal, and probabilistic combinatorics.
- Network theory and the analysis of complex networks.
- Applications in cryptography, coding theory, and cybersecurity.
- Algorithmic game theory and mechanism design.
- Random graphs and their computational applications.
- Graph coloring, graph drawing, and information visualization.
This Special Issue aims to serve as a valuable resource for both researchers and practitioners, fostering collaboration across disciplines, enhancing the visibility of cutting-edge work, and inspiring future developments at the interface of discrete mathematics and computer science.
We look forward to receiving your contributions.
Dr. Shanzhen Gao
Dr. Julian D. Allagan
Dr. Jianning Su
Dr. Weizheng Gao
Guest Editors
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Axioms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2400 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Keywords
- graph theory
- combinatorics
- graph algorithms
- combinatorial optimization
- algorithm design
- network analysis
- computational complexity
- discrete mathematics
- theoretical computer science
- cryptography
Benefits of Publishing in a Special Issue
- Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
- Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
- Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
- External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
- Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.
Further information on MDPI's Special Issue policies can be found here.
