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, FPT, etc.
While in master, I also briefly worked on infinite time computation models.

Publication list here.

---

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

Somes projects I have participated to

• ERC Cutacombs
• ANR DISTANCIA
• ANR GraphEn

Research social media links

• Google Scholar
• ORCID
• dblp