Carla’s research is motivated by the practical relevance of combinatorial optimization and integer programming in real-world problems, and it is triggered by applications in various fields, ranging from machine learning to power systems, and from network design to congestion in competitive settings. Her goal is to exploit the polyhedral structure of many combinatorial problems that arise in practice to design efficient algorithms for their solution. On the theoretical side, she is interested in fundamental questions concerning the geometry and the combinatorial structure of polyhedra, and in the computational complexity of combinatorial problems in optimization and game theory.