International Journal of Foundations of Computer Science

Article	Citations
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks	21
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification	19
An Improved Helmet Detection Algorithm Based on YOLO V4	15
Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube	13
Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks	11
Fuzzy Dynamic Obstacle Avoidance Algorithm for Basketball Robot Based on Multi-Sensor Data Fusion Technology	10
The Non-inclusive Diagnosability of Hypercubes under the MM* Model	9
Fuzzy Clustering-Based Financial Data Mining System Analysis and Design	8
Error-Free Affine, Unitary, and Probabilistic OBDDs	7
Extremal Results on Vertex and Link Residual Closeness	7
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm	7
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE	6
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest	6
Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy	5
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China	5
Locating Number of Biswapped Networks	5
Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks	5
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks	5
Component Connectivity of Alternating Group Networks and Godan Graphs	4
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms	4
An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation	4
Generalizations of Checking Stack Automata: Characterizations and Hierarchies	4
The Component Diagnosability of General Networks	4
A More Reasonable Proof of Cobham’s Theorem	4
Securing Smart City Services in Cyber-Physical Systems Using the Computation Annealed Selection Process	3

Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata	3
Alternate Lucas Cubes	3
Search on a Line by Byzantine Robots	3
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata	3
Semilinearity of Families of Languages	3
Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model	3
Reconstructing Words from Right-Bounded-Block Words	3
Watson–Crick Jumping Finite Automata	3
Space Complexity of Stack Automata Models	3
Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks	3
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults	2
Sentiment Analysis of Chinese Reviews Based on BiTCN-Attention Model	2
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels	2
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees	2
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations	2
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees	2
Management and Monitoring of Multi-Behavior Recommendation Systems Using Graph Convolutional Neural Networks	2
Random Regular Expression Over Huge Alphabets	2
Synchronizing Almost-Group Automata	2
On the Balancedness of Tree-to-Word Transducers	2
Strict Linearizability and Abstract Atomicity	2
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid	2
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks	2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect	2
Generalizations of Code Languages with Marginal Errors	2
A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm	2
Special Aquatic Products Supply Chain Coordination Considering Bilateral Green Input in the Context of High-Quality Development	2
HV-Palindromes in Two-Dimensional Words	1
(n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn	1
The r-Extra Diagnosability of Hyper Petersen Graphs	1
Subnetwork Preclusion of (n,k)-Star Networks	1
Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions	1
Relating Various Types of Distributed Reaction Systems	1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks	1
Analysis of Vulnerability of Some Transformation Networks	1
Simplifications of Uniform Expressions Specified by Systems	1
Further Remarks on the Operational Nonterminal Complexity	1
Tissue P Systems with Vesicles of Multisets	1
The Clustered Selected-Internal Steiner Tree Problem	1
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata	1
Rainbow Domination in Cartesian Product of Paths and Cycles	1
Restricted Existence and Approximation Algorithms for PMMS	1
Dyck Words, Lattice Paths, and Abelian Borders	1
Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family	1
Identifying the Configurations to Operating Efficiency in China’s Life Insurance Industry Using Fuzzy-Set Qualitative Comparative Analysis	1
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata	1
Additional Closeness of Cycle Graphs	1
The Hardest LL(k) Language	1
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language	1
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs	1

NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities	1
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover	1
Descriptional Complexity of Semi-Simple Splicing Systems	1
Sensitivity Analysis Contact Reliability of VH-CATT Cylindrical Gear and Its Reliability with Material Strength Degradation	1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs	1
Compositions with Constant Weighted Extended Tree Transducers	1
Improved Approximation Algorithms for Bin Packing with Conflicts	1
Recognizing Generating Subgraphs Revisited	1
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages	1
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs	1
Graph Convolutional Network-Guided Mine Gas Concentration Predictor	1
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees	1
New Bounds for Some Topological Indices	1
Embedding Augmented Cube into Certain Trees and Windmill Graphs	1
Language Classes of Extended Distributed Reaction Systems	1
Balanced-by-Construction Regular and ω-Regular Languages	1
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami	1
Family Trees for Enumeration	1
Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages	1
The Overlap Gap Between Left-Infinite and Right-Infinite Words	1
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas	1
An Improved Approximation Algorithm for the Capacitated Correlation Clustering Problem	0
Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost	0
The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited	0
Recomputation of Public Capital Based on PIM and the Effect on China Regional Economic Growth	0
Symbol Separation in Double Occurrence Words	0
State Complexity of Overlap Assembly	0
Preface	0
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors	0
Volume Edited by Magnus Steinby	0
Author Index Volume 31 (2020)	0
A New Hierarchy for Automaton Semigroups	0
Routing Among Convex Polygonal Obstacles in the Plane	0
Weakly and Strongly Irreversible Regular Languages	0
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata	0
Parametric Algorithm to Find the Largest Empty Rectangle from a Set of Line Segments	0
Metric Properties of Non-Commuting Graph Associated to Two Groups	0
Marriage and Roommate	0
Properties and Algorithm of Lattice Pseudo-Submodular Functions	0
Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions	0
Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq	0
The Generalized 3-Connectivity of a Family of Regular Networks	0
Distributed Independent Sets in Interval and Segment Intersection Graphs	0
An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs	0
Limit Law for Zagreb and Wiener Indices of Random Exponential Recursive Trees	0
Minimizing I/Os in Out-of-Core Task Tree Scheduling	0
Approximating All-Points Furthest Pairs and Maximum Spanning Trees in Metric Spaces	0
Conversions Between Six Models of Finite Automata	0
Language Acceptors with a Pushdown: Characterizations and Complexity	0
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products	0
Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers	0
The Structure Fault Tolerance of Alternating Group Networks	0
A Simple 2-Approximation for Maximum-Leaf Spanning Tree	0
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules	0
Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting	0
The Generalized 3-Connectivity of Exchanged Crossed Cube	0
Exact Affine Counter Automata	0
Author Index Volume 33 (2022)	0
Reversible Top-Down Syntax Analysis	0
Reachability Analysis of Self Modifying Code	0
State Complexity of Boolean Operations on Graph-Walking Automata	0
Implementations and Applications of Automata 2018: Preface	0
PSPACE-Completeness of Reversible Deterministic Systems	0
On the Shared Transportation Problem: Computational Hardness and Exact Approach	0
An Inequality for the Number of Periods in a Word	0
Isolated Rupture in Composite Networks	0
Closure Properties of Subregular Languages Under Operations	0
k-Planar Placement and Packing of Δ-Regular Caterpillars	0
Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings	0
Integer Weighted Automata on Infinite Words	0
Regular Expressions Avoiding Absorbing Patterns and the Significance of Uniform Distribution	0
Isolated Rupture in Thorny Networks	0
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages	0
On the Interplay of Direct Topological Factorizations and Cellular Automata Dynamics on Beta-Shifts	0
Structural Synthesis of PLC Program for Real-Time Specification Patterns	0
Shortest Journeys in Directed Temporal Graphs	0
On the Construction of Multiply Constant-Weight Codes	0
Optimal Embedded and Enclosing Isosceles Triangles	0
Graph Orientation with Edge Modifications	0
The Power of Machines That Control Experiments	0

Graph Algorithm Based Submodular Function for Sparsest Cut Problem	0
A Simple and Efficient Method for Accelerating Construction of the Gap-Greedy Spanner	0
A Note on Squares in Binary Words	0
Boosting Reversible Pushdown and Queue Machines by Preprocessing	0
Transportation Problem Allowing Sending and Bringing Back	0
Normalish Amenable Subgroups of the R. Thompson Groups	0
Triple Cyclic Codes Over ?q + u?q	0
Latvian Quantum Finite State Automata for Unary Languages	0
Left is Better Than Right for Reducing Nondeterminism of NFAs	0
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs	0
The Outer-Paired Domination of Graphs	0
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect	0
On the Boolean Closure of Deterministic Top-Down Tree Automata	0
Repetition Factorization of Automatic Sequences	0
Eulerian and Hamiltonian Soft Semigraphs	0
Connectivity Status of Intuitionistic Fuzzy Graphs and Its Applications	0
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength	0
Preface	0
Some Special Perfect c-Nonlinear Functions on ℤn	0
Robust Subgroup Multisignature with One-Time Public Keys in Order	0
Total 2-Rainbow Domination in Graphs: Complexity and Algorithms	0
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs	0
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions	0
The Wide Diameter and Fault Diameter of Exchanged Crossed Cube	0
Special Issue: International Colloquium: Recent Advances of Quantitative Models in Computer Science (RAQM 2021) — Preface	0
The h-Component Diagnosability of Alternating Group Graphs	0
Weighted Linear Dynamic Logic	0
A Lightweight Key Agreement Protocol with Authentication Capability	0
A Note of Reliability Analysis of SM-λ in Folded-Crossed Hypercube with Conditional Faults	0
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs	0
Tree-Based Generation of Restricted Graph Languages	0
Inverse Spectral Problems for a Special Acyclic Matrix	0
Paired Domination Integrity of Graphs	0
Preface	0
Influential Node Identification of Network Based on Agglomeration Operation	0
Author Index Volume 32 (2021)	0
A Proof of Parikh’s Theorem via Dickson’s Lemma	0
The 4-Set Tree Connectivity of Folded Hypercube	0
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets	0
Drawing Simultaneously Embedded Graphs with Few Bends	0
Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata	0
Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words	0
Definability Results for Top-Down Tree Transducers	0
Non-Adaptive and Adaptive Two-Sided Search with Fast Objects	0
A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions	0
A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations	0
A Pseudo-Random Generator Whose Output is a Normal Sequence	0
Improving the Quality of Service (QoS) and Resource Allocation in Vehicular Platoon Using Meta-Heuristic Optimization Algorithm	0
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time	0
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design	0
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs	0
Two Effective Properties of ω-Rational Functions	0
The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings	0
The Triple-Pair Construction for Weighted ω-Pushdown Automata	0
Approximation Algorithms for Partial Vertex Covers in Trees	0
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case	0
Mathematical Modelling and Computational Analysis of Covid-19 Epidemic in Erbil Kurdistan Using Modified Lagrange Interpolating Polynomial	0
The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph	0
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern	0
Improved Approximation Algorithms for Matroid and Knapsack Means Problems	0
Conditional Fractional Matching Preclusion Number of Graphs	0
Hybrid Enhanced Binary Honey Badger Algorithm with Quadratic Programming for Cardinality Constrained Portfolio Optimization	0
Preface	0
Special Issue: Graph Algorithms: Theory and Applications - A Special Issue Dedicated to the Memory of Professor Takao Nishizeki — Preface	0
The Component (Edge) Connectivity of Round Matching Composition Networks	0
Enhancing Reliability of Folded Petersen Networks Based on Edge Partition	0
In Memoriam: Magnus Steinby (1941–2021)	0
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge	0
Two New Classes of (Almost) Perfect c-Nonlinear Permutations	0
Linear Codes and Linear Complementary Pairs of Codes Over a Non-Chain Ring	0
Ambiguity Hierarchies for Weighted Tree Automata	0
Vertex and Link Residual Closeness of Graphs of Given Fractional Matching Number	0
An Improvement for Error-Correcting Pairs of Some Special MDS Codes	0
Node and Link Vulnerability in Complete Multipartite Networks	0
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices	0
The g-Good-Neighbor Conditional Diagnosabilities of Hypermesh Optical Interconnection Networks Under the PMC and Comparison Models	0
On the Super (Edge)-Connectivity of Generalized Johnson Graphs	0
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs	0
Finite Approximations and Similarity of Languages	0
Smooth Subsum Search A Heuristic for Practical Integer Factorization	0
Extremal Binary PFAs with Small Number of States	0
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube	0
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem	0
The Bottom-Up Position Tree Automaton and the Father Automaton	0
Online and Approximate Network Construction from Bounded Connectivity Constraints	0
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice	0
New Constructions of Codebooks Nearly Meeting the Welch Bound	0
Guessing the Buffer Bound for k-Synchronizability	0
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands	0
Online Predictions for Online TSP on the Line	0
Preface	0
Modelling Uncertainty in Architectures of Parametric Component-Based Systems	0
Announcement	0
More Efficient Parallel Integer Sorting	0
Algorithm Design for Asset Trading Under Multiple Factors	0