Etude algorithmique de certaines classes de graphes parfaits : les graphes de parité, les graphes i-triangulés, les graphes parfaits trois chromatiques. (Algorithmic study of somme classes of perfect graphs : parity graphs, I-delta, 3-chromatic perfect graphs). - Michel Burlet (1981)

Polyhedral consequences of the amalgam operation. - Michel Burlet; Jean Fonlupt (Discret. Math., 1994)

A new and improved algorithm for the 3-cut problem. - Michel Burlet; Olivier Goldschmidt (Oper. Res. Lett., 1997)

Minimum weight (T, d)-joins and multi-joins. - Michel Burlet; Alexander V. Karzanov (Discret. Math., 1998)

A sparse version of the ridge logistic regression for large-scale text categorization. - Sujeevan Aseervatham; Anestis Antoniadis; Éric Gaussier; Michel Burlet; Yves Denneulin (Pattern Recognit. Lett., 2011)

Logistic Regression and Text Classification. - Sujeevan Aseervatham; Éric Gaussier; Anestis Antoniadis; Michel Burlet; Yves Denneulin (Textual Information Access: Statistical Models, 2012)