My website is . My employer is Télécom Paris (on leave) / Inria. My user page on the French Wikipedia might be more complete.

Paid editing disclosure (inspired by User:David Eppstein): I consider that editing Wikipedia is part of my job (as a researcher in Inria, on leave from an associate professor position in Télécom Paris), so to this extent my edits on Wikipedia pages thematically connected to my job there could be considered as paid edits. However, I do these edits in an entirely self-directed way, and there is no guidance or oversight from my employer on what I edit or how I edit it. In all cases, my edits on Wikipedia are not endorsed by my current or past employers.

Articles to create or improve

• Longest common subsequence: add conditional hardness lower bounds from Strong Exponential Time Hypothesis
• Longest common extension (LCE)
• Yannakakis algorithm, and acyclic conjunctive query (also GYO algorithm)
• graph sparsifier
• Weisfeiler-Leman algorithm, extending Colour refinement algorithm
• hypertree width
• Variety_of_finite_semigroups: fix issues
• Guarded logic: complexity of satisfiability, etc., cf
• Fine-grained complexity (but note that fine-grained reduction exists); OV-conjecture
• algebraic complexity theory, to link from circuit (computer science), circuit complexity, circuits over sets of natural numbers, and algebraic circuit complexity classes
• Karp-Luby sampling
• Feder-Vardi conjecture
• knowledge compilation
• instance-optimal algorithm
• query containment problem
• massively parallel computation model
• conflict-driven clause learning (clarify "cut", etc.)
• unambiguous tree automaton
• Arden's rule generalizing to semiring
• regular path query and C2RPQs etc.
• FPRAS: clarify that the notion of approximation is usually multiplicative not additive

Articles on which I have significantly worked

Note that I mostly do small edits to fix problems in the articles I read. Also, this list is not exhaustive (see my contribution log for more).