Domino Tatami Covering is NP-complete

Alejandro Erickson, Frank Ruskey

Type: Preprint

Publication Date: 2013-05-29

Citations: 0

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Domino Tatami Covering is NP-complete	2013	Alejandro Erickson Frank Ruskey
+	Monomino-Domino Tatami Coverings	2013	Alejandro Erickson
+	Generating Tatami Coverings Efficiently	2014	Alejandro Erickson Frank Ruskey
+	Enumerating maximal tatami mat coverings of square grids with $v$ vertical dominoes	2013	Alejandro Erickson Frank Ruskey
+	Enumerating maximal tatami mat coverings of square grids with $v$ vertical dominoes	2013	Alejandro Erickson Frank Ruskey
+	Guarding Polyominoes under $k$-Hop Visibility	2023	Omrit Filtser Erik Krohn Bengt J. Nilsson Christian Rieck Christiane Schmidt
+ PDF Chat	The Complexity of Generalized Domino Tilings	2013	Igor Pak Jed Yang
+	The complexity of generalized domino tilings	2013	Igor Pak Jed Yang
+	Tatamibari is NP-complete	2020	Aviv Adler Jeffrey Bosboom Erik D. Demaine Martin L. Demaine Quanquan C. Liu Jayson Lynch
+ PDF Chat	Graphs with equal domination and covering numbers	2019	Andrzej Lingas Mateusz Miotk Jerzy Topp Paweł Żyliński
+	ZHED is NP-complete	2021	Sagnik Saha Erik D. Demaine
+	(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity	2018	Stéphane Bessy Marin Bougeret Jocelyn Thiebaut
+	Tatami Maker: A combinatorially rich mechanical game board	2013	Alejandro Erickson
+	Tatami Maker: A Combinatorially Rich Mechanical Game Board	2013	Alejandro Erickson
+ PDF Chat	Packing Arc-Disjoint Cycles in Tournaments	2021	Stéphane Bessy Marin Bougeret R. Krithika Abhishek Sahu Saket Saurabh Jocelyn Thiebaut Meirav Zehavi
+	Guarding Polyominoes Under k-Hop Visibility	2025	Omrit Filtser Erik Krohn Bengt J. Nilsson Christian Rieck Christiane Schmidt
+	On the Complexity of Planar Covering of Small Graphs	2011	Ondřej Bílka Jozef Jirásek Pavel Klavík Martin Tancer Jan Volec
+	On the Complexity of Planar Covering of Small Graphs	2011	Ondřej Bílka Jozef Jirásek Pavel Klavík Martin Tancer Jan Volec
+	Enumeration of Hybrid Domino-Lozenge Tilings II: Quasi-octagonal regions	2013	Tri Lai
+ PDF Chat	Enumeration of Hybrid Domino-Lozenge Tilings II: Quasi-Octagonal Regions	2016	Tri Lai

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (4)

Action	Title	Year	Authors
+	The Computational Complexity of the Kakuro Puzzle, Revisited	2010	Oliver Ruepp Markus Holzer
+ PDF Chat	Monomer-Dimer Tatami Tilings of Rectangular Regions	2011	Alejandro Erickson Frank Ruskey Jennifer Woodcock Mark Schurch
+	Complexity of Cycle Transverse Matching Problems	2011	Ross Churchley Jing Huang Xuding Zhu
+	Monomer-dimer tatami tilings of square regions	2012	Alejandro Erickson Mark Schurch