Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	JCDCGGG (21. : 2018 : Quezon) Discrete and Computational Geometry, Graphs, and Games
1. Verfasser:	Iwamoto, Chuzo (VerfasserIn)
Weitere Verfasser:	Ibusuki, Tatsuaki (VerfasserIn)
Format:	UnknownFormat
Sprache:	eng
Veröffentlicht:	2021
Schlagworte:
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Titel	Jahr	Verfasser
Global Location-Domination in the Join and Cartesian Product of Graphs	2021	Malnegro, Analen
Barnette’s Conjecture Through the Lens of the Mod P Complexity Classes	2021	Barish, Robert D.
Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan	2021	Iwamoto, Chuzo
On Geometric Graphs on Point Sets in the Plane	2021	Urrutia, Jorge
On Structural Parameterizations of Node Kayles	2021	Kobayashi, Yasuaki
Toward Unfolding Doubly Covered n-Stars	2021	Akitaya, Hugo A.
Negative Instance for the Edge Patrolling Beacon Problem	2021	Abel, Zachary
The Metric Dimension of the Join of Paths and Cycles	2021	Garces, Ian June L.
Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number — A Survey	2021	Ozeki, Kenta
Crystallographic Flat Origami from n-Uniform Tilings	2021	Las Penas, Ma. Louise Antonette N. De
On the Complexity of Jelly-no-Puzzle	2021	Yang, Chao
The Two-Distance Sets in Dimension Four	2021	Szöllösi, Ferenc
Robustness in Power-Law Kinetic Systems with Reactant-Determined Interactions	2021	Fortun, Noel T.
Packing Cube Nets into Rectangles with O(1) Holes	2021	Demaine, Erik D.