We design, analyze, implement and experiment with data structures and algorithms for combinatorial and geometric problems from a variety of application areas. Our focus is on problems involving large data sets and hard optimization questions. The problem areas we consider include spatial data structures and algorithms, optimization problems in railway networks, distributed data and structures, data structures and algorithms for computational biology problems, communication network optimization algorithms, approximation algorithms for packing and covering problems, and other discrete optimization problems. Here is a list of projects that we currently address. Click on project title to obtain more information from the ETH Zuerich Research Database.

To obtain a list of all (together with completed) projects, please, follow this link.