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 2021-06-01 to 2025-06-01.)
ArticleCitations
The Overlap Gap Between Left-Infinite and Right-Infinite Words22
A Pseudo-Random Generator Whose Output is a Normal Sequence19
Restricted Existence and Approximation Algorithms for PMMS13
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices13
Ambiguity Hierarchies for Weighted Tree Automata12
A Simple 2-Approximation for Maximum-Leaf Spanning Tree10
On the Shared Transportation Problem: Computational Hardness and Exact Approach8
The Structure Fault Tolerance of Alternating Group Networks7
Shortest Journeys in Directed Temporal Graphs6
Family Trees for Enumeration6
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice6
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands5
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors5
Normalish Amenable Subgroups of the R. Thompson Groups4
Weighted Linear Dynamic Logic4
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm4
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets4
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata4
An Improvement for Error-Correcting Pairs of Some Special MDS Codes3
More Efficient Parallel Integer Sorting3
PSPACE-Completeness of Reversible Deterministic Systems3
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees3
Non-resumable scheduling on a single bounded parallel-batch machine with flexible maintenance3
Component Connectivity of Alternating Group Networks and Godan Graphs3
k-Planar Placement and Packing of Δ-Regular Caterpillars3
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions3
Balanced-by-Construction Regular and ω-Regular Languages3
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults2
Structural Synthesis of PLC Program for Real-Time Specification Patterns2
Modelling Uncertainty in Architectures of Parametric Component-Based Systems2
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas2
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect2
Routing Among Convex Polygonal Obstacles in the Plane2
Results on the Gowers U2 Norm of Generalized Boolean Functions2
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems2
The h-Component Diagnosability of Alternating Group Graphs2
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes2
Minimizing I/Os in Out-of-Core Task Tree Scheduling2
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem2
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design1
Author Index Volume 35 (2024)1
Online Predictions for Online TSP on the Line1
The coordination mechanism for scheduling game with deterioration jobs and uniform-batch machines1
Graph Algorithm Based Submodular Function for Sparsest Cut Problem1
The h-Faulty-Block Connectivity of n-Dimensional Balanced Hypercube1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs1
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case1
Author Index Volume 32 (2021)1
Volume Edited by Magnus Steinby1
Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages1
Eulerian and Hamiltonian Soft Semigraphs1
Space Complexity of Stack Automata Models1
Online and Approximate Network Construction from Bounded Connectivity Constraints1
Efficiently Enumerating Spanning Trees of k-Trees1
Alternate Lucas Cubes1
Certainty in Formalising SMT-LIB for Strings in Isabelle1
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks1
Approximation Algorithms for Partial Vertex Covers in Trees1
The Differential Properties of Certain Permutation Polynomials Over Finite Fields1
Tree-Based Generation of Restricted Graph Languages1
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules1
On the Super (Edge)-Connectivity of Generalized Johnson Graphs1
Image-Binary Automata1
Conditional Fractional Matching Preclusion Number of Graphs1
A Generalized Pumping Lemma for Weighted Recognizable Languages1
Locating Number of Biswapped Networks1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio1
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time1
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect1
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern1
Language Classes of Extended Distributed Reaction Systems0
Improved Approximation Algorithms for Bin Packing with Conflicts0
Integer Codes Correcting Single Errors and Detecting Double Adjacent Errors0
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs0
Preface0
New Bounds for Some Topological Indices0
On the Balancedness of Tree-to-Word Transducers0
Weakly and Strongly Irreversible Regular Languages0
Guessing the Buffer Bound for k-Synchronizability0
Operations on Boolean and Alternating Finite Automata0
Preface0
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs0
Marriage and Roommate0
Improved Approximation Algorithms for Matroid and Knapsack Means Problems0
Graph Convolutional Network-Guided Mine Gas Concentration Predictor0
Embedding Augmented Cube into Certain Trees and Windmill Graphs0
The 4-Set Tree Connectivity of Folded Hypercube0
Special Aquatic Products Supply Chain Coordination Considering Bilateral Green Input in the Context of High-Quality Development0
Compositions with Constant Weighted Extended Tree Transducers0
On the Boolean Closure of Deterministic Top-Down Tree Automata0
One-Way Restarting Automata and Their Sensitivitys0
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube0
Drawing Simultaneously Embedded Graphs with Few Bends0
Compressed Structures for Partial Derivative Automata Constructions0
Definability Results for Top-Down Tree Transducers0
Sentiment Analysis of Chinese Reviews Based on BiTCN-Attention Model0
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China0
Parametric Algorithm to Find the Largest Empty Rectangle from a Set of Line Segments0
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees0
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification0
On the Construction of Multiply Constant-Weight Codes0
Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications0
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms0
Distributed Independent Sets in Interval and Segment Intersection Graphs0
Fuzzy Clustering-Based Financial Data Mining System Analysis and Design0
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees0
Author Index Volume 33 (2022)0
A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions0
Special Issue: Articles Dedicated to the Memory of Magnus Steinby — Preface0
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring0
Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity0
The Local Metric Dimension and Distance-Edge-Monitoring Number of Graph0
Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting0
The Triple-Pair Construction for Weighted ω-Pushdown Automata0
Algorithms for the Truss Maintenance Problem on Edge-Weighted Graphs0
Limit Law for Zagreb and Wiener Indices of Random Exponential Recursive Trees0
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case0
Subnetwork Preclusion of (n,k)-Star Networks0
An Analysis of Las Vegas Algorithms for Linear Search0
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces0
The Clustered Selected-Internal Steiner Tree Problem0
Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata0
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words0
Metric Properties of Non-Commuting Graph Associated to Two Groups0
More on the Descriptional Complexity of Products of Finite Automata0
Robust Subgroup Multisignature with One-Time Public Keys in Order0
Preface0
Language Quotients Revisited0
Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq0
Integer Weighted Automata on Infinite Words0
Influential Node Identification of Network Based on Agglomeration Operation0
Relating Various Types of Distributed Reaction Systems0
Regular Expressions Avoiding Absorbing Patterns and the Significance of Uniform Distribution0
Improving the Quality of Service (QoS) and Resource Allocation in Vehicular Platoon Using Meta-Heuristic Optimization Algorithm0
The Generalized 3-Connectivity of a Family of Regular Networks0
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions0
Optimal Embedded and Enclosing Isosceles Triangles0
Properties and Algorithm of Lattice Pseudo-Submodular Functions0
Transportation Problem Allowing Sending and Bringing Back0
Preface0
The g-Extra Mixed Connectivity of Hypercube-Like Networks0
Multi-Head Two-Way Finite Automata with Advice0
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities0
Closure Properties of Subregular Languages Under Operations0
Recomputation of Public Capital Based on PIM and the Effect on China Regional Economic Growth0
Optimal Layout of Embedding onto Folded Hypercubes0
Once-Marking and Always-Marking 1-Limited Automata0
A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm0
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover0
Analysis of Vulnerability of Some Transformation Networks0
Two-Way Non-Uniform Finite Automata0
Algorithm Design for Asset Trading Under Multiple Factors0
Synthesizing Computable Functions from Rational Specifications Over Infinite Words0
Sufficiency Conditions for Well-Formedness of Quantum Context-Free Grammars0
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata0
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata0
Dyck Words, Lattice Paths, and Abelian Borders0
Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization0
Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks0
Operational Complexity in Subregular Classes0
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) — Preface0
The g-Good-Neighbor Conditional Diagnosabilities of Hypermesh Optical Interconnection Networks Under the PMC and Comparison Models0
Universal First-Order Quantification Over Automata0
Preface0
Two-Dimensional Context-Free Grid Grammars0
Finite Approximations and Similarity of Languages0
The Power of Machines That Control Experiments0
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner0
Simplifications of Uniform Expressions Specified by Systems0
Author Index Volume 34 (2023)0
Isolated Rupture in Thorny Networks0
Tissue P Systems with Vesicles of Multisets0
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers0
State Complexity of Partial Word Finite Automata0
Isolated Rupture in Composite Networks0
Parameterized Complexity Classes Defined by Threshold Circuits and Their Connection with Sorting Networks0
An Improved Helmet Detection Algorithm Based on YOLO V40
Almost Perfect c-Nonlinear Permutations with Trace Functions Over ????2n0
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata0
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) — Preface0
Language Acceptors with a Pushdown: Characterizations and Complexity0
Kernels of Context-Free Languages0
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations0
On the Power of Star-Controlled Insertion-Deletion Systems0
The Strong Diagnosability of Multiprocessor Systems Under the PMC Model0
Characterizations of M-Equivalence and Weak M-Relation0
Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks0
Inverse Spectral Problems for a Special Acyclic Matrix0
Computing a 3-Role Assignment is Polynomial-Time Solvable on Complementary Prisms0
Deciding Whether an Attributed Translation can be Realized by a Top-Down Transducer0
The Component Diagnosability of General Networks0
The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings0
Latvian Quantum Finite State Automata for Unary Languages0
An Innovative Algorithm for Generating Three Completely Independent Spanning Trees in Folded Hypercube Networks0
An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs0
HV-Palindromes in Two-Dimensional Words0
Words-to-Letters Valuations for Language Kleene Algebras with Variable and Constant Complements0
Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages0
Input-Driven Double-Head Pushdown Automata0
The Outer-Paired Domination of Graphs0
Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost0
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited0
New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation0
The Generalized 4-Connectivity of Locally Exchanged Twisted Cubes0
Reversible Top-Down Syntax Analysis0
Some Special Perfect c-Nonlinear Functions on ℤn0
Fuzzy Dynamic Obstacle Avoidance Algorithm for Basketball Robot Based on Multi-Sensor Data Fusion Technology0
Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs0
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube0
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid0
Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy0
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs0
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number0
Edge-Fault-Tolerant Edge-Bipancyclicity of Modified Bubble-Sort Graphs0
Mathematical Modelling and Computational Analysis of Covid-19 Epidemic in Erbil Kurdistan Using Modified Lagrange Interpolating Polynomial0
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength0
Two Effective Properties of ω-Rational Functions0
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs0
Smooth Subsum Search A Heuristic for Practical Integer Factorization0
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs0
The Component (Edge) Connectivity of Round Matching Composition Networks0
A Lower Bound on the 2-Adic Complexity of Hall’s Sextic Residue Sequences0
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults0
An Improved Approximation Algorithm for the Capacitated Correlation Clustering Problem0
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products0
Management and Monitoring of Multi-Behavior Recommendation Systems Using Graph Convolutional Neural Networks0
Enhancing Reliability of Folded Petersen Networks Based on Edge Partition0
Exact Affine Counter Automata0
Special Issue: Graph Algorithms: Theory and Applications - A Special Issue Dedicated to the Memory of Professor Takao Nishizeki — Preface0
Identifying the Configurations to Operating Efficiency in China’s Life Insurance Industry Using Fuzzy-Set Qualitative Comparative Analysis0
Additional Closeness of Cycle Graphs0
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks0
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.0
On Two Modifications of the McEliece PKE and the CFS Signature Scheme0
Giovanni in Paris0
Characterization of Isometric Words based on Swap and Mismatch Distance0
Three-Word Codes {a,aba,u} Having a Finite Completion0
Sensitivity Analysis Contact Reliability of VH-CATT Cylindrical Gear and Its Reliability with Material Strength Degradation0
The Hardest LL(k) Language0
Extremal Results on Vertex and Link Residual Closeness0
Fuzzy Propositional Configuration Logics0
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages0
Conversions Between Six Models of Finite Automata0
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge0
An Inequality for the Number of Periods in a Word0
Repetition Factorization of Automatic Sequences0
Extremal Binary PFAs with Small Number of States0
0.084245920181274