Follow
Oscar Defrain
Oscar Defrain
Aix-Marseille Université
Verified email at lis-lab.fr - Homepage
Title
Cited by
Cited by
Year
Enumerating minimal dominating sets in triangle-free graphs
M Bonamy, O Defrain, M Heinrich, JF Raymond
36th International Symposium on Theoretical Aspects of Computer Science …, 2019
192019
Enumerating minimal dominating sets in Kt-free graphs and variants
M Bonamy, O Defrain, M Heinrich, M Pilipczuk, JF Raymond
ACM Transactions on Algorithms (TALG) 16 (3), 1-23, 2020
122020
On Vizing's edge colouring question
M Bonamy, O Defrain, T Klimošová, A Lagoutte, J Narboni
Journal of Combinatorial Theory, Series B 159, 126-139, 2023
102023
Avoidable paths in graphs
M Bonamy, O Defrain, M Hatzel, J Thiebaut
arXiv preprint arXiv:1908.03788, 2019
102019
Dualization in lattices given by implicational bases
O Defrain, L Nourine
Theoretical Computer Science 814, 169-176, 2020
92020
On objects dual to tree-cut decompositions
Ł Bożyk, O Defrain, K Okrasa, M Pilipczuk
Journal of Combinatorial Theory, Series B 157, 401-428, 2022
82022
On the dualization in distributive lattices and related problems
O Defrain, L Nourine, T Uno
Discrete Applied Mathematics 300, 85-96, 2021
82021
Close relatives (of feedback vertex set), revisited
H Jacob, T Bellitto, O Defrain, M Pilipczuk
arXiv preprint arXiv:2106.16015, 2021
82021
Translating between the representations of a ranked convex geometry
O Defrain, L Nourine, S Vilmin
Discrete Mathematics 344 (7), 112399, 2021
72021
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
L Beaudou, C Brosse, O Defrain, F Foucaud, A Lagoutte, V Limouzy, ...
Discrete Mathematics & Theoretical Computer Science 25 (Graph Theory), 2024
32024
Enumerating minimal dominating sets in the (in) comparability graphs of bounded dimension posets
M Bonamy, O Defrain, P Micek, L Nourine
arXiv preprint arXiv:2004.07214, 2020
32020
Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in -free and -free chordal graphs
O Defrain, L Nourine
arXiv preprint arXiv:1805.02412, 2018
32018
Sparse graphs without long induced paths
O Defrain, JF Raymond
Journal of Combinatorial Theory, Series B 166, 30-49, 2024
12024
On the dualization problem in graphs, hypergraphs, and lattices
O Defrain
Université Clermont Auvergne [2017-2020], 2020
12020
Revisiting a theorem by Folkman on graph colouring
M Bonamy, P Charbit, O Defrain, G Joret, A Lagoutte, V Limouzy, L Pastor, ...
arXiv preprint arXiv:1907.11429, 2019
12019
On the hardness of inclusion-wise minimal separators enumeration
C Brosse, O Defrain, K Kurita, V Limouzy, T Uno, K Wasa
Information Processing Letters 185, 106469, 2024
2024
On the enumeration of signatures of XOR-CNF's
N Creignou, O Defrain, F Olive, S Vilmin
arXiv preprint arXiv:2402.18537, 2024
2024
Local certification of geometric graph classes
O Defrain, L Esperet, A Lagoutte, P Morin, JF Raymond
arXiv preprint arXiv:2311.16953, 2023
2023
Enumerating minimal solution sets for metric graph problems
B Bergougnoux, O Defrain, FM Inerney
arXiv preprint arXiv:2309.17419, 2023
2023
Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
V Bartier, O Defrain, F Mc Inerney
2023
The system can't perform the operation now. Try again later.
Articles 1–20