David Auger
David Auger
Laboratoire DAVID, équipe ALMOST, Université de Versailles Saint-Quentin-en-Yvelines
Verified email at
Cited by
Cited by
Continuous upper confidence trees with polynomial exploration–consistency
D Auger, A Couetoux, O Teytaud
Machine Learning and Knowledge Discovery in Databases: European Conference …, 2013
Minimal identifying codes in trees and planar graphs with large girth
D Auger
European Journal of Combinatorics 31 (5), 1372-1384, 2010
Multiple tree for partially observable monte-carlo tree search
D Auger
European Conference on the Applications of Evolutionary Computation, 53-62, 2011
Watching systems in graphs: an extension of identifying codes
D Auger, I Charon, O Hudry, A Lobstein
Discrete Applied Mathematics 161 (12), 1674-1685, 2013
Complexity results for identifying codes in planar graphs
D Auger, I Charon, O Hudry, A Lobstein
International Transactions in Operational Research 17 (6), 691-710, 2010
Induced paths in twin-free graphs
D Auger
the electronic journal of combinatorics, N17-N17, 2008
Maximum size of a minimum watching system and the graphs achieving the bound
D Auger, I Charon, O Hudry, A Lobstein
Discrete Applied Mathematics 164, 20-33, 2014
Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs
D Auger, I Charon, I Honkala, O Hudry, A Lobstein
Advances in Mathematics of Communications 3 (1), 97-114, 2008
Watching systems in the king grid
D Auger, I Honkala
Graphs and Combinatorics 29 (3), 333-347, 2013
Finding optimal strategies of almost acyclic simple stochastic games
D Auger, P Coucheney, Y Strozecki
Theory and Applications of Models of Computation: 11th Annual Conference …, 2014
A generic strategy improvement method for simple stochastic games
D Auger, XB de Montjoye, Y Strozecki
arXiv preprint arXiv:2102.04922, 2021
The frontier of decidability in partially observable recursive games
D Auger, O Teytaud
International Journal of Foundations of Computer Science 23 (07), 1439-1450, 2012
Extremal values for identification, domination and maximum cliques in twin-free graphs
I Charon, O Hudry, A Lobstein
Ars Combinatoria 101, 161-185, 2011
Sphere coverings and identifying codes
D Auger, G Cohen, S Mesnager
Designs, codes and cryptography 70, 3-7, 2014
Problèmes d'identification métrique dans les graphes
D Auger
École nationale supérieure des télécommunications, 2007
On the existence of a cycle of length at least 7 in a (1,≤ 2)-twin-free graph
D Auger, I Charon, O Hudry, A Lobstein
Discussiones Mathematicae Graph Theory 30 (4), 591-609, 2010
Identifying codes in trees and planar graphs
D Auger
Electronic Notes in Discrete Mathematics 34, 585-588, 2009
Polynomial time algorithm for arrival on tree-like multigraphs
D Auger, P Coucheney, L Duhaze
arXiv preprint arXiv:2204.13151, 2022
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule
D Auger, P Coucheney, Y Strozecki
arXiv preprint arXiv:1901.05316, 2019
Problèmes d'identification combinatoire et puissances de graphes
D Auger
Télécom ParisTech, 2010
The system can't perform the operation now. Try again later.
Articles 1–20