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 LAGOS 2025 — XIII Latin American Algorithms, Graphs, and Optimization Symposium — Buenos Aires, Argentina
Día de Entrega: 2025-06-20

Following the tradition of the Latin American Algorithms, Graphs, and Optimization Symposia (LAGOS), a special issue of Discrete Applied Mathematics will be dedicated to LAGOS 2025, held in Buenos Aires, Argentina, from November 10–14, 2025 (http://lagos.mat.br/lagos2025/). All interested researchers are invited to contribute to this special issue.

Guest editors:

Luciano N. GrippoInstituto de Ciencias
Universidad Nacional de General Sarmiento, Argentina
lgrippo@campus.ungs.edu.ar

Martín D. Safe
Departamento de Matemática
Universidad Nacional del Sur, Argentina
msafe@uns.edu.ar

Manuscript submission information:

The topics should relate to the themes of the conference:

    Algorithms and Complexity: algorithms and computational complexity; approximation algorithms; randomized algorithms; parameterized complexity.
    Operations Research and Mathematical Programming: combinatorial optimization; integer programming; operations research; management science.
    Graph Theory: structural graph theory; graph algorithms; extremal graph theory; spectral graph theory; probabilistic graph theory.
    Combinatorial Geometry: discrete geometry; convex geometry; polyhedral combinatorics; computational geometry.
    Applications to Real-world Problems: mathematical programming; combinatorial optimization; continuous optimization; heuristics; metaheuristics.

Submissions of contributions not presented at the symposium are also welcome. If your contribution was presented at the symposium, the full version article should differ substantially from the extended abstract published in Procedia Computer Science (e.g., proofs of the results, further results, etc., can be added). All articles will be thoroughly refereed according to the high standards of Discrete Applied Mathematics.

The Guide for Authors can be found at: https://www.elsevier.com/journals/discrete-applied-mathematics/0166-218x/guide-for-authors.

Full papers must be submitted through the Elsevier Editorial Manager System (https://www.editorialmanager.com/dam/default2.aspx). Please see the Author Instructions on the Journal website 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 LAGOS 2025.

DEADLINE: The deadline for submissions is May 31, 2026.

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

We appreciate your consideration and look forward to receiving your contribution.

Special Issue on Graph Theory and Combinatorial Optimizations
Día de Entrega: 2025-06-30

The Guest Editors are editing the following special issue in the journal Discrete Applied Mathematics (ISSN 2075-1680), focusing on Graph Theory and Combinatorial Optimizations. This special issue is dedicated to Professor Fuji Zhang on the occasion of his 88th birthday.

Guest editors:

Dr. Xueliang Li, Center for Combinatorics, Nankai University, Tianjin 300071, China;
Dr. Jixiang Meng, College of Mathematics and System Science, Xinjiang University, Urumchi, Xinjiang 830046, China; 
Dr. Heping Zhang,  School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu 730000, China;
Dr. Jinjiang Yuan, School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, China;
Dr. Xian’an Jin, School of Mathematical Sciences, Xiamen University, Xiamen, Fujian 361005, China

Manuscript submission information:

The topics focus on but are not limited to the following: algebraic graph theory, applied graph theory, spectral graph theory, chemical graph theory, structural graph theory, algorithmic graph theory, combinatorial optimizations, extremal graph theory, random graph theory, topological graph theory, etc.

We appreciate your consideration, and sincerely hope you will participate.

Guide for authors can be found at:https://www.elsevier.com/journals/discrete-applied-mathematics/0166-218x/guide-for authors

Full papers must be submitted through the Elsevier Editorial Manager (EM) system (https://www.editorialmanager.com/dam/default1.aspx). When submitting your paper, be sure to specify that the paper is a contribution for the special issue by selecting the article type Graph Theory and Combinatorial Optimizations. Please see the Author Instructions on the site if you have not yet submitted a paper through EM.

Deadline for Manuscript Submissions: 30 June 2025

Special Issue on WEPA 2024 (6th Workshop on Enumeration Problems and Applications)
Día de Entrega: 2026-05-31

WEPA (Workshop on Enumeration Problems and Applications) is an international forum for researchers in the area of design, analysis, experimental evaluation, and engineering of algorithms for enumeration problems. The objective of the workshop is to foster collaboration, gathering researchers to present recent results and explore future directions for enumeration algorithms with applications in biology, data mining, logic, databases, and more. This special issue collects papers related to these themes, but not restricted to contributions presented at the workshop.

Guest editors:

Dr. Giulia Punzi
University of Pisa, Pisa, Italy
E-mail: giulia.punzi@unipi.it 
Areas of Expertise: Combinatorial algorithms, Enumeration, Graph algorithms

Prof. Nadia Creignou
Aix-Marseille Université, Marseille, France
E-mail: nadia.creignou@lis-lab.fr 
Areas of Expertise: Complexity, Enumeration, Logic

Special issue information:

Submissions should relate to the themes of WEPA, including but not restricted to:

    Combinatorial Enumeration and Counting
    Input-sensitive and Output-sensitive Algorithms
    Complexity of Enumeration Problems
    Approximate Enumeration and Counting
    Applications in Biology, Data Mining, Logic, and Databases

Manuscript submission information:

Guide for authors can be found at: 
Guide for authors - Discrete Applied Mathematics - ISSN 0166-218X | ScienceDirect.com by Elsevier

Full papers must be submitted through the Editorial Manager®. Please see the Author Instructions on the site 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 WEPA 2024.

The submission deadline is September 26, 2025

The guest editors will make every effort for a timely processing of the submissions. Accepted papers will be published online individually, before print publication.

We appreciate your consideration and look forward to receiving your contribution.

Keywords:

(Enumeration) AND ((algorithms) OR (complexity) OR (combinatorics) OR (approximation) OR (logic) OR (database) OR (data mining) OR (bioinformatics))