Infinite Time Busy Beavers. - Oscar Defrain; Bruno Durand 001; Grégory Lafitte (CiE, 2017)

Neighborhood preferences for minimal dominating sets enumeration. - Oscar Defrain; Lhouari Nourine (CoRR, 2018)

Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal Graphs. - Oscar Defrain; Lhouari Nourine (ISAAC, 2019)

Enumerating Minimal Dominating Sets in Triangle-Free Graphs. - Marthe Bonamy; Oscar Defrain; Marc Heinrich; Jean-Florent Raymond (STACS, 2019)

Revisiting a Theorem by Folkman on Graph Colouring. - Marthe Bonamy; Pierre Charbit; Oscar Defrain; Gwenaël Joret; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor; Jean-Sébastien Sereni (Electron. J. Comb., 2020)

Avoidable Paths in Graphs. - Marthe Bonamy; Oscar Defrain; Meike Hatzel; Jocelyn Thiebaut (Electron. J. Comb., 2020)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. - Marthe Bonamy; Oscar Defrain; Piotr Micek; Lhouari Nourine (CoRR, 2020)

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. - Marthe Bonamy; Oscar Defrain; Marc Heinrich; Michal Pilipczuk; Jean-Florent Raymond (ACM Trans. Algorithms, 2020)

Dualization in lattices given by implicational bases. - Oscar Defrain; Lhouari Nourine (Theor. Comput. Sci., 2020)

On the dualization problem in graphs, hypergraphs, and lattices. (Sur le problème de dualisation dans les graphes, hypergraphes, et treillis). - Oscar Defrain (2020)

Close Relatives (Of Feedback Vertex Set), Revisited. - Hugo Jacob 001; Thomas Bellitto; Oscar Defrain; Marcin Pilipczuk (IPEC, 2021)

On the dualization in distributive lattices and related problems. - Oscar Defrain; Lhouari Nourine; Takeaki Uno (Discret. Appl. Math., 2021)

Translating between the representations of a ranked convex geometry. - Oscar Defrain; Lhouari Nourine; Simon Vilmin (Discret. Math., 2021)

On digraphs without onion star immersions. - Lukasz Bozyk; Oscar Defrain; Karolina Okrasa; Michal Pilipczuk (CoRR, 2022)

On objects dual to tree-cut decompositions. - Lukasz Bozyk; Oscar Defrain; Karolina Okrasa; Michal Pilipczuk (J. Comb. Theory B, 2022)

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree. - Valentin Bartier; Oscar Defrain; Fionn Mc Inerney (CoRR, 2023)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. - Laurent Beaudou; Caroline Brosse; Oscar Defrain; Florent Foucaud; Aurélie Lagoutte; Vincent Limouzy; Lucas Pastor (Discret. Math. Theor. Comput. Sci., 2023)

On Vizing's edge colouring question. - Marthe Bonamy; Oscar Defrain; Tereza Klimosová; Aurélie Lagoutte; Jonathan Narboni (J. Comb. Theory B, 2023)

Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. - Valentin Bartier; Oscar Defrain; Fionn Mc Inerney (IWOCA, 2024)

Local Certification of Geometric Graph Classes. - Oscar Defrain; Louis Esperet; Aurélie Lagoutte; Pat Morin; Jean-Florent Raymond (MFCS, 2024)

Polynomial-delay generation of functional digraphs up to isomorphism. - Oscar Defrain; Antonio E. Porreca; Ekaterina Timofeeva (Discret. Appl. Math., 2024)

Sparse graphs without long induced paths. - Oscar Defrain; Jean-Florent Raymond (J. Comb. Theory B, 2024)

On the hardness of inclusion-wise minimal separators enumeration. - Caroline Brosse; Oscar Defrain; Kazuhiro Kurita; Vincent Limouzy; Takeaki Uno; Kunihiro Wasa (Inf. Process. Lett., 2024)

Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs. - Emanuel Elias Silva Castelo; Oscar Defrain; Guilherme C. M. Gomes (WADS, 2025)

On the Enumeration of Signatures of XOR-CNF's. - Nadia Creignou; Oscar Defrain; Frédéric Olive; Simon Vilmin (WADS, 2025)

Enumerating Minimal Solution Sets for Metric Graph Problems. - Benjamin Bergougnoux; Oscar Defrain; Fionn Mc Inerney (Algorithmica, 2025)

Translating between the representations of an acyclic convex geometry of bounded degree. - Oscar Defrain; Arthur Ohana; Simon Vilmin (CoRR, 2025)

A quasi-optimal upper bound for induced paths in sparse graphs. - Basile Couëtoux; Oscar Defrain; Jean-Florent Raymond (CoRR, 2025)

Parameterized complexity of isometric path partition: treewidth and diameter. - Dibyayan Chakraborty; Oscar Defrain; Florent Foucaud; Mathieu Mari; Prafullkumar Tale (CoRR, 2025)