Chromatic characterization of biclique covers. - Denis Cornaz; Jean Fonlupt (Discret. Math., 2006)

A linear programming formulation for the maximum complete multipartite subgraph problem. - Denis Cornaz (Math. Program., 2006)

On co-bicliques. - Denis Cornaz (RAIRO Oper. Res., 2007)

The Maximum Induced Bipartite Subgraph Problem with Edge Weights. - Denis Cornaz; Ali Ridha Mahjoub (SIAM J. Discret. Math., 2007)

A one-to-one correspondence between colorings and stable sets. - Denis Cornaz; Vincent Jost (Oper. Res. Lett., 2008)

The sandwich line graph. - Denis Cornaz; Philippe Meurdesoif (Electron. Notes Discret. Math., 2010)

Clique-connecting forest and stable set polytopes. - Denis Cornaz (RAIRO Oper. Res., 2010)

Max-multiflow/min-multicut for G+H series-parallel. - Denis Cornaz (Discret. Math., 2011)

Bounded Single-Peaked Width and Proportional Representation. - Denis Cornaz; Lucie Galand; Olivier Spanjaard (ECAI, 2012)

Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width. - Denis Cornaz; Lucie Galand; Olivier Spanjaard (IJCAI, 2013)

Perfectness of clustered graphs. - Flavia Bonomo; Denis Cornaz; Tínaz Ekim; Bernard Ries (Discret. Optim., 2013)

Packing and covering with linear programming: A survey. - Cédric Bentz; Denis Cornaz; Bernard Ries (Eur. J. Oper. Res., 2013)

Kőnig's edge-colouring theorem for all graphs. - Denis Cornaz; V. H. Nguyen (Oper. Res. Lett., 2013)

Mathematical formulations for the Balanced Vertex k-Separator Problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2014)

On minimal two-edge-connected graphs. - Denis Cornaz; Youcef Magnouche; Ali Ridha Mahjoub (CoDIT, 2014)

Chromatic Gallai identities operating on Lovász number. - Denis Cornaz; Philippe Meurdesoif (Math. Program., 2014)

Solving Vertex Coloring Problems as Maximum Weighted Stable Set Problems. - Denis Cornaz; Fabio Furini; Enrico Malaguti (CTW, 2015)

Solving vertex coloring problems as maximum weight stable set problems. - Denis Cornaz; Fabio Furini; Enrico Malaguti (Discret. Appl. Math., 2017)

The Minimum Rooted-Cycle Cover Problem. - Denis Cornaz; Youcef Magnouche (ISCO, 2018)

Minimal arc-sets spanning dicycles. - Denis Cornaz; Hervé Kerivin; Ali Ridha Mahjoub (Discret. Appl. Math., 2018)

The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut. - Denis Cornaz; Youcef Magnouche; Ali Ridha Mahjoub; Sébastien Martin (Discret. Appl. Math., 2019)

The vertex k-cut problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (Discret. Optim., 2019)

Trader multiflow and box-TDI systems in series-parallel graphs. - Denis Cornaz; Roland Grappe; Mathieu Lacroix 001 (Discret. Optim., 2019)

A note on selective line-graphs and partition colorings. - Denis Cornaz; Fabio Furini; Enrico Malaguti; Alberto Santini (Oper. Res. Lett., 2019)

A characterization of positive spanning sets with ties to strongly connected digraphs. - Denis Cornaz; Sébastien Kerleau; Clément W. Royer (CoRR, 2024)

A characterization of positive spanning sets with ties to strongly edge-connected digraphs. - Denis Cornaz; Sébastien Kerleau; Clément W. Royer (Discret. Appl. Math., 2025)