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