7 citations · 19 across the 12 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2016
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices
Emeric Gioan, Kevin Sol, Gérard Subsol
Provided n points in an (n-1)-dimensional affine space, and one ordering of the points for each coordinate, we address the problem of testing whether these orderings determine if t…
cs.DM2013★ 1 cited
Computation with No Memory, and Rearrangeable Multicast Networks
Serge Burckel, Emeric Gioan, Emmanuel Thomé
We investigate the computation of mappings from a set S^n to itself with "in situ programs", that is using no extra variables than the input, and performing modifications of one co…
cs.DM2008★ 1 cited
Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs
Emeric Gioan, Christophe Paul
In this paper, we revisit the split decomposition of graphs and give new combinatorial and algorithmic results for the class of totally decomposable graphs, also known as the dista…