Acta Informatica

Papers
(The TQCC of Acta Informatica is 1. 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-01-01 to 2026-01-01.)
ArticleCitations
Reactive bisimulation semantics for a process algebra with timeouts16
The Primitive Deficiency of two Primitive Strings10
Deterministic real-time tree-walking-storage automata10
On integer linear programs for treewidth based on perfect elimination orderings (extended version)10
Visualization of bipartite graphs in limited window size6
On the 3-tree core of plane graphs5
Toward a theory of program repair5
Constrained polynomial zonotopes5
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs4
Translation validation of coloured Petri net models of programs on integers4
Homeostasis tissue-like P systems with cell separation4
Approximating subset sum ratio via partition computations4
New families of Laplacian borderenergetic graphs3
Parameterized algorithms for the Steiner arborescence problem on a hypercube2
On the piecewise complexity of words2
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications2
Watson-Crick finite automata of small size and variants of string assembling systems2
Testing membership for timed automata2
Editorial 2023: changes and invariants2
A closer look at Hamiltonicity and domination through the lens of diameter and convexity2
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction2
Properties of graphs specified by a regular language1
Operational complexity and pumping lemmas1
Dense non-binary Fibonacci codes1
From regular expression matching to parsing1
Cycle encoding-based parameter synthesis for timed automata safety1
Generalized straight-line programs1
A binary integer programming-based method for qubit mapping in sparse architectures1
Revisiting 2–3 red–black trees with a pedagogically sound yet efficient deletion algorithm: parity-seeking1
Depth-first search in directed planar graphs, revisited1
Reoptimization of parameterized problems1
On Huang and Wong’s algorithm for generalized binary split trees1
Balancing m-ary search trees with compressions on the fringe1
Reachability analysis of linear systems1
0.33812308311462