OOIR: Observatory of International Research

Papers

(The median citation count of Acta Informatica 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-09-01 to 2025-09-01.)

Article	Citations
Correction to: Sound reasoning in tock-CSP	10
Reactive bisimulation semantics for a process algebra with timeouts	9
On integer linear programs for treewidth based on perfect elimination orderings (extended version)	8
The Primitive Deficiency of two Primitive Strings	7
Deterministic real-time tree-walking-storage automata	5
Constrained polynomial zonotopes	5
Visualization of bipartite graphs in limited window size	5
On the 3-tree core of plane graphs	4
Homeostasis tissue-like P systems with cell separation	4
Toward a theory of program repair	4
Translation validation of coloured Petri net models of programs on integers	3
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs	3
Approximating subset sum ratio via partition computations	2
Editorial 2023: changes and invariants	2
New families of Laplacian borderenergetic graphs	2
On the piecewise complexity of words	2
Correction to: Reactive synthesis without regret	1
Testing membership for timed automata	1
Depth-first search in directed planar graphs, revisited	1
Operational complexity and pumping lemmas	1
On Huang and Wong’s algorithm for generalized binary split trees	1
Parameterized algorithms for the Steiner arborescence problem on a hypercube	1
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications	1
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction	1
Index appearance record with preorders	1

Properties of graphs specified by a regular language	1
Cycle encoding-based parameter synthesis for timed automata safety	1
A closer look at Hamiltonicity and domination through the lens of diameter and convexity	1
Reoptimization of parameterized problems	1
Generalized straight-line programs	1
A binary integer programming-based method for qubit mapping in sparse architectures	1
Editorial 2024: moving forwards in the electronic age	0
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking	0
Lamplighter groups and automata	0
Three-word codes $$\{a,\ aba,\ u\}$$ and $$\{a,\ ab,\ v\}$$ having finite completions	0
Discovering workflow nets of concurrent iterative processes	0
A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R	0
Improving LSH via tensorized random projection	0
A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model	0
The longest letter-duplicated subsequence and related problems	0
Data reduction for directed feedback vertex set on graphs without long induced cycles	0
Gray-box runtime enforcement of hyperproperties	0
The thief orienteering problem on 2-terminal series–parallel graphs	0
Comparative genomics with succinct colored de Bruijn graphs	0
Reasoning over n-indexed sequences in SMT	0
Invariant relations for affine loops	0
Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence	0
Decentralized runtime verification of message sequences in message-based systems	0
On minimum t-claw deletion in split graphs	0
Tight bounds for the sensitivity of CDAWGs with left-end edits	0
On partial information retrieval: the unconstrained 100 prisoner problem	0
From regular expression matching to parsing	0
The second step in characterizing a three-word code	0
Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms	0
Dense non-binary Fibonacci codes	0
Parameterized aspects of distinct Kemeny rank aggregation	0
Correction: Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence	0
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm	0
Preserving hyperproperties of programs using primitives with consensus number 2	0
Word-representable graphs from a word’s perspective	0
The regular languages of wire linear AC$$^0$$	0
Alternating complexity of counting first-order logic for the subword order	0
Row-column combination of Dyck words	0
Linear-size suffix tries and linear-size CDAWGs simplified and improved	0
Exact distributed quantum algorithm for generalized Simon’s problem	0
On the undecidability and descriptional complexity of synchronized regular expressions	0
Simple chain automaton random number generator for IoT devices	0
Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking	0
A decision procedure for string constraints with string/integer conversion and flat regular constraints	0
Connected feedback vertex set on AT-free graphs	0
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms	0
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times	0
Balancing m-ary search trees with compressions on the fringe	0
Effects on distance energy of some special complete multipartite graphs by embedding an edge	0
Novel tree-search method for synthesizing SMT strategies	0

Reachability analysis of linear systems	0
An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus	0
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms	0
On first-order runtime enforcement of branching-time properties	0
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances	0
Exact and parameterized algorithms for choosability	0
$$\mathcal {L}$$-reduction computation revisited	0
Pushdown automata and constant height: decidability and bounds	0
n-PS-codes, 2-infix-outfix codes and some related classes of codes	0
Improved complement for two-way alternating automata	0
Careful synchronization of partial deterministic finite automata	0
Fault-tolerance in distance-edge-monitoring sets	0
Preface to Klaus-Jörn Lange Festschrift	0
Parameterized lower bounds for the weighted vertex cover problem in trees	0
On star-k-PCGs: exploring class boundaries for small k values	0
Distance-edge-monitoring sets of networks	0
Minimum status of trees with a given degree sequence	0
Exploration of k-edge-deficient temporal graphs	0