OOIR: Observatory of International Research

Papers

(The median citation count of Fundamenta Informaticae is 0. 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-08-01 to 2025-08-01.)

Article	Citations
Decision Problems on Copying and Shuffling	11
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	9
Link Residual Closeness of Harary Graphs	6
Introduction to Probabilistic Concurrent Systems	6
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers	6
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	6
On Finding Hamiltonian Cycles in Barnette Graphs	5
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ????_r	5
Minimal Size of Counters for (Real-Time) Multicounter Automata	5
On the Complexity of Proving Polyhedral Reductions	5
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	4
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words	4
A Note on Calculi for Non-deterministic Many-valued Logics	4
Computing Square Roots in Quaternion Algebras	4
Morphisms and Minimisation of Weighted Automata	4
Preface	3
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique	3
On Morphisms Preserving Palindromic Richness	3
Edge Forcing in Butterfly Networks	3
Formal Concepts and Residuation on Multilattices	3
On Boolean Automata Networks (de)Composition1	3
Coverability, Termination, and Finiteness in Recursive Petri Nets	3
Structural Liveness of Immediate Observation Petri Nets	2
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	2
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions	2

The Complexity of Synthesis of b-Bounded Petri Nets	2
Adaptive Merging on Phase Change Memory	2
On Random Number Generation for Kernel Applications	2
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications	2
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios	2
Error Correction for Discrete Tomography	2
Cost Automata, Safe Schemes, and Downward Closures	2
Absent Subsequences in Words	2
Perturbation Results for Distance-edge-monitoring Numbers	2
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines	2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	2
Relations between Control Mechanisms for Sequential Grammars1	2
Number Conservation via Particle Flow in One-dimensional Cellular Automata	2
Acyclic and Cyclic Reversing Computations in Petri Nets	1
Investigating Reversibility of Steps in Petri Nets	1
A Non-Deterministic Multiset Query Language	1
Computing Parameterized Invariants of Parameterized Petri Nets	1
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	1
Preface	1
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs	1
Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion	1
Taking Complete Finite Prefixes To High Level, Symbolically*	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
Solving Infinite Games in the Baire Space	1
Parametric Analyses of Attack-fault Trees*	1
Spanning Structures in Walker–Breaker Games	1
Cost Problems for Parametric Time Petri Nets*	1
Optimal Local Identifying and Local Locating-dominating Codes	1
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars	1
Preface	1
Complexity and Equivalency of Multiset Dimension and ID-colorings	1
A Congruence-Based Perspective on Finite Tree Automata	1
Preface	1
Time-free Solution to Independent Set Problem using P Systems with Active Membranes	1
Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory	1
Tomography and Applications	1
Resource Bisimilarity in Petri Nets is Decidable	1
The Inverse of Ackermann Function is Computable in Linear Time	1
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs	1
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis	1
Compression on the Twisted Jacobi Intersection	1
Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions	0
Descriptional Complexity of Finite Automata – Selected Highlights	0
Preface	0
Preface	0
Nominal Unification and Matching of Higher Order Expressions with Recursive Let	0
Physical Computational Complexity and First-order Logic	0
Universal Address Sequence Generator for Memory Built-in Self-test	0

Waiting Nets: State Classes and Taxonomy	0
On Complexity Bounds and Confluence of Parallel Term Rewriting*	0
Elimination Distance to Bounded Degree on Planar Graphs Preprint	0
Closeness and Vertex Residual Closeness of Harary Graphs	0
Commuting Upper Triangular Binary Morphisms	0
On Insecure Uses of BGN for Privacy Preserving Data Aggregation Protocols	0
Free-choice Nets with Home Clusters are Lucent	0
On Iiro Honkala’s Contributions to Identifying Codes	0
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model	0
Maximal and Minimal Dynamic Petri Net Slicing	0
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3	0
Relation-Algebraic Verification of Disjoint-Set Forests	0
Towards Syntactic Epistemic Logic	0
A Rewriting-logic-with-SMT-based Formal Analysis and Parameter Synthesis Framework for Parametric Time Petri Nets	0
Mining Clinical Process from Hospital Information System: A Granular Computing Approach	0
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes	0
On the Hardness of Energy Minimisation for Crystal Structure Prediction	0
Maximum Centre-Disjoint Mergeable Disks	0
On Three Domination-based Identification Problems in Block Graphs	0
Diffuse and Localized Functional Dysconnectivity in Schizophrenia: a Bootstrapped Top-Down Approach	0
Preface	0
Network Capacity Bound for Personalized PageRank in Multimodal Networks	0
Preface	0
Characteristics of de Bruijn’s early proof checker Automath	0
Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers*	0
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words	0
On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples	0
On the 2-domination Number of Cylinders with Small Cycles	0
Right Buchberger Algorithm over Bijective Skew PBW Extensions	0
Self-stabilisation of Cellular Automata on Tilings	0
Inferring Unobserved Events in Systems with Shared Resources and Queues	0
KNN Loss and Deep KNN	0
Affine Completeness of Some Free Binary Algebras	0
Testing Boolean Functions Properties	0
Preface	0
Skeleton Abstraction for Universal Temporal Properties	0
On Local Antimagic Vertex Coloring for Complete Full t-ary Trees	0
Nonatomic Non-Cooperative Neighbourhood Balancing Games	0
Computing the Length of Sum of Squares and Pythagoras Element in a Global Field	0
A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems	0
Strong Regulatory Graphs	0
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model	0
Boris (Boaz) Trakhtenbrot — The Beginning	0
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues	0
Diameter of General Knödel Graphs	0
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues	0
Daniel Simson Obituary	0
A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ????_n	0
Getting There and Back Again	0
Two Sufficient Conditions for Graphs to Admit Path Factors	0
Decidability of Definability Issues in the Theory of Real Addition	0
String Covering: A Survey	0
The 1966 International Congress of Mathematicians: A Micro-memoir	0
Gathering over Meeting Nodes in Infinite Grid*	0
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ????_r	0
Reconstruction of Convex Sets from One or Two X-rays	0
Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*	0
Preface	0
Methods for Efficient Unfolding of Colored Petri Nets	0
Myhill-Nerode Theorem for Higher-Dimensional Automata	0
On Rotation Distance of Rank Bounded Trees	0
Unfoldings and Coverings of Weighted Graphs	0
On the Tutte and Matching Polynomials for Complete Graphs	0
Preface	0
Theory of Constructive Semigroups with Apartness – Foundations, Development and Practice	0
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs	0
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons	0
Proving Confluence in the Confluence Framework with CONFident	0
A Generalization of Falsity in Finitely-many Valued Logics	0
Preface: Information Granulation in Data Science and Scalable Computing	0
Finding Codes on Infinite Grids Automatically	0
Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees	0
All Graphs with at Most 8 Nodes are 2-interval-PCGs	0
Reachability in Simple Neural Networks	0
Correctness Notions for Petri Nets with Identifiers	0