International Journal of Foundations of Computer Science

Article	Citations
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices	27
The Partial Diagnosability of Interconnection Networks Under the Strong Hybrid MM* Model	17
Ambiguity Hierarchies for Weighted Tree Automata	12
Restricted Existence and Approximation Algorithms for PMMS	12
Note on Two-Stage BP Maximization	10
A Simple 2-Approximation for Maximum-Leaf Spanning Tree	9
On the Shared Transportation Problem: Computational Hardness and Exact Approach	9
The Structure Fault Tolerance of Alternating Group Networks	8
Family Trees for Enumeration	8
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice	7
A new class of permutation quadrinomial over ????q2 with characteristic 5	6
Fault-Tolerant Maximal Local-Connectivity on Leaf-Sort Graphs	5
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors	5
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands	4
The Restricted Connectivity of Bubble-Sort Star Graphs	4
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm	4
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets	4
Shortest Journeys in Directed Temporal Graphs	4
Weighted Linear Dynamic Logic	3
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions	3
Strong Menger Connectivity of Alternating Group Network Under Subnetwork Failure	3
An Approximation Algorithm for Generalized Connectivity Problem on Planar Graphs	3
k-Planar Placement and Packing of Δ-Regular Caterpillars	3
On the Smallest Synchronizing Terms of Finite Tree Automata	3
PSPACE-Completeness of Reversible Deterministic Systems	3

Approximation Algorithms for the UAV Path Planning with Object Coverage Constraints	3
An Improvement for Error-Correcting Pairs of Some Special MDS Codes	3
Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance	3
Ratio-Based Distortion and Network Distance	2
Reversible Two-Party Computations	2
Hamiltonian Paths Passing Through Linear Forests in Hypercubes with Faulty Edges	2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect	2
Modelling Uncertainty in Architectures of Parametric Component-Based Systems	2
Component Connectivity of Alternating Group Networks and Godan Graphs	2
Routing Among Convex Polygonal Obstacles in the Plane	2
The h-Component Diagnosability of Alternating Group Graphs	2
Two Classes of Partitioned Uniform Cyclic Relative Difference Families and Their Applications to Difference Systems of Sets	2
Balanced-by-Construction Regular and ω-Regular Languages	2
Structural Synthesis of PLC Program for Real-Time Specification Patterns	2
On Open-End Bin Packing Games	2
Results on the Gowers U2 Norm of Generalized Boolean Functions	2
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes	1
The h -Faulty-Block Connectivity of n -Dimensional Balanced Hypercube	1
Online and Approximate Network Construction from Bounded Connectivity Constraints	1
Optimizing Maximum Subgraph and Wirelength in WK-Recursive Networks	1
Subnetworks Reliability Analysis of Complete Transposition Networks	1
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern	1
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time	1
Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages	1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs	1
An Upper Bound for Edge Congestion and the Exact Wirelength of Embedding onto BC Graphs	1
Component Connectivity of 3-Ary n-Cubes	1
Embedded Edge Connectivity of Alternating Group Networks	1
The Coordination Mechanism for Scheduling Game with Deterioration Jobs and Uniform-Batch Machines	1
Computation of Geometric Color-Spanning Region for Line Segments	1
Online Predictions for Online TSP on the Line	1
The Seeding and Bi-Criteria Algorithms for Fuzzy k -Median Problem	1
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems	1
Approximation Algorithms for Partial Vertex Covers in Trees	1
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid	1
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case	1
Conditional Fractional Matching Preclusion Number of Graphs	1
On the Fault Diameter and Wide Diameter of Locally Exchanged Twisted Cube	1
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules	1
Locating Number of Biswapped Networks	1
Interrelations Between Soft and Ordinary Sets: An Exploration of Soft Filters and Soft Nets	1
Preface	1
The Generalized 4-Connectivity of Bubble-Sort Graphs	1
Volume Edited by Magnus Steinby	1
Sweeping Input-Driven Pushdown Automata	1
Author Index Volume 35 (2024)	1
Graph Algorithm Based Submodular Function for Sparsest Cut Problem	1
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem	1
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect	1
Reverse M-polynomial of a Graph	1

