Oscar Defrain - RankMe

50 papers A 1B 7C 3Journal 38

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. Discret. Math. Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
2026	J	`jnl`	Generating minimal redundant and maximal irredundant sets in incidence graphs. CoRR Emanuel Elias Silva Castelo, Jérémie Chalopin, Oscar Defrain, Simon Vilmin
2026	J	`jnl`	On digraphs without onion star immersions. J. Comb. Theory B Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2025	J	`jnl`	A quasi-optimal upper bound for induced paths in sparse graphs. CoRR Basile Couëtoux, Oscar Defrain, Jean-Florent Raymond
2025	B	`conf`	Enumerating Minimal Dominating Sets and Variants in Chordal Bipartite Graphs. WADS Emanuel Elias Silva Castelo, Oscar Defrain, Guilherme C. M. Gomes
2025	J	`jnl`	Enumerating Minimal Solution Sets for Metric Graph Problems. Algorithmica Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2025	J	`jnl`	Enumerating minimal dominating sets and variants in chordal bipartite graphs. CoRR Emanuel Elias Silva Castelo, Oscar Defrain, Guilherme C. M. Gomes
2025	B	`conf`	Enumerating the Irreducible Closed Sets of an Acyclic Implicational Base of Bounded Degree. ISAAC Oscar Defrain, Arthur Ohana, Simon Vilmin
2025	B	`conf`	On the Enumeration of Signatures of XOR-CNF's. WADS Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin
2025	J	`jnl`	Parameterized complexity of isometric path partition: treewidth and diameter. CoRR Dibyayan Chakraborty, Oscar Defrain, Florent Foucaud, Mathieu Mari, Prafullkumar Tale
2025	J	`jnl`	Translating between the representations of an acyclic convex geometry of bounded degree. CoRR Oscar Defrain, Arthur Ohana, Simon Vilmin
2024	B	`conf`	Enumerating Minimal Solution Sets for Metric Graph Problems. WG Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2024	C	`conf`	Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. IWOCA Valentin Bartier, Oscar Defrain, Fionn Mc Inerney
2024	B	`conf`	Local Certification of Geometric Graph Classes. MFCS Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
2024	J	`jnl`	On the enumeration of signatures of XOR-CNF's. CoRR Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin
2024	J	`jnl`	On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2024	J	`jnl`	Polynomial-delay generation of functional digraphs up to isomorphism. Discret. Appl. Math. Oscar Defrain, Antonio E. Porreca, Ekaterina Timofeeva
2024	J	`jnl`	Sparse graphs without long induced paths. J. Comb. Theory B Oscar Defrain, Jean-Florent Raymond
2023	J	`jnl`	Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. Discret. Math. Theor. Comput. Sci. Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2023	J	`jnl`	Enumerating minimal solution sets for metric graph problems. CoRR Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney
2023	J	`jnl`	Local certification of geometric graph classes. CoRR Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
2023	J	`jnl`	Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree. CoRR Valentin Bartier, Oscar Defrain, Fionn Mc Inerney
2023	J	`jnl`	On Vizing's edge colouring question. J. Comb. Theory B Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
2023	J	`jnl`	On the hardness of inclusion-wise minimal separators enumeration. CoRR Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa
2023	J	`jnl`	Sparse graphs without long induced paths. CoRR Oscar Defrain, Jean-Florent Raymond
2022	J	`jnl`	On digraphs without onion star immersions. CoRR Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2022	J	`jnl`	On objects dual to tree-cut decompositions. J. Comb. Theory B Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2021	B	`conf`	Close Relatives (Of Feedback Vertex Set), Revisited. IPEC Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
2021	J	`jnl`	Close relatives (of Feedback Vertex Set), revisited. CoRR Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk
2021	J	`jnl`	Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor
2021	J	`jnl`	On Vizing's edge colouring question. CoRR Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
2021	J	`jnl`	On objects dual to tree-cut decompositions. CoRR Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
2021	J	`jnl`	On the dualization in distributive lattices and related problems. Discret. Appl. Math. Oscar Defrain, Lhouari Nourine, Takeaki Uno
2021	J	`jnl`	Translating between the representations of a ranked convex geometry. Discret. Math. Oscar Defrain, Lhouari Nourine, Simon Vilmin
2020	J	`jnl`	Avoidable Paths in Graphs. Electron. J. Comb. Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
2020	J	`jnl`	Dualization in lattices given by implicational bases. Theor. Comput. Sci. Oscar Defrain, Lhouari Nourine
2020	J	`jnl`	Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
2020	J	`jnl`	Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
2020	—	`—`	On the dualization problem in graphs, hypergraphs, and lattices. (Sur le problème de dualisation dans les graphes, hypergraphes, et treillis). Oscar Defrain
2020	J	`jnl`	Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
2019	J	`jnl`	Avoidable paths in graphs. CoRR Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
2019	C	`conf`	Dualization in Lattices Given by Implicational Bases. ICFCA Oscar Defrain, Lhouari Nourine
2019	J	`jnl`	Dualization in lattices given by implicational bases. CoRR Oscar Defrain, Lhouari Nourine
2019	A	`conf`	Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
2019	B	`conf`	Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P ISAAC Oscar Defrain, Lhouari Nourine
2019	J	`jnl`	On the dualization in distributive lattices and related problems. CoRR Oscar Defrain, Lhouari Nourine, Takeaki Uno
2019	J	`jnl`	Translating between the representations of a ranked convex geometry. CoRR Oscar Defrain, Lhouari Nourine, Simon Vilmin
2018	J	`jnl`	Enumerating minimal dominating sets in triangle-free graphs. CoRR Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
2018	J	`jnl`	Neighborhood preferences for minimal dominating sets enumeration. CoRR Oscar Defrain, Lhouari Nourine
2017	C	`conf`	Infinite Time Busy Beavers. CiE Oscar Defrain, Bruno Durand, Grégory Lafitte