Naoki Kitamura

36 papers A* 2A 3B 6Misc 1Journal 21Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Independent set reconfiguration under bounded-hop token jumping. Theor. Comput. Sci. Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2025	J	`jnl`	Approximation hardness of domination problems on generalized convex graphs. Theor. Comput. Sci. Po Yuan Wang, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2025	B	`conf`	Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model. SIROCCO Yuki Kawashima, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2025	J	`jnl`	Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation. CoRR Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2025	B	`conf`	Independent Set Reconfiguration Under Bounded-Hop Token Jumping. WALCOM Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2025	J	`jnl`	Partial gathering of mobile agents in dynamic tori. Comput. J. Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim
2025	J	`jnl`	Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems. CoRR Naoki Kitamura, Yuichi Sudo, Koichi Wada
2025	B	`conf`	Uniform Deployment of Mobile Robots in Complete Bipartite Graphs. OPODIS Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama, Toshimitsu Masuzawa, Quentin Bramas, Sébastien Tixeuil
2024	A	`conf`	A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. ESA Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2024	A*	`conf`	A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2024	J	`jnl`	Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. CoRR Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2024	B	`conf`	Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings. OPODIS Fukuhito Ooshita, Naoki Kitamura, Ryota Eguchi, Michiko Inoue, Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Yuichi Sudo
2024	J	`jnl`	Independent Set Reconfiguration Under Bounded-Hop Token. CoRR Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
2023	J	`jnl`	A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2023	J	`jnl`	Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. IEICE Trans. Inf. Syst. Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa
2023	—	`conf`	Partial Gathering of Mobile Agents in Dynamic Tori. SAND Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim
2022	J	`jnl`	A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. IEICE Trans. Inf. Syst. Naoki Kitamura, Taisuke Izumi
2022	B	`conf`	Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. OPODIS Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2022	J	`jnl`	Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. CoRR Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
2022	J	`jnl`	Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. CoRR Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa
2022	J	`jnl`	Fast Neighborhood Rendezvous. IEICE Trans. Inf. Syst. Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
2022	B	`conf`	Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. SPAA Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
2022	J	`jnl`	Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. CoRR Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
2021	J	`jnl`	A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. CoRR Naoki Kitamura, Taisuke Izumi
2021	J	`jnl`	Fast Neighborhood Rendezvous. CoRR Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
2021	J	`jnl`	Low-congestion shortcut and graph parameters. Distributed Comput. Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2020	A	`conf`	Fast Neighborhood Rendezvous. ICDCS Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
2020	J	`jnl`	Uniform distribution for Pachinko. Theor. Comput. Sci. Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
2019	J	`jnl`	A Population Protocol for Uniform $k$-partition under Global Fairness. Int. J. Netw. Comput. Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
2019	A	`conf`	Low-Congestion Shortcut and Graph Parameters. DISC Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2019	J	`jnl`	Low-Congestion Shortcut and Graph Parameters. CoRR Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
2018	—	`conf`	A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
2018	A*	`conf`	Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. PODC Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi
2018	J	`jnl`	Do evaluation functions really improve Monte-Carlo tree search? ICGA J. Kiminori Matsuzaki, Naoki Kitamura
2018	Misc	`conf`	Uniform Distribution On Pachinko. FUN Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
2015	—	`conf`	Compact 100-Gb/s DP-QPSK intradyne coherent receiver module employing Si waveguide. ECOC Morio Takahashi, Takashi Matsumoto, Shinya Watanabe, Kazuhiro Shiba, Taro Kaneko, Mamoru Oguro, Tadayuki Chikuma, Naoki Kitamura, Hiroyuki Yamazaki