Awards 1
-
優秀研究賞
北村直暉, 川端裕也, 泉泰介 情報科学ワークショップ 2016/09
Naoki Kitamura
北村 直暉
Naoki Kitamura
北村 直暉
Graduate School of Information Science and Technology Department of Computer Science, Assistant Professor
Papers 19
-
Independent Set Reconfiguration Under Bounded-Hop Token Jumping.
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
WALCOM p. 215-228 2025 Research paper (international conference proceedings)
-
Approximation hardness of domination problems on generalized convex graphs.
Po Yuan Wang, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
Theor. Comput. Sci. Vol. 1028 p. 115035-115035 2025 Research paper (scientific journal)
-
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles.
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
ESA p. 65-18 2024/09/23 Research paper (international conference proceedings)
-
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching
Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) p. 4062-4082 2024/01/04 Part of collection (book)
Publisher: Society for Industrial and Applied Mathematics
-
Independent Set Reconfiguration Under Bounded-Hop Token.
Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
CoRR Vol. abs/2407.11768 2024 Research paper (scientific journal)
-
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set.
Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa
IEICE Transactions on Information & Systems Vol. 106 No. 11 p. 1762-1771 2023/11 Research paper (scientific journal)
-
Partial Gathering of Mobile Agents in Dynamic Tori
Masahiro, Shibata, Naoki Kitamura, Ryota, Eguvhi, Yuichi, Sudo, Junya, Nakamura, Yonghwan, Kim
Symposium on Algorithmic Foundations of Dynamic Networks (SAND) Vol. 257 p. 2:1-2:22 2023/06 Research paper (international conference proceedings)
-
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
26th International Conference on Principles of Distributed Systems, OPODIS 2022 p. 11:1-11:18 2022/12 Research paper (international conference proceedings)
-
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki KITAMURA, Taisuke IZUMI
IEICE Transactions on Information and Systems Vol. E105.D No. 3 p. 634-645 2022/03/01 Research paper (scientific journal)
Publisher: Institute of Electronics, Information and Communications Engineers (IEICE)
-
Fast Neighborhood Rendezvous
Ryota EGUCHI, Naoki KITAMURA, Taisuke IZUMI
IEICE Transactions on Information and Systems Vol. E105.D No. 3 p. 597-610 2022/03/01 Research paper (scientific journal)
Publisher: Institute of Electronics, Information and Communications Engineers (IEICE)
-
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs.
Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
SPAA p. 11-22 2022 Research paper (international conference proceedings)
-
Low-congestion shortcut and graph parameters
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
Distributed Computing Vol. 34 No. 5 p. 349-365 2021/10 Research paper (scientific journal)
Publisher: Springer Science and Business Media LLC
-
Uniform distribution for Pachinko
Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
Theoretical Computer Science Vol. 839 p. 103-121 2020/11 Research paper (international conference proceedings)
Publisher: Elsevier BV
-
Fast Neighborhood Rendezvous.
Ryota Eguchi, Naoki Kitamura, Taisuke Izumi
40th IEEE International Conference on Distributed Computing Systems(ICDCS) p. 168-178 2020 Research paper (international conference proceedings)
Publisher: IEEE
-
Low-Congestion Shortcut and Graph Parameters.
Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi
33rd International Symposium on Distributed Computing(DISC) p. 25:1-25:17 2019 Research paper (international conference proceedings)
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
-
A Population Protocol for Uniform k-partition under Global Fairness
Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
International Journal of Networking and Computing Vol. 9 No. 1 p. 97-110 2019 Research paper (scientific journal)
Publisher: IJNC Editorial Committee
-
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 p. 241-243 2018/07 Research paper (international conference proceedings)
Publisher: ACM
-
Uniform distribution on pachinko
Naoki Kitamura, Yuya Kawabata, Taisuke Izumi
The 9th International Conference on FUN with Algorithms p. 26:1-26:14 2018/06 Research paper (international conference proceedings)
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
-
A Population Protocol for Uniform k-Partition Under Global Fairness.
Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue
2018 IEEE International Parallel and Distributed Processing Symposium Workshops p. 813-819 2018 Research paper (international conference proceedings)
Publisher: IEEE Computer Society
Presentations 1
-
CONGESTモデルにおける最⼤マッチング問題に対する⾼速な アルゴリズム
北村直暉
COMP-AFSA学生シンポジウム 2024/03/06