International Journal of Foundations of Computer Science

Aims & Scope

The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science.

The theoretical and mathematical aspects covered include: - Algebraic theory of computing and formal systems - Algorithm and system implementation issues - Approximation, probabilistic, and randomized algorithms - Automata and formal languages - Automated deduction - Combinatorics and graph theory - Complexity theory - Computational biology and bioinformatics - Cryptography - Database theory - Data structures - Design and analysis of algorithms - DNA computing - Foundations of computer security - Foundations of high-performance computing

View Aims & Scope

---

Metrics & Ranking

Impact Factor

Year	Value
2025	0.6
2024	0.60

SJR (SCImago Journal Rank)

Year	Value
2024	0.245

Quartile

Year	Value
2024	Q3

h-index

Year	Value
2024	45

Journal Rank

Year	Value
2024	18802

Journal Citation Indicator

Year	Value
2024	147

---

---

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, 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.

• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS

  Citation: 243

  Authors: B. BUI, A., A.

• ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES

  Citation: 163

  Authors: MARTIN CHARLES, UDI

• Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems

  Citation: 126

  Authors: Edmund, Ansgar, Zhi, Bruce, Joël, Olaf, Michael

• DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS

  Citation: 114

  Authors: ERNESTO, MARTA MARGARIDA BRAZ, JOSÉ LUIS ESTEVES DOS

• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES

  Citation: 113

  Authors: MARKUS, MARTIN

• ON THE COMPLEXITY OF SOME COLORING GAMES

  Citation: 108

  Authors: HANS L.

• SYNTHESIZING STATE-BASED OBJECT SYSTEMS FROM LSC SPECIFICATIONS

  Citation: 108

  Authors: DAVID, HILLEL

• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION

  Citation: 102

  Authors: GIOVANNI, JEFFREY

• SPIKE TRAINS IN SPIKING NEURAL P SYSTEMS

  Citation: 101

  Authors: GHEORGHE, MARIO J., GRZEGORZ

• A TOUR OF REACTION SYSTEMS

  Citation: 96

  Authors: ROBERT, ANDRZEJ, MICHAEL, GRZEGORZ

---