I am currently looking for students and collaborators to work with me on theoretical computer science and database theory problems, in the Links team at Inria Lille.

This page lists specific topics. If you would be interested in working with me on other topics closed to my research areas, don't hesitate to get in touch: a3nm<REMOVETHIS>@a3nm.net

Efficient Enumeration via Edits

This proposal is for a PhD about enumeration algorithms (in particular for paths in graphs and for words in languages), co-supervised with Mikaël Monet, in the Links team at Inria Lille, to start in September 2025 (with applications by April 2025).

See the proposal for more details.

Lower Bounds on Provenance and Counting for Recursive Queries

This proposal is for a master's level internship about circuit and counting lower bounds for recursive query evalutaion problems. See the detailed proposal.

This proposal is set in the Links team at Inria Lille.

Enumerating Simple Paths Satisfying a Regular Path Query

This proposal is for a master's level internship about enumeration algorithms for simple path matches of regular path queries. See the detailed proposal.

This proposal is a co-supervision with Mikaël Monet, in the Links team at Inria Lille.

Incremental Maintenance of Queries on Dynamic Trees

This proposal is for a master's level internship about dynamic algorithms to maintain properties of regular languages on trees. See the detailed proposal.

This proposal is a co-supervision with Charles Paperman, in the Links team at Inria Lille.

Tractable Grammars on Probabilistic Words

This proposal is for a bachelor's level internship in theoretical computer science about weighted counting problems for context-free grammars. See the detailed proposal.

This proposal is a co-supervision with Mikaël Monet and Sylvain Salvati, in the Links team at Inria Lille.

Other topics?

I am open to supervising students on many other questions in theoretical computer science. Do not hesitate to contact me to discuss possible directions to work together.

For more problems to work on, you can have a look at my publications (especially the conclusions of papers), or my list of open questions (but with some caveats: many of these problems are not a reasonable target for an internship, and I may not be the most adequate supervisor for some of them; look for the ones with (*) in their title for the ones I recommend).