Oscar Defrain

During my PhD, I most importantly studied the dualization of monotone Boolean functions, and its generalizations, through the different shapes it takes on graphs, hypergraphs, and lattices: minimal dominating sets enumeration, minimal transversals enumeration, maximal independent sets enumeration, lattice dualization, meet-irreducible enumeration.
The manuscript can be found here, and a handout of the slides here.

Aside from enumeration, I am more generally interested in combinatorics and algorithms: structural graph theory, graph decompositions, FPT, etc.
While in master, I also briefly worked on infinite time computation models.

International journals

International conference proceedings

Forthcoming works



I reviewed for TCS, DAM, IWOCA, MFCS, ICFCA, SODA, ESA, etc.
My Google scholar and dblp.