The research group Theory and Applications of Algorithms focuses on the following research topics:

  • Efficient algorithms and data structures, and their applications
  • Algorithms engineering
  • Data mining in Computational Science
  • Reliable distributed algorithms and their application in practice
  • High performance/distributed numerical algorithms

» Learn more

Team of research group TAA

Publications of research group TAA

Projects of research group TAA

 News & Events

Paper accepted at FOCS 2024

The paper "Near-Optimal (1 + ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs" by Arnold Filtser, Gramoz Goranci, Neel Patel and Maximilian Probst...

Our papers "On the Two Sides of Redundancy in Graph Neural Networks" and "Approximating the Graph Edit Distance with Compact Neighborhood Representations" have been accepted...

Paper accepted at KDD 2024

The paper "Expander Hierarchies for Normalized Cuts on Graphs" by Kathrin Hanauer, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian Vötsch has been accepted for the...

Paper accepted at KDD 2024

Our paper "Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Leman Go Indifferent" has been accepted at the SIGKDD Conference on Knowledge Discovery and Data...

Paper accepted at ICML2024

The paper "Dynamic Facility Location in High Dimensional Euclidean Spaces" by Sayan Bhattacharya, Gramoz Goranci, Shaofeng H.-C. Jiang, Yi Qian, Yubo Zhang will appear at the...

Paper accepted at SoCG 2024

The paper "Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size" by Joachim Gudmundsson, Martin P. Seybold, and Sampson Wong has...

ALENEX 2024

The following paper with authors Kathrin Hanauer, Martin P. Seybold, and Julian Unterweger from the TAA group will appear at ALENEX 2024.

Three papers accepted to SODA 2024

The following papers with authors from the TAA group will appear at ACM-SIAM Symposium on Discrete Algorithms (SODA24)

 

"Fast Algorithms for Separable Linear Programs" by...