Induced Paths in Twin-Free Graphs. - David Auger (Electron. J. Comb., 2008)

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. - David Auger; Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2009)

Erratum. - David Auger; Irène Charon; Iiro S. Honkala; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2009)

Identifying Codes in Trees and Planar Graphs. - David Auger (Electron. Notes Discret. Math., 2009)

On the sizes of the graphs G, Gr, Gr G: the directed case. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Australas. J Comb., 2010)

On the existence of a cycle of length at least 7 in a (1, le 2)-twin-free graph. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discuss. Math. Graph Theory, 2010)

Minimal identifying codes in trees and planar graphs with large girth. - David Auger (Eur. J. Comb., 2010)

Complexity results for identifying codes in planar graphs. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Int. Trans. Oper. Res., 2010)

Problèmes d'identification combinatoire et puissances de graphes. (Combinatorial identification problems and graph powers). - David Auger (2010)

Multiple Tree for Partially Observable Monte-Carlo Tree Search. - David Auger (EvoApplications (1), 2011)

Combinatorial identification problems and graph powers. - David Auger (4OR, 2011)

On the sizes of graphs and their powers: The undirected case. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discret. Appl. Math., 2011)

The Frontier of Decidability in Partially Observable Recursive Games. - David Auger; Olivier Teytaud (Int. J. Found. Comput. Sci., 2012)

SLA learning from past failures, a Multi-Armed Bandit approach. - Lise Rodier; David Auger; Johanne Cohen; Hélia Pouyllau (CNSM, 2013)

Distributed Selfish Algorithms for the Max-Cut Game. - David Auger; Johanne Cohen; Pierre Coucheney; Lise Rodier (ISCIS, 2013)

Continuous Upper Confidence Trees with Polynomial Exploration - Consistency. - David Auger; Adrien Couëtoux; Olivier Teytaud (ECML/PKDD (1), 2013)

Watching systems in graphs: An extension of identifying codes. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discret. Appl. Math., 2013)

Watching Systems in the King Grid. - David Auger; Iiro S. Honkala (Graphs Comb., 2013)

Sparse binary zero-sum games. - David Auger; Jialin Liu 001; Sylvie Ruette; David Lupien St-Pierre; Olivier Teytaud (ACML, 2014)

Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. - David Auger; Pierre Coucheney; Yann Strozecki (TAMC, 2014)

Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. - David Auger; Pierre Coucheney; Yann Strozecki (CoRR, 2014)

Maximum size of a minimum watching system and the graphs achieving the bound. - David Auger; Irène Charon; Olivier Hudry; Antoine Lobstein (Discret. Appl. Math., 2014)

Sphere coverings and identifying codes. - David Auger; Gérard D. Cohen; Sihem Mesnager (Des. Codes Cryptogr., 2014)

Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. - David Auger; Pierre Coucheney; Yann Strozecki (STACS, 2019)

A Generic Strategy Improvement Method for Simple Stochastic Games. - David Auger; Xavier Badin de Montjoye; Yann Strozecki (MFCS, 2021)

A Generic Strategy Iteration Method for Simple Stochastic Games. - David Auger; Xavier Badin de Montjoye; Yann Strozecki (CoRR, 2021)

Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. - David Auger; Pierre Coucheney; Loric Duhaze (MFCS, 2022)

Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. - David Auger; Pierre Coucheney; Loric Duhazé; Kossi Roland Etse (RP, 2023)

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems. - David Auger; Pierre Coucheney; Kossi Roland Etse (CoRR, 2024)

Nonatomic Non-Cooperative Neighbourhood Balancing Games. - David Auger; Johanne Cohen; Antoine Lobstein (Fundam. Informaticae, 2024)