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-05-01 to 2026-05-01.)
ArticleCitations
A lazy and modular approach to int-blasting21
On integer linear programs for treewidth based on perfect elimination orderings (extended version)12
Reconstruction of SMT proofs with Lambdapi11
Space separating special geffert normal form for succinct representation of star-controlled insertion-deletion systems10
Fast algorithms for window accumulated subsequence matching problem9
Deterministic real-time tree-walking-storage automata8
New orientable sequences5
The Primitive Deficiency of two Primitive Strings5
Visualization of bipartite graphs in limited window size4
Constrained polynomial zonotopes3
On the 3-tree core of plane graphs3
Homeostasis tissue-like P systems with cell separation2
Structure of finite maximal prefix codes with constant average length 42
Parameterized algorithms for the Steiner arborescence problem on a hypercube2
Approximating subset sum ratio via partition computations2
Toward a theory of program repair2
Graphs of order n with exactly $$n+1$$ complementarity eigenvalues2
Internal contextual grammars with resources restricted and structure limited selection2
New families of Laplacian borderenergetic graphs2
Editorial 2023: changes and invariants2
On the piecewise complexity of words2
Reoptimization of parameterized problems1
A binary integer programming-based method for qubit mapping in sparse architectures1
Reachability analysis of linear systems1
A closer look at Hamiltonicity and domination through the lens of diameter and convexity1
Opacity complexity of automatic sequences: the general case1
Dense non-binary Fibonacci codes1
Sweeping permutation automata1
Properties of graphs specified by a regular language1
Watson-Crick finite automata of small size and variants of string assembling systems1
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications1
Cycle encoding-based parameter synthesis for timed automata safety1
Operational complexity and pumping lemmas1
Depth-first search in directed planar graphs, revisited1
Generalized straight-line programs1
Testing membership for timed automata1
0.14009499549866