Main content

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.

Have a look at one of our research areas.


Page URL:
Sat Jul 22 01:46:16 CEST 2017
© 2017 Eidgenössische Technische Hochschule Zürich