Journal list Promote Sponsor
Journal of Discrete Algorithms
Netherlands · Elsevier
workspace_premium Q3 — Computational Theory and Mathematics lock_open Open Access

Journal of Discrete Algorithms

Journal of Discrete Algorithms is a journal indexed in SJR in Computational Theory and Mathematics and Discrete Mathematics and Combinatorics with an H index of 36. It has a best quartile of Q3. It is published in English.

ISSN: 1570-8667
Publisher: Elsevier
Category: Computational Theory and Mathematics
open_in_new Portal NPD menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
NPD Q3
H-index 36
Acceptance rate pie_chart
34%
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
NPD Open Access
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

SJR Impact

—

H-index

36

Docs (year)

0

Docs 3y

31

Total refs

0

Cites 3y

23

Citable 3y

29

Cites/Doc 2y

0

Ref/Doc

0.0

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.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Approximating the k-traveling repairman problem with repairtimes

View more

Update games and update networks

View more

Cut problems in graphs with a budget constraint

View more

Cooperative computing with fragmentable and mergeable groups

View more

Consensus in Byzantine asynchronous systems

View more

Computing upward topological book embeddings of upward planar digraphs

View more

Completely connected clustered graphs

View more

Compact directed acyclic word graphs for a sliding window

View more

Bottom-k document retrieval

View more

Bothway embedding of circulant network into grid

View more

Bandwidth of bipartite permutation graphs in polynomial time

View more

Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems

View more
SHOW MORE ARTICLES

Approximation algorithms for Hamming clustering problems

View more

2004 Symposium on String Processing and Information Retrieval

View more

Applying an edit distance to the matching of tree ring sequences in dendrochronology

View more

An approximation algorithm for sorting by reversals and transpositions

View more

Algorithms for shortest paths and d-cycle problems

View more

Algorithms for finding distance-edge-colorings of graphs

View more

Algorithms for extracting motifs from biological weighted sequences

View more

A unifying look at the Apostolico-Giancarlo string-matching algorithm

View more

A PTAS for the sparsest 2-spanner of 4-connected planar triangulations

View more

A note on the complexity of minimum dominating set

View more

A note on data structures for maintaining bipartitions

View more

A dynamic edit distance table

View more

FAQs