Dominique Sotteau

TL;DR: This paper gives embeddings of complete binary trees into square grids and extended grids with total vertex-congestion 1, i.e., for any vertex x of the extended grid the authors have load(x)+vertex-Congestion(x)⩽1.

TL;DR: This work shows an approximation algorithm that solves the optical routing problem for IA using at most 1.006 times the lower bound on the number of wavelengths, and proves exact bounds on the optimal load induced on an edge for IA, over all shortest-path routing schemes.

TL;DR: The existence of cycles of all lengths in the cube-connected cycles graph is established and it is established that this graph is no far from being pancyclic in cases n odd and bi-pancyclic in case n even.

TL;DR: It is shown that for any integer k and any graph G there exists a partial hypergraph H of some complete h -partite hypergraph K h h x N such that G is the k -line graph of H .

TL;DR: It is proved that, for any p≤d, there exists a spanning directed p-ary tree of depth at most D⌈logpd⌉; in a de Bruijn digraph B(d,D) or in a Kautz digraph K(d),D of degree d and diameter D, which gives directly an upper bound on the broadcast time of these digraphs.