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

Article	Citations
Decision Problems on Copying and Shuffling	11
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
On the Complexity of Proving Polyhedral Reductions	5
On Finding Hamiltonian Cycles in Barnette Graphs	5
Global Types and Event Structure Semantics for Asynchronous Multiparty Sessions	5
Computing Square Roots in Quaternion Algebras	5
A Note on Calculi for Non-deterministic Many-valued Logics	4
Morphisms and Minimisation of Weighted Automata	4
Structural Liveness of Immediate Observation Petri Nets	3
Formal Concepts and Residuation on Multilattices	3
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	3
Single-sample Versus Case-control Sampling Scheme for Positive Unlabeled Data: the Story of Two Scenarios	3
Perturbation Results for Distance-edge-monitoring Numbers	3
Cost Automata, Safe Schemes, and Downward Closures	2
Error Correction for Discrete Tomography	2
Resource Bisimilarity in Petri Nets is Decidable	2
Adaptive Merging on Phase Change Memory	2
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	2
Number Conservation via Particle Flow in One-dimensional Cellular Automata	2
Absent Subsequences in Words	2
Preface	2
A Note of Generalization of Fractional ID-factor-critical Graphs	1

On the Tutte and Matching Polynomials for Complete Graphs	1
Nonatomic Non-Cooperative Neighbourhood Balancing Games	1
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	1
Tomography and Applications	1
Structure and Power: an Emerging Landscape	1
Taking Complete Finite Prefixes To High Level, Symbolically*	1
Maximal and Minimal Dynamic Petri Net Slicing	1
Preface	1
Computing Parameterized Invariants of Parameterized Petri Nets	1
Solving Infinite Games in the Baire Space	1
Complexity and Equivalency of Multiset Dimension and ID-colorings	1
Affine Completeness of Some Free Binary Algebras	1
Myhill-Nerode Theorem for Higher-Dimensional Automata	1
Preface	1
Preface	1
Optimal Local Identifying and Local Locating-dominating Codes	1
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues	0
Methods for Efficient Unfolding of Colored Petri Nets	0
Proving Confluence in the Confluence Framework with CONFident	0
On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples	0
Waiting Nets: State Classes and Taxonomy	0
The 1966 International Congress of Mathematicians: A Micro-memoir	0
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes	0
Decidability of Definability Issues in the Theory of Real Addition	0
Daniel Simson Obituary	0
Diameter of General Knödel Graphs	0
Finding Codes on Infinite Grids Automatically	0
String Covering: A Survey	0
Commuting Upper Triangular Binary Morphisms	0
Exact Wirelength of Embedding 3-Ary n -Cubes into Certain Cylinders and Trees	0
Preface	0
Boris (Boaz) Trakhtenbrot — The Beginning	0
On Insecure Uses of BGN for Privacy Preserving Data Aggregation Protocols	0
Closeness and Vertex Residual Closeness of Harary Graphs	0
Reconstruction of Convex Sets from One or Two X-rays	0
On Rotation Distance of Rank Bounded Trees	0
On Complexity Bounds and Confluence of Parallel Term Rewriting*	0
Universal Address Sequence Generator for Memory Built-in Self-test	0
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words	0
Preface	0
All Graphs with at Most 8 Nodes are 2-interval-PCGs	0
Reachability in Simple Neural Networks	0
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues	0
Preface	0
Descriptional Complexity of Finite Automata – Selected Highlights	0
Maximum Centre-Disjoint Mergeable Disks	0
A Rewriting-logic-with-SMT-based Formal Analysis and Parameter Synthesis Framework for Parametric Time Petri Nets	0
Strong Regulatory Graphs	0
On Iiro Honkala’s Contributions to Identifying Codes	0
Skeleton Abstraction for Universal Temporal Properties	0

Unfoldings and Coverings of Weighted Graphs	0
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ???? _r	0
Gathering over Meeting Nodes in Infinite Grid*	0
Elimination Distance to Bounded Degree on Planar Graphs Preprint	0
On Three Domination-based Identification Problems in Block Graphs	0
Diffuse and Localized Functional Dysconnectivity in Schizophrenia: a Bootstrapped Top-Down Approach	0
Network Capacity Bound for Personalized PageRank in Multimodal Networks	0
Towards Syntactic Epistemic Logic	0
Relation-Algebraic Verification of Disjoint-Set Forests	0
Two Sufficient Conditions for Graphs to Admit Path Factors	0
Correctness Notions for Petri Nets with Identifiers	0
A Generalization of Falsity in Finitely-many Valued Logics	0