1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2007
Minimum de Bruijn Sequence in a Language with Forbidden Substrings
Eduardo Moreno, Martin Matamala
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, app…
cs.DM2005★ 1 cited
Minimal Eulerian trail in a labeled digraph
Martin Matamala, Eduardo Moreno
Let be an Eulerian directed graph with an arc-labeling such that arcs going out from the same vertex have different labels. In this work, we present an algorithm to construct t…
math.CO2003
Domino tilings and related models: space of configurations of domains with holes
Sebastien Desreux, Martin Matamala, Ivan Rapaport +1
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretat…