Koki Suetsugu

Orcid: 0000-0003-2529-7501

According to our database¹, Koki Suetsugu authored at least 13 papers between 2017 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Universal partisan rulesets and a universal partisan dicotic ruleset.

[BibT_eX]

[DOI]

Koki Suetsugu

Int. J. Game Theory, December, 2024

Emperor nim and emperor sum: a new sum of impartial games.

[BibT_eX]

[DOI]

Koki Suetsugu

Int. J. Game Theory, December, 2024

Computational complexity of Turning Tiles.

[BibT_eX]

[DOI]

Int. J. Game Theory, December, 2024

A complete solution for the partisan chocolate game.

[BibT_eX]

[DOI]

Tomoaki Abuku

Hikaru Manabe

Richard J. Nowakowski

Carlos Pereira dos Santos

Koki Suetsugu

Int. J. Game Theory, December, 2024

Enforce and selective operators of combinatorial games.

[BibT_eX]

[DOI]

Int. J. Game Theory, December, 2024

Relationship between misère NIM and two-player GOISHI HIROI.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Turning Tiles is PSPACE-complete.

[BibT_eX]

[DOI]

CoRR, 2023

Hardness of braided quantum circuit optimization in the surface code.

[BibT_eX]

[DOI]

CoRR, 2023

2021

Max-Min 3-Dispersion Problems.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

2020

Variant of Wythoff's Game-Corner Two Rooks.

[BibT_eX]

[DOI]

J. Inf. Process., 2020

2019

Multiplayer games as extension of misère games.

[BibT_eX]

[DOI]

Koki Suetsugu

Int. J. Game Theory, 2019

On the Complexity of Lattice Puzzles.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2017

Achievement Games on a One-dimensional Board.

[BibT_eX]

[DOI]

Koki Suetsugu

J. Inf. Process., 2017

Koki Suetsugu

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...