International Journal of Foundations of Computer Science

Papers
(The median citation count of International Journal of Foundations of Computer Science is 0. 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 2022-05-01 to 2026-05-01.)
ArticleCitations
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices25
The Partial Diagnosability of Interconnection Networks Under the Strong Hybrid MM* Model23
Note on Two-Stage BP Maximization16
Ambiguity Hierarchies for Weighted Tree Automata16
A Simple 2-Approximation for Maximum-Leaf Spanning Tree15
Restricted Existence and Approximation Algorithms for PMMS11
Family Trees for Enumeration10
On the Shared Transportation Problem: Computational Hardness and Exact Approach10
The Structure Fault Tolerance of Alternating Group Networks8
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice7
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors6
A new class of permutation quadrinomial over ????q2 with characteristic 56
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets6
Fault-Tolerant Maximal Local-Connectivity on Leaf-Sort Graphs6
Shortest Journeys in Directed Temporal Graphs6
An Approximation Algorithm for Generalized Connectivity Problem on Planar Graphs5
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands5
Weighted Linear Dynamic Logic4
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm4
Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance4
k-Planar Placement and Packing of Δ-Regular Caterpillars4
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions4
Component Connectivity of Alternating Group Networks and Godan Graphs3
On the Smallest Synchronizing Terms of Finite Tree Automata3
Ratio-Based Distortion and Network Distance3
An Improvement for Error-Correcting Pairs of Some Special MDS Codes3
Reversible Two-Party Computations3
PSPACE-Completeness of Reversible Deterministic Systems3
Balanced-by-Construction Regular and ω-Regular Languages3
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems2
Sweeping Input-Driven Pushdown Automata2
Results on the Gowers U2 Norm of Generalized Boolean Functions2
Structural Synthesis of PLC Program for Real-Time Specification Patterns2
The h-Component Diagnosability of Alternating Group Graphs2
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes2
Non-Submodular Maximization Subject to a Knapsack Constraint on the Integer Lattice2
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem2
Routing Among Convex Polygonal Obstacles in the Plane2
Modelling Uncertainty in Architectures of Parametric Component-Based Systems2
Component Connectivity of 3-Ary n-Cubes2
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults2
A Generalized Pumping Lemma for Weighted Recognizable Languages2
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid2
Hamiltonian Paths Passing Through Linear Forests in Hypercubes with Faulty Edges2
On Open-End Bin Packing Games2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect2
On Deterministic Finite Automata Equipped with Partial Orders1
Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity1
Computing a 3-Role Assignment is Polynomial-Time Solvable on Complementary Prisms1
Author Index Volume 35 (2024)1
Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages1
Graph Algorithm Based Submodular Function for Sparsest Cut Problem1
Online and Approximate Network Construction from Bounded Connectivity Constraints1
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules1
Certainty in Formalising SMT-LIB for Strings in Isabelle1
Locating Number of Biswapped Networks1
Embedded Edge Connectivity of Alternating Group Networks1
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design1
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs1
Minimizing I/Os in Out-of-Core Task Tree Scheduling1
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case1
Approximation Algorithms for Partial Vertex Covers in Trees1
Almost Perfect c-Nonlinear Permutations with Trace Functions over ????2n1
On Two Modifications of the McEliece PKE and the CFS Signature Scheme1
On the Power of Star-Controlled Insertion-Deletion Systems1
Online Predictions for Online TSP on the Line1
The Differential Properties of Certain Permutation Polynomials over Finite Fields1
The Coordination Mechanism for Scheduling Game with Deterioration Jobs and Uniform-Batch Machines1
Volume Edited by Magnus Steinby1
On the Super (Edge)-Connectivity of Generalized Johnson Graphs1
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time1
The h -Faulty-Block Connectivity of n -Dimensional Balanced Hypercube1
Dynamic Reconfiguration of Networks Based on Visual Attention Mechanisms1
NC-ENCE Graph Grammars: Properties and Application to Game Design1
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio1
Computation of Geometric Color-Spanning Region for Line Segments1
Tree-Based Generation of Restricted Graph Languages1
The Hardest LL(k) Language1
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case1
Relating Various Types of Distributed Reaction Systems1
Subnetworks Reliability Analysis of Complete Transposition Networks1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks1
Efficiently Enumerating Spanning Trees of k -Trees1
An Upper Bound for Edge Congestion and the Exact Wirelength of Embedding onto BC Graphs1
The Seeding and Bi-Criteria Algorithms for Fuzzy k-Median Problem1
Conditional Fractional Matching Preclusion Number of Graphs1
Eulerian and Hamiltonian Soft Semigraphs1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs1
Improved Approximation Algorithms for Bin Packing with Conflicts1
The Generalized 4-Connectivity of Bubble-Sort Graphs1
Preface1
Interrelations Between Soft and Ordinary Sets: An Exploration of Soft Filters and Soft Nets1
Image-Binary Automata1
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect1
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata0
Treasure Hunt in Euclidean Plane: Cost vs. Pebble Trade-Off0
Integer Codes Correcting Single Errors and Detecting Double Adjacent Errors0
Metric Properties of Non-Commuting Graph Associated to Two Groups0
Average State Complexity of Partial Derivative Automata for Synchronised Shuffles0
Accountable Authority Identity-Based Broadcast Encryption for IoT Devices0
Language Quotients Revisited0
Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks0
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited0
Securing Smart City Services in Cyber-Physical Systems Using the Computation Annealed Selection Process0
Asynchronous Gathering of Finite Memory Robots on a Circle under Limited Visibility0
Fault-Tolerant Communication Mechanisms in Data Center Network of HS-DCell0
Characterizations of M -Equivalence and Weak M -Relation0
Single-Machine Lot Scheduling with Order Rejection0
The h-Extra r-Component Connectivity of Half Hypercube0
Some Special Perfect c-Nonlinear Functions on ℤn0
Special Aquatic Products Supply Chain Coordination Considering Bilateral Green Input in the Context of High-Quality Development0
k-Domination Connectivity in Graphs0
A Bicriteria Approximation Algorithm for the Min-Max Rural Postmen Cover Problem0
A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm0
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata0
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers0
Laplacian Spectrum of Some Special Graphs0
Single Machine Scheduling with a Restricted Weight-Modifying Activity to Minimize the Weighted Makespan0
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs0
New Bounds for Some Topological Indices0
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs0
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults0
Fault Tolerability Analysis of Hypercubes Based on g-Extra H-Structure Fault Pattern0
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees0
Polynomial Representation of General Partial Boolean Functions with a Single Quantum Query0
Parameterized Complexity Classes Defined by Threshold Circuits and Their Connection with Sorting Networks0
On The 4-Adic Complexity of Quaternary Cyclotomic Sequences of Order 4 with Even Length0
Exact and Heuristic Algorithms for Single-Machine Scheduling with Total Late Work and Job Rejection0
Fuzzy Clustering-Based Financial Data Mining System Analysis and Design0
Robust Subgroup Multisignature with One-Time Public Keys in Order0
The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings0
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings0
Inverse Spectral Problems for a Special Acyclic Matrix0
Recursion Theorems in Numbered Sets0
Latvian Quantum Finite State Automata for Unary Languages0
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China0
An Improved Helmet Detection Algorithm Based on YOLO V40
A Note on Automatic Baire Property0
Improving the Quality of Service (QoS) and Resource Allocation in Vehicular Platoon Using Meta-Heuristic Optimization Algorithm0
Enhancing Reliability of Folded Petersen Networks Based on Edge Partition0
Characterization of Isometric Words based on Swap and Mismatch Distance0
Author Index Volume 36 (2025)0
Analysis of Vulnerability of Some Transformation Networks0
Additional Closeness of Cycle Graphs0
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.0
A Proximal Gradient Algorithm with Dimensionality Reduction for a Class of Optimization Problems in Radiotherapy0
Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting0
Giovanni in Paris0
The g -Extra Mixed Connectivity of Hypercube-Like Networks0
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages0
Fuzzy Propositional Configuration Logics0
State Complexity of Partial Word Finite Automata0
Once-Marking and Always-Marking 1-Limited Automata0
An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs0
Constructions of 2-Rotation Symmetric Boolean Functions with Good Cryptographic Properties0
Improved Approximation Algorithms for Matroid and Knapsack Means Problems0
Embedding Augmented Cube into Certain Trees and Windmill Graphs0
The 4-Set Tree Connectivity of Folded Hypercube0
Note on the Nonlinear Complexity of Finite Length Sequences0
More on the Descriptional Complexity of Products of Finite Automata0
Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications0
The k -Regular Edge Connectivity of Three Types of Regular Graphs0
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products0
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube0
Optimal Embedded and Enclosing Isosceles Triangles0
The g-Good-Neighbor Conditional Diagnosabilities of Hypermesh Optical Interconnection Networks Under the PMC and Comparison Models0
Knapsack Problems with Monotonically Non-Decreasing Variable Weights (Profits) of Items0
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) — Preface0
The Strong Diagnosability of Multiprocessor Systems Under the PMC Model0
Constrained Multi-Tildes: Derived Term and Position Automata0
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification0
Special Issue: Graph Algorithms: Theory and Applications - A Special Issue Dedicated to the Memory of Professor Takao Nishizeki — Preface0
Isolated Rupture in Thorny Networks0
Regular Expressions Avoiding Absorbing Patterns and the Significance of Uniform Distribution0
Hulls of q-Ary Narrow-Sense BCH Codes of Length q4 − 10
The Generalized Burning Number of Caterpillars0
A Lower Bound on the 2-Adic Complexity of Hall’s Sextic Residue Sequences0
Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost0
Fuzzy Dynamic Obstacle Avoidance Algorithm for Basketball Robot Based on Multi-Sensor Data Fusion Technology0
Identifying the Configurations to Operating Efficiency in China’s Life Insurance Industry Using Fuzzy-Set Qualitative Comparative Analysis0
The Local Metric Dimension and Distance-Edge-Monitoring Number of Graph0
Two-Dimensional Context-Free Grid Grammars0
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations0
The Generalized 3-Connectivity of a Family of Regular Networks0
Influential Node Identification of Network Based on Agglomeration Operation0
State Complexity of Boolean Operations on Graph-Walking Automata0
Optimal Layout of Embedding onto Folded Hypercubes0
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions0
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words0
Paired Domination Integrity of Graphs0
The Pumping Lemma for Regular Languages is Hard0
Mathematical Modelling and Computational Analysis of Covid-19 Epidemic in Erbil Kurdistan Using Modified Lagrange Interpolating Polynomial0
Guessing the Buffer Bound for k-Synchronizability0
Limit Law for Zagreb and Wiener Indices of Random Exponential Recursive Trees0
Language Acceptors with a Pushdown: Characterizations and Complexity0
Language Classes of Extended Distributed Reaction Systems0
The Generalized 4-Connectivity of Locally Exchanged Twisted Cubes0
Deciding Whether an Attributed Translation can be Realized by a Top-Down Transducer0
Transition Systems from Asymmetric Prime Event Structures with Cause-Respecting Reversibility0
A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions0
Sentiment Analysis of Chinese Reviews Based on BiTCN-Attention Model0
Reversible Top-Down Syntax Analysis0
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) — Preface0
Closure Properties of Subregular Languages Under Operations0
Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization0
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number0
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs0
Transportation Problem Allowing Sending and Bringing Back0
Control Languages Associated with Labelled Spiking Neural P Systems with Mute Rules0
Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs0
Smooth Subsum Search A Heuristic for Practical Integer Factorization0
Properties and Algorithm of Lattice Pseudo-Submodular Functions0
Preface0
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner0
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata0
Multi-Head Two-Way Finite Automata with Advice0
Compressed Structures for Partial Derivative Automata Constructions0
Structure Fault-Tolerant Hamiltonicity of Generalized Base 4-Hypercube Networks0
Universal First-Order Quantification over Automata0
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube0
A Two-Layer Reinforcement Learning-Integrated Genetic Algorithm for Flexible Job Shop Scheduling Considering Transportation Constraints0
Definability Results for Top-Down Tree Transducers0
Algorithm Design for Asset Trading Under Multiple Factors0
Finite Approximations and Similarity of Languages0
Author Index Volume 33 (2022)0
Drawing Simultaneously Embedded Graphs with Few Bends0
Marriage and Roommate0
Preface0
Secure Re-Keying in Group Key Management Using Combinatorial Designs0
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength0
Repetition Factorization of Automatic Sequences0
New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation0
Rainbow Domination in Cartesian Product of Paths and Cycles0
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs0
Operational Complexity in Subregular Classes0
An Analysis of Las Vegas Algorithms for Linear Search0
Special Issue: Articles Dedicated to the Memory of Magnus Steinby — Preface0
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring0
An Innovative Algorithm for Generating Three Completely Independent Spanning Trees in Folded Hypercube Networks0
Conversions Between Six Models of Finite Automata0
Sufficiency Conditions for Well-Formedness of Quantum Context-Free Grammars0
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms0
In Memoriam: Magnus Steinby (1941–2021)0
Sensitivity Analysis Contact Reliability of VH-CATT Cylindrical Gear and Its Reliability with Material Strength Degradation0
Synthesizing Computable Functions from Rational Specifications Over Infinite Words0
Isolated Rupture in Composite Networks0
An Improved Approximation Algorithm for the Minimum 4-Star Partition Problem0
Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq0
0.1022891998291