Algorithmica

Aims & Scope

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 is an international journal which publishes original papers on algorithms that are either (i) theoretical papers addressing problems arising in practical areas or (ii) experimental papers that have general appeal because of their practical importance or techniques.

Papers are expected to make significant contributions, judged in terms of theoretical analysis, simulations, or algorithm behavior on data from applications.

The areas listed below are representative areas; papers in other areas are certainly welcome.

The fields of interest include 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.

It is expected that the areas covered by this journal will change as new technologies, methodologies and applications develop.

In addition to these regular papers, the journal features two special sections: Application Experience and Problems.

View Aims & Scope

---

Metrics & Ranking

SJR (SCImago Journal Rank)

Year	Value
2024	0.969

Quartile

Year	Value
2024	Q1

Journal Rank

Year	Value
2024	5086

Journal Citation Indicator

Year	Value
2024	609

Impact Factor

Year	Value
2024	0.90

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• On-line construction of suffix trees

  Citation: 995

  Authors: E.

• Approximation Algorithms for Connected Dominating Sets

  Citation: 855

  Authors: S., S.

• A sweepline algorithm for Voronoi diagrams

  Citation: 806

  Authors: Steven

• Retiming synchronous circuitry

  Citation: 708

  Authors: Charles E., James B.

• AnO(ND) difference algorithm and its variations

  Citation: 595

  Authors: Eugene W.

• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

  Citation: 530

  Authors: Vladimir J., Alexander A.

• Proportionate progress: A notion of fairness in resource allocation

  Citation: 494

  Authors: S. K., N. K., C. G., D. A.

• Constrained delaunay triangulations

  Citation: 487

  Authors: L.

• Competitive snoopy caching

  Citation: 406

  Authors: Anna R., Mark S., Larry, Daniel D.

• A New Proof for the Existence of Mutually Unbiased Bases

  Citation: 387

  Authors: Not Available, Not Available, Not Available, Not Available

---