Discrete Applied Mathematics

Aims & Scope

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.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	1.1

SJR (SCImago Journal Rank)

Year	Value
2024	0.661

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	97

Journal Rank

Year	Value
2024	8671

Journal Citation Indicator

Year	Value
2024	1387

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Scheduling subject to resource constraints: classification and complexity

  Citation: 1075

  Authors: J., J.K., A.H.G.Rinnooy

• Resolvability in graphs and the metric dimension of a graph

  Citation: 661

  Authors: Gary, Linda, Mark A., Ortrud R.

• Landmarks in graphs

  Citation: 594

  Authors: Samir, Balaji, Azriel

• Complement reducible graphs

  Citation: 587

  Authors: D.G., H., L.Stewart

• Pairings for cryptographers

  Citation: 532

  Authors: Steven D., Kenneth G., Nigel P.

• Pseudo-Boolean optimization

  Citation: 518

  Authors: Endre, Peter L.

• Reverse search for enumeration

  Citation: 504

  Authors: David, Komei

• Signed graphs

  Citation: 500

  Authors: Thomas

• A survey of very large-scale neighborhood search techniques

  Citation: 461

  Authors: Ravindra K., Özlem, James B., Abraham P.

• Upper bounds to the clique width of graphs

  Citation: 442

  Authors: Bruno, Stephan

---