Michael Lampis

Michael Lampis is an Associate Professor at Université Paris Dauphine, specializing in theoretical computer science with a focus on algorithm design, approximation algorithms, and fixed-parameter tractability. His research bridges computational complexity and practical algorithmic solutions for NP-hard problems.

His work explores structural graph parameters, approximation schemes, and parameterized complexity, with applications in game theory, social choice, and combinatorial optimization. Research interests include:

• Design of sub-exponential and parameterized approximation algorithms
• Fine-grained complexity analysis
• Algorithmic meta-theorems for graph width parameters

Lampis has supervised multiple PhD students and leads research projects funded by ANR and international collaborations. His publications demonstrate consistent focus on bridging theoretical foundations with computational efficiency across diverse domains including voting systems, hedonic games, and network design.