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

Article	Citations
A lazy and modular approach to int-blasting	21
On integer linear programs for treewidth based on perfect elimination orderings (extended version)	12
Reconstruction of SMT proofs with Lambdapi	11
Space separating special geffert normal form for succinct representation of star-controlled insertion-deletion systems	10
Fast algorithms for window accumulated subsequence matching problem	9
Deterministic real-time tree-walking-storage automata	8
The Primitive Deficiency of two Primitive Strings	5
New orientable sequences	5
Visualization of bipartite graphs in limited window size	4
On the 3-tree core of plane graphs	3
Constrained polynomial zonotopes	3
Approximating subset sum ratio via partition computations	2
Toward a theory of program repair	2
Graphs of order n with exactly $$n+1$$ complementarity eigenvalues	2
Internal contextual grammars with resources restricted and structure limited selection	2
New families of Laplacian borderenergetic graphs	2
Editorial 2023: changes and invariants	2
On the piecewise complexity of words	2
Homeostasis tissue-like P systems with cell separation	2
Structure of finite maximal prefix codes with constant average length 4	2
Parameterized algorithms for the Steiner arborescence problem on a hypercube	2
Sweeping permutation automata	1
Properties of graphs specified by a regular language	1
Watson-Crick finite automata of small size and variants of string assembling systems	1
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications	1

Cycle encoding-based parameter synthesis for timed automata safety	1
Operational complexity and pumping lemmas	1
Depth-first search in directed planar graphs, revisited	1
Generalized straight-line programs	1
Testing membership for timed automata	1
Reoptimization of parameterized problems	1
A binary integer programming-based method for qubit mapping in sparse architectures	1
Reachability analysis of linear systems	1
A closer look at Hamiltonicity and domination through the lens of diameter and convexity	1
Opacity complexity of automatic sequences: the general case	1
Dense non-binary Fibonacci codes	1
Careful synchronization of partial deterministic finite automata	0
A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R	0
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking	0
Word-representable graphs from a word’s perspective	0
Novel tree-search method for synthesizing SMT strategies	0
Tight bounds for the sensitivity of CDAWGs with left-end edits	0
The second step in characterizing a three-word code	0
Exact distributed quantum algorithm for generalized Simon’s problem	0
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times	0
Preface to Klaus-Jörn Lange Festschrift	0
Hypernode automata	0
Invariant relations for affine loops	0
The longest letter-duplicated subsequence and related problems	0
Correction: Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence	0
Deterministic tree-walking-storage automata	0
Alternating complexity of counting first-order logic for the subword order	0
Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence	0
Ramsey achievement games on graphs : algorithms and bounds	0
Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking	0
Linear-size suffix tries and linear-size CDAWGs simplified and improved	0
Fault-tolerance in distance-edge-monitoring sets	0
The thief orienteering problem on 2-terminal series–parallel graphs	0
Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm	0
An efficient alternative strategy for finding prices in envy-free perfect matchings	0
Improving LSH via tensorized random projection	0
Spanning cactus and spanning cactus extension of outerplanar graphs	0
Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms	0
Balancing m-ary search trees with compressions on the fringe	0
Connected feedback vertex set on AT-free graphs	0
On star-k-PCGs: exploring class boundaries for small k values	0
On partial information retrieval: the unconstrained 100 prisoner problem	0
Decentralized runtime verification of message sequences in message-based systems	0
Exploration of k-edge-deficient temporal graphs	0
Simple chain automaton random number generator for IoT devices	0
Effects on distance energy of some special complete multipartite graphs by embedding an edge	0
An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus	0
Simple linear time algorithm for sorting strings in omega-order with applications	0
Comparative genomics with succinct colored de Bruijn graphs	0
Parameterized lower bounds for the weighted vertex cover problem in trees	0

Exact and parameterized algorithms for choosability	0
On the undecidability and descriptional complexity of synchronized regular expressions	0
n-PS-codes, 2-infix-outfix codes and some related classes of codes	0
Reasoning over n-indexed sequences in SMT	0
Pushdown automata and constant height: decidability and bounds	0
Gray-box runtime enforcement of hyperproperties	0
The regular languages of wire linear AC$$^0$$	0
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms	0
Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching	0
Discovering workflow nets of concurrent iterative processes	0
Parameterized aspects of distinct Kemeny rank aggregation	0
On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs	0
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms	0
Distance-edge-monitoring sets of networks	0
A decision procedure for string constraints with string/integer conversion and flat regular constraints	0
Lamplighter groups and automata	0
Explainability requirements as hyperproperties	0
On the change of Seidel energy of the tripartite Turán graph T(n, 3) by an edge embedding	0
Three-word codes $$\{a,\ aba,\ u\}$$ and $$\{a,\ ab,\ v\}$$ having finite completions	0
Editorial 2025: Going Beyond 40	0
Message recovery attack in NTRU through VFK lattices	0
Preserving hyperproperties of programs using primitives with consensus number 2	0
On minimum t-claw deletion in split graphs	0
Editorial 2024: moving forwards in the electronic age	0
Data reduction for directed feedback vertex set on graphs without long induced cycles	0
Distance labeling for families of cycles	0
Symbolic execution for refuting ∀∃ hyperproperties	0
Row-column combination of Dyck words	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