David Auger
David Auger
Laboratoire DAVID, équipe ALMOST, Université de Versailles Saint-Quentin-en-Yvelines
Verified email at uvsq.fr
Title
Cited by
Cited by
Year
Continuous upper confidence trees with polynomial exploration–consistency
D Auger, A Couetoux, O Teytaud
Joint European Conference on Machine Learning and Knowledge Discovery in …, 2013
392013
Minimal identifying codes in trees and planar graphs with large girth
D Auger
European Journal of Combinatorics 31 (5), 1372-1384, 2010
352010
Multiple tree for partially observable monte-carlo tree search
D Auger
European Conference on the Applications of Evolutionary Computation, 53-62, 2011
332011
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
212010
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
172013
Induced paths in twin-free graphs
D Auger
the electronic journal of combinatorics, N17-N17, 2008
112008
Sparse binary zero-sum games
D Auger, J Liu, S Ruette, D Saint-Pierre, O Teytaud
Asian Conference on Machine Learning, 173-188, 2015
62015
Finding optimal strategies of almost acyclic simple stochastic games
D Auger, P Coucheney, Y Strozecki
International Conference on Theory and Applications of Models of Computation …, 2014
62014
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
62012
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, 2009
62009
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, 2009
62009
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
5*2014
Watching systems in the king grid
D Auger, I Honkala
Graphs and Combinatorics 29 (3), 333-347, 2013
52013
Problèmes d'identification métrique dans les graphes
D Auger
École nationale supérieure des télécommunications, 2007
52007
Sphere coverings and identifying codes
D Auger, G Cohen, S Mesnager
Designs, codes and cryptography 70 (1-2), 3-7, 2014
42014
Extremal values for identification, domination and maximum cliques in twin-free graphs
I Charon, O Hudry, A Lobstein
Ars Combinatoria 101, 161-185, 2011
42011
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
42010
Identifying codes in trees and planar graphs
D Auger
Electronic Notes in Discrete Mathematics 34, 585-588, 2009
42009
On the sizes of the graphs G, Gr, Gr\G: the directed case.
D Auger, I Charon, O Hudry, A Lobstein
Australas. J Comb. 48, 87-110, 2010
32010
SLA learning from past failures, a Multi-Armed Bandit approach
L Rodier, D Auger, J Cohen, H Pouyllau
Proceedings of the 9th International Conference on Network and Service …, 2013
22013
The system can't perform the operation now. Try again later.
Articles 1–20