Edge cover by bipartite subgraphs. - Marie-Christine Plateau; Leo Liberti; Laurent Alfandari (CTW, 2007)

Quadratic convex reformulations for quadratic 0-1 programming. - Marie-Christine Plateau (4OR, 2008)

Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations. - Alain Billionnet; Sourour Elloumi; Marie-Christine Plateau (RAIRO Oper. Res., 2008)

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. - Alain Billionnet; Sourour Elloumi; Marie-Christine Plateau (Discret. Appl. Math., 2009)

Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations. - Marie-Christine Plateau; Yasmín Á. Ríos-Solís (Eur. J. Oper. Res., 2010)

Edge cover by connected bipartite subgraphs. - Leo Liberti; Laurent Alfandari; Marie-Christine Plateau (Ann. Oper. Res., 2011)