Journal list Promote Sponsor
verified SJR 0,969 · Q1 • database Scopus / SJR & Web of Science indexed
Algorithmica
United States · Springer New York
workspace_premium Q1 — Applied Mathematics lock_open Open Access

Algorithmica

Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal for practical importance or techniques. Founded in 1986, it is the longest running journal dedicat...

ISSN: 0178-4617
Publisher: Springer New York
Category: Applied Mathematics
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Visit publisher site menu_book Guidelines NPD
schedule CountryOfPapers database fields
SJR Impact Factor trending_up
0,969 Q1
H-index 84
Acceptance rate pie_chart
27% Selective
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
2.290 € Open Access
Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,969

H-index

84

Docs (year)

125

Docs 3y

402

Total refs

4259

Cites 3y

609

Citable 3y

390

Cites/Doc 2y

1.22

Ref/Doc

34.07

Immediate OA

2290 €

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

An improved algorithm for finding the median distributively

View more

Time-Constrained Scheduling of Weighted Packets on Trees and Meshes

View more

Computing Approximate Shortest Paths on Convex Polytopes

View more

Computing a (1+e)-Approximate Geometric Minimum-Diameter Spanning Tree

View more

Computational geometry in a curved world

View more

Competitive On-Line Switching Policies

View more

Combinatorial and Experimental Methods for Approximate Point Pattern Matching

View more

Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness

View more

Augmenting Trees to Meet Biconnectivity and Diameter Constraints

View more

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

View more

Approximation algorithms for partitioning a rectangle with interior points

View more

Approximating Node Connectivity Problems via Set Covers

View more
SHOW MORE ARTICLES

An optimal algorithm for the boundary of a cell in a union of rays

View more

A cautious scheduler for multistep transactions

View more

An Experimental Study of Algorithms for Weighted Completion Time Scheduling

View more

Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns

View more

A Tutorial for Designing Flexible Geometric Algorithms

View more

A theory of rectangular dual graphs

View more

A new scheme for the deterministic simulation of PRAMs in VLSI

View more

A New Approximation Algorithm for Finding Heavy Planar Subgraphs

View more

A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation

View more

A minimum-area circuit forl-selection

View more

A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees

View more

A faster divide-and-conquer algorithm for constructing delaunay triangulations

View more

FAQs