1 citations · 1 across the 3 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Cutwidth Bounds via Vertex Partitions
Antoine Amarilli, Benoît Groz
We study the cutwidth measure on graphs and ways to bound the cutwidth of a graph by partitioning its vertices. We consider bounds expressed as a function of two quantities: on the…
cs.DS2025
Linear Time Subsequence and Supersequence Regex Matching
Antoine Amarilli, Bartlomiej Dudek, Florin Manea +2
It is well-known that checking whether a given string matches a given regular expression can be done in quadratic time and that this cannot be improved to…