International Journal of Foundations of Computer Science

Article	Citations
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks	20
On Component Connectivity of Hierarchical Star Networks	17
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification	16
Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube	10
Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements	10
An Improved Helmet Detection Algorithm Based on YOLO V4	9
Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks	9
The Non-inclusive Diagnosability of Hypercubes under the MM* Model	8
Error-Free Affine, Unitary, and Probabilistic OBDDs	7
Fuzzy Clustering-Based Financial Data Mining System Analysis and Design	7
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes	6
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest	6
On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model	6
Fuzzy Dynamic Obstacle Avoidance Algorithm for Basketball Robot Based on Multi-Sensor Data Fusion Technology	6
Extremal Results on Vertex and Link Residual Closeness	5
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE	5
Monomial Generalized Almost Perfect Nonlinear Functions	5
Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting	5
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks	4
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China	4
Component Connectivity of Alternating Group Networks and Godan Graphs	4
A More Reasonable Proof of Cobham’s Theorem	4
Generalizations of Checking Stack Automata: Characterizations and Hierarchies	4
An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation	4
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm	4

Reconstructing Words from Right-Bounded-Block Words	3
Semilinearity of Families of Languages	3
Locating Number of Biswapped Networks	3
Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks	3
Watson–Crick Jumping Finite Automata	3
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata	3
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms	3
The Component Diagnosability of General Networks	3
Space Complexity of Stack Automata Models	3
Selection Algorithms with Small Groups	3
Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy	2
Sentiment Analysis of Chinese Reviews Based on BiTCN-Attention Model	2
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels	2
Generalizations of Code Languages with Marginal Errors	2
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations	2
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid	2
Management and Monitoring of Multi-Behavior Recommendation Systems Using Graph Convolutional Neural Networks	2
Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks	2
Constructions of (r,t)-LRC Based on Totally Isotropic Subspaces in Symplectic Space Over Finite Fields	2
Synchronizing Almost-Group Automata	2
Alternate Lucas Cubes	2
Strict Linearizability and Abstract Atomicity	2
Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model	2
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks	2
Securing Smart City Services in Cyber-Physical Systems Using the Computation Annealed Selection Process	2
Random Regular Expression Over Huge Alphabets	2
Convergecast Tree on Temporal Graphs	2
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees	2
Special Aquatic Products Supply Chain Coordination Considering Bilateral Green Input in the Context of High-Quality Development	2
A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm	1
Compositions with Constant Weighted Extended Tree Transducers	1
Search on a Line by Byzantine Robots	1
Efficient Identification of k-Closed Strings	1
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees	1
The r-Extra Diagnosability of Hyper Petersen Graphs	1
Constructing de Bruijn Sequences Based on a New Necessary Condition	1
A New Study of Parikh Matrices Restricted to Terms	1
Embedding Augmented Cube into Certain Trees and Windmill Graphs	1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks	1
Further Remarks on the Operational Nonterminal Complexity	1
Simplifications of Uniform Expressions Specified by Systems	1
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs	1
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata	1
Sensitivity Analysis Contact Reliability of VH-CATT Cylindrical Gear and Its Reliability with Material Strength Degradation	1
Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages	1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs	1
Restricted Existence and Approximation Algorithms for PMMS	1
Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family	1
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas	1
Relating Various Types of Distributed Reaction Systems	1

