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

Article	Citations
The Overlap Gap Between Left-Infinite and Right-Infinite Words	22
A Simple 2-Approximation for Maximum-Leaf Spanning Tree	18
Ambiguity Hierarchies for Weighted Tree Automata	13
A Pseudo-Random Generator Whose Output is a Normal Sequence	13
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices	11
Restricted Existence and Approximation Algorithms for PMMS	10
On the Shared Transportation Problem: Computational Hardness and Exact Approach	7
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice	7
Family Trees for Enumeration	7
The Structure Fault Tolerance of Alternating Group Networks	6
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors	5
Shortest Journeys in Directed Temporal Graphs	5
Normalish Amenable Subgroups of the R. Thompson Groups	5
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands	4
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets	4
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm	4
More Efficient Parallel Integer Sorting	3
Weighted Linear Dynamic Logic	3
Non-resumable scheduling on a single bounded parallel-batch machine with flexible maintenance	3
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions	3
k-Planar Placement and Packing of Δ-Regular Caterpillars	3
Component Connectivity of Alternating Group Networks and Godan Graphs	3
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata	3
PSPACE-Completeness of Reversible Deterministic Systems	3
An Improvement for Error-Correcting Pairs of Some Special MDS Codes	3

Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees	3
Balanced-by-Construction Regular and ω-Regular Languages	2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect	2
Results on the Gowers U2 Norm of Generalized Boolean Functions	2
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas	2
Routing Among Convex Polygonal Obstacles in the Plane	2
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults	2
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid	2
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes	2
The h-Component Diagnosability of Alternating Group Graphs	2
Modelling Uncertainty in Architectures of Parametric Component-Based Systems	2
Structural Synthesis of PLC Program for Real-Time Specification Patterns	2
Minimizing I/Os in Out-of-Core Task Tree Scheduling	2
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time	1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio	1
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case	1
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem	1
Alternate Lucas Cubes	1
Efficiently Enumerating Spanning Trees of k-Trees	1
Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages	1
Tree-Based Generation of Restricted Graph Languages	1
On the Super (Edge)-Connectivity of Generalized Johnson Graphs	1
Certainty in Formalising SMT-LIB for Strings in Isabelle	1
Online and Approximate Network Construction from Bounded Connectivity Constraints	1
The h-Faulty-Block Connectivity of n-Dimensional Balanced Hypercube	1
Author Index Volume 35 (2024)	1
The coordination mechanism for scheduling game with deterioration jobs and uniform-batch machines	1
Descriptional Complexity of Semi-Simple Splicing Systems	1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs	1
Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks	1
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect	1
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern	1
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules	1
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design	1
Online Predictions for Online TSP on the Line	1
Image-Binary Automata	1
Volume Edited by Magnus Steinby	1
Locating Number of Biswapped Networks	1
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages	1
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems	1
A Generalized Pumping Lemma for Weighted Recognizable Languages	1
Fault-Tolerant Strong Menger (Edge) Connectivity of DCC Linear Congruential Graphs	1
Author Index Volume 32 (2021)	1
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge	1
Conditional Fractional Matching Preclusion Number of Graphs	1
Eulerian and Hamiltonian Soft Semigraphs	1
Approximation Algorithms for Partial Vertex Covers in Trees	1
Graph Algorithm Based Submodular Function for Sparsest Cut Problem	1
Space Complexity of Stack Automata Models	1