Theoretical Computer Science is a fascinating subject dealing with the foundations of Computer Science. Our theory group has diverse research interests in algorithms and complexity theory. In particular, the areas we work on include:

  • approximation algorithms,
  • complexity theory,
  • exact and parameterized algorithms,
  • data structures

Group Leaders


 Pasted GraphicFabrizio Glandoni

Pasted Graphic Monaldo Mastrolilli

Researchers






PhD Students


Salvatore Ingala
Georgios Stamoulis


Visitors

Zeev Nutov

Recent Visitors


Yuval Rabani
Vincenzo Bonifaci
Danny Hermelin
Kavitha Telikepalli
Andreas Wiese
Laekhanukit Bundit
Lukasz Jez
Adam Kurpisz


Former Members


Dr. Parinya Chalermsook
Dr. Marek Cygan
Prof. Klaus Jansen
Dr. Christoph Ambuhl
Prof. Ola Svensson
Dr. Nikos Mutsanas
Dr. Arash Rafiey