Oscar Defrain

According to our database, Oscar Defrain authored at least 23 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., March, 2024

On the enumeration of signatures of XOR-CNF's.

Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin

CoRR, 2024

2023

On Vizing's edge colouring question.

Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni

J. Comb. Theory, Ser. B, March, 2023

Local certification of geometric graph classes.

Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond

CoRR, 2023

Enumerating minimal solution sets for metric graph problems.

Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney

CoRR, 2023

Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree.

Valentin Bartier, Oscar Defrain, Fionn Mc Inerney

CoRR, 2023

Sparse graphs without long induced paths.

Oscar Defrain, Jean-Florent Raymond

CoRR, 2023

2022

On objects dual to tree-cut decompositions.

Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk

J. Comb. Theory, Ser. B, 2022

On digraphs without onion star immersions.

Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk

CoRR, 2022

2021

Translating between the representations of a ranked convex geometry.

Oscar Defrain, Lhouari Nourine, Simon Vilmin

Discret. Math., 2021

On the dualization in distributive lattices and related problems.

Oscar Defrain, Lhouari Nourine, Takeaki Uno

Discret. Appl. Math., 2021

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

CoRR, 2021

Close Relatives (Of Feedback Vertex Set), Revisited.

Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

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

Oscar Defrain

PhD thesis, 2020

Dualization in lattices given by implicational bases.

Oscar Defrain, Lhouari Nourine

Theor. Comput. Sci., 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

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets.

Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine

CoRR, 2020

Avoidable Paths in Graphs.

Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut

Electron. J. Comb., 2020

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

2019

Enumerating Minimal Dominating Sets in Triangle-Free Graphs.

Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P₇-Free and P₈-Free Chordal Graphs.

Oscar Defrain, Lhouari Nourine

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Neighborhood preferences for minimal dominating sets enumeration.

Oscar Defrain, Lhouari Nourine

CoRR, 2018

2017

Infinite Time Busy Beavers.

Oscar Defrain, Bruno Durand, Grégory Lafitte

Proceedings of the Unveiling Dynamics and Complexity, 2017