mathematics-logo

Journal Browser

Journal Browser

Advances in Algorithms, Data Structures, and Computing

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E1: Mathematics and Computer Science".

Deadline for manuscript submissions: closed (30 September 2025) | Viewed by 293

Special Issue Editors


E-Mail Website
Guest Editor
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China
Interests: cloud computing; edge computing; reinforcement learning; deep learning; mathematics modeling

E-Mail Website
Guest Editor
College of Computer Science and Technology, China University of Petroleum (East China), Qingdao 266580, China
Interests: bioinformatics; large-scale graph computation; theory and applications of DNA computational models; complex gene logic networks; gene regulatory networks

Special Issue Information

Dear Colleagues,

Advances in algorithms, data structures, and computing focus on recent advancements in mathematical computing and algorithms, highlighting innovative approaches and solutions that contribute to the efficiency, scalability, and applicability of algorithms as well as data structures in complex computational environments. The rapid evolution of computational techniques has enabled more precise and powerful tools for solving problems across diverse fields, including optimization, numerical analysis, machine learning, and data science. We invite submissions that explore novel algorithms, data structures, and computational models, as well as improvements to existing methods, especially those that enhance performance in mathematical and computational tasks. Topics of interest include, but are not limited to, algorithmic design and analysis, parallel and distributed computing, computational complexity, graph algorithms, numerical methods, cryptography, and optimization techniques. The aim of this Special Issue is to provide a platform for researchers and practitioners to present cutting-edge developments in the mathematical foundations of computing, offering new perspectives and methodologies with which to tackle the challenges of modern computational science.

Prof. Dr. Shanchen Pang
Prof. Dr. Shudong Wang
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 250 words) can be sent to the Editorial Office for assessment.

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. Mathematics is an international peer-reviewed open access semimonthly 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 2600 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

  • mathematical modeling
  • deep learning
  • cloud computing
  • edge computing
  • bioinformatics
  • theory and applications of DNA computational models
  • reinforcement learning

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 (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

18 pages, 890 KB  
Article
Bidirectional Algorithms for Polygon Triangulations and (m + 2)-Angulations via Fuss–Catalan Numbers
by Aybeyan Selim, Muzafer Saracevic, Lazar Stosic, Omer Aydin and Mahir Zajmović
Mathematics 2025, 13(23), 3837; https://doi.org/10.3390/math13233837 (registering DOI) - 30 Nov 2025
Abstract
Polygon triangulations and their generalizations to (m + 2)—angulations are fundamental in combinatorics and computational geometry. This paper presents a unified linear-time framework that establishes explicit bijections between m—Dyck words, planted (m + 1)—ary trees, and (m + 2)—angulations [...] Read more.
Polygon triangulations and their generalizations to (m + 2)—angulations are fundamental in combinatorics and computational geometry. This paper presents a unified linear-time framework that establishes explicit bijections between m—Dyck words, planted (m + 1)—ary trees, and (m + 2)—angulations of convex polygons. We introduce stack-based and tree-based algorithms that enable reversible conversion between symbolic and geometric representations, prove their correctness and optimal complexity, and demonstrate their scalability through extensive experiments. The approach reveals a hierarchical decomposition encoded by Fuss–Catalan numbers, providing a compact and uniform representation for triangulations, quadrangulations, pentangulations, and higher-arity angulations. Experimental comparisons show clear advantages over rotation-based methods in both runtime and memory usage. The framework offers a general combinatorial foundation that supports efficient enumeration, compressed representation, and extensions to higher-dimensional or non-convex settings. Full article
(This article belongs to the Special Issue Advances in Algorithms, Data Structures, and Computing)
Back to TopTop