ISSN: 0166-218X

Journal Home

Journal Guideline

Discrete Applied Mathematics Q2 Unclaimed

Elsevier Netherlands

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

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

Discrete Applied Mathematics focuses its scope in these topics and keywords: graphs, number, interesting, kidney, latticesa, lexicographic, matheuristic, meaning, mechanism, minimum, ...

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Applied Mathematics (Q2) Discrete Mathematics and Combinatorics (Q2)

Price

- €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,758

SJR Impact factor

92

H Index

413

Total Docs (Last Year)

1258

Total Docs (3 years)

9178

Total Refs

1568

Total Cites (3 years)

1236

Citable Docs (3 years)

1.18

Cites/Doc (2 years)

22.22

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Numerical Algorithms Q2
Communications in Applied Mathematics and Computational Science Q2
Advances in Computational Mathematics Q2
SIAM Journal on Financial Mathematics Q2
Journal of Computational and Applied Mathematics Q2

Compare this journals

Aims and Scope

Best articles by citations

Vertex-symmetric digraphs with small diameter

On the number of Abelian square-free words on four letters

On paths avoiding forbidden pairs of vertices in a graph

Lower bounds for the job-shop scheduling problem on multi-purpose machines

The capacity of monotonic functions

Bin-packing and matchings in threshold graphs

A graph-theoretic result for a model of neural computation

Block duplicate graphs and a hierarchy of chordal graphs

Outpaths in semicomplete multipartite digraphs

Total domination number of grid graphs

Interference patterns in bijective colorings of 2-regular graphs

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

SHOW MORE ARTICLES

Representation theory and invariant neural networks

Minimizing broadcast costs under edge reductions in tree networks

Monotonicity of single-seat preferential election rules

Coloring edges of self-complementary graphs

Generation of molecular graphs based on flexible utilization of the available structural information

On the channel capacity of read/write isolated memory

Combinatorics of RNA secondary structures

Characterizations of some classes of strong sign nonsingular digraphs

On the primer selection problem in polymerase chain reaction experiments

A 223 superstring approximation algorithm

List schedules for cyclic scheduling

Classification by polynomial surfaces