Alexandre Vigny

Alexandre Vigny is an Assistant Professor at University Clermont Auvergne in France, focusing on the intersection of logic, algorithms, and graph theory. He has previously held postdoctoral positions at the University of Bremen (2019-2023) and the University of Warsaw (2018-2019), and completed his PhD at University Paris Diderot (2015-2018) under Arnaud Durand and Luc Segoufin.

• Current role: Junior Professor at University Clermont Auvergne (2023-present)
• Postdoctoral experience: University of Bremen (2019-2023), University of Warsaw (2018-2019)
• PhD: University Paris Diderot (2015-2018)

His research interests span theoretical computer science, with a focus on first-order logic, graph algorithms, and complexity analysis. Recent work includes advances in algorithmic meta theorems, reconfiguration problems on sparse graphs, and distributed domination algorithms. Publications highlight applications of logic in solving graph-theoretic problems and query enumeration in database theory.

Key trends in his 2025 publications include lower bounds analysis for dominating sets in sparse graphs, token sliding reconfiguration on DAGs, and elimination distance metrics. Earlier works (2017-2024) cover dynamic query evaluation, monadic stability, and parameterized distributed complexity frameworks.

Teaching roles have included courses in algorithm design, object-oriented programming, database systems, and model theory across Clermont Auvergne, Bremen, and Paris institutions. Co-supervises PhD student Jona Dirks (2024-present) in reconfiguration problems on directed graphs.