7 citations · 24 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
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…
cs.CG2016★ 1 cited
Distance-Sensitive Planar Point Location
Boris Aronov, Mark de Berg, David Eppstein +2
Let be a connected planar polygonal subdivision with edges that we want to preprocess for point-location queries, and where we are given the probability tha…