2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.CG2018
Group evolution patterns in running races
Y. Diez, M. Fort, M. Korman +1
We address the problem of tracking and detecting interactions between the different groups of runners that form during a race. In athletic races control points are set to monitor t…
cs.DS2017
Experimental Study of Compressed Stack Algorithms in Limited Memory Environments
Jean-François Baffier, Yago Diez, Matias Korman
The {\em compressed stack} is a data structure designed by Barba {\em et al.} (Algorithmica 2015) that allows to reduce the amount of memory needed by an algorithm (at the cost of…
cs.DM2016★ 2 cited
Hanabi is NP-hard, Even for Cheaters who Look at Their Cards
Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez +5
In this paper we study a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory. In Hanabi, each card has one among colors and a number…