OOIR: Observatory of International Research

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-03-01 to 2024-03-01.)

Article	Citations
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks	20
On Component Connectivity of Hierarchical Star Networks	16
Multilayer Stacked Probabilistic Belief Network-Based Brain Tumor Segmentation and Classification	15
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	9
Super Ck and Sub-Ck Connectivity of k-Ary n-Cube Networks	8
The Non-inclusive Diagnosability of Hypercubes under the MM* Model	8
Error-Free Affine, Unitary, and Probabilistic OBDDs	7
Unpaired Many-to-Many Disjoint Path Cover of Balanced Hypercubest	6
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes	6
Fuzzy Clustering-Based Financial Data Mining System Analysis and Design	6
On g-Extra Conditional Diagnosability of Twisted Hypercubes under MM∗ Model	6
An Improved Helmet Detection Algorithm Based on YOLO V4	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
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm	4
Research on Prediction of Housing Prices Based on GA-PSO-BP Neural Network Model: Evidence from Chongqing, China	4
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks	4
Generalizations of Checking Stack Automata: Characterizations and Hierarchies	4
An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation	4
A More Reasonable Proof of Cobham’s Theorem	4
Reconstructing Words from Right-Bounded-Block Words	3

Semilinearity of Families of Languages	3
Space Complexity of Stack Automata Models	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
Locating Number of Biswapped Networks	3
Selection Algorithms with Small Groups	3
The Component Diagnosability of General Networks	3
Component Connectivity of Alternating Group Networks and Godan Graphs	3
Remarks on k-Clique, k-Independent Set and 2-Contamination in Complementary Prisms	3
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
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
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
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
Language Classes of Extended Distributed Reaction Systems	1
The Clustered Selected-Internal Steiner Tree Problem	1
Descriptional Complexity of Semi-Simple Splicing Systems	1
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
Weak Cost Register Automata are Still Powerful	1
Improved Approximation Algorithms for Bin Packing with Conflicts	1
Cryptanalysis of Cramer-Shoup Like Cryptosystems Based on Index Exchangeable Family	1
Management and Monitoring of Multi-Behavior Recommendation Systems Using Graph Convolutional Neural Networks	1
The r-Extra Diagnosability of Hyper Petersen Graphs	1
Relating Various Types of Distributed Reaction Systems	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
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks	1
Equivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree Automata	1
The Synchronizing Probability Function for Primitive Sets of Matrices	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
Recognizing Generating Subgraphs Revisited	1
(n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn	1
Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs	1
Search on a Line by Byzantine Robots	1

Constructing de Bruijn Sequences Based on a New Necessary Condition	1
Identifying the Configurations to Operating Efficiency in China’s Life Insurance Industry Using Fuzzy-Set Qualitative Comparative Analysis	1
The Hardest LL(k) Language	1
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees	1
Balanced-by-Construction Regular and ω-Regular Languages	1
Embedding Hierarchical Cubic Networks into k-Rooted Complete Binary Trees for Minimum Wirelength	1
Simplifications of Uniform Expressions Specified by 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
Efficient Identification of k-Closed Strings	1
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities	1
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees	1
Dyck Words, Lattice Paths, and Abelian Borders	1
Restricted Existence and Approximation Algorithms for PMMS	1
Embedding Augmented Cube into Certain Trees and Windmill Graphs	1
A New Study of Parikh Matrices Restricted to Terms	1
Analysis of Vulnerability of Some Transformation Networks	1
Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions	1
Further Remarks on the Operational Nonterminal Complexity	1
Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language	1