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-10-01 to 2025-10-01.)
ArticleCitations
Correction to: Sound reasoning in tock-CSP13
Reactive bisimulation semantics for a process algebra with timeouts9
On integer linear programs for treewidth based on perfect elimination orderings (extended version)9
Deterministic real-time tree-walking-storage automata7
Visualization of bipartite graphs in limited window size5
Constrained polynomial zonotopes5
The Primitive Deficiency of two Primitive Strings5
On the 3-tree core of plane graphs4
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs4
Toward a theory of program repair4
New families of Laplacian borderenergetic graphs3
Translation validation of coloured Petri net models of programs on integers3
Homeostasis tissue-like P systems with cell separation3
Parameterized algorithms for the Steiner arborescence problem on a hypercube2
Approximating subset sum ratio via partition computations2
Editorial 2023: changes and invariants2
On the piecewise complexity of words2
On Huang and Wong’s algorithm for generalized binary split trees1
Dense non-binary Fibonacci codes1
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
Cycle encoding-based parameter synthesis for timed automata safety1
Correction to: Reactive synthesis without regret1
A closer look at Hamiltonicity and domination through the lens of diameter and convexity1
Operational complexity and pumping lemmas1
Depth-first search in directed planar graphs, revisited1
Balancing m-ary search trees with compressions on the fringe1
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction1
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications1
Index appearance record with preorders1
Properties of graphs specified by a regular language1
Reachability analysis of linear systems1
Generalized straight-line programs1
Reoptimization of parameterized problems1
Testing membership for timed automata1
0.078177928924561