Acta Informatica

Parametric timed automata (PTA) extend timed automata (TA) with parameters instead of fixed timing constraints, providing the flexibility to accommodate uncertainties during the design phase. Once a parametric model is obtained, the next step is ...

A bipartite graph G(X, Y) is called a star-convex bipartite graph with convexity on X if there is an associated star T(X, F), such that for each vertex in Y, its neighborhood in X induces a subtree in T. A graph G is said to be a split graph if G ...${}_{\mathrm{}}$$\mathrm{}$${}_{\mathrm{}\mathrm{}}$$\mathrm{}$${\mathrm{}}^{{}^{\mathrm{}}}$

Word-representable graphs were introduced in 2008 by Kitaev and Pyatkin in the context of semigroup theory. Graphs are called word-representable if there exists a word with the graph’s nodes as letters such that the letters in the word alternate ...

The Kemeny method is one of the popular tools for rank aggregation. However, computing an optimal Kemeny ranking is $\mathsf{NP}$-hard. Consequently, the computational task of finding a Kemeny ranking has been studied under the lens of parameterized ...$\mathsf{}$$\mathsf{}$

Given a text and a pattern over an alphabet, the classic exact matching problem searches for all occurrences of the pattern in the text. Unlike exact matching, order-preserving pattern matching (OPPM) considers the relative order of elements, ...$$${}^{\mathrm{}}$${}^{\mathrm{}}$$$$$

The linear-size suffix tries (LSTries) (Crochemore et al. in Theor Comput Sci 638:171–178, 2016) are a version of suffix trees in which the edge labels are single characters, yet are able to perform pattern matching queries in optimal time. ...$\mathsf{}\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathsf{}$$\mathsf{}$