verified SJR 0,661 · Q2 • database Scopus / SJR & Web of Science indexed

Netherlands · Elsevier B.V.

workspace_premium Q2 — Applied Mathematics lock_open Open Access Unclaimed

Discrete Applied Mathematics

Discrete Applied Mathematics is a journal indexed in SJR in Applied Mathematics and Discrete Mathematics and Combinatorics with an H index of 97. It has an SJR impact factor of 0,661 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,661.

Discrete Applied Mathematics focuses its scope in these topics and keywords: graphs, routing, vehicle, protein, product, minimum, meaning, folding, distant, bounded, ...

ISSN: 0166-218X

Editorial: Elsevier B.V.

Category: Applied Mathematics

Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD

schedule Datos CoP · solo campos en BD

SJR Impact Factor trending_up

0,661 Q2

H-index 97

Tasa de Aceptación pie_chart

25% Selectiva

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

NPD Open Access

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

0,661

H-index

Docs (year)

444

Docs 3y

1102

Total refs

10351

Cites 3y

1387

Citable 3y

1089

Cites/Doc 2y

1.3

Ref/Doc

23.31

Immediate OA

—

Embargoed OA

NPD

Non OA / Submission

0 €

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims

rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks

Weighted domination of cocomparability graphs

Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem

Fault-tolerant routings in double fixed-step networks

Facets of the k-partition polytope

Even and odd pairs in comparability and in P4-comparability graphs

Cycles in the cube-connected cycles graph

Complexity of searching an immobile hider in a graph

Combinatorics of RNA secondary structures

Coloring edges of self-complementary graphs

Classification by polynomial surfaces

Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach

SHOW MORE ARTICLES

Characterizations of some classes of strong sign nonsingular digraphs

2-Medians in trees with pos/neg weights

Block duplicate graphs and a hierarchy of chordal graphs

Bin-packing and matchings in threshold graphs

Approximation algorithms for the shortest total path length spanning tree problem

An upper bound for the size of the largest antichain in the poset of partitions of an integer

An approximation algorithm for scheduling on three dedicated machines

A new sufficient condition for a digraph to be Hamiltonian

A new Greedoid: the family of local maximum stable sets of a forest

A graph-theoretic result for a model of neural computation

A communication problem and directed triple systems

A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

FAQS

In Country of Papers you can find SJR impact factor and other metrics to help you decide on a Journal.