2 papers
math.CO2025
Interval Graphs are Reconstructible
Irene Heinrich, Masashi Kiyomi, Yota Otachi +1
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order…
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…