default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Auger
Person information
- affiliation: University of Versailles Saint-Quentin-en-Yvelines, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]David Auger, Johanne Cohen, Antoine Lobstein:
Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundam. Informaticae 191(3-4): 239-268 (2024)- 2023
- [c10]David Auger
, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse:
Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. RP 2023: 183-198 - [i8]David Auger, Johanne Cohen, Antoine Lobstein:
Nonatomic Non-Cooperative Neighbourhood Balancing Games. CoRR abs/2303.08507 (2023) - [i7]David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse:
Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. CoRR abs/2307.01897 (2023) - 2022
- [c9]David Auger, Pierre Coucheney, Loric Duhaze:
Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. MFCS 2022: 12:1-12:14 - [i6]David Auger, Pierre Coucheney, Loric Duhaze:
Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs. CoRR abs/2204.13151 (2022) - 2021
- [c8]David Auger, Xavier Badin de Montjoye, Yann Strozecki:
A Generic Strategy Improvement Method for Simple Stochastic Games. MFCS 2021: 12:1-12:22 - [i5]David Auger, Xavier Badin de Montjoye, Yann Strozecki:
A Generic Strategy Iteration Method for Simple Stochastic Games. CoRR abs/2102.04922 (2021)
2010 – 2019
- 2019
- [c7]David Auger, Pierre Coucheney, Yann Strozecki:
Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. STACS 2019: 9:1-9:16 - [i4]David Auger, Pierre Coucheney, Yann Strozecki:
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule. CoRR abs/1901.05316 (2019) - 2014
- [j15]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Maximum size of a minimum watching system and the graphs achieving the bound. Discret. Appl. Math. 164: 20-33 (2014) - [j14]David Auger, Gérard D. Cohen, Sihem Mesnager:
Sphere coverings and identifying codes. Des. Codes Cryptogr. 70(1-2): 3-7 (2014) - [c6]David Auger, Jialin Liu, Sylvie Ruette, David Lupien St-Pierre, Olivier Teytaud:
Sparse binary zero-sum games. ACML 2014 - [c5]David Auger, Pierre Coucheney, Yann Strozecki:
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. TAMC 2014: 67-85 - [i3]David Auger, Pierre Coucheney, Yann Strozecki:
Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. CoRR abs/1402.0471 (2014) - 2013
- [j13]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Watching systems in graphs: An extension of identifying codes. Discret. Appl. Math. 161(12): 1674-1685 (2013) - [j12]David Auger, Iiro S. Honkala:
Watching Systems in the King Grid. Graphs Comb. 29(3): 333-347 (2013) - [c4]Lise Rodier, David Auger, Johanne Cohen, Hélia Pouyllau:
SLA learning from past failures, a Multi-Armed Bandit approach. CNSM 2013: 277-283 - [c3]David Auger, Johanne Cohen, Pierre Coucheney, Lise Rodier:
Distributed Selfish Algorithms for the Max-Cut Game. ISCIS 2013: 45-54 - [c2]David Auger, Adrien Couëtoux, Olivier Teytaud:
Continuous Upper Confidence Trees with Polynomial Exploration - Consistency. ECML/PKDD (1) 2013: 194-209 - 2012
- [j11]David Auger, Olivier Teytaud:
The Frontier of Decidability in Partially Observable Recursive Games. Int. J. Found. Comput. Sci. 23(7): 1439-1450 (2012) - 2011
- [j10]David Auger:
Combinatorial identification problems and graph powers. 4OR 9(4): 417-420 (2011) - [j9]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the sizes of graphs and their powers: The undirected case. Discret. Appl. Math. 159(16): 1666-1675 (2011) - [c1]David Auger:
Multiple Tree for Partially Observable Monte-Carlo Tree Search. EvoApplications (1) 2011: 53-62 - [i2]David Auger:
Multiple Tree for Partially Observable Monte-Carlo Tree Search. CoRR abs/1102.1580 (2011) - 2010
- [b1]David Auger:
Problèmes d'identification combinatoire et puissances de graphes. (Combinatorial identification problems and graph powers). Télécom ParisTech, France, 2010 - [j8]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the sizes of the graphs G, Gr, Gr \ G: the directed case. Australas. J Comb. 48: 87-110 (2010) - [j7]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph. Discuss. Math. Graph Theory 30(4): 591-609 (2010) - [j6]David Auger:
Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31(5): 1372-1384 (2010) - [j5]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Complexity results for identifying codes in planar graphs. Int. Trans. Oper. Res. 17(6): 691-710 (2010) - [i1]David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein:
Watching Systems in graphs: an extension of Identifying Codes. CoRR abs/1005.0765 (2010)
2000 – 2009
- 2009
- [j4]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. Adv. Math. Commun. 3(1): 97-114 (2009) - [j3]David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
Erratum. Adv. Math. Commun. 3(4): 429-430 (2009) - [j2]David Auger:
Identifying Codes in Trees and Planar Graphs. Electron. Notes Discret. Math. 34: 585-588 (2009) - 2008
- [j1]David Auger:
Induced Paths in Twin-Free Graphs. Electron. J. Comb. 15(1) (2008)
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-08-03 20:15 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:
