Algorithms, Computational Complexity Theory, Computational Geometry, and Categorical Methods Theory with Applications

A special issue of Axioms (ISSN 2075-1680). This special issue belongs to the section "Mathematical Analysis".

Deadline for manuscript submissions: 30 July 2026 | Viewed by 10

Special Issue Editors

Faculty of Environmental Informatics, Tokyo City University, Tokyo 158-0087, Japan
Interests: algorithms; computational complexity; category theory; machine learning methodology

E-Mail Website
Guest Editor
Department of Applied Mathematics, Braude College, Karmiel 2161002, Israel
Interests: differential geometry; image segmentation; internet; complex networks; computational complexity; computational geometry; convex programming; curve fitting; feature extraction; image matching; image texture
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Algorithms, computational complexity theory, computational geometry, and categorical methods form a core toolkit for understanding efficiency, structure, and compositionality in modern computation. In an era of unprecedented computational power and data proliferation—where software permeates science and industry—the efficiency, correctness, and scalability of systems are more critical than ever. We face the following pressing questions: Which problems admit efficient algorithms? What lower bounds delineate intrinsic hardness? How can geometric structure be exploited in data analysis and optimization? And how can categorical abstractions unify models, proofs, and implementations across domains?

This Special Issue will bring together these synergistic pillars of theoretical computer science to explore the interplay between classical foundations and contemporary applications. Our aim is to illuminate new research directions and foster a deeper, structural understanding of computation, from rigorous theory to real-world impact.

We welcome state-of-the-art contributions across the following (non-exhaustive) areas:

  • Algorithms and Optimization: Design and analysis; algorithm engineering; approximation and randomized methods; de-randomization; online, parallel, distributed, streaming, sublinear/sketching paradigms; and specialized data structures.
  • Computational Complexity: Complexity classes (e.g., P vs. NP and beyond); fine-grained and parameterized complexity; circuit, proof, and communication complexity; hardness of approximation; conditional lower bounds; and quantum/classical comparisons.
  • Computational Geometry and Topology: Geometric data structures; convexity and arrangements; hulls, Voronoi diagrams, triangulations; geometric optimization; mesh generation; computational topology and topological data analysis; and applications in graphics, robotics, GIS, CAD, and vision.
  • Categorical Methods and Applications: Category theory in computer science; categorical logic and type theory; categorical semantics for programming languages; monoidal categories, operads, lenses/optics, and compositional modeling; coalgebraic/algebraic methods; topos theory and categorical probability; diagrammatic reasoning; and interfaces with machine learning and quantum computing.
  • Interdisciplinary Applications: Theory-driven advances in cryptography, bioinformatics, network science, data science, and artificial intelligence.

Submissions will be accepted on a rolling basis until the deadline. All manuscripts will undergo rigorous peer review, and acceptance will be based on quality, originality, and relevance to this Special Issue.

Dr. Yiyang Jia
Dr. Emil Saucan
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

  • algorithms
  • optimization
  • categorical methods
  • computational complexity
  • computer science
  • data science
  • categorical logic
  • type theory

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.

Published Papers

This special issue is now open for submission.
Back to TopTop