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