27 citations · 53 across the 10 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013★ 2 cited
The complexity of Shortest Common Supersequence for inputs with no identical consecutive letters
Aurélie Lagoutte, Sébastien Tavenas
The Shortest Common Supersequence problem (SCS for short) consists in finding a shortest common supersequence of a finite set of words on a fixed alphabet Sigma. It is well-known t…
cs.DM2013★ 9 cited
Detecting wheels
Emilie Diot, Sébastien Tavenas, Nicolas Trotignon
A \emph{wheel} is a graph made of a cycle of length at least~4 together with a vertex that has at least three neighbors in the cycle. We prove that the problem whose instance is a…