1 citations · 1 across the 3 of their papers we have counts for
5 papers
Graphs with Bounded Push-Pop Walk Orderings
Antoine Amarilli, Claire David, Nadime Francis +3
Consider a directed graph G and the (generally infinite) set Walks(G) of the walks in that graph. We are interested in ordering Walks(G) as w1, w2,... in a way that ensures that ea…
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…
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…
Edge-Minimum Walk of Modular Length in Polynomial Time
Antoine Amarilli, Benoît Groz, Nicole Wein
We study the problem of finding, in a directed graph, an st-walk of length r mod q which is edge-minimum, i.e., uses the smallest number of distinct edges. Despite the vast literat…
Survey of Results on the ModPath and ModCycle Problems
Antoine Amarilli
This note summarizes the state of what is known about the tractability of the problem ModPath, which asks if an input undirected graph contains a simple st-path whose length satisf…