Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles. K. Burke, Antoine Dailly, and Nacim Oijid. Submitted.(preprint) (Summary: Non-disconnecting Arc-Kayles is PSPACE-hard)
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. K. Burke, Matthew Ferland, Svenja Huntemann, and Shang-Hua Teng. Submitted.(preprint) (Summary: Sums of Superstars are NP-hard.)
Keeping Your Distance is Hard. K. Burke, Silvia Heubach, Melissa Huggan, and Svenja Huntemann. To be published in Games of No Chance 6.(preprint) (Summary: Investigates hardness of distance games, finding large families that are PSPACE-complete.)