Curriculum vitae

Grappe Roland

Full Professor
LAMSADE

roland.grappeping@lamsade.dauphinepong.fr
Personal URL

Biography

Since September 2023, I am Professor at LAMSADE at Paris Dauphine-PSL. From 2011 to 2023, I was an Associate Professor in Computer Science at the AOC team of LIPN, Paris 13 University. My research focuses on combinatorial optimization problems involving graphs and polyhedra, with a particular interest in underlying geometrical and matricial aspects. I started exploring polyhedral aspects of combinatorial optimization during my post-doc at the University of Padua, under Michele Conforti's supervision. Previously, I completed my thesis in graph theory in Grenoble, under the guidance of Zoltán Szigeti.

Latest publications

Articles

Chervet P., GRAPPE R., Lacroix M., Pisanu F., Wolfler Calvo R. (2023), Hard problems on box-totally dual integral polyhedra, Discrete Optimization, vol. 50, p. 100810

Barbato M., GRAPPE R., Lacroix M., Lancini E. (2023), Box-total dual integrality and edge-connectivity, Mathematical Programming, vol. 197, n°1, p. 307-336

Barbato M., GRAPPE R., Lacroix M., Lancini E., Wolfler Calvo R. (2022), The Schrijver system of the flow cone in series–parallel graphs, Discrete Applied Mathematics, vol. 308, p. 162-167

Chervet P., GRAPPE R., Robert L-H. (2021), Box-total dual integrality, box-integrality, and equimodular matrices, Mathematical Programming, vol. 188, n°1, p. 319-349

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

David J., GRAPPE R., Lacroix M., Traversi E. (2018), Self-sufficient sets in smartgrids, Electronic Notes in Discrete Mathematics, vol. 69, p. 301-308

GRAPPE R., Lacroix M. (2018), The st-bond polytope on series-parallel graphs, RAIRO - Operations Research, vol. 52, n°3, p. 923-934

Barbato M., GRAPPE R., Lacroix M., Pira C. (2018), Lexicographical polytopes, Discrete Applied Mathematics, vol. 240, p. 3-7

Communications avec actes

GRAPPE R., Lacroix M., Martin S. (2023), The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms, in Claudia Califano ; Achraf Jabeur Telmoudi ; Enrique Herrera Viedma, 2023 9th International Conference on Control, Decision and Information Technologies (CoDIT), IEEE - Institute of Electrical and Electronics Engineers, 956-961 p.

Barbato M., GRAPPE R., Lacroix M., Lancini E. (2020), On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs, in Mourad Baïou, Bernard Gendron, Oktay Günlük, A. Ridha Mahjoub, Combinatorial Optimization, Springer International Publishing, 27-41 p.

Back to the list