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, starting September 2025 onwards.
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@a3nm.net
Query-Directed Width Measures for Probabilistic Graph Homomorphisms¶
This proposal is for a master's level internship about query evaluation on probabilistic data. The goal of the internship is to define width measures on graphs capturing the tractable cases of that problem. See the detailed proposal.
This proposal is a co-supervision with Mikaël Monet and will be located in the Links team at Inria Lille.
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 evaluation problems. See the detailed proposal.
This proposal is set 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).