David Auger

Johanne Cohen

Antoine Lobstein

Fundam. Informaticae, 2024

2023

Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 17th International Conference, 2023

2022

Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs.

[BibT_eX]

[DOI]

Loric Duhaze

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

A Generic Strategy Iteration Method for Simple Stochastic Games.

[BibT_eX]

[DOI]

Xavier Badin de Montjoye

CoRR, 2021

A Generic Strategy Improvement Method for Simple Stochastic Games.

[BibT_eX]

[DOI]

Xavier Badin de Montjoye

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2019

Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2014

Sphere coverings and identifying codes.

[BibT_eX]

[DOI]

Gérard D. Cohen

Sihem Mesnager

Des. Codes Cryptogr., 2014

Maximum size of a minimum watching system and the graphs achieving the bound.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games.

[BibT_eX]

[DOI]

CoRR, 2014

Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

Sparse binary zero-sum games.

[BibT_eX]

[DOI]

Jialin Liu

Sylvie Ruette

David Lupien St-Pierre

Olivier Teytaud

Proceedings of the Sixth Asian Conference on Machine Learning, 2014

2013

Watching Systems in the King Grid.

[BibT_eX]

[DOI]

Iiro S. Honkala

Graphs Comb., 2013

Watching systems in graphs: An extension of identifying codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Continuous Upper Confidence Trees with Polynomial Exploration - Consistency.

[BibT_eX]

[DOI]

Adrien Couëtoux

Olivier Teytaud

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

Distributed Selfish Algorithms for the Max-Cut Game.

[BibT_eX]

[DOI]

Proceedings of the Information Sciences and Systems 2013, 2013

SLA learning from past failures, a Multi-Armed Bandit approach.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Network and Service Management, 2013

2012

The Frontier of Decidability in Partially Observable Recursive Games.

[BibT_eX]

[DOI]

Olivier Teytaud

Int. J. Found. Comput. Sci., 2012

2011

On the sizes of graphs and their powers: The undirected case.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Combinatorial identification problems and graph powers.

[BibT_eX]

[DOI]

4OR, 2011

Multiple Tree for Partially Observable Monte-Carlo Tree Search.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computation, 2011

2010

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

[BibT_eX]

[DOI]

PhD thesis, 2010

Complexity results for identifying codes in planar graphs.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2010

Minimal identifying codes in trees and planar graphs with large girth.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

On the existence of a cycle of length at least 7 in a (1, \le 2)-twin-free graph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

On the sizes of the graphs G, Gr, Gr \ G: the directed case.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

2009

Identifying Codes in Trees and Planar Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Erratum.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2009

Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2009

2008

Induced Paths in Twin-Free Graphs.

[BibT_eX]

[DOI]