Dimitris Fotakis is an Associate Professor at the School of Electrical and Computer Engineering, National Technical University of Athens. He has been with NTU Athens since Feb. 2009. He graduated from the University of Patras (BEng. 1994, PhD 1999) and previously held a postodoc position with the Max-Planck Institut für Informatik (Postdoc, Sept. 2001 – Sept. 2003), and tenured or tenure track faculty positions with the Aristotle University of Thessaloniki (Dec. 2003 – Oct. 2004) and the University of Aegean (Oct. 2004 – Jan. 2009). He has been a visiting scholar at the University of Liverpool and the Max-Planck Institut für Informatik and a visiting professor at the University of Paris-Dauphine. His research interests lie in the area of Theoretical Computer Science. He works on algorithmic game theory, with emphasis on algorithmic aspects of congestion games and approximate mechanism design without money, and on the design and analysis of approximation and online algorithms, with emphasis on facility location problems. He has published more than 90 papers in major conferences and journals and has served on the program committees of some important conferences (ICALP-A, ESA-A, SWAT, EC, WWW, WINE, SAGT). His research has received more than 1800 citations (according to Google Scholar). His research results include asymptotically optimal algorithms for online and incremental facility location, a potential function for generalizations of congestion games with linear delays, and best possible approximate truthful mechanisms without money for facility location.
Design and Analysis of Algorithms, Algorithmic Game Theory, Approximation and Online Algorithms, Algorithmic Engineering, Computational Complexity, Discrete Mathematics
- Computer Programming (Undergraduate - 1st Semester)
- Introduction to Computer Science (Undergraduate - 3rd Semester)
- Discrete Mathematics (Undergraduate - 4th Semester)
- Algorithms and Complexity (Undergraduate - 7th Semester)
- Advanced Algorithms (Undergraduate - 8th Semester)
- Theoretical Computer Science II: Parallel Algorithms and Complexity (Graduate - Spring Semester)