Alexandre Vigny

Alexandre Vigny is a junior professor at University Clermont Auvergne, France, where he conducts research at the intersection of logic, algorithms, and graph theory. His work focuses on theoretical computer science, particularly in model checking, query enumeration, and distributed algorithms on sparse graph classes.

Research Interests:

• Theoretical Computer Science
• Logic in Computer Science
• Parameterized and Distributed Algorithms
• Graph Theory and Structural Sparsity
• Database Query Evaluation
• Reconfiguration Problems

His recent publications explore algorithmic meta-theorems, first-order logic with connectivity, elimination distance, and distributed domination, primarily on sparse and structurally constrained graphs. His work appears in top venues such as LICS, ICALP, PODS, and JACM.

Scientific Awards:

• No awards explicitly mentioned.

Advising and Grants:

• Co-supervising Jona Dirks, PhD student since October 2024, with Mamadou Kanté.
• No specific grants mentioned, but active in collaborative research with prominent figures like Sebastian Siebertz, Luc Segoufin, and Patrice Ossona de Mendez.

Labs and Teams:

• Previously part of Sebastian Siebertz’s team at the University of Bremen.
• Collaborates with researchers across Europe, including in Warsaw and Paris.
• Involved in the theoretical computer science community, co-organizing the PODC-DARE workshop.