معرفی
Oscar Defrain is an Associate Professor at Aix-Marseille University, affiliated with the Laboratoire d’Informatique et Systèmes (LIS UMR CNRS 7020) and the ACRO team. He holds a Ph.D. from Université Clermont Auvergne (2020) and completed a postdoc at the University of Warsaw. His research focuses on algorithms and combinatorics in graphs, hypergraphs, and lattice structures, with expertise in minimal dominating sets, maximal independent sets, and Boolean function dualization.
- Education: Ph.D. in Computer Science, Université Clermont Auvergne (2020)
Research Interests: Defrain specializes in structural graph theory, hypergraph dualization, and algorithmic enumeration. His work spans combinatorial optimization, parameterized complexity, and lattice theory, with recent contributions to geometric graph certification, metric graph problems, and XOR-CNF signature enumeration. He coordinates the ANR JCJC PARADUAL project and participates in ERC Cutacombs and ANR DISTANCIA.
Recent Publications (2024-2025) examine quasi-optimal bounds for induced paths, polynomial-delay isomorphism generation, hypergraph dualization with FPT-delay, and geometric graph certification. These works intersect graph algorithms, combinatorics, and theoretical computer science.
Teaching: Defrain teaches graph theory, algorithmic enumeration, and programming (Java/Python) at Aix-Marseille University (M1, L1, L2) and Université Clermont Auvergne (M1, L3). He uses platforms like Moodle and AMeTICE for course materials.
