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 2021-12-01 to 2025-12-01.)

Article	Citations
Note on Two-Stage BP Maximization	23
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices	23
The Partial Diagnosability of Interconnection Networks Under the Strong Hybrid MM* Model	16
Ambiguity Hierarchies for Weighted Tree Automata	15
A Simple 2-Approximation for Maximum-Leaf Spanning Tree	14
Restricted Existence and Approximation Algorithms for PMMS	11
On the Shared Transportation Problem: Computational Hardness and Exact Approach	8
Family Trees for Enumeration	7
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice	7
The Structure Fault Tolerance of Alternating Group Networks	7
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm	6
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands	6
A new class of permutation quadrinomial over ????q2 with characteristic 5	6
Shortest Journeys in Directed Temporal Graphs	6
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets	5
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors	5
On the Smallest Synchronizing Terms of Finite Tree Automata	4
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees	4
Fault-Tolerant Maximal Local-Connectivity on Leaf-Sort Graphs	4
Weighted Linear Dynamic Logic	4
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata	4
Ratio-Based Distortion and Network Distance	3
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions	3
Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance	3
k-Planar Placement and Packing of Δ-Regular Caterpillars	3

An Improvement for Error-Correcting Pairs of Some Special MDS Codes	3
More Efficient Parallel Integer Sorting	3
Structural Synthesis of PLC Program for Real-Time Specification Patterns	2
Balanced-by-Construction Regular and ω-Regular Languages	2
Hamiltonian Paths Passing Through Linear Forests in Hypercubes with Faulty Edges	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	2
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems	2
PSPACE-Completeness of Reversible Deterministic Systems	2
Routing Among Convex Polygonal Obstacles in the Plane	2
The h-Component Diagnosability of Alternating Group Graphs	2
Component Connectivity of 3-Ary n-Cubes	2
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults	2
Modelling Uncertainty in Architectures of Parametric Component-Based Systems	2
Component Connectivity of Alternating Group Networks and Godan Graphs	2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect	2
Reversible Two-Party Computations	2
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid	2
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem	2
On the Super (Edge)-Connectivity of Generalized Johnson Graphs	1
Volume Edited by Magnus Steinby	1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks	1
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time	1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs	1
Certainty in Formalising SMT-LIB for Strings in Isabelle	1
Minimizing I/Os in Out-of-Core Task Tree Scheduling	1
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas	1
Interrelations Between Soft and Ordinary Sets: An Exploration of Soft Filters and Soft Nets	1
The Coordination Mechanism for Scheduling Game with Deterioration Jobs and Uniform-Batch Machines	1
Approximation Algorithms for Partial Vertex Covers in Trees	1
Eulerian and Hamiltonian Soft Semigraphs	1
Tree-Based Generation of Restricted Graph Languages	1
Conditional Fractional Matching Preclusion Number of Graphs	1
Graph Algorithm Based Submodular Function for Sparsest Cut Problem	1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs	1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio	1
Computation of Geometric Color-Spanning Region for Line Segments	1
Non-Submodular Maximization Subject to a Knapsack Constraint on the Integer Lattice	1
A Generalized Pumping Lemma for Weighted Recognizable Languages	1
Locating Number of Biswapped Networks	1
The Seeding and Bi-Criteria Algorithms for Fuzzy k-Median Problem	1
An Upper Bound for Edge Congestion and the Exact Wirelength of Embedding onto BC Graphs	1
Author Index Volume 35 (2024)	1
Online and Approximate Network Construction from Bounded Connectivity Constraints	1
Author Index Volume 32 (2021)	1
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages	1
Online Predictions for Online TSP on the Line	1
The Generalized 4-Connectivity of Bubble-Sort Graphs	1
The h-Faulty-Block Connectivity of n-Dimensional Balanced Hypercube	1
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case	1

Sweeping Input-Driven Pushdown Automata	1
Image-Binary Automata	1
Efficiently Enumerating Spanning Trees of k-Trees	1
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect	1
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design	1