معرفی
Matthieu Rosenfeld is an Assistant Professor at the University of Montpellier, affiliated with the LIRMM laboratory and the ESCAPE team. He teaches in the Computer Science department of IUT Montpellier-Sète.
His research interests include combinatorics, theoretical computer science, and discrete mathematics, focusing on combinatorics on words and graph theory. He frequently employs computer-assisted proofs for avoidability problems.
Recent publications explore topics like nonrepetitive colorings in Euclidean space, undecidability in bilinear systems, Vizing's problem for triangle-free graphs, Shur's conjecture in power-free languages, and word reconstruction via subword queries.
His work often intersects formal languages, graph coloring, and algebraic structures, with applications to automata theory, logic, and algorithm design.
