OOIR: Observatory of International Research

Papers

(The TQCC of Fundamenta Informaticae 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-06-01 to 2026-06-01.)

Article	Citations
Decision Problems on Copying and Shuffling	10
Link Residual Closeness of Harary Graphs	7
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	6
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	6
Introduction to Probabilistic Concurrent Systems	6
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers	5
On the Complexity of Proving Polyhedral Reductions	5
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	5
A Note on Calculi for Non-deterministic Many-valued Logics	4
Computing Square Roots in Quaternion Algebras	4
On Finding Hamiltonian Cycles in Barnette Graphs	4
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios	3
Morphisms and Minimisation of Weighted Automata	3
Formal Concepts and Residuation on Multilattices	3
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	3
Perturbation Results for Distance-edge-monitoring Numbers	3
Structural Liveness of Immediate Observation Petri Nets	2
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	2
Absent Subsequences in Words	2
Cost Automata, Safe Schemes, and Downward Closures	2
Error Correction for Discrete Tomography	2
Adaptive Merging on Phase Change Memory	2
On Random Number Generation for Kernel Applications	2
Structure and Power: an Emerging Landscape	1
Resource Bisimilarity in Petri Nets is Decidable	1

Preface	1
Optimal Local Identifying and Local Locating-dominating Codes	1
Taking Complete Finite Prefixes To High Level, Symbolically*	1
On the Tutte and Matching Polynomials for Complete Graphs	1
Nonatomic Non-Cooperative Neighbourhood Balancing Games	1
Number Conservation via Particle Flow in One-dimensional Cellular Automata	1
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	1
Tomography and Applications	1
A Note of Generalization of Fractional ID-factor-critical Graphs	1
Affine Completeness of Some Free Binary Algebras	1
Maximal and Minimal Dynamic Petri Net Slicing	1
Preface	1
Preface	1
Computing Parameterized Invariants of Parameterized Petri Nets	1
Solving Infinite Games in the Baire Space	1
Preface	1
Myhill-Nerode Theorem for Higher-Dimensional Automata	1
Preface	1
Complexity and Equivalency of Multiset Dimension and ID-colorings	1