12 citations · 48 across the 27 of their papers we have counts for
3 papers · 1 filter
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…
Constrained Generalized Delaunay Graphs Are Plane Spanners
Prosenjit Bose, Jean-Lou De Carufel, André van Renssen
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which the edges of the graph are not allowed to cross. Given an arbitrary convex shap…
The Price of Order
Prosenjit Bose, Pat Morin, André van Renssen
We present tight bounds on the spanning ratio of a large family of ordered -graphs. A -graph partitions the plane around each vertex into disjoint cones, each having aper…