| 2026 | MFCS | Generating Minimal Redundant and Maximal Irredundant Sets in Incidence Graphs. | Emanuel Elias Silva Castelo, Jrmie Chalopin, Oscar Defrain, Simon Vilmin |
| 2026 | WG | Parameterized Complexity of Isometric Path Partition: Treewidth and Diameter. | Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale |
| 2025 | ISAAC | Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree. | Oscar Defrain, Arthur Ohana, Simon Vilmin |
| 2025 | WADS | Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs. | Emanuel Elias Silva Castelo, Oscar Defrain, Guilherme C. M. Gomes |
| 2025 | WADS | On the Enumeration of Signatures of XOR-CNF's. | Nadia Creignou, Oscar Defrain, Frdric Olive, Simon Vilmin |
| 2024 | IWOCA | Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. | Valentin Bartier, Oscar Defrain, Fionn Mc Inerney |
| 2024 | MFCS | Local Certification of Geometric Graph Classes. | Oscar Defrain, Louis Esperet, Aurlie Lagoutte, Pat Morin, Jean-Florent Raymond |
| 2024 | WG | Enumerating Minimal Solution Sets for Metric Graph Problems. | Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney |
| 2019 | ICFCA | Dualization in Lattices Given by Implicational Bases. | Oscar Defrain, Lhouari Nourine |
| 2019 | ISAAC | Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P | Oscar Defrain, Lhouari Nourine |
| 2019 | STACS | Enumerating Minimal Dominating Sets in Triangle-Free Graphs. | Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond |
| 2017 | CiE | Infinite Time Busy Beavers. | Oscar Defrain, Bruno Durand, Grgory Lafitte |