Tree-Based Generation of Restricted Graph Languages	1
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults	1
Properties of Parikh Determinant Under Some Word Operations	1
Computing a 3-Role Assignment is Polynomial-Time Solvable on Complementary Prisms	1
On the Power of Star-Controlled Insertion-Deletion Systems	1
The Differential Properties of Certain Permutation Polynomials over Finite Fields	1
Improved Approximation Algorithms for Bin Packing with Conflicts	1
Image-Binary Automata	1
Certainty in Formalising SMT-LIB for Strings in Isabelle	1
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge	1
NC-ENCE Graph Grammars: Properties and Application to Game Design	1
On the Super (Edge)-Connectivity of Generalized Johnson Graphs	1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio	1
Non-Submodular Maximization Subject to a Knapsack Constraint on the Integer Lattice	1
Eulerian and Hamiltonian Soft Semigraphs	1
Efficiently Enumerating Spanning Trees of k -Trees	1
A Generalized Pumping Lemma for Weighted Recognizable Languages	1
Dynamic Reconfiguration of Networks Based on Visual Attention Mechanisms	1
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees	0
Special Issue: Graph Algorithms: Theory and Applications - A Special Issue Dedicated to the Memory of Professor Takao Nishizeki — Preface	0
Inverse Spectral Problems for a Special Acyclic Matrix	0
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) — Preface	0
Single Machine Scheduling of Coupled Task with Resource Consumption	0
Fault Tolerability Analysis of Hypercubes Based on g-Extra H-Structure Fault Pattern	0
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces	0
Regular Expressions Avoiding Absorbing Patterns and the Significance of Uniform Distribution	0
On The 4-Adic Complexity of Quaternary Cyclotomic Sequences of Order 4 with Even Length	0
Operational Complexity in Subregular Classes	0
Secure Re-Keying in Group Key Management Using Combinatorial Designs	0
Algorithms for the Truss Maintenance Problem on Edge-Weighted Graphs	0
Robust Subgroup Multisignature with One-Time Public Keys in Order	0
Once-Marking and Always-Marking 1-Limited Automata	0
Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs	0
A Note on Automatic Baire Property	0
An Analysis of Las Vegas Algorithms for Linear Search	0
The g -Extra Mixed Connectivity of Hypercube-Like Networks	0
Author Index Volume 36 (2025)	0
An Improved Helmet Detection Algorithm Based on YOLO V4	0
The 2-Good 3-Component Connectivity of Alternating Group Networks	0
Single-Machine Lot Scheduling with Order Rejection	0
Language Acceptors with a Pushdown: Characterizations and Complexity	0
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number	0
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.	0
Sensitivity Analysis Contact Reliability of VH-CATT Cylindrical Gear and Its Reliability with Material Strength Degradation	0
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages	0
k-Domination Connectivity in Graphs	0
Fuzzy Propositional Configuration Logics	0
The 4-Set Tree Connectivity of Folded Hypercube	0
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata	0
An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs	0
Compressed Structures for Partial Derivative Automata Constructions	0
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) — Preface	0
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products	0
Search and Rescue on the Ring	0
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs	0
Priority-Constraint Particle Swarm Optimization Algorithm for Dynamic Weapon-Target Assignment in Coordinated Air Combat	0
Constructions of 2-Rotation Symmetric Boolean Functions with Good Cryptographic Properties	0
Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting	0
Definability Results for Top-Down Tree Transducers	0
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults	0
A Proximal Gradient Algorithm with Dimensionality Reduction for a Class of Optimization Problems in Radiotherapy	0
Treasure Hunt in Euclidean Plane: Cost vs. Pebble Trade-Off	0
A Bicriteria Approximation Algorithm for the Min-Max Rural Postmen Cover Problem	0
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube	0
Preface	0
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers	0
Multi-Head Two-Way Finite Automata with Advice	0
The Hardest LL(k) Language	0
Drawing Simultaneously Embedded Graphs with Few Bends	0
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs	0
Algorithm Design for Asset Trading Under Multiple Factors	0
The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case	0
A Lower Bound on the 2-Adic Complexity of Hall’s Sextic Residue Sequences	0
Author Index Volume 33 (2022)	0
Properties and Algorithm of Lattice Pseudo-Submodular Functions	0
On the Ding and Helleseth’s 8th Open Problem About Optimal Ternary Cyclic Codes	0
Two-Dimensional Context-Free Grid Grammars	0
The Local Metric Dimension and Distance-Edge-Monitoring Number of Graph	0
Integer Weighted Automata on Infinite Words	0
Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost	0

Synthesizing Computable Functions from Rational Specifications Over Infinite Words	0
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions	0
Influential Node Identification of Network Based on Agglomeration Operation	0
The h-Extra r-Component Connectivity of Half Hypercube	0
Corrigendum: Inside the class of REGEX languages [6]	0
Conversions Between Six Models of Finite Automata	0
Sentiment Analysis of Chinese Reviews Based on BiTCN-Attention Model	0
Transition Systems from Asymmetric Prime Event Structures with Cause-Respecting Reversibility	0
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited	0
Latvian Quantum Finite State Automata for Unary Languages	0
Universal First-Order Quantification over Automata	0
Enhancing Reliability of Folded Petersen Networks Based on Edge Partition	0
A Dual-Guided Exact Algorithm for the Two-Constraint Path Problem	0
Integer Codes Correcting Single Errors and Detecting Double Adjacent Errors	0
Control Languages Associated with Labelled Spiking Neural P Systems with Mute Rules	0
Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq	0
Asynchronous Gathering of Finite Memory Robots on a Circle under Limited Visibility	0
Sufficiency Conditions for Well-Formedness of Quantum Context-Free Grammars	0
Reversible Top-Down Syntax Analysis	0
Hulls of q-Ary Narrow-Sense BCH Codes of Length q4 − 1	0
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words	0
Smooth Subsum Search A Heuristic for Practical Integer Factorization	0
The Generalized Burning Number of Caterpillars	0
Polynomial Representation of General Partial Boolean Functions with a Single Quantum Query	0
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata	0
Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks	0
Total Outer-Connected Domination on Convex Split Graphs — Classical, Parameterized and Approximation Complexity Results	0
Two-Way Non-Uniform Finite Automata	0
A Two-Layer Reinforcement Learning-Integrated Genetic Algorithm for Flexible Job Shop Scheduling Considering Transportation Constraints	0
Transportation Problem Allowing Sending and Bringing Back	0
Chromatic Harmonic Polynomials and Indices of Jump Graphs of Some Graphs	0
Algorithmics and Complexity of All-or-Nothing Resource Allocation with Delay Constraints	0
Note on the Nonlinear Complexity of Finite Length Sequences	0
Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity	0
Preface	0
The Generalized 4-Connectivity of Locally Exchanged Twisted Cubes	0
The g-Good-Neighbor Conditional Diagnosabilities of Hypermesh Optical Interconnection Networks Under the PMC and Comparison Models	0
Online Fault-Tolerant Bin Packing for Server Consolidation Revisited	0
Advanced Mathematical Characterization of a Four Triangular Ladder Graph with Multiplicative Degree Kirchhoff Index	0
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata	0
Special Aquatic Products Supply Chain Coordination Considering Bilateral Green Input in the Context of High-Quality Development	0
On Deterministic Finite Automata Equipped with Partial Orders	0
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength	0
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs	0
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China	0
Relating Various Types of Distributed Reaction Systems	0
An Improved Approximation Algorithm for the Minimum 4-Star Partition Problem	0
Exact and Heuristic Algorithms for Single-Machine Scheduling with Total Late Work and Job Rejection	0
Marriage and Roommate	0
Average State Complexity of Partial Derivative Automata for Synchronised Shuffles	0
Approximation Algorithms on a Scheduling Problem with Connectivity Constraints	0
Giovanni in Paris	0
Characterisation of Language Intersections Using Distances	0
Repetition Factorization of Automatic Sequences	0
An Innovative Algorithm for Generating Three Completely Independent Spanning Trees in Folded Hypercube Networks	0
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring	0
The Pumping Lemma for Regular Languages is Hard	0
Geodetic Coalition Graphs	0
Characterization of Isometric Words based on Swap and Mismatch Distance	0
Bounds on the Augmented Sombor Index of a Graph	0
Recursion Theorems in Numbered Sets	0
Improving the Quality of Service (QoS) and Resource Allocation in Vehicular Platoon Using Meta-Heuristic Optimization Algorithm	0
Improved Approximation Algorithms for Matroid and Knapsack Means Problems	0
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms	0
Accountable Authority Identity-Based Broadcast Encryption for IoT Devices	0
Limit Law for Zagreb and Wiener Indices of Random Exponential Recursive Trees	0
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations	0
Deciding Whether an Attributed Translation can be Realized by a Top-Down Transducer	0
Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications	0
Two New Classes of Complete Permutation Polynomials Over Finite Fields ????33n	0
Closure Properties of Subregular Languages Under Operations	0
Language Classes of Extended Distributed Reaction Systems	0
Language Quotients Revisited	0
Optimal Embedded and Enclosing Isosceles Triangles	0
Metric Properties of Non-Commuting Graph Associated to Two Groups	0
Some Special Perfect c-Nonlinear Functions on ℤn	0
Embedding Augmented Cube into Certain Trees and Windmill Graphs	0
Fault-Tolerant Communication Mechanisms in Data Center Network of HS-DCell	0
State Complexity of Partial Word Finite Automata	0
More on the Descriptional Complexity of Products of Finite Automata	0
Identifying the Configurations to Operating Efficiency in China’s Life Insurance Industry Using Fuzzy-Set Qualitative Comparative Analysis	0
Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization	0
Single Machine Scheduling with a Restricted Weight-Modifying Activity to Minimize the Weighted Makespan	0
Characterizations of M -Equivalence and Weak M -Relation	0
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner	0
The k -Regular Edge Connectivity of Three Types of Regular Graphs	0
Knapsack Problems with Monotonically Non-Decreasing Variable Weights (Profits) of Items	0
Laplacian Spectrum of Some Special Graphs	0
Structure Fault-Tolerant Hamiltonicity of Generalized Base 4-Hypercube Networks	0
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube	0
On Two Modifications of the McEliece PKE and the CFS Signature Scheme	0
New Bounds for Some Topological Indices	0
The Strong Diagnosability of Multiprocessor Systems Under the PMC Model	0
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs	0
Almost Perfect c-Nonlinear Permutations with Trace Functions over ????2n	0