David Auger - RankMe

36 papers A 1B 3C 2Journal 25Unranked 4

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems. CoRR David Auger, Pierre Coucheney, Kossi Roland Etse
2024	J	`jnl`	Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundam. Informaticae David Auger, Johanne Cohen, Antoine Lobstein
2023	—	`conf`	Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. RP David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse
2023	J	`jnl`	Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. CoRR David Auger, Pierre Coucheney, Loric Duhazé, Kossi Roland Etse
2023	J	`jnl`	Nonatomic Non-Cooperative Neighbourhood Balancing Games. CoRR David Auger, Johanne Cohen, Antoine Lobstein
2022	B	`conf`	Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. MFCS David Auger, Pierre Coucheney, Loric Duhaze
2022	J	`jnl`	Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs. CoRR David Auger, Pierre Coucheney, Loric Duhaze
2021	B	`conf`	A Generic Strategy Improvement Method for Simple Stochastic Games. MFCS David Auger, Xavier Badin de Montjoye, Yann Strozecki
2021	J	`jnl`	A Generic Strategy Iteration Method for Simple Stochastic Games. CoRR David Auger, Xavier Badin de Montjoye, Yann Strozecki
2019	A	`conf`	Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule. STACS David Auger, Pierre Coucheney, Yann Strozecki
2019	J	`jnl`	Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule. CoRR David Auger, Pierre Coucheney, Yann Strozecki
2014	C	`conf`	Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. TAMC David Auger, Pierre Coucheney, Yann Strozecki
2014	J	`jnl`	Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games. CoRR David Auger, Pierre Coucheney, Yann Strozecki
2014	J	`jnl`	Maximum size of a minimum watching system and the graphs achieving the bound. Discret. Appl. Math. David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2014	C	`conf`	Sparse binary zero-sum games. ACML David Auger, Jialin Liu, Sylvie Ruette, David Lupien St-Pierre, Olivier Teytaud
2014	J	`jnl`	Sphere coverings and identifying codes. Des. Codes Cryptogr. David Auger, Gérard D. Cohen, Sihem Mesnager
2013	—	`conf`	Continuous Upper Confidence Trees with Polynomial Exploration - Consistency. ECML/PKDD (1) David Auger, Adrien Couëtoux, Olivier Teytaud
2013	—	`conf`	Distributed Selfish Algorithms for the Max-Cut Game. ISCIS David Auger, Johanne Cohen, Pierre Coucheney, Lise Rodier
2013	B	`conf`	SLA learning from past failures, a Multi-Armed Bandit approach. CNSM Lise Rodier, David Auger, Johanne Cohen, Hélia Pouyllau
2013	J	`jnl`	Watching Systems in the King Grid. Graphs Comb. David Auger, Iiro S. Honkala
2013	J	`jnl`	Watching systems in graphs: An extension of identifying codes. Discret. Appl. Math. David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2012	J	`jnl`	The Frontier of Decidability in Partially Observable Recursive Games. Int. J. Found. Comput. Sci. David Auger, Olivier Teytaud
2011	J	`jnl`	Combinatorial identification problems and graph powers. 4OR David Auger
2011	J	`jnl`	Multiple Tree for Partially Observable Monte-Carlo Tree Search CoRR David Auger
2011	—	`conf`	Multiple Tree for Partially Observable Monte-Carlo Tree Search. EvoApplications (1) David Auger
2011	J	`jnl`	On the sizes of graphs and their powers: The undirected case. Discret. Appl. Math. David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010	J	`jnl`	Complexity results for identifying codes in planar graphs. Int. Trans. Oper. Res. David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010	J	`jnl`	Minimal identifying codes in trees and planar graphs with large girth. Eur. J. Comb. David Auger
2010	J	`jnl`	On the existence of a cycle of length at least 7 in a Discuss. Math. Graph Theory David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010	J	`jnl`	On the sizes of the graphs G, G Australas. J Comb. David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2010	—	`—`	Problèmes d'identification combinatoire et puissances de graphes. (Combinatorial identification problems and graph powers). David Auger
2010	J	`jnl`	Watching Systems in graphs: an extension of Identifying Codes CoRR David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein
2009	J	`jnl`	Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs. Adv. Math. Commun. David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2009	J	`jnl`	Erratum. Adv. Math. Commun. David Auger, Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein
2009	J	`jnl`	Identifying Codes in Trees and Planar Graphs. Electron. Notes Discret. Math. David Auger
2008	J	`jnl`	Induced Paths in Twin-Free Graphs. Electron. J. Comb. David Auger