International Journal of Foundations of Computer Science

Papers
(The TQCC of International Journal of Foundations of Computer Science is 1. 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 2020-11-01 to 2024-11-01.)
ArticleCitations
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks21
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification19
An Improved Helmet Detection Algorithm Based on YOLO V415
Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube13
Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks11
Fuzzy Dynamic Obstacle Avoidance Algorithm for Basketball Robot Based on Multi-Sensor Data Fusion Technology10
The Non-inclusive Diagnosability of Hypercubes under the MM* Model9
Fuzzy Clustering-Based Financial Data Mining System Analysis and Design8
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm7
Error-Free Affine, Unitary, and Probabilistic OBDDs7
Extremal Results on Vertex and Link Residual Closeness7
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest6
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE6
Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks5
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks5
Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy5
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China5
Locating Number of Biswapped Networks5
The Component Diagnosability of General Networks4
A More Reasonable Proof of Cobham’s Theorem4
Component Connectivity of Alternating Group Networks and Godan Graphs4
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms4
An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation4
Generalizations of Checking Stack Automata: Characterizations and Hierarchies4
Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model3
Reconstructing Words from Right-Bounded-Block Words3
Watson–Crick Jumping Finite Automata3
Space Complexity of Stack Automata Models3
Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks3
Securing Smart City Services in Cyber-Physical Systems Using the Computation Annealed Selection Process3
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata3
Alternate Lucas Cubes3
Search on a Line by Byzantine Robots3
Effective Projections on Group Shifts to Decide Properties of Group Cellular Automata3
Semilinearity of Families of Languages3
A Recursive Algorithm for Constructing Dual-CISTs in Hierarchical Folded Cubic Networks2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect2
Generalizations of Code Languages with Marginal Errors2
A Steganography Embedding Method Based on CDF-DWT Technique for Reversible Data Hiding Application Using Elgamal Algorithm2
Special Aquatic Products Supply Chain Coordination Considering Bilateral Green Input in the Context of High-Quality Development2
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults2
Sentiment Analysis of Chinese Reviews Based on BiTCN-Attention Model2
Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels2
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees2
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations2
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees2
Management and Monitoring of Multi-Behavior Recommendation Systems Using Graph Convolutional Neural Networks2
Random Regular Expression Over Huge Alphabets2
Synchronizing Almost-Group Automata2
On the Balancedness of Tree-to-Word Transducers2
Strict Linearizability and Abstract Atomicity2
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid2
Compositions with Constant Weighted Extended Tree Transducers1
The Hardest LL(k) Language1
Recognizing Generating Subgraphs Revisited1
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs1
Improved Approximation Algorithms for Bin Packing with Conflicts1
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities1
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages1
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs1
Graph Convolutional Network-Guided Mine Gas Concentration Predictor1
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees1
New Bounds for Some Topological Indices1
Language Classes of Extended Distributed Reaction Systems1
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami1
Family Trees for Enumeration1
Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages1
The Overlap Gap Between Left-Infinite and Right-Infinite Words1
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas1
Embedding Augmented Cube into Certain Trees and Windmill Graphs1
Balanced-by-Construction Regular and ω-Regular Languages1
HV-Palindromes in Two-Dimensional Words1
(n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn1
The r-Extra Diagnosability of Hyper Petersen Graphs1
Subnetwork Preclusion of (n,k)-Star Networks1
Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks1
Simplifications of Uniform Expressions Specified by Systems1
Tissue P Systems with Vesicles of Multisets1
The Clustered Selected-Internal Steiner Tree Problem1
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata1
Rainbow Domination in Cartesian Product of Paths and Cycles1
Relating Various Types of Distributed Reaction Systems1
Restricted Existence and Approximation Algorithms for PMMS1
Analysis of Vulnerability of Some Transformation Networks1
Further Remarks on the Operational Nonterminal Complexity1
Dyck Words, Lattice Paths, and Abelian Borders1
Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family1
Identifying the Configurations to Operating Efficiency in China’s Life Insurance Industry Using Fuzzy-Set Qualitative Comparative Analysis1
Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata1
Additional Closeness of Cycle Graphs1
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language1
Vertex-Bipartition: A Unified Approach for Kernelization of Graph Linear Layout Problems Parameterized by Vertex Cover1
Descriptional Complexity of Semi-Simple Splicing Systems1
Sensitivity Analysis Contact Reliability of VH-CATT Cylindrical Gear and Its Reliability with Material Strength Degradation1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs1
0.052688837051392