Discrete Mathematics
My initial training was in mathematics, more specifically graph theory, and I did work for a while with Eldar Fischer, Oded Lachish, and Janos Makowski.
I then worked with Nicolas Schabanel at the end of my Master’s degree, and then during the first half of my thesis, with a focus on dynamic clustering.
I still try to do some research, mostly with Siargey Kachanovich and Sébastien Bouchard. Currently, math-wise I am mostly thinking about submanifold meshing and point location problems, as well as distributed agent problems.
Here are the different papers:
My first paper, on the roots of graph polynomials.
A second that came shortly after but still isn’t published, on paths in $2$-connected graphs.
Our paper with Nicolas Schabanel on Dynamic Clustering (and the corresponding French paper).
A paper with Siargey Kachanovich on counting the number of paths in a constrained control-flow graph.
A second one on the inflating enclosing ball problem.
A preprint on bilingual palindrome generation.
A paper on disabled mobilities that does not have original mathematics but mentions an application of some percolation theory.