Research

During my Ph.D., I most importantly studied the dualization of monotone Boolean functions and its generalizations in graphs, hypergraphs, and lattices: minimal dominating sets enumeration, minimal transversals enumeration, maximal independent sets enumeration, lattice dualization, meet-irreducible enumeration, etc.

• The manuscript can be found here, and a handout of the slides here.
• A page dedicated to implementation aspects may be found here.
• One dedicated to the fundamental aspects may be found here.

Aside from enumeration, I am more generally interested in combinatorics and algorithms: structural graph theory, graph decompositions, immersions, parameterized complexity, etc.

While in master, I also briefly worked on infinite time computation models.

Publication list here.

Somes projects I have coordinated

• ANR JCJC PARADUAL

Somes projects I have participated to

• ERC Cutacombs
• ANR DISTANCIA
• ANR GraphEn

Ph.D. students

• Arthur Ohana (2025–)
• Emanuel Castelo (2024–)

Research links

• Google Scholar
• ORCID
• dblp

Other attended events

CALAMAR 2025 || JGA 2024 || WEPA 2024 || SJAW 2024 || CIRM Thematic Month 2024 || JCALM 2023 || JGA 2023 || WEPA 2022 || JGA 2022 || ICGT 2022 || SGT 2022 || MGT 2021 || JGA 2021 || WG 2021 || IPEC 2021 || WEPA 2020 || JGA 2020 || ISAAC 2019 || WEPA 2019 || PGW 2019 || ICFCA 2019 || STACS 2019 || JGA 2018 || WEPA 2018 || Dagstuhl Seminar 18421, 2018 || PGW 2018 || ICGT 2018 || SGT 2018

I reviewed for TCS, DAM, DMTCS, IWOCA, MFCS, ICFCA, ESA, SODA, STOC.