Florin Manea

activity

20092026

most citedThe Hardness of Solving Simple Word Equations

3 citations · 5 across the 8 of their papers we have counts for

collaborators

Showing cs.DSShow all

6 papers · 1 filter

cs.DS2026

Tractable Gap-Constraint Languages for Complex Event Recognition

Antoine Amarilli, Florin Manea, Tina Ringleb +1

For strings $u, D \in Σ^{*}$ , a subsequence embedding of $u$ in $D$ is a function $e : {1, 2, \dots, ∣ u ∣} \to {1, 2, \dots, ∣ D ∣}$ with $e (i) < e (i + 1)$ for every $i \in \{1…

cs.DS2023★ 1 cited

Longest Common Subsequence with Gap Constraints

Duncan Adamson, Maria Kosche, Tore Koß +2

We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the d…

cs.DS2021

Matching Patterns with Variables under Hamming Distance

Paweł Gawrychowski, Florin Manea, Stefan Siemer

A pattern $α$ is a string of variables and terminal letters. We say that $α$ matches a word $w$ , consisting only of terminal letters, if $w$ can be obtained by replacing the variab…

cs.DS2020

The Edit Distance to $k$ -Subsequence Universality

Pamela Fleischmann, Maria Kosche, Tore Koß +2

A word $u$ is a subsequence of another word $w$ if $u$ can be obtained from $w$ by deleting some of its letters. The word $w$ with alph $(w) = Σ$ is called $k$ -subsequence universal i…

cs.DS2019

Matching Patterns with Variables

Florin Manea, Markus L. Schmid

A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching…

cs.DS2018

Fast and Longest Rollercoasters

Paweł Gawrychowski, Florin Manea, Radosław Serafin

For $k \geq 3$ , a k-rollercoaster is a sequence of numbers whose every maximal contiguous subsequence, that is increasing or decreasing, has length at least $k$ ; $3$ -rollercoasters…