24 citations · 76 across the 16 of their papers we have counts for
17 papers
Cannibal Animal Games: a new variant of Tic-Tac-Toe
Jean Cardinal, Sébastien Collette, Hiro Ito +4
This paper presents a new partial two-player game, called the \emph{cannibal animal game}, which is a variant of Tic-Tac-Toe. The game is played on the infinite grid, where in each…
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
Andrei Asinowski, Jean Cardinal, Nathann Cohen +9
We consider a coloring problem on dynamic, one-dimensional point sets: points appearing and disappearing on a line at given times. We wish to color them with k colors so that at an…
Coloring and Guarding Arrangements
Prosenjit Bose, Jean Cardinal, Sébastien Collette +4
Given an arrangement of lines in the plane, what is the minimum number of colors required to color the lines so that no cell of the arrangement is monochromatic? In this paper…
De-amortizing Binary Search Trees
Prosenjit Bose, Sébastien Collette, Rolf Fagerberg +1
We present a general method for de-amortizing essentially any Binary Search Tree (BST) algorithm. In particular, by transforming Splay Trees, our method produces a BST that has the…
Confluent Persistence Revisited
Sebastien Collette, John Iacono, Stefan Langerman
It is shown how to enhance any data structure in the pointer model to make it confluently persistent, with efficient query and update times and limited space overhead. Updates are…
Blocking Coloured Point Sets
Greg Aloupis, Brad Ballinger, Sébastien Collette +3
This paper studies problems related to visibility among points in the plane. A point \emph{blocks} two points and if is in the interior of the line segment $\bar{vw…