Éric Duchêne

According to our database1, Éric Duchêne authored at least 37 papers between 2005 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Taking-and-merging games as rewrite games.
Discret. Math. Theor. Comput. Sci., 2020

Maker-Breaker domination game.
Discret. Math., 2020

Partition games.
Discret. Appl. Math., 2020

INFLUENCE: a partizan scoring game on graphs.
CoRR, 2020

2018
The switch operators and push-the-button games: A sequential compound over rulesets.
Theor. Comput. Sci., 2018

Ice sliding games.
Int. J. Game Theory, 2018

Partition games are pure breaking games.
CoRR, 2018

2017
Deciding game invariance.
Inf. Comput., 2017

Labeled embedding of <i>(n, n-2)</i>-graphs in their complements.
Discuss. Math. Graph Theory, 2017

A Vizing-like theorem for union vertex-distinguishing edge coloring.
Discret. Appl. Math., 2017

2016
Nonhomogeneous Beatty Sequences Leading to Invariant Games.
SIAM J. Discret. Math., 2016

Building Nim.
Int. J. Game Theory, 2016

A Self-Acquiring Knowledge Process for MCTS.
Int. J. Artif. Intell. Tools, 2016

Combinatorial Games: From Theoretical Solving to AI Algorithms.
Proceedings of the Scalable Uncertainty Management - 10th International Conference, 2016

2015
Labeled 2-packings of trees.
Discret. Math., 2015

Graphes et jeux combinatoires.
, 2015

2014
Vertex Nim played on graphs.
Theor. Comput. Sci., 2014

Labeled embedding of (n, n-2)-graphs in their complements.
CoRR, 2014

Knowledge Complement for Monte Carlo Tree Search: An Application to Combinatorial Games.
Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

2013
Impartial coloring games.
Theor. Comput. Sci., 2013

Invariant games and non-homogeneous Beatty sequences.
CoRR, 2013

Labeled packings of graphs.
Australas. J Comb., 2013

2012
The undirected m-Capacitated Peripatetic Salesman Problem.
Eur. J. Oper. Res., 2012

Gap vertex-distinguishing edge colorings of graphs.
Discret. Math., 2012

String Comparators Based Algorithms for Process Model Matchmaking.
Proceedings of the 2012 IEEE Ninth International Conference on Services Computing, 2012

2010
Invariant games.
Theor. Comput. Sci., 2010

Extensions and restrictions of Wythoff's game preserving its p positions.
J. Comb. Theory, Ser. A, 2010

New Results about Set Colorings of Graphs.
Electron. J. Comb., 2010

2009
Heuristiques pour le Problème du Vendeur <i>m</i>-Péripatétique.
RAIRO Oper. Res., 2009

New results about impartial solitaire clobber.
RAIRO Oper. Res., 2009

Geometrical extensions of Wythoff's game.
Discret. Math., 2009

Combinatorial graph games.
Ars Comb., 2009

Another bridge between Nim and Wythoff.
Australas. J Comb., 2009

2008
A morphic approach to combinatorial games: the Tribonacci case.
RAIRO Theor. Informatics Appl., 2008

2007
The Undirected <i>m</i>-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms.
Oper. Res., 2007

2005
Branch-and-cut algorithms for the undirected m.
Eur. J. Oper. Res., 2005

Around Wythoff's game.
Electron. Notes Discret. Math., 2005


  Loading...