Daniele Catanzaro

Research Projects

This webpage, under construction, lists the current and past research projects carried out so far.

NEWS: Funding opportunities for PhDs and Postdocs are currently available at CORE. Contact me if interested.

Ongoing research projects

  • Title: Advances in computational phylogenetics
    • Funding Source: Belgian National Fund for Scientific Research (FRS-FNRS)
    • Reference: PDR 2021 ref. 40007831
    • Period: 2022-2025
    • Amount: 234 000 euros
    • Role: Principal Investigator
    • Scientific production generated within this project:
      • D. Catanzaro, R. Pesenti, and L. Wolsey. Characterizing path-length matrices of unrooted binary trees.
      • D. Catanzaro, R. Pesenti, A. Sapucaia, and L. Wolsey. On the balanced minimum evolution polytope in the path-length space.
      • Open Problems on Balanced Minimum Evolution. Sumner Workshop 23, Christchurch, New Zealand, February 13-16, 2023.
      • Balanced Minimum Evolution as Cross-Entropy Minimization. DECO 23, Napier, New Zealand, February 7-10, 2023.
      • Balanced Minimum Evolution Problem – Characterizing Path-Length Matrices of UBTs. 32th European Conference on Operations Research (EURO 2022), Espoo, Finland, July 3-6, 2022.
      • Balanced Minimum Evolution Problem – Theoretical & Computational Advances. Mathematical and Computational Evolutionary Biology (MCEB 2022), Chateau d’Oex, Switzerland, June 26-30, 2022.
      • Balanced Minimum Evolution Problem – An information theory perspective. International Symposium on Combinatorial Optimization (ISCO 2022), Paris, May 18- 20, 2022
  • Title: Coalescens
    • Funding Source: Fondation Louvain
    • Reference: “Le numérique au service de l’humaine”
    • Period: 2018 – Ongoing
    • Amount: 140 000 euros
    • Role: Principal Investigator
    • Scientific production generated within this project:
      • D. Catanzaro, M. Frohn, O. Gascuel, and R. Pesenti. A massively parallel exact solution algorithm for the Balanced Minimum Evolution Problem. In progress. TR-06-2021, Center for Operations Research and Econometrics, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
      • 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.
      • D. Catanzaro, S. Coniglio, and F. Furini. On the exact separation of cover inequalities of maximum depth. Optimization Letters, 2021, to appear.
      • D. Catanzaro and R. Pesenti. Enumerating Vertices of the Balanced Minimum Evolution Polytope. Computers and Operations Research, 109, 209-217, 2019.

Past research projects

  • Title: Optimizing over unrooted binary tree: Connecting phylogenetics with information theory
    • Funding Source: Université Catholique de Louvain  
    • Reference: Fonds Speciaux de Recherche 2017
    • Period: 2017-2021
    • Amount: 151 000 euros
    • Role: Principal Investigator
    • Scientific production generated within this project:
      • 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.
      • D. Catanzaro, M. Frohn, and R. Pesenti. A massively parallel exact solution algorithm for the Balanced Minimum Evolution Problem. In progress. TR-06-2021, Center for Operations Research and Econometrics, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
      • D. Catanzaro, M. Frohn, R. Pesenti. Greed, majorization, and their impact on optimization over lattices of unrooted binary trees. In progress. TR-05-2019, Center for Operations Research and Econometrics, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
      • Some Combinatorial Connections between Phylogenetics and Huffman Coding. International Conference 2018 on Applied Combinatorial Optimization (EURO/ALIO 2018), Bologna, Italy, on June 25-27, 2018.
  • Title: Optimizing over unrooted binary tree: Foundations
    • Funding Source: Belgian National Fund for Scientific Research (FRS-FNRS)
    • Reference: CDR S/25-MCF/OL J.0026.17
    • Period: 2017-2019
    • Amount: 20 500 euros
    • Role: Principal Investigator
    • Scientific production generated within this project:
      • D. Catanzaro, R. Pesenti, and L. Wolsey. On the Balanced Minimum Evolution Polytope. Discrete Optimization, 36, 1-33, 2020. (Tech Report: TR)
      • D. Catanzaro and R. Pesenti. Enumerating Vertices of the Balanced Minimum Evolution Polytope. Computers and Operations Research, 109, 209-217, 2019.
      • D. Catanzaro and R. Pesenti. The Pure Parsimony Estimation Problem. In progress.TR-04-2019, Center for Operations Research and Econometrics, Université Catholique de Louvain, Louvain-la-Neuve, Belgium.
      • “On the balanced minimum evolution polytope”. 30th European Conference On Operational Research, Dublin, Ireland, on June 23-26, 2019.
      • The Balanced Minimum Evolution Problem – Part I & Part II: 23st International Symposium on Mathematical Programming (ISMP 2018), Bordeaux, France, on July 1-6, 2018.