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 2022-08-01 to 2026-08-01.)

Article	Citations
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices	27
The Partial Diagnosability of Interconnection Networks Under the Strong Hybrid MM* Model	17
Ambiguity Hierarchies for Weighted Tree Automata	12
Restricted Existence and Approximation Algorithms for PMMS	12
Note on Two-Stage BP Maximization	10
A Simple 2-Approximation for Maximum-Leaf Spanning Tree	9
On the Shared Transportation Problem: Computational Hardness and Exact Approach	9
The Structure Fault Tolerance of Alternating Group Networks	8
Family Trees for Enumeration	8
A Differentially Private Approximation Algorithm for Submodular Maximization Under a Polymatroid Constraint Over the Integer Lattice	7
A new class of permutation quadrinomial over ????q2 with characteristic 5	6
A Novel Image Clustering Algorithm Based on Supported Nearest Neighbors	5
Fault-Tolerant Maximal Local-Connectivity on Leaf-Sort Graphs	5
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets	4
Shortest Journeys in Directed Temporal Graphs	4
Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands	4
The Restricted Connectivity of Bubble-Sort Star Graphs	4
Optimizing the Online Learners’ Verbal Intention Classification Efficiency Based on the Multi-Head Attention Mechanism Algorithm	4
Approximation Algorithms for the UAV Path Planning with Object Coverage Constraints	3
An Improvement for Error-Correcting Pairs of Some Special MDS Codes	3
Non-Resumable Scheduling on a Single Bounded Parallel-Batch Machine with Flexible Maintenance	3
Weighted Linear Dynamic Logic	3
Some Constructions of Perfect c-Nonlinear and Pseudo-Perfect c-Nonlinear Functions	3
Strong Menger Connectivity of Alternating Group Network Under Subnetwork Failure	3
An Approximation Algorithm for Generalized Connectivity Problem on Planar Graphs	3

k-Planar Placement and Packing of Δ-Regular Caterpillars	3
On the Smallest Synchronizing Terms of Finite Tree Automata	3
PSPACE-Completeness of Reversible Deterministic Systems	3
On Open-End Bin Packing Games	2
Results on the Gowers U2 Norm of Generalized Boolean Functions	2
Ratio-Based Distortion and Network Distance	2
Reversible Two-Party Computations	2
Hamiltonian Paths Passing Through Linear Forests in Hypercubes with Faulty Edges	2
Single-Machine Scheduling with a Deteriorating Maintenance Activity and DeJong’s Learning Effect	2
Modelling Uncertainty in Architectures of Parametric Component-Based Systems	2
Component Connectivity of Alternating Group Networks and Godan Graphs	2
Routing Among Convex Polygonal Obstacles in the Plane	2
The h-Component Diagnosability of Alternating Group Graphs	2
Two Classes of Partitioned Uniform Cyclic Relative Difference Families and Their Applications to Difference Systems of Sets	2
Balanced-by-Construction Regular and ω-Regular Languages	2
Structural Synthesis of PLC Program for Real-Time Specification Patterns	2
Computing a 3-Role Assignment is Polynomial-Time Solvable on Complementary Prisms	1
On the Power of Star-Controlled Insertion-Deletion Systems	1
The Differential Properties of Certain Permutation Polynomials over Finite Fields	1
Improved Approximation Algorithms for Bin Packing with Conflicts	1
Image-Binary Automata	1
Parameterized Algorithms for Fixed-Order Book Drawing with Few Crossings Per Edge	1
Certainty in Formalising SMT-LIB for Strings in Isabelle	1
On the Super (Edge)-Connectivity of Generalized Johnson Graphs	1
NC-ENCE Graph Grammars: Properties and Application to Game Design	1
Eulerian and Hamiltonian Soft Semigraphs	1
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio	1
Non-Submodular Maximization Subject to a Knapsack Constraint on the Integer Lattice	1
Dynamic Reconfiguration of Networks Based on Visual Attention Mechanisms	1
Efficiently Enumerating Spanning Trees of k -Trees	1
A Generalized Pumping Lemma for Weighted Recognizable Languages	1
A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes	1
The h -Faulty-Block Connectivity of n -Dimensional Balanced Hypercube	1
Online and Approximate Network Construction from Bounded Connectivity Constraints	1
Optimizing Maximum Subgraph and Wirelength in WK-Recursive Networks	1
Subnetworks Reliability Analysis of Complete Transposition Networks	1
Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern	1
Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages	1
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time	1
An Upper Bound for Edge Congestion and the Exact Wirelength of Embedding onto BC Graphs	1
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs	1
Embedded Edge Connectivity of Alternating Group Networks	1
Component Connectivity of 3-Ary n-Cubes	1
Online Predictions for Online TSP on the Line	1
The Coordination Mechanism for Scheduling Game with Deterioration Jobs and Uniform-Batch Machines	1
Computation of Geometric Color-Spanning Region for Line Segments	1
The Seeding and Bi-Criteria Algorithms for Fuzzy k -Median Problem	1
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems	1
Approximation Algorithms for Partial Vertex Covers in Trees	1
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid	1

Compositions of Weighted Extended Tree Transducers — The Unambiguous Case	1
Conditional Fractional Matching Preclusion Number of Graphs	1
On the Fault Diameter and Wide Diameter of Locally Exchanged Twisted Cube	1
A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules	1
Locating Number of Biswapped Networks	1
Preface	1
Interrelations Between Soft and Ordinary Sets: An Exploration of Soft Filters and Soft Nets	1
Volume Edited by Magnus Steinby	1
The Generalized 4-Connectivity of Bubble-Sort Graphs	1
Author Index Volume 35 (2024)	1
Sweeping Input-Driven Pushdown Automata	1
Hamiltonian-Based Efficient Algorithms for Legalization with Neighbor Diffusion Effect	1
Graph Algorithm Based Submodular Function for Sparsest Cut Problem	1
The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem	1
Reverse M-polynomial of a Graph	1
Tree-Based Generation of Restricted Graph Languages	1
Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults	1
Properties of Parikh Determinant Under Some Word Operations	1