Michael Lampis

Michael Lampis is a Maître de conférences HDR (Assistant Professor) at LAMSADE, Universite Paris Dauphine. His research focuses on theoretical computer science, particularly in approximation algorithms, parameterized complexity, and graph algorithm design. He has held post-doctoral positions at Kyoto University and KTH, Stockholm, and earned his PhD from the Graduate Center of CUNY under Amotz Bar-Noy.

Research Interests include:

• Structural Graph Parameters (treewidth, pathwidth, clique-width)
• Algorithmic Meta-Theorems
• Approximation Schemes
• Combinatorial Optimization
• Computational Complexity

Recent Research Trends highlight his work on parameterized approximation algorithms for graph problems (e.g., feedback vertex set, matching) and complexity analysis of games/puzzles. His projects S-EX-AP-PE-AL (ANR JCJC), COAL-GAS (CNRS-PSL), and collaborations with Japanese institutions (PARAGA, GRAPA) emphasize cross-border innovation.

Scientific Awards include:

• Best Student Paper Award at WG 2025
• Best Paper Award at SOFSEM 2024

Advising involves PhD students Ioannis Katsikarelis, Louis Dublois, and Manolis Vasilakis, alongside Master's advisees like Edouard Nemery and Alban Guerbois. He actively participates in peer review for conferences (ICALP, ESA, STACS) and journals (Algorithmica, JCSS, DAM).