Suivre
Oscar Defrain
Oscar Defrain
Aix-Marseille Université
Adresse e-mail validée de lis-lab.fr - Page d'accueil
Titre
Citée par
Citée par
Année
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
162019
Dualization in lattices given by implicational bases
O Defrain, L Nourine
Theoretical Computer Science 814, 169-176, 2020
72020
Avoidable paths in graphs
M Bonamy, O Defrain, M Hatzel, J Thiebaut
arXiv preprint arXiv:1908.03788, 2019
72019
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
62020
On the dualization in distributive lattices and related problems
O Defrain, L Nourine, T Uno
Discrete Applied Mathematics 300, 85-96, 2021
52021
Translating between the representations of a ranked convex geometry
O Defrain, L Nourine, S Vilmin
Discrete Mathematics 344 (7), 112399, 2021
52021
On Vizing's edge colouring question
M Bonamy, O Defrain, T Klimošová, A Lagoutte, J Narboni
arXiv preprint arXiv:2107.07900, 2021
32021
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
22022
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
22018
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, ...
arXiv preprint arXiv:2110.14003, 2021
12021
Close Relatives (Of Feedback Vertex Set), Revisited
H Jacob, T Bellitto, O Defrain, M Pilipczuk
arXiv preprint arXiv:2106.16015, 2021
12021
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
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 digraphs without onion star immersions
Ł Bożyk, O Defrain, K Okrasa, M Pilipczuk
arXiv preprint arXiv:2211.15477, 2022
2022
On the dualization problem in graphs, hypergraphs, and lattices
O Defrain
Université Clermont Auvergne(2017-2020), 2020
2020
Infinite Time Busy Beavers
O Defrain, B Durand, G Lafitte
Conference on Computability in Europe, 221-233, 2017
2017
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–16