Naoki Kitamura

works on

card-based cryptography 1 directed graphs 1 fault tolerance 1 local failover routing 1 moderatorless games 1 packet header bits 1 physical protocols 1 routing algorithms 1 secret sharing 1 social deduction 1

From the 2 of 7 linked papers with an AI index.

most citedIndependent Set Reconfiguration Under Bounded-Hop Token

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing cs.DCShow all

2 papers · 1 filter

cs.DC2026

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 $T$ -interval-connected graphs, a standard model of dynamic networks in which, for every time window of length $T$ , the inter…

cs.DC2025

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching

Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi

In this paper, we propose a randomized $O ~ (I^¼ (G))$ -round algorithm for the maximum cardinality matching problem in the CONGEST model, where $I^¼ (G)$ means the maximum size of…