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

Article	Citations
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	6
Decision Problems on Copying and Shuffling	6
Introduction to Probabilistic Concurrent Systems	5
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	5
Link Residual Closeness of Harary Graphs	5
On the Complexity of Proving Polyhedral Reductions	5
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers	5
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	4
On Finding Hamiltonian Cycles in Barnette Graphs	4
Preface	3
On Morphisms Preserving Palindromic Richness	3
Coverability, Termination, and Finiteness in Recursive Petri Nets	3
Computing Square Roots in Quaternion Algebras	3
A Note on Calculi for Non-deterministic Many-valued Logics	3
Edge Forcing in Butterfly Networks	3
Morphisms and Minimisation of Weighted Automata	3
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????_r	3
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words	3
Formal Concepts and Residuation on Multilattices	3
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications	2
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions	2
Structural Liveness of Immediate Observation Petri Nets	2
Adaptive Merging on Phase Change Memory	2
On Random Number Generation for Kernel Applications	2
Perturbation Results for Distance-edge-monitoring Numbers	2

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	2
The Complexity of Synthesis of b-Bounded Petri Nets	2
Absent Subsequences in Words	2
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios	2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	2
Error Correction for Discrete Tomography	2
Cost Automata, Safe Schemes, and Downward Closures	2
Number Conservation via Particle Flow in One-dimensional Cellular Automata	2
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis	1
Structure and Power: an Emerging Landscape	1
A Note of Generalization of Fractional ID-factor-critical Graphs	1
Symbolic and Structural Model-Checking	1
A Non-Deterministic Multiset Query Language	1
Tomography and Applications	1
Resource Bisimilarity in Petri Nets is Decidable	1
Cost Problems for Parametric Time Petri Nets*	1
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs	1
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs	1
Affine Completeness of Some Free Binary Algebras	1
Complexity and Equivalency of Multiset Dimension and ID-colorings	1
Taking Complete Finite Prefixes To High Level, Symbolically*	1
Time-free Solution to Independent Set Problem using P Systems with Active Membranes	1
Solving Infinite Games in the Baire Space	1
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	1
Preface	1
Optimal Local Identifying and Local Locating-dominating Codes	1
Preface	1
Preface	1
A Congruence-Based Perspective on Finite Tree Automata	1
Acyclic and Cyclic Reversing Computations in Petri Nets	1
Investigating Reversibility of Steps in Petri Nets	1
Preface	1
Computing Parameterized Invariants of Parameterized Petri Nets	1
Spanning Structures in Walker–Breaker Games	1
Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory	1
The Inverse of Ackermann Function is Computable in Linear Time	1
Myhill-Nerode Theorem for Higher-Dimensional Automata	1