International Journal of Foundations of Computer Science

Papers
(The TQCC of International Journal of Foundations of Computer Science is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-04-01 to 2025-04-01.)
ArticleCitations
The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph21
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs15
A Time to Cast Away Stones: On a Family of Pebble Automata13
Paired Domination Integrity of Graphs13
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem10
Two Effective Properties of ω-Rational Functions10
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words7
Minimizing I/Os in Out-of-Core Task Tree Scheduling7
Preface6
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid5
State Complexity of Boolean Operations on Graph-Walking Automata5
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest5
An Inequality for the Number of Periods in a Word5
On the Boolean Closure of Deterministic Top-Down Tree Automata4
Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization4
In Memoriam: Magnus Steinby (1941–2021)4
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices3
Finite Approximations and Similarity of Languages3
Restricted Existence and Approximation Algorithms for PMMS3
A Simple 2-Approximation for Maximum-Leaf Spanning Tree3
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas3
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms3
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) — Preface3
Exact Affine Counter Automata3
Ambiguity Hierarchies for Weighted Tree Automata2
Preface2
Language Acceptors with a Pushdown: Characterizations and Complexity2
The Overlap Gap Between Left-Infinite and Right-Infinite Words2
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems2
Parametric Algorithm to Find the Largest Empty Rectangle from a Set of Line Segments2
Latvian Quantum Finite State Automata for Unary Languages2
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China2
A Generalized Pumping Lemma for Weighted Recognizable Languages2
Compositions with Constant Weighted Extended Tree Transducers2
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case1
Family Trees for Enumeration1
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults1
A Pseudo-Random Generator Whose Output is a Normal Sequence1
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees1
Algorithm Design for Asset Trading Under Multiple Factors1
Binary Coded Unary Regular Languages1
Robust Subgroup Multisignature with One-Time Public Keys in Order1
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs1
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover1
A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm1
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs1
Compressed Structures for Partial Derivative Automata Constructions1
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification1
Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq1
On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts1
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations1
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata1
Conversions Between Six Models of Finite Automata1
Simplifications of Uniform Expressions Specified by Systems1
Reachability Analysis of Self Modifying Code1
Inverse Spectral Problems for a Special Acyclic Matrix1
Special Aquatic Products Supply Chain Coordination Considering Bilateral Green Input in the Context of High-Quality Development1
On the Shared Transportation Problem: Computational Hardness and Exact Approach1
Rainbow Domination in Cartesian Product of Paths and Cycles1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio1
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings1
An Improved Approximation Algorithm for the Capacitated Correlation Clustering Problem1
Generalizations of Checking Stack Automata: Characterizations and Hierarchies1
Characterization of Isometric Words based on Swap and Mismatch Distance1
An Improved Helmet Detection Algorithm Based on YOLO V41
Language Classes of Extended Distributed Reaction Systems1
Node and Link Vulnerability in Complete Multipartite Networks1
Descriptional Complexity of Semi-Simple Splicing Systems1
Tissue P Systems with Vesicles of Multisets1
The Generalized 3-Connectivity of Exchanged Crossed Cube1
Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages1
A Note on Squares in Binary Words1
0.15413212776184