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 (ECOC, 2015)

Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. - Naoki Kitamura; Kazuki Kakizawa; Yuya Kawabata; Taisuke Izumi (PODC, 2018)

Do evaluation functions really improve Monte-Carlo tree search? - Kiminori Matsuzaki; Naoki Kitamura (J. Int. Comput. Games Assoc., 2018)

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)

Uniform distribution for Pachinko. - Naoki Kitamura; Yuya Kawabata; Taisuke Izumi (Theor. Comput. Sci., 2020)

Low-congestion shortcut and graph parameters. - Naoki Kitamura; Hirotaka Kitagawa; Yota Otachi; Taisuke Izumi (Distributed Comput., 2021)

Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. - Taichi Inoue; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (OPODIS, 2022)

Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. - Taisuke Izumi; Naoki Kitamura; Takamasa Naruse; Gregory Schwartzman (SPAA, 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)

Fast Neighborhood Rendezvous. - Ryota Eguchi; Naoki Kitamura; Taisuke Izumi (IEICE Trans. Inf. Syst., 2022)

A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. - Naoki Kitamura; Taisuke Izumi (IEICE Trans. Inf. Syst., 2022)

Partial Gathering of Mobile Agents in Dynamic Tori. - Masahiro Shibata; Naoki Kitamura; Ryota Eguchi; Yuichi Sudo; Junya Nakamura 001; Yonghwan Kim 001 (SAND, 2023)

Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. - Rongcheng Dong; Taisuke Izumi; Naoki Kitamura; Yuichi Sudo; Toshimitsu Masuzawa (IEICE Trans. Inf. Syst., 2023)

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. - Kaito Harada; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (ESA, 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 (OPODIS, 2024)

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. - Taisuke Izumi; Naoki Kitamura; Yutaro Yamaguchi 001 (SODA, 2024)

Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. - Kaito Harada; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (CoRR, 2024)

Independent Set Reconfiguration Under Bounded-Hop Token. - Hiroki Hatano; Naoki Kitamura; Taisuke Izumi; Takehiro Ito; Toshimitsu Masuzawa (CoRR, 2024)

Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model. - Yuki Kawashima; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (SIROCCO, 2025)

Independent Set Reconfiguration Under Bounded-Hop Token Jumping. - Hiroki Hatano; Naoki Kitamura; Taisuke Izumi; Takehiro Ito; Toshimitsu Masuzawa (WALCOM, 2025)

Approximation hardness of domination problems on generalized convex graphs. - Po Yuan Wang; Naoki Kitamura; Taisuke Izumi; Toshimitsu Masuzawa (Theor. Comput. Sci., 2025)