1 citations · 1 across the 2 of their papers we have counts for
4 papers
Independent Set Reconfiguration Under Bounded-Hop Token
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi +2
The independent set reconfiguration problem (ISReconf) is the problem of determining, for given independent sets I_s and I_t of a graph G, whether I_s can be transformed into I_t b…
Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
Yuichi Sudo, Naoki Kitamura, Masahiro Shibata +4
We study deterministic exploration by a single agent in -interval-connected graphs, a standard model of dynamic networks in which, for every time window of length , the inter…
Near-linear Time Dispersion of Mobile Agents
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
Consider that there are agents in a simple, connected, and undirected graph with nodes and edges. The goal of the dispersion problem is to move these …
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
Kaito Harada, Naoki Kitamura, Taisuke Izumi +1
An \emph{-approximate vertex fault-tolerant distance sensitivity oracle} (\emph{-VSDO}) for a weighted input graph and a source vertex is the data s…