Information Processing Letters

Aims & Scope

Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing.

This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology.

High quality experimental papers that address topics of sufficiently broad interest may also be considered.

Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions.

Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	0.6

SJR (SCImago Journal Rank)

Year	Value
2024	0.412

Quartile

Year	Value
2024	Q3

h-index

Year	Value
2024	86

---

---

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.

• The particle swarm optimization algorithm: convergence analysis and parameter selection

  Citation: 2097

  Authors: Ioan Cristian

• An algorithm for drawing general undirected graphs

  Citation: 1882

  Authors: Tomihisa, Satoru

• An efficient algorith for determining the convex hull of a finite planar set

  Citation: 1276

  Authors: R.L.

• Defining liveness

  Citation: 717

  Authors: Bowen, Fred B.

• The budgeted maximum coverage problem

  Citation: 703

  Authors: Samir, Anna, Joseph (Seffi)

• Occam's Razor

  Citation: 660

  Authors: Anselm, Andrzej, David, Manfred K.

• Constructing optimal binary decision trees is NP-complete

  Citation: 596

  Authors: Laurent, Ronald L.

• A linear-time algorithm for testing the truth of certain quantified boolean formulas

  Citation: 595

  Authors: Bengt, Michael F., Robert Endre

• Dynamic program slicing

  Citation: 574

  Authors: Bogdan, Janusz

• Optimal packing and covering in the plane are NP-complete

  Citation: 531

  Authors: Robert J., Michael S., Steven L.

---