Identifying the Configurations to Operating Efficiency in China’s Life Insurance Industry Using Fuzzy-Set Qualitative Comparative Analysis	1
Analysis of Vulnerability of Some Transformation Networks	1
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees	1
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect	1
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength	1
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities	1
Language Classes of Extended Distributed Reaction Systems	1
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami	1
On the Balancedness of Tree-to-Word Transducers	1
Decidability of Right One-Way Jumping Finite Automata	1
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs	1
Recognizing Generating Subgraphs Revisited	1
Weak Cost Register Automata are Still Powerful	1
(n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn	1
Dyck Words, Lattice Paths, and Abelian Borders	1
The Hardest LL(k) Language	1
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages	1
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults	1
Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions	1
Balanced-by-Construction Regular and ω-Regular Languages	1
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language	1
Improved Approximation Algorithms for Bin Packing with Conflicts	1
The Synchronizing Probability Function for Primitive Sets of Matrices	1
The Clustered Selected-Internal Steiner Tree Problem	1
Descriptional Complexity of Semi-Simple Splicing Systems	1
On the Construction of Multiply Constant-Weight Codes	0
The Structure Fault Tolerance of Alternating Group Networks	0
Preface	0
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings	0
From Two-Way Transducers to Regular Function Expressions	0
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs	0
Tissue P Systems with Vesicles of Multisets	0
The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings	0
On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts	0
Additional Closeness of Cycle Graphs	0
Graph Algorithm Based Submodular Function for Sparsest Cut Problem	0
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number	0
Symbol Separation in Double Occurrence Words	0
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern	0
Graph Orientation with Edge Modifications	0
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect	0
Normalish Amenable Subgroups of the R. Thompson Groups	0
The g-Good-Neighbor Conditional Diagnosabilities of Hypermesh Optical Interconnection Networks Under the PMC and Comparison Models	0
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs	0
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers	0
A New Hierarchy for Automaton Semigroups	0
Shortest Journeys in Directed Temporal Graphs	0
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces	0
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults	0
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata	0
The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph	0
Announcement	0
Properties and Algorithm of Lattice Pseudo-Submodular Functions	0
The Bottom-Up Position Tree Automaton and the Father Automaton	0
In Memoriam: Magnus Steinby (1941–2021)	0
Online and Approximate Network Construction from Bounded Connectivity Constraints	0
The Generalized 3-Connectivity of Exchanged Crossed Cube	0
Preface	0
Ambiguity Hierarchies for Weighted Tree Automata	0
Reversible Top-Down Syntax Analysis	0
Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications	0
A Simple 2-Approximation for Maximum-Leaf Spanning Tree	0
Online Predictions for Online TSP on the Line	0
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube	0
A Pattern Logic for Automata with Outputs	0
Subnetwork Preclusion of (n,k)-Star Networks	0
Node and Link Vulnerability in Complete Multipartite Networks	0
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata	0
Exact Affine Counter Automata	0
A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions	0
Simplified Bounds on FHSs Set and Its Strictly Optimal Construction	0
Definability Results for Top-Down Tree Transducers	0
New Constructions of Codebooks Nearly Meeting the Welch Bound	0
Graph Convolutional Network-Guided Mine Gas Concentration Predictor	0
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata	0
Structural Synthesis of PLC Program for Real-Time Specification Patterns	0
A Proof of Parikh’s Theorem via Dickson’s Lemma	0
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design	0
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited	0
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube	0

The Power of Machines That Control Experiments	0
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words	0
Influential Node Identification of Network Based on Agglomeration Operation	0
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge	0
Optimal Embedded and Enclosing Isosceles Triangles	0
Routing Among Convex Polygonal Obstacles in the Plane	0
A Pseudo-Random Generator Whose Output is a Normal Sequence	0
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions	0
The Triple-Pair Construction for Weighted ω-Pushdown Automata	0
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs	0
Tight Bounds on the Upload Capacity to Enable Two-Hop Delivery in Peer-to-Peer Video Streaming Systems	0
Tree-Based Generation of Restricted Graph Languages	0
Two Effective Properties of ω-Rational Functions	0
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects	0
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products	0
Author Index Volume 31 (2020)	0
Volume Edited by Magnus Steinby	0
Boosting Reversible Pushdown and Queue Machines by Preprocessing	0
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring	0
Projection for Büchi Tree Automata with Constraints between Siblings	0
Author Index Volume 33 (2022)	0
On the Boolean Closure of Deterministic Top-Down Tree Automata	0
Approximation Algorithms for Partial Vertex Covers in Trees	0
The Outer-Paired Domination of Graphs	0
Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties	0
Minimizing I/Os in Out-of-Core Task Tree Scheduling	0
A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles	0
A Note on Squares in Binary Words	0
Isolated Rupture in Composite Networks	0
Finite Approximations and Similarity of Languages	0
PSPACE-Completeness of Reversible Deterministic Systems	0
A Lightweight Key Agreement Protocol with Authentication Capability	0
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) — Preface	0
k-Planar Placement and Packing of Δ-Regular Caterpillars	0
Reachability Analysis of Self Modifying Code	0
Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon	0
More Efficient Parallel Integer Sorting	0
Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs	0
HV-Palindromes in Two-Dimensional Words	0
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms	0
Recomputation of Public Capital Based on PIM and the Effect on China Regional Economic Growth	0
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover	0
Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost	0
An Inequality for the Number of Periods in a Word	0
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata	0
Algorithm Design for Asset Trading Under Multiple Factors	0
Improving the Quality of Service (QoS) and Resource Allocation in Vehicular Platoon Using Meta-Heuristic Optimization Algorithm	0
Preface	0
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time	0
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages	0
The Intersection Problem for Finite Semigroups	0
An Improved Approximation Algorithm for the Capacitated Correlation Clustering Problem	0
Triple Cyclic Codes Over ?q + u?q	0
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors	0
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules	0
Family Trees for Enumeration	0
Transportation Problem Allowing Sending and Bringing Back	0
State Complexity of Overlap Assembly	0
Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus	0
Weakly and Strongly Irreversible Regular Languages	0
Smooth Subsum Search A Heuristic for Practical Integer Factorization	0
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs	0
Weighted Linear Dynamic Logic	0
The Overlap Gap Between Left-Infinite and Right-Infinite Words	0
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands	0
Guessing the Buffer Bound for k-Synchronizability	0
Robust Subgroup Multisignature with One-Time Public Keys in Order	0
On the Super (Edge)-Connectivity of Generalized Johnson Graphs	0
On the k-error Linear Complexity of Subsequences of d-ary Sidel’nikov Sequences Over Prime Field ?d	0
Closure Properties of Subregular Languages Under Operations	0
Improved Approximation Algorithms for Matroid and Knapsack Means Problems	0
Modelling Uncertainty in Architectures of Parametric Component-Based Systems	0
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices	0
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner	0
The Component (Edge) Connectivity of Round Matching Composition Networks	0
Implementations and Applications of Automata 2018: Preface	0
Preface	0
Extremal Binary PFAs with Small Number of States	0
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case	0
Special Issue Developments in Language Theory 2018 — Preface	0
Rainbow Domination in Cartesian Product of Paths and Cycles	0
Author Index Volume 32 (2021)	0
Two New Classes of (Almost) Perfect c-Nonlinear Permutations	0
Drawing Simultaneously Embedded Graphs with Few Bends	0
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice	0
Membership Problem for Two-Dimensional General Row Jumping Finite Automata	0
Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization	0
Isolated Rupture in Thorny Networks	0
Inverse Spectral Problems for a Special Acyclic Matrix	0
Integer Weighted Automata on Infinite Words	0
On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness	0
New Bounds for Some Topological Indices	0
On the Shared Transportation Problem: Computational Hardness and Exact Approach	0
Weak Separation Problem for Tree Languages	0
A Reduction of Integer Factorization to Modular Tetration	0