default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriel Renault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j11]Rebecca Milley
, Gabriel Renault:
The invertible elements of the monoid of dead-ending misère games. Discret. Math. 345(12): 113084 (2022)- 2020
- [j10]Éric Duchêne, Valentin Gledel, Aline Parreau, Gabriel Renault:
Maker-Breaker domination game. Discret. Math. 343(9): 111955 (2020)
2010 – 2019
- 2018
- [j9]Gabriel Renault:
Invertibility modulo dead-ending no- \(\mathcal {P}\) -universes. Int. J. Game Theory 47(3): 797-809 (2018) - [i6]Éric Duchêne, Valentin Gledel, Aline Parreau, Gabriel Renault:
Maker-Breaker domination game. CoRR abs/1807.09479 (2018) - 2016
- [j8]Julien Bensmail, Gabriel Renault:
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs. Graphs Comb. 32(5): 1707-1721 (2016) - [j7]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj, Gabriel Renault:
Complexity of the game domination problem. Theor. Comput. Sci. 648: 1-7 (2016) - 2015
- [j6]Paul Dorbec, Gasper Kosmrlj, Gabriel Renault:
The domination game played on unions of graphs. Discret. Math. 338(1): 71-79 (2015) - [j5]Gabriel Renault:
Binary Dicots, a Core of Dicot Games. Integers 15: G1 (2015) - [j4]Paul Dorbec, Gabriel Renault, Aaron N. Siegel, Éric Sopena:
Dicots, and a taxonomic ranking for misère games. J. Comb. Theory A 130: 42-63 (2015) - [j3]Gabriel Renault, Simon Schmidt:
On the complexity of the misère version of three games played on graphs. Theor. Comput. Sci. 595: 159-167 (2015) - [c3]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. FSTTCS 2015: 293-306 - [i5]Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault:
Quantitative Games under Failures. CoRR abs/1504.06744 (2015) - [i4]Gabriel Renault:
Invertibility modulo dead-ending no-P-universes. CoRR abs/1509.01576 (2015) - [i3]Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Gasper Kosmrlj, Gabriel Renault:
Complexity of the Game Domination Problem. CoRR abs/1510.00140 (2015) - 2014
- [j2]Éric Duchêne, Gabriel Renault:
Vertex Nim played on graphs. Theor. Comput. Sci. 516: 20-27 (2014) - [i2]Gabriel Renault, Simon Schmidt:
On the Complexity of the Misère Version of Three Games Played on Graphs. CoRR abs/1401.0400 (2014) - 2013
- [b1]Gabriel Renault:
Combinatorial games on graphs. (Jeux combinatoires dans les graphes). University of Bordeaux, France, 2013 - [j1]Rebecca Milley, Gabriel Renault:
Dead ends in misère play: The misère monoid of canonical numbers. Discret. Math. 313(20): 2223-2231 (2013) - 2012
- [i1]Éric Duchêne, Gabriel Renault:
Vertex Nim played on graphs. CoRR abs/1208.0722 (2012) - 2010
- [c2]Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle:
On the Boolean-Width of a Graph: Structure and Applications. WG 2010: 159-170
2000 – 2009
- 2009
- [c1]Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault:
Measuring Permissivity in Finite Games. CONCUR 2009: 196-210
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 2024-06-10 20:30 CEST 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:
