The Journal of Combinatorial Algorithms, Informatics and Computational Sciences

The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.

Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.

Special Issue on Algorithms in Discrete Mathematics
截稿日期: 2024-12-31

Discrete Mathematics is the study of mathematical structures of countable sets, and often finite sets. It has connection to theoretical computer science in a number of areas such as graph theory, mathematical logic, automata theory, formal language and computational geometry.

Guest editors:

Professor Yaping Mao, School of Mathematics and Statistics, Qinghai Normal University, Xining, 81008, China
Dr. Eddie Cheng, Department of Mathematics and Statistics, Oakland University, Rochester, Michigan, USA
Dr. Florent Foucaud, LIMOS and IUT Clermont Auvergne, Universite Clermont Auvergne, France
Chair Professor Sun-Yuan Hsieh, Department of Computer Science & Information Engineering, National Cheng Kung University, Tainan
Associate Professor Ling-Ju Hung, Department of Creative Technologies and Product Design, National Taipei University of Business, Taoyuan City

Manuscript submission information:

A typical problem in discrete mathematics is to decide whether elements of a finite set have a certain mathematical structure. Given the set is finite, theoretically, the answer can be found in finite time by enumerating and inspecting all possibilities. However, this is infeasible in practice, and as such, one should look for efficient algorithms to solve such problems. Professor Ralf Klasing has made many important contributions in this area, and this special issue is dedicated to his works at his 60th birthday.

Full papers must be submitted through the Elsevier Editorial Manager®. Please see the Author Instructions on Discrete Applied Mathematics | Journal | ScienceDirect.com by Elsevier if you have not yet submitted a paper through
this web based system. When submitting your paper, be sure to specify that the paper is a contribution for the special issue by selecting the article type VSI:DAM_Discrete Algorithms.

DEADLINE: The deadline for submissions is December 31, 2024.

Accepted papers will be published online individually, before print publication.

We are looking forward to receiving your contribution.

Keywords:

Design and analysis of algorithms, distributed algorithms, approximation algorithms, algorithms in interconnection networks, algorithms on temporal graphs, combinatorial and graph algorithms