Élise Vandomme

activity

20122020

most citedLeaf realization problem, caterpillar graphs and prefix normal words

11 citations · 16 across the 3 of their papers we have counts for

collaborators

8 papers

math.CO2020

On non-repetitive complexity of Arnoux-Rauzy words

Kateřina Medková, Edita Pelantová, Élise Vandomme

The non-repetitive complexity $n r C_{u}$ and the initial non-repetitive complexity $in r C_{u}$ are functions which reflect the structure of the infinite w…

math.CO2019

Recurrence along directions in multidimensional words

Émilie Charlier, Svetlana Puzynina, Élise Vandomme

In this paper we introduce and study new notions of uniform recurrence in multidimensional words. A $d$ -dimensional word is called \emph{uniformly recurrent} if for all $(s_1,\ldot…

math.CO2018

Critical exponents of infinite balanced words

Narad Rampersad, Jeffrey Shallit, Élise Vandomme

Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+sqrt(2)/2. Over an alphabet of size 4 we construct an infinite balanced word with critica…

math.CO2017★ 11 cited

Leaf realization problem, caterpillar graphs and prefix normal words

Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3

Given a simple graph $G$ with $n$ vertices and a natural number $i \leq n$ , let $L_{G} (i)$ be the maximum number of leaves that can be realized by an induced subtree $T$ of $G$ with…

cs.DS2017★ 5 cited

Fully leafed induced subtrees

Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3

Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i \leq n$ vertices and $ℓ$ leaves in $G$ …

math.CO2014

Identifying codes in vertex-transitive graphs and strongly regular graphs

Sylvain Gravier, Aline Parreau, Sara Rottey +2

We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1…

cs.FL2014

A new approach to the $2$ -regularity of the $ℓ$ -abelian complexity of $2$ -automatic sequences

Aline Parreau, Michel Rigo, Eric Rowland +1

We prove that a sequence satisfying a certain symmetry property is $2$ -regular in the sense of Allouche and Shallit, i.e., the $Z$ -module generated by its $2$ -kernel is fi…

math.CO2012

Constant 2-labellings and an application to (r,a,b)-covering codes

Sylvain Gravier, Elise Vandomme

We introduce the concept of constant $2$ -labelling of a weighted graph and show how it can be used to obtain perfect weighted coverings. Roughly speaking, a constant $2$ -labelling…