David Auger

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 10

Top Venues

Télécom ParisTech, France (PHD)

Education History

Télécom ParisTech, France

PHD

Publications

David Auger, Johanne Cohen, Antoine Lobstein
Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundam. Informaticae 191 (3-4) (2024)
David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse
Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. CoRR (2023)
David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse
Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. RP (2023)
David Auger, Johanne Cohen, Antoine Lobstein
Nonatomic Non-Cooperative Neighbourhood Balancing Games. CoRR (2023)
David Auger, Pierre Coucheney, Loric Duhaze
Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. MFCS (2022)
David Auger, Pierre Coucheney, Loric Duhaze
Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs. CoRR (2022)
David Auger, Xavier Badin de Montjoye, Yann Strozecki
A Generic Strategy Improvement Method for Simple Stochastic Games. MFCS (2021)
David Auger, Xavier Badin de Montjoye, Yann Strozecki
A Generic Strategy Iteration Method for Simple Stochastic Games. CoRR (2021)
David Auger, Pierre Coucheney, Yann Strozecki
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule. CoRR (2019)
David Auger, Pierre Coucheney, Yann Strozecki
Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. STACS (2019)
David Auger, Pierre Coucheney, Yann Strozecki
Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. CoRR (2014)
David Auger, Pierre Coucheney, Yann Strozecki
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. TAMC (2014)
David Auger, Jialin Liu, Sylvie Ruette, David Lupien St-Pierre, Olivier Teytaud
Sparse binary zero-sum games. ACML (2014)
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 (2014)
David Auger, Gérard D. Cohen, Sihem Mesnager
Sphere coverings and identifying codes. Des. Codes Cryptogr. 70 (1-2) (2014)
David Auger, Adrien Couëtoux, Olivier Teytaud
Continuous Upper Confidence Trees with Polynomial Exploration - Consistency. ECML/PKDD (1) (2013)
David Auger, Johanne Cohen, Pierre Coucheney, Lise Rodier
Distributed Selfish Algorithms for the Max-Cut Game. ISCIS (2013)
David Auger, Iiro S. Honkala
Watching Systems in the King Grid. Graphs Comb. 29 (3) (2013)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
Watching systems in graphs: An extension of identifying codes. Discret. Appl. Math. 161 (12) (2013)
Lise Rodier, David Auger, Johanne Cohen, Hélia Pouyllau
SLA learning from past failures, a Multi-Armed Bandit approach. CNSM (2013)
David Auger, Olivier Teytaud
The Frontier of Decidability in Partially Observable Recursive Games. Int. J. Found. Comput. Sci. 23 (7) (2012)
David Auger
Combinatorial identification problems and graph powers. 4OR 9 (4) (2011)
David Auger
Multiple Tree for Partially Observable Monte-Carlo Tree Search. EvoApplications (1) (2011)
David Auger
Multiple Tree for Partially Observable Monte-Carlo Tree Search CoRR (2011)
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) (2011)
David Auger
Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. 31 (5) (2010)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
Complexity results for identifying codes in planar graphs. Int. Trans. Oper. Res. 17 (6) (2010)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
-twin-free graph. Discuss. Math. Graph Theory 30 (4) (2010)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
Watching Systems in graphs: an extension of Identifying Codes CoRR (2010)
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
\ G: the directed case. Australas. J Comb. 48 (2010)
David Auger
Identifying Codes in Trees and Planar Graphs. Electron. Notes Discret. Math. 34 (2009)
David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
Erratum. Adv. Math. Commun. 3 (4) (2009)
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) (2009)
David Auger
Induced Paths in Twin-Free Graphs. Electron. J. Comb. 15 (1) (2008)

David Auger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

David Auger