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-11-01 to 2025-11-01.)
ArticleCitations
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices22
Note on Two-Stage BP Maximization22
The Partial Diagnosability of Interconnection Networks Under the Strong Hybrid MM* Model16
Ambiguity Hierarchies for Weighted Tree Automata15
A Simple 2-Approximation for Maximum-Leaf Spanning Tree14
Restricted Existence and Approximation Algorithms for PMMS11
On the Shared Transportation Problem: Computational Hardness and Exact Approach8
The Structure Fault Tolerance of Alternating Group Networks7
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice7
Family Trees for Enumeration7
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm6
A new class of permutation quadrinomial over ????q2 with characteristic 56
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors5
Shortest Journeys in Directed Temporal Graphs5
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets5
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands5
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata4
Fault-Tolerant Maximal Local-Connectivity on Leaf-Sort Graphs4
On the Smallest Synchronizing Terms of Finite Tree Automata4
More Efficient Parallel Integer Sorting3
k-Planar Placement and Packing of Δ-Regular Caterpillars3
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions3
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees3
An Improvement for Error-Correcting Pairs of Some Special MDS Codes3
Weighted Linear Dynamic Logic3
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect2
Component Connectivity of Alternating Group Networks and Godan Graphs2
Routing Among Convex Polygonal Obstacles in the Plane2
The h-Component Diagnosability of Alternating Group Graphs2
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults2
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes2
Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance2
Ratio-Based Distortion and Network Distance2
Hamiltonian Paths Passing Through Linear Forests in Hypercubes with Faulty Edges2
Modelling Uncertainty in Architectures of Parametric Component-Based Systems2
Component Connectivity of 3-Ary n-Cubes2
Structural Synthesis of PLC Program for Real-Time Specification Patterns2
PSPACE-Completeness of Reversible Deterministic Systems2
Reversible Two-Party Computations2
Balanced-by-Construction Regular and ω-Regular Languages2
Results on the Gowers U2 Norm of Generalized Boolean Functions2
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid2
An Upper Bound for Edge Congestion and the Exact Wirelength of Embedding onto BC Graphs1
Author Index Volume 35 (2024)1
Online and Approximate Network Construction from Bounded Connectivity Constraints1
Author Index Volume 32 (2021)1
The Generalized 4-Connectivity of Bubble-Sort Graphs1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks1
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages1
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case1
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem1
Non-Submodular Maximization Subject to a Knapsack Constraint on the Integer Lattice1
Minimizing I/Os in Out-of-Core Task Tree Scheduling1
Locating Number of Biswapped Networks1
Tree-Based Generation of Restricted Graph Languages1
On the Super (Edge)-Connectivity of Generalized Johnson Graphs1
Eulerian and Hamiltonian Soft Semigraphs1
Efficiently Enumerating Spanning Trees of k-Trees1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs1
The Seeding and Bi-Criteria Algorithms for Fuzzy k-Median Problem1
Certainty in Formalising SMT-LIB for Strings in Isabelle1
Sweeping Input-Driven Pushdown Automata1
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas1
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems1
The h-Faulty-Block Connectivity of n-Dimensional Balanced Hypercube1
Image-Binary Automata1
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design1
Online Predictions for Online TSP on the Line1
Conditional Fractional Matching Preclusion Number of Graphs1
Interrelations Between Soft and Ordinary Sets: An Exploration of Soft Filters and Soft Nets1
Graph Algorithm Based Submodular Function for Sparsest Cut Problem1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio1
Volume Edited by Magnus Steinby1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs1
Computation of Geometric Color-Spanning Region for Line Segments1
A Generalized Pumping Lemma for Weighted Recognizable Languages1
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time1
The Coordination Mechanism for Scheduling Game with Deterioration Jobs and Uniform-Batch Machines1
0.090939998626709