This page (under construction) lists the current doctoral students under my supervision as well as some doctoral students with who I had strong interactions during their studies.
Martin Frohn
Martin graduated in economathematics at the University of Cologne (2017), under the supervision of Michael Jünger. At present, I am supervising his doctoral studies, which focus on the combinatorics of phylogenetics. So far, Martin authored the following manuscripts:
- D. Catanzaro, M. Frohn, O. Gascuel, and R. Pesenti. A Tutorial on the Balanced Minimum Evolution. European Journal of Operational Research, invited article, minor revision pending, 2021.
- M. Frohn. On the approximability of the Fixed-Tree Balanced Minimum Evolution Problem. Optimization Letters, accepted, 2021.
- D. Catanzaro, M. Frohn, and R. Pesenti. An information theory perspective on the Balanced Minimum Evolution Problem. Operations Research Letters, 48(3): 362-367, 2020.
Martin will defend his doctoral thesis during summer 2021.
Henri Dehaybe
Henri graduated in Management Engineering at the Université Catholique de Louvain (2017). At present, I am co-supervising his doctoral studies, together with my colleague Philippe Chevalier.
- H. Dehaybe, D. Catanzaro, and P. Chevalier. A Deep Reinforcement Learning approach for the Stochastic Inventory Problem. Submitted to Operations Research, 2021.
Roberto Ronco
Roberto is carrying out his doctoral studies in Computer Science and Operations Research at the University of Genoa, Italy, under the supervision of Massimo Paolucci. Large part of his research efforts are currently focusing on scheduling problems. I have collaborated with Roberto in the context of the following article:
- D. Catanzaro, R. Pesenti, R. Ronco. A new fast and accurate solution approach for the automatic scene detection problem. Submitted to Computers and Operations Research, minor revision pending, 2021.
Luciano Porretta
Luciano graduated in Computer Science at the University of l’Aquila, Italy, under my co-supervision (2010). He carried out his doctoral studies at the Graphs and Mathematical Optimization Unit of the Computer Science Department of the Université Libre de Bruxelles, Belgium, under the supervision of my colleague Bernard Fortz. He was awarded the title of Doctor of Sciences in January 2018. I have intensely collaborated with Luciano on a large part of his doctoral studies, focused on models and methods in genome-wide association studies. Our collaboration gave rise to the following articles:
- L. Porretta, D. Catanzaro, B. V. Halldórsson, and B. Fortz. A Branch&Price Algorithm for the Minimum Cost Clique Cover Problem in Max-Point Tolerance Graphs. 4OR, 17(1), 75-96, 2019.
- D. Catanzaro, M. Labbé, and L. Porretta. A class representative model for pure parsimony haplotyping under uncertain data. PLoS One 6(3): e17937, 2011.
Participation to doctoral defense committees
I have been member of the following doctoral defense committees:
- Nikita Doikov. Development of Second-Order Methods for Convex Optimization Problems. Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Louvain School of Engineering, Universitè Catholique de Louvain, June 2016. Member of the Committee.
- Josè Miguel Pesada Perez. Express shipment service network design: Challenges, advances and robustness. Louvain School of Management, Universitè Catholique de Louvain. June 17, 2020. Chairman.
- Luciano Porretta. Models and methods for genome-wide association studies. Graphs and Mathematical Optimization Unit, Computer Science Department, Universitè Libre de Bruxelles, January 2018. Member of the Committee.
- Cyrille Dejemeppe. Abstractions and algorithms for scheduling applications. Institute of Information and Communication Technologies, Electronics and Applied Mathematics, Louvain School of Engineering, Universitè Catholique de Louvain, June 2016. Member of the Committee.
- Veronica Dal Sasso. Branch-and-price approaches for pure-parsimony haplotyping. Department of Mathematics, University of Padua, Italy, December 2016. Member of the Committee.