I am currently looking for students and collaborators to work with me on theoretical computer science and database theory problems. 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

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.

We are also open to PhD applications on this topic, with the opportunity to obtain funding for a PhD thesis. See here for a PhD offer on essentially the same topic.

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 and can be located in the DIG team of Télécom Paris or in the Links team at Inria Lille, at the choice of the applicant.

Other topics?

I am open to supervising students on other topics. 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).