Author

Naoki Kitamura

h-index 5 View on Semantic Scholar

We have 3 of 30 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Beating Quadratic Time--Message Trade-off in Distributed Minimum Spanning Tree Construction

A new distributed algorithm for computing a minimum spanning tree (MST) in the CONGEST-KT model, where messages are limited to $O(\log n)$ bits and each vertex initially knows the identifiers of its neighbors, which breaks the quadratic time--message trade-off barrier.

Taisuke Izumi, Naoki Kitamura, T. Masuzawa · 0 citations

Jul 2026

NP-Hardness of Connected Components Reconfiguration under Component Jumping on Caterpillar Graphs

It is proved that \CCRCJ~on path graphs is NP-hard even on caterpillar graphs, which is a very restricted subclass of trees and chordal graphs minimally above path graphs, thereby resolving Nakahata's open problem on chordal graphs under multiset size constraints.

Naoki Kitamura, Seitaro Kawaguchi, Yuya Terashima et al. · arXiv.org · 0 citations

Open access Jul 2026

Improved Algorithms for Local Failover Routing on Directed Graphs

This paper studies local failover schemes that minimize the number of rewritable bits in the packet header on directed graphs with $k-arc failures and shows that their scheme is nearly optimal when the number of faulty arcs is approximately less than the number of nodes.

Yuki Kawashima, Naoki Kitamura, Taisuke Izumi · IEICE Transactions on Fundam... · 0 citations