11 citations · 52 across the 27 of their papers we have counts for
33 papers
Rendezvous under Variable Disorientation:The Algorithmic Power of Fixed Unit Distance
Toshimitsu Masuzawa, Yuichi Sudo, Koichi Wada
We study deterministic Rendezvous of two robots with lights under weak geometric and synchronization assumptions. Our focus is on Variable Disorientation (VD), where each robot may…
Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction
Taisuke Izumi, Naoki Kitamura, Toshimitsu Masuzawa
We present a new distributed algorithm for computing a minimum spanning tree (MST) in the \textsf{CONGEST-KT} model, where messages are limited to bits and each v…
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…
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…
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 str…
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 …