Daniele Catanzaro

Research Activities

I am a computer scientist and an applied mathematician.

My research interests focus on discrete optimization, search algorithms, massive parallelism, and high performance computing. Specific optimization problems I worked on include: linear, nonlinear and uncertain network design problems, (versions of) the Steiner tree problem, colouring, covering, and partitioning problems, routing problems, (generalised versions of) the traveling salesman and the quadratic assignment problems, and nonlinear inverse problems. I am also particularly interested in specific topics from the area of data compression & encryption as well as from bioinformatics, including the development of predictive models for tumorigenesis, genome-wide association studies, and in the combinatorics and computational aspects of molecular evolution and phylogenetics, with special focus on distance methods and balanced minimum evolution.

My research activities have been supported by the Belgian National Fund for Scientific Research, the Louvain Foundation, the U.S. National Institutes of Health, the Belgian American Educational Foundation (BAEF), and the European Marie Curie Fellowship Program.

Mathematical Genealogy