Examples are ongoing work on our existing libraries like LEDA or CGAL and planned libraries for handling parallel disks, integer programming or constraint programming as described below. We have developed algorithmic tools which provide a more abstract view of a parallel disk system. The aim of this project is to develop these tools further and implement them on real machines. For more details contact Peter Sanders . Integer programming and constraint programming Internet routing and load balancing algorithms.
Internet traffic is characterized by a high variability.
We are interested in devising routing algorithms that take into account these variability and balance traffic among resources in order to minimize hotspots and delays. For more details contact Berthold V cking . This is an interdisciplinary project involving computational geometry, computer algebra and numerical analysis. Another topic handled in the same context is surface reconstruction from unorganized point sets. For more details contact Edgar Ramos .