Naoki Kitamura

According to our database, Naoki Kitamura authored at least 19 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Approximation hardness of domination problems on generalized convex graphs.

Po Yuan Wang, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa

Theor. Comput. Sci., 2025

2024

Independent Set Reconfiguration Under Bounded-Hop Token.

Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa

CoRR, 2024

Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time.

Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa

CoRR, 2024

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching.

Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings.

Fukuhito Ooshita, Naoki Kitamura, Ryota Eguchi, Michiko Inoue, Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Yuichi Sudo

Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles.

Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Loosely-Stabilizing Algorithm on Almost Maximal Independent Set.

Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa

IEICE Trans. Inf. Syst., November, 2023

Partial Gathering of Mobile Agents in Dynamic Tori.

Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching.

Naoki Kitamura, Taisuke Izumi

IEICE Trans. Inf. Syst., 2022

Fast Neighborhood Rendezvous.

Ryota Eguchi, Naoki Kitamura, Taisuke Izumi

IEICE Trans. Inf. Syst., 2022

Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices.

Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa

CoRR, 2022

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs.

Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs.

Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

2021

Low-congestion shortcut and graph parameters.

Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi

Distributed Comput., 2021

2020

Uniform distribution for Pachinko.

Naoki Kitamura, Yuya Kawabata, Taisuke Izumi

Theor. Comput. Sci., 2020

2019

A Population Protocol for Uniform $k$-partition under Global Fairness.

Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue

Int. J. Netw. Comput., 2019

2018

Do evaluation functions really improve Monte-Carlo tree search?

Kiminori Matsuzaki, Naoki Kitamura

J. Int. Comput. Games Assoc., 2018

Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage.

Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2015

Compact 100-Gb/s DP-QPSK intradyne coherent receiver module employing Si waveguide.

Morio Takahashi, Takashi Matsumoto, Shinya Watanabe, Kazuhiro Shiba, Taro Kaneko, Mamoru Oguro, Tadayuki Chikuma, Naoki Kitamura, Hiroyuki Yamazaki

Proceedings of the European Conference on Optical Communication, 2015