15 citations · 87 across the 33 of their papers we have counts for
Showing 2014 · cs.CCShow all
2 papers · 2 filters
cs.CC2014
Havannah and TwixT are PSPACE-complete
Edouard Bonnet, Florian Jamain, Abdallah Saffidine
Numerous popular abstract strategy games ranging from Hex and Havannah to Lines of Action belong to the class of connection games. Still, very few complexity results on such games…
cs.CC2014
Sparsification and subexponential approximation
Edouard Bonnet, Vangelis Th. Paschos
Instance sparsification is well-known in the world of exact computation since it is very closely linked to the Exponential Time Hypothesis. In this paper, we extend the concept of…