Información de la Revista

Discrete Applied Mathematics (DAM)

Por favor Iniciar sesión para ver el sitio web de la revista
Cuenta gratuita: consulta los sitios oficiales, sigue las fechas límite y recibe recordatorios por correo.
Iniciar sesión Registrarse

Factor de Impacto:
1.1
Editor:
Elsevier
ISSN:
0166-218X
Vistas:
31780
Seguidores:
3

Solicitud de Artículos

Discrete Applied Mathematics (DAM) is an academic journal published by Elsevier. (ISSN 0166-218X, impact factor 1.1, CCF C).

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. This journal has an Open Archive. All published items, including research articles, have unrestricted access and will remain permanently free to read and download 48 months after publication. All papers in the Archive are subject to Elsevier's user license.
Última actualización por Dou Sun el

Special Issues

Special Issue on Combinatorial Foundations of Discrete Systems Día de Entrega: 2026-10-31 Gyula O.H. Katona—a preeminent scholar in combinatorics, theory of databases, search theory and cryptology—has dedicated his career to uncovering the combinatorial principles that govern discrete systems. His work on finite set structures, extremal results for graphs and hypergraphs and connections to probability theory and measure theory, and discrete structural properties has laid the foundational framework for analyzing discrete systems across mathematics and its applied branches, shaping how researchers model, optimize, and solve problems in discrete domains. A central focus of Katona’s research has been exploring the structure and extremal behavior of combinatorial systems—problems that lie at the core of discrete mathematics, from characterizing intersecting set families to deriving sharp bounds for subset sums and cyclic ordered sets. Katona’s primary research focus lies in extremal set theory, where he is best known for two landmark results: the Shadow Theorem (also referred to as the Kruskal-Katona Theorem) and his cyclic permutation-based proof of the Erdős-Ko-Rado Theorem. The latter proof is notably included in Proofs from The Book—a collection of elegant mathematical proofs compiled by Martin Aigner and Günter M. Ziegler under the guidance of Paul Erdős. To celebrate his 85th birthday and honor his profound impact on the field, this special issue focuses on the combinatorial foundations of discrete systems—rooted in Katona’s lifelong research. Guest editors: Dr. Yaping Mao (Lead Guest Editor), [email protected] Dr. Endre Boros, Rutgers Business School-New Brunwick, [email protected] Dr. Péter Frankl, [email protected] Dr. Zoltán Füredi, [email protected] Dr. Ralf Klasing, University of Bordeaux, [email protected] Special issue information: The topics relevant to this special issue align with the theme combinatorial foundations of discrete systems, including but not limited to: Extremal properties of intersecting, union-closed, and intersecting-union families of sets Combinatorial inequalities (e.g., subset sum, entropy-based, and cyclic order inequalities) Extremal combinatorial problems (e.g., Turán problem, matching problem, combinatorial number and domination number) Cyclic ordered sets and their combinatorial structures Combinatorial designs (e.g., block designs, pairwise balanced designs) and their extremal variants Applications of extremal set theory to coding theory, cryptography, and data compression Search Theory (e.g., information and communication, search with lies, adaptive search) Subset lattice properties and their connections to poset (partially ordered set) theory Combinatorial optimization problems rooted in extremal set theory (e.g., set cover, hitting set)​ Discrete geometry and its interactions with extremal set theory (e.g., convex hulls, point configurations)​ Historical and survey contributions celebrating Katona’s work and its impact on discrete mathematics Relational databases and closure operations Random structures, algorithms and computation Manuscript submission information: Full papers must be submitted through the Elsevier 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 Combinatorial Foundations of Discrete Systems. Important dates: Submission deadline: October 31, 2026 Keywords: Extremal Set Theory; Combinatorial Structures; Combinatorial Designs; Combinatorial Inequalities; Combinatorial Optimization; Discrete Geometry; Random Structures; Poset Theory; Statistical Planning & Theory; Probability & Measure Theory https://www.sciencedirect.com/special-issue/331169/combinatorial-foundations-of-discrete-systems
Última actualización por Dou Sun el
Special Issue on Siberian International Conference on Graph Theory and Combinatorics Día de Entrega: 2027-03-31 We are preparing a special issue of Discrete Applied Mathematics dedicated to the Siberian International Conference on Graph Theory and Combinatorics (SCGC-2026), that will be held in Novosibersk, Russia from August 11–14, 2026. This conference aims to provide a forum for scientists to present recent results, exchange ideas, establish scientific connections, and explore directions for future research, in order to promote research in the field of graph theory and combinatorics. For more information on the conference, see https://mca.nsu.ru/scgc-2026/. We invite submissions of high-quality original research papers that showcase significant contributions to all topics related to graph theory and combinatorics. Guest editors: Professor Dr. Xueliang Li, Center for Combinatorics, Nankai University, China. Dr. Hamidreza Golmohammadi, Sobolev Institute of Mathematics, Novosibirsk State University, Russia. Professor Dr. Jianfeng Wang, School of Mathematics and Statistics, Shandong University of Technology, China. Special issue information: All interested researchers are invited to contribute to this special issue. The topics should relate to the themes of the conference. While the focus of the special issue will be on the works presented at the conference, submissions of contributions not presented at the workshop are also welcome. Contributions arising from papers given at the conference should be substantially extended, and should cite the conference paper where appropriate. Manuscript submission information: Full papers must be submitted through the Elsevier 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 VSI: SCGC-2026 Manuscript submission information: Submissions open: May 1, 2026 Submissions close: March 31, 2027 https://www.sciencedirect.com/special-issue/331751/siberian-international-conference-on-graph-theory-and-combinatorics
Última actualización por Dou Sun el

Las personas que vieron esto también vieron

CCFNombre CompletoFactor de ImpactoEditorISSN
AIEEE Transactions on Computers3.8IEEE0018-9340
BTheoretical Computer Science1.0Elsevier0304-3975
BInformation Sciences6.0Elsevier0020-0255
BJournal of Web Semantics3.1Elsevier1570-8268
CIEEE Transactions on Computational Social Systems4.9IEEE2373-7476

Revistas Relacionadas

CCFNombre CompletoFactor de ImpactoEditorISSN
Discrete Mathematics0.9Elsevier0012-365X
Applied Mathematics and Computation3.4Elsevier0096-3003
Journal of Computational and Applied Mathematics2.6Elsevier0377-0427
Discrete Optimization1.6Elsevier1572-5286
Journal of Discrete AlgorithmsElsevier1570-8667
Applied Numerical Mathematics2.4Elsevier0168-9274
Applied Mathematics & Optimization1.7Springer0095-4616
Applied Computing and InformaticsElsevier2210-8327
Applied Soft Computing6.6Elsevier1568-4946
Mathematics and Computers in Simulation4.4Elsevier0378-4754

Conferencias Relacionadas

CCFICOREAbreviaciónNombre CompletoEntregaNotificaciónFecha de conferencia
CALDAMInternational Conference on Algorithms and Discrete Applied Mathematics2018-10-012018-11-112019-02-14
CDMSIAM Conference on Discrete Mathematics2025-12-222026-06-22
CICCInternational Conference on Communications2026-10-022027-01-152027-05-30
CBIJCNNInternational Joint Conference on Neural Networks2027-01-312027-03-152027-06-14
CBTrustComInternational Conference on Trust, Security and Privacy in Computing and Communications2025-08-012025-10-012025-11-14
CBICONIPInternational Conference on Neural Information Processing2026-05-102026-07-152026-11-23
CCHPCCInternational Conference on High Performance Computing and Communications2026-07-152026-09-102026-10-29
CAGECCOGenetic and Evolutionary Computation Conference2026-01-192026-03-202026-07-13
CBGlobecomIEEE Global Communications Conference2026-04-012026-08-012026-12-07
CBICPRInternational Conference on Pattern Recognition2026-01-102026-03-312026-08-17

Comentarios 0

Aún no hay comentarios.

Por favor Iniciar sesión para publicar un comentario