Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Finding a reconfiguration sequence between longest increasing subsequences
Yuuki Aoike, Masashi Kiyomi, Yasuaki Kobayashi +1
In this note, we consider the problem of finding a step-by-step transformation between two longest increasing subsequences in a sequence, namely Longest Increasing Subsequence Reco…
cs.DS2020
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
Yuuki Aoike, Tatsuya Gima, Tesshu Hanaka +5
A cactus is a connected graph that does not contain as a minor. Given a graph and integer , Cactus Vertex Deletion (also known as Diamond Hitting Se…