10 citations · 12 across the 5 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2020
Tatamibari is NP-complete
Aviv Adler, Jeffrey Bosboom, Erik D. Demaine +3
In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an grid of cells, where each cell possibly contains a clue among +, -, |. The goal is to partition…
cs.CC2018
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster +5
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a sce…