Kanae Yoshiwatari

According to our database, Kanae Yoshiwatari authored at least 7 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Misère Partizan Arc Kayles is PSPACE-complete, even on Planar Graphs.

Kyle Burke, Caroline Cashman, Alfie Davies, Kanae Yoshiwatari, Francesca Yu

CoRR, November, 2025

Colored Node Kayles: Algorithms and Computational Complexity.

Tesshu Hanaka, Hirotaka Ono, Kanae Yoshiwatari

Proceedings of the PRIMA 2025: Principles and Practice of Multi-Agent Systems, 2025

2024

Computational complexity of Turning Tiles.

Tesshu Hanaka, Hironori Kiya, Hirotaka Ono, Koki Suetsugu, Kanae Yoshiwatari

Int. J. Game Theory, December, 2024

Faster Winner Determination Algorithms for (Colored) Arc Kayles.

Tesshu Hanaka, Hironori Kiya, Michael Lampis, Hirotaka Ono, Kanae Yoshiwatari

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Parameterized Vertex Integrity Revisited.

Tesshu Hanaka, Michael Lampis, Manolis Vasilakis, Kanae Yoshiwatari

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

Turning Tiles is PSPACE-complete.

Kanae Yoshiwatari, Hironori Kiya, Koki Suetsugu, Tesshu Hanaka, Hirotaka Ono

CoRR, 2023

2022

Winner Determination Algorithms for Graph Games with Matching Structures.

Kanae Yoshiwatari, Hironori Kiya, Tesshu Hanaka, Hirotaka Ono

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022