8 citations · 36 across the 49 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
Space-Efficient Algorithms for Longest Increasing Subsequence
Masashi Kiyomi, Hirotaka Ono, Yota Otachi +2
Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in time and space. Our goa…
cs.DS2017★ 1 cited
Vertex Deletion Problems on Chordal Graphs
Yixin Cao, Yuping Ke, Yota Otachi +1
Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis an…
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…