Các bài viết có thể truy cập công khai - Oscar DefrainTìm hiểu thêm
Có tại một số nơi: 14
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
Các cơ quan ủy nhiệm: European Commission, Agence Nationale de la Recherche
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
Các cơ quan ủy nhiệm: European Commission, Agence Nationale de la Recherche
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
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche
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
Các cơ quan ủy nhiệm: European Commission
On the dualization in distributive lattices and related problems
O Defrain, L Nourine, T Uno
Discrete Applied Mathematics 300, 85-96, 2021
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche
Dualization in lattices given by implicational bases
O Defrain, L Nourine
Theoretical Computer Science 814, 169-176, 2020
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche
Translating between the representations of a ranked convex geometry
O Defrain, L Nourine, S Vilmin
Discrete Mathematics 344 (7), 112399, 2021
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche
Sparse graphs without long induced paths
O Defrain, JF Raymond
Journal of Combinatorial Theory, Series B 166, 30-49, 2024
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche
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
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche
Enumerating minimal solution sets for metric graph problems
B Bergougnoux, O Defrain, F Mc Inerney
Algorithmica, 1-24, 2025
Các cơ quan ủy nhiệm: Austrian Science Fund, Agence Nationale de la Recherche
Hypergraph Dualization with -delay Parameterized by the Degeneracy and Dimension
V Bartier, O Defrain, F Mc Inerney
International Workshop on Combinatorial Algorithms, 111-125, 2024
Các cơ quan ủy nhiệm: Austrian Science Fund, Agence Nationale de la Recherche
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
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche, Japan Science and Technology Agency
Polynomial-delay generation of functional digraphs up to isomorphism
O Defrain, AE Porreca, E Timofeeva
Discrete Applied Mathematics 357, 24-33, 2024
Các cơ quan ủy nhiệm: Agence Nationale de la Recherche
Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree
V Bartier, O Defrain, F Mc Inerney
Các cơ quan ủy nhiệm: Austrian Science Fund, Agence Nationale de la Recherche
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