Naoki Kitamura

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 25

Top Topics

Monotone Boolean Functions

Independent Set

Maximum Matching

Top Venues

IEICE Trans. Inf. Syst.

Publications

Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA (2024)
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
Independent Set Reconfiguration Under Bounded-Hop Token. CoRR (2024)
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. CoRR (2024)
Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR (2023)
Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim
Partial Gathering of Mobile Agents in Dynamic Tori. SAND (2023)
Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. IEICE Trans. Inf. Syst. 106 (11) (2023)
Naoki Kitamura, Taisuke Izumi
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. IEICE Trans. Inf. Syst. (3) (2022)
Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. CoRR (2022)
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. OPODIS (2022)
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Computational Power of A Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. CoRR (2022)
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. CoRR (2022)
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. SPAA (2022)
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
Fast Neighborhood Rendezvous. IEICE Trans. Inf. Syst. (3) (2022)
Naoki Kitamura, Taisuke Izumi
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. CoRR (2021)
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
Low-congestion shortcut and graph parameters. Distributed Comput. 34 (5) (2021)
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
Fast Neighborhood Rendezvous. CoRR (2021)
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
Fast Neighborhood Rendezvous. ICDCS (2020)
Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
Uniform distribution for Pachinko. Theor. Comput. Sci. 839 (2020)
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
Low-Congestion Shortcut and Graph Parameters. CoRR (2019)
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
Low-Congestion Shortcut and Graph Parameters. DISC (2019)
Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
A Population Protocol for Uniform $k$-partition under Global Fairness. Int. J. Netw. Comput. 9 (1) (2019)
Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. PODC (2018)
Kiminori Matsuzaki, Naoki Kitamura
Do evaluation functions really improve Monte-Carlo tree search? J. Int. Comput. Games Assoc. 40 (3) (2018)
Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops (2018)
Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
Uniform Distribution On Pachinko. FUN (2018)
Morio Takahashi, Takashi Matsumoto, Shinya Watanabe, Kazuhiro Shiba, Taro Kaneko, Mamoru Oguro, Tadayuki Chikuma, Naoki Kitamura, Hiroyuki Yamazaki
Compact 100-Gb/s DP-QPSK intradyne coherent receiver module employing Si waveguide. ECOC (2015)