Cornaz Denis - CV

Articles

Cornaz D., Magnouche Y., Mahjoub A., Martin S. (2019), The multi-terminal vertex separator problem: Polyhedral analysis and Branch-and-Cut, Discrete Applied Mathematics, vol. 256, n°1, p. 11-37

Cornaz D., Furini F., Lacroix M., Malaguti E., Mahjoub A., Martin S. (2019), The vertex k-cut problem, Discrete Optimization, vol. 31, n°1, p. 8-28

Cornaz D., GRAPPE R., Lacroix M. (2019), Trader multiflow and box-TDI systems in series-parallel graphs., Discrete Optimization, vol. 31, n°1, p. 103-114

Cornaz D., Furini F., Malaguti E., Santini A. (2019), A note on selective line-graphs and partition colorings, Operations Research Letters, vol. 47, n°6, p. 565-568

Cornaz D., Kerivin H., Mahjoub A. (2018), Minimal arc-sets spanning dicycles, Discrete Applied Mathematics, vol. 240, n°1, p. 33-43

Cornaz D., Furini F., Malaguti E. (2017), Solving vertex coloring problems as maximum weight stable set problems, Discrete Applied Mathematics, vol. 217, n°2, p. 151-162

Cornaz D., Meurdesoif P. (2014), Chromatic Gallai identities operating on Lovász number, Mathematical Programming, vol. 144, n°1-2, p. 347-368

Ries B., Cornaz D., Ekim T., Bonomo F. (2013), Perfectness of clustered graphs, Discrete Optimization, vol. 10, n°4, p. 296-303

Bentz C., Ries B., Cornaz D. (2013), Packing and covering with linear programming: A survey., European Journal of Operational Research, vol. 227, n°3, p. 409-422

Nguyen V., Cornaz D. (2013), Kőnig’s edge-colouring theorem for all graphs, Operations Research Letters, vol. 41, n°6, p. 592-596

Cornaz D. (2011), Max-multiflow/min-multicut for G+H series-parallel, Discrete Mathematics, vol. 311, n°17, p. 1957-1967

Cornaz D., Meurdesoif P. (2010), The sandwich line-graph, Electronic Notes in Discrete Mathematics, vol. 36, n°1, p. 955-960

Cornaz D. (2010), Clique-connecting forest and stable set polytopes, RAIRO - Operations Research, vol. 44, n°1, p. 73-83

Cornaz D., Jost V. (2008), A one-to-one correspondence between colorings and stable sets, Operations Research Letters, vol. 36, n°6, p. 673-676

Mahjoub A., Cornaz D. (2007), The maximum induced bipartite subgraph problem with edge weights, SIAM Journal on Discrete Mathematics, vol. 21, n°3, p. 662-675

Cornaz D. (2007), On co-bicliques, RAIRO - Operations Research, vol. 41, n°3, p. 295-304

Cornaz D. (2006), A linear programming formulation for the maximum complete multipartite subgraph problem, Mathematical Programming, vol. 105, n°2-3, p. 329-344

Cornaz D., Fonlupt J. (2006), Chromatic characterization of biclique covers, Discrete Mathematics, vol. 306, n°5, p. 495-507

Communications avec actes

Cornaz D., Magnouche Y. (2018), The Minimum Rooted-Cycle Cover Problem, in Jon Lee, Giovanni Rinaldi, A. Ridha Mahjoub, Combinatorial Optimization, Berlin Heidelberg, Springer International Publishing, 115-120 p.

Cornaz D., Magnouche Y., Mahjoub A. (2014), On minimal two-edge-connected graphs, in , 2014 International Conference on Control, Decision and Information Technologies (CoDIT), IEEE - Institute of Electrical and Electronics Engineers, 251-256 p.

Cornaz D., Furini F., Lacroix M., Malaguti E., Mahjoub A., Martin S. (2014), Mathematical formulations for the Balanced Vertex k-Separator Problem, in , 2014 International Conference on Control, Decision and Information Technologies (CoDIT), IEEE - Institute of Electrical and Electronics Engineers, 176-181 p.

Cornaz D., Galand L., Spanjaard O. (2013), Kemeny Elections with Bounded Single-peaked or Single-crossing Width, in , Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), AAAI Press / IJCAI, 76-82 p.

Cornaz D., Galand L., Spanjaard O. (2012), Bounded Single-Peaked Width and Proportional Representation, in , ECAI 2012, 20th European Conference on Artificial Intelligence, Montpellier, IOS Press, 270-275 p.

Mahjoub A., Cornaz D. (2009), Optimiser sur les ensembles d'arêtes des graphes bipartis induits, in Laboratoire lorrain de recherche en informatique et ses applications, ROADEF 2009, extended abstracts, livre des résumés, Nancy, LORIA, 412 p.

Communications sans actes

Cornaz D., Meurdesoif P. (2012), Strengthening Lovász bound for coloring with a new graph transformation, 21st International Symposium on Mathematical Programming (ISMP 2012), Berlin, Allemagne

Cornaz D., Galand L., Spanjaard O. (2012), Bounded single-peaked width and proportional representation, COMSOC 2012, Cracovie, Pologne