OOIR: Observatory of International Research

Papers

(The TQCC of Fundamenta Informaticae is 2. 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 2020-04-01 to 2024-04-01.)

Article	Citations
Discovering Object-centric Petri Nets	47
Optimal Personalised Treatment Computation through In Silico Clinical Trials on Patient Digital Twins*	9
Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs	9
A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems	6
A Note of Generalization of Fractional ID-factor-critical Graphs	6
Using Hoare Logic in a Process Algebra Setting	6
Disjunctive Total Domination Subdivision Number of Graphs	6
Parametric Analyses of Attack-fault Trees*	6
Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions	5
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	5
Constructing Node-Independent Spanning Trees in Augmented Cubes	5
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*	5
Finding Minimum Locating Arrays Using a CSP Solver	5
Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search	5
Generative Capacity of Contextual Grammars with Subregular Selection Languages*	4
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference	4
Continuous Domains in Formal Concept Analysis*	4
Mining Clinical Process from Hospital Information System: A Granular Computing Approach	4
Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*	4
Comparing Degenerate Strings	4
Comparison of Different Data Mining Methods to Determine Disease Progression in Dissimilar Groups of Parkinson’s Patients	3
Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees	3
An Improved Set-based Reasoner for the Description Logic ?ℒD4,×†	3
Time-free Solution to Independent Set Problem using P Systems with Active Membranes	3
Free-choice Nets with Home Clusters are Lucent	3

On Combining the Methods of Link Residual and Domination in Networks	3
Solving the Team Composition Problem in a Classroom	3
Small Universal Numerical P Systems with Thresholds for Computing Functions	3
A Novel Ensemble Model - The Random Granular Reflections	3
A Behavioural Theory of Recursive Algorithms	3
Algebraic Structure of Step Traces and Interval Traces	3
Getting There and Back Again	3
Target-oriented Petri Net Synthesis	3
Multi-valued Verification of Strategic Ability	3
Adding Metalogic Features to Knowledge Representation Languages*	3
On Variable Precision Generalized Rough Sets and Incomplete Decision Tables	3
Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks	3
Probabilistic Timed Automata with Clock-Dependent Probabilities	2
Automated Comparative Study of Some Generalized Rough Approximations	2
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model	2
Inferring Unobserved Events in Systems with Shared Resources and Queues	2
On the 2-domination Number of Cylinders with Small Cycles	2
Structure and Power: an Emerging Landscape	2
An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems	2
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs	2
Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability	2
The Structure of Multigranular Rough Sets	2
Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks	2
Theory of Constructive Semigroups with Apartness – Foundations, Development and Practice	2
Dynamic Slicing for Concurrent Constraint Languages	2
Checking Sets of Pure Evolving Association Rules	2
Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors	2
Universal Address Sequence Generator for Memory Built-in Self-test*	2
Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers*	2
Recognizing Visibility Graphs of Triangulated Irregular Networks	2
Additional Closeness and Networks Growth	2
MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*	2
Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*	2
Persistent Stochastic Non-Interference	2
Abstract Contract Synthesis and Verification in the Symbolic ? Framework	2
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic	2
On the Length of Shortest Strings Accepted by Two-way Finite Automata	2
Computing Singular Elements Modulo Squares	2
A Set-theoretic Approach to Reasoning Services for the Description Logic ? ℒ D 4,×	2
KNN Loss and Deep KNN	2
A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ?n	2