13 citations · 18 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2019★ 2 cited
The Packed Interval Covering Problem is NP-complete
Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat +1
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
cs.CC2016
On the Complexity of Connection Games
Édouard Bonnet, Florian Jamain, Abdallah Saffidine
In this paper, we study three connection games among the most widely played: Havannah, Twixt, and Slither. We show that determining the outcome of an arbitrary input position is PS…