The meeting graph: a new model for loop cyclic register allocation. - Christine Eisenbeis; Sylvain Lelait; Bruno Marmol (PACT, 1995)

A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops. - Sylvain Lelait; Guang R. Gao; Christine Eisenbeis (CC, 1998)

Compiler-Directed Reordering of Data by Cyclic Graph Coloring. - Daniela Genius; Sylvain Lelait (Euro-Par, 1999)

On a Graph-theoretical Model for Cyclic Register Allocation. - Dominique de Werra; Christine Eisenbeis; Sylvain Lelait; Bruno Marmol (Discret. Appl. Math., 1999)

Compilation Techniques for Multimedia Processors. - Andreas Krall; Sylvain Lelait (Int. J. Parallel Program., 2000)

Circular-arc graph coloring: On chords and circuits in the meeting graph. - Dominique de Werra; Christine Eisenbeis; Sylvain Lelait; Elena Stöhr (Eur. J. Oper. Res., 2002)

Efficiently implementing maximum independent set algorithms on circle graphs. - Nicholas Nash; Sylvain Lelait; David Gregg (ACM J. Exp. Algorithmics, 2008)