ISSN: 0178-4617

Journal Guideline

Algorithmica Q1 Unclaimed

Springer New York United States

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

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 dedicated to the study of algorithms, and continues to be a leading publication in the field. The development of algorithms is an integral part of computer science. The increasing complexity and scope of computer applications makes the design of efficient algorithms essential. Algorithmica covers algorithms in applied areas such as: VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools, as well as algorithms in fundamental areas such as sorting, searching, data structures, computational geometry, and linear programming. In addition, the journal features two special sections: Application Experience, presenting findings obtained from applications of theoretical results to practical situations, and Problems, offering short papers presenting problems on selected topics of computer science. Offers theoretical papers on that address practical problems, and experimental papers demonstrating practical importance or technique Topics include VLSI, distributed computing, parallel processing, automated design, robotics, graphics, data base design, software tools and more Includes special sections on Application Experience, and open Problems It has an SJR impact factor of 0,905.

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Applied Mathematics (Q1) Computer Science (miscellaneous) (Q1) Computer Science Applications (Q2)

Price

2290 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,905

SJR Impact factor

81

H Index

153

Total Docs (Last Year)

404

Total Docs (3 years)

5091

Total Refs

601

Total Cites (3 years)

392

Citable Docs (3 years)

1.49

Cites/Doc (2 years)

33.27

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

Journal of the American Mathematical Society Q1
IEEE Transactions on Pattern Analysis and Machine Intelligence Q1
IEEE Transactions on Wireless Communications Q1
Molecular Systems Biology Q1
IEEE Signal Processing Magazine Q1

Compare this journals

Aims and Scope

Best articles by citations

Erratum to "Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes"

Delay Optimization in Quorum Consensus

The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures

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

Robust Algorithms for Preemptive Scheduling

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

Disk Embeddings of Planar Graphs

A New Approximation Algorithm for Finding Heavy Planar Subgraphs

Minimize the Maximum Duty in Multi-interface Networks

On the number of Eulerian orientations of a graph

Linear Bidirectional On-Line Construction of Affix Trees

Computing Approximate Shortest Paths on Convex Polytopes

SHOW MORE ARTICLES

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

Polygonal Representations of Digital Sets

A Tutorial for Designing Flexible Geometric Algorithms

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy

Minimizing channel density in standard cell layout

Internal and external algorithms for the points-in-regions problem - the inside join of geo-relational algebra

Dynamic fractional cascading

Some chain visibility problems in a simple polygon

Reachability Oracles for Directed Transmission Graphs

Temporary Tasks Assignment Resolved

Fault Identification in System-Level Diagnosis: a Logic-Based Framework and an O(n 2sqrt{t}/{\log n}) Algorithm

Foreword