Research in the Algorithmics group headed by Michael Kaufmann focuses on topics related to algorithmics.
In addition to basic research on graphs and network analysis, the group is concerned with the development of network layout algorithms. Theoretical work provides the basis for the development of tools for visualization of networks in areas such as software or business processes, or for visualization of technical and biological networks.
The group’s applied work includes the Algorithm Engineering für SAT-Solver (Algorithm Engineering for SAT solvers) project in which we develop algorithms to improve the performance of SAT solvers for complex industrial problems. Other algorithmic topics to which we contribute are related to bioinformatics, algorithmic geometry, and of course parallelism.
Waterloo, Ontario, Canada
Sydney, New South Wales, Australia
Tucson, Arizona, United States of America
Perugia, Umbrien, Italy
Athen, Attika, Greece