default search action
Valentin Gledel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney
, Mehdi Mhalla, Aline Parreau:
Smash and grab: The 0 ⋅ 6 scoring game on graphs. Theor. Comput. Sci. 990: 114417 (2024) - [c3]Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. FUN 2024: 2:1-2:12 - [i8]Guillaume Bagan, Éric Duchêne, Florian Galliot, Valentin Gledel, Mirjana Mikalacki, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Poset Positional Games. CoRR abs/2404.07700 (2024) - [i7]Guillaume Bagan, Éric Duchêne, Valentin Gledel, Tuomo Lehtilä, Aline Parreau:
Partition strategies for the Maker-Breaker domination game. CoRR abs/2406.15165 (2024) - [i6]Valentin Gledel, Gerold Jäger:
On the Metric Dimension of Ka ⨉ Kb ⨉ Kc. CoRR abs/2408.17229 (2024) - 2023
- [j8]Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A Note on the Flip Distance between Non-crossing Spanning Trees. Comput. Geom. Topol. 2(1): 8:1-8:7 (2023) - [c2]Valentin Gledel, Nacim Oijid
Avoidance Games Are PSPACE-Complete. STACS 2023: 34:1-34:19 - [i5]Éric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Milos Stojakovic:
Complexity of Maker-Breaker Games on Edge Sets of Graphs. CoRR abs/2302.10972 (2023) - [i4]Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron:
A note on the flip distance between non-crossing spanning trees. CoRR abs/2303.07710 (2023) - 2021
- [j7]Guillaume Bagan, Valentin Gledel, Marc Heinrich, Fionn Mc Inerney
Weighted total acquisition. Discret. Appl. Math. 304: 260-282 (2021) - 2020
- [j6]Valentin Gledel, Michael A. Henning, Vesna Irsic, Sandi Klavzar:
Maker-Breaker total domination game. Discret. Appl. Math. 282: 96-107 (2020) - [j5]Éric Duchêne, Valentin Gledel, Aline Parreau, Gabriel Renault:
Maker-Breaker domination game. Discret. Math. 343(9): 111955 (2020) - [j4]Prosenjit Bose, Valentin Gledel, Claire Pennarun
Power domination on triangular grids with triangular and hexagonal shape. J. Comb. Optim. 40(2): 482-500 (2020)
2010 – 2019
- 2019
- [b1]Valentin Gledel:
Couverture de sommets sous contraintes. (Vertex covering under constraints). University of Lyon, France, 2019 - [j3]Valentin Gledel, Vesna Irsic, Sandi Klavzar
Strong geodetic cores and Cartesian product graphs. Appl. Math. Comput. 363 (2019) - [j2]Valentin Gledel
Identification of points using disks. Discret. Math. 342(1): 256-269 (2019) - [j1]Antoine Dailly, Valentin Gledel, Marc Heinrich:
A generalization of Arc-Kayles. Int. J. Game Theory 48(2): 491-511 (2019) - [c1]Valentin Gledel, Vesna Irsic, Sandi Klavzar:
Fast Winning Strategies for the Maker-Breaker Domination Game. LAGOS 2019: 473-484 - 2018
- [i3]Éric Duchêne, Valentin Gledel, Aline Parreau, Gabriel Renault:
Maker-Breaker domination game. CoRR abs/1807.09479 (2018) - 2017
- [i2]Valentin Gledel, Aline Parreau:
Identification of points using disks. CoRR abs/1705.11116 (2017) - [i1]Antoine Dailly, Valentin Gledel, Marc Heinrich:
A generalization of Arc-Kayles. CoRR abs/1709.05219 (2017)
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-09-30 00:04 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: