default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOscar Defrain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Oscar Defrain, Antonio E. Porreca
, Ekaterina Timofeeva:
Polynomial-delay generation of functional digraphs up to isomorphism. Discret. Appl. Math. 357: 24-33 (2024)- [j11]Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. Inf. Process. Lett. 185: 106469 (2024) - [j10]Oscar Defrain, Jean-Florent Raymond:
Sparse graphs without long induced paths. J. Comb. Theory B 166: 30-49 (2024) - [c8]Valentin Bartier, Oscar Defrain, Fionn Mc Inerney:
Hypergraph Dualization with FPT-delay Parameterized by the Degeneracy and Dimension. IWOCA 2024: 111-125 - [c7]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local Certification of Geometric Graph Classes. MFCS 2024: 48:1-48:14 - [c6]Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney:
Enumerating Minimal Solution Sets for Metric Graph Problems. WG 2024: 50-64 - [i18]Nadia Creignou, Oscar Defrain, Frédéric Olive, Simon Vilmin:
On the enumeration of signatures of XOR-CNF's. CoRR abs/2402.18537 (2024) - 2023
- [j9]Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. Discret. Math. Theor. Comput. Sci. 25(2) (2023) - [j8]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. J. Comb. Theory B 159: 126-139 (2023) - [i17]Oscar Defrain, Jean-Florent Raymond:
Sparse graphs without long induced paths. CoRR abs/2304.09679 (2023) - [i16]Valentin Bartier, Oscar Defrain, Fionn Mc Inerney:
Minimal dominating sets enumeration with FPT-delay parameterized by the degeneracy and maximum degree. CoRR abs/2305.06974 (2023) - [i15]Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa:
On the hardness of inclusion-wise minimal separators enumeration. CoRR abs/2308.15444 (2023) - [i14]Benjamin Bergougnoux, Oscar Defrain, Fionn Mc Inerney:
Enumerating minimal solution sets for metric graph problems. CoRR abs/2309.17419 (2023) - [i13]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local certification of geometric graph classes. CoRR abs/2311.16953 (2023) - 2022
- [j7]Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On objects dual to tree-cut decompositions. J. Comb. Theory B 157: 401-428 (2022) - [i12]Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On digraphs without onion star immersions. CoRR abs/2211.15477 (2022) - 2021
- [j6]Oscar Defrain, Lhouari Nourine, Takeaki Uno:
On the dualization in distributive lattices and related problems. Discret. Appl. Math. 300: 85-96 (2021) - [j5]Oscar Defrain, Lhouari Nourine, Simon Vilmin:
Translating between the representations of a ranked convex geometry. Discret. Math. 344(7): 112399 (2021) - [c5]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close Relatives (Of Feedback Vertex Set), Revisited. IPEC 2021: 21:1-21:15 - [i11]Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On objects dual to tree-cut decompositions. CoRR abs/2103.14667 (2021) - [i10]Hugo Jacob, Thomas Bellitto, Oscar Defrain, Marcin Pilipczuk:
Close relatives (of Feedback Vertex Set), revisited. CoRR abs/2106.16015 (2021) - [i9]Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni:
On Vizing's edge colouring question. CoRR abs/2107.07900 (2021) - [i8]Laurent Beaudou, Caroline Brosse, Oscar Defrain, Florent Foucaud, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor:
Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly. CoRR abs/2110.14003 (2021) - 2020
- [b1]Oscar Defrain:
On the dualization problem in graphs, hypergraphs, and lattices. (Sur le problème de dualisation dans les graphes, hypergraphes, et treillis). University of Clermont Auvergne, Clermont-Ferrand, France, 2020 - [j4]Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni:
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): 1 (2020) - [j3]Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut:
Avoidable Paths in Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j2]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms 16(3): 39:1-39:23 (2020) - [j1]Oscar Defrain, Lhouari Nourine:
Dualization in lattices given by implicational bases. Theor. Comput. Sci. 814: 169-176 (2020) - [i7]Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine:
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR abs/2004.07214 (2020)
2010 – 2019
- 2019
- [c4]Oscar Defrain, Lhouari Nourine:
Dualization in Lattices Given by Implicational Bases. ICFCA 2019: 89-98 - [c3]Oscar Defrain, Lhouari Nourine:
Neighborhood Inclusions for Minimal Dominating Sets Enumeration: Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal Graphs. ISAAC 2019: 63:1-63:16 - [c2]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS 2019: 16:1-16:12 - [i6]Oscar Defrain, Lhouari Nourine:
Dualization in lattices given by implicational bases. CoRR abs/1901.07503 (2019) - [i5]Oscar Defrain, Lhouari Nourine, Takeaki Uno:
On the dualization in distributive lattices and related problems. CoRR abs/1902.07004 (2019) - [i4]Oscar Defrain, Lhouari Nourine, Simon Vilmin:
Translating between the representations of a ranked convex geometry. CoRR abs/1907.09433 (2019) - [i3]Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut:
Avoidable paths in graphs. CoRR abs/1908.03788 (2019) - 2018
- [i2]Oscar Defrain, Lhouari Nourine:
Neighborhood preferences for minimal dominating sets enumeration. CoRR abs/1805.02412 (2018) - [i1]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating minimal dominating sets in triangle-free graphs. CoRR abs/1810.00789 (2018) - 2017
- [c1]Oscar Defrain, Bruno Durand, Grégory Lafitte:
Infinite Time Busy Beavers. CiE 2017: 221-233
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 21:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
