Benjamin Hellouin de Menibus

activity

20122019

most citedEntry times in automata with simple defect dynamics

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2018

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width

Benjamin Hellouin de Menibus, Takeaki Uno

In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths,…

cs.DM2018

Aperiodic points in $Z^{2}$ -subshifts

Anael Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier

We consider the structure of aperiodic points in $Z^{2}$ -subshifts, and in particular the positions at which they fail to be periodic. We prove that if a $Z^{2}$ -subshi…

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width

Aperiodic points in Z2-subshifts

Aperiodic points in $Z^{2}$ -subshifts