4 citations · 18 across the 22 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017★ 3 cited
Polynomial-Time Algorithms for Sliding Tokens on Cactus Graphs and Block Graphs
Duc A. Hoang, Ryuhei Uehara
Given two independent sets of a graph , and imagine that a token (coin) is placed at each vertex of . The Sliding Token problem asks if one could transform to …
cs.CG2017
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces
Erik D. Demaine, Matias Korman, Jason S. Ku +6
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union…