• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Kitamura Naoki  北村 直暉

ORCIDConnect your ORCID iD *help
Researcher Number 30963657
Other IDs
Affiliation (Current) 2026: 大阪大学, 大学院情報科学研究科, 助教
Affiliation (based on the past Project Information) *help 2026: 大阪大学, 大学院情報科学研究科, 助教
2022 – 2024: 大阪大学, 大学院情報科学研究科, 助教
Review Section/Research Field
Principal Investigator
Basic Section 60010:Theory of informatics-related / 1001:Information science, computer engineering, and related fields
Except Principal Investigator
Medium-sized Section 60:Information science, computer engineering, and related fields
Keywords
Principal Investigator
分散アルゴリズム / 動的グラフ / フォールトトレラント / 普遍的な最適アルゴリズム / パラメータ化アルゴリズム / 木幅 / モバイルエージェント
Except Principal Investigator
クリティカルな実行 / 機械学習 / 分散アルゴリズム / 分散ソフトウェア / 分散システム
  • Research Projects

    (4 results)
  • Research Products

    (16 results)
  • Co-Researchers

    (2 People)
  •  自律分散ロボット群の通信能力と計算能力の関係の解明Principal Investigator

    • Principal Investigator
      北村 直暉
    • Project Period (FY)
      2026 – 2029
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      The University of Osaka
  •  耐故障性を考慮した分散アルゴリズムの設計Principal Investigator

    • Principal Investigator
      北村 直暉
    • Project Period (FY)
      2023 – 2025
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Osaka University
  •  Design of the Universally Optimal Distributed AlgorithmPrincipal Investigator

    • Principal Investigator
      Kitamura Naoki
    • Project Period (FY)
      2022 – 2024
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Review Section
      1001:Information science, computer engineering, and related fields
    • Research Institution
      Osaka University
  •  A machine learning based approach to automatic derivation of critical executions of distributed softwares

    • Principal Investigator
      Masuzawa Toshimitsu
    • Project Period (FY)
      2021 – 2024
    • Research Category
      Grant-in-Aid for Challenging Research (Exploratory)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Osaka University

All 2025 2024 2023 2022

All Presentation

  • [Presentation] (Brief Announcement): Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model2025

    • Author(s)
      Yuki Kawashima, Naoki Kitamura, Taisuke Izumi and Toshimitsu Masuzawa
    • Organizer
      International Colloquium on Structural Information and Communications Complexity(SIROCCO)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] (Brief Announcement): Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model2025

    • Author(s)
      Yuki Kawashima, Naoki Kitamura, Taisuke Izumi and Toshimitsu Masuzawa
    • Organizer
      International Colloquium on Structural Information and Communications Complexity(SIROCCO 2025)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K16838
  • [Presentation] CONGESTモデルにおける最大マッチング問題に対する高速なアルゴリズム2024

    • Author(s)
      北村直暉
    • Organizer
      電子情報通信学会 総合大会 シンポジウムセッション COMP-AFSA学生シンポジウム
    • Invited
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] Crash-Tolerant Perpetual Exploration with Myopic Luminous Robots on Rings2024

    • Author(s)
      Fukuhito Ooshita, Naoki Kitamura, Ryota Eguchi, Michiko Inoue, Hirotsugu Kakugawa, Sayaka Kamei, Masahiro Shibata, Yuichi Sudo
    • Organizer
      International Conference on Principles of Distributed Systems (OPODIS 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K16838
  • [Presentation] A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching2024

    • Author(s)
      Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
    • Organizer
      ACM-SIAM Symposium on Discrete Algorithms (SODA)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] ハイブリッドモデルにおける(1+ε)-近似MSTの高速な構築アルゴリズム2024

    • Author(s)
      平岡昇真, 北村直暉,泉泰介, 増澤利光
    • Organizer
      情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles2024

    • Author(s)
      Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa
    • Organizer
      Annual European Symposium on Algorithms (ESA 2024)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K16838
  • [Presentation] Independent Set Reconfiguration Under Bounded-Hop Token Jumping2024

    • Author(s)
      Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa
    • Organizer
      International Conference and Workshops on Algorithms and Computation(WALCOM)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] Partial Gathering of Mobile Agents in Dynamic Tori2023

    • Author(s)
      Masahiro Shibata, Naoki Kitamura, Ryota Eguchi, Yuichi Sudo, Junya Nakamura, Yonghwan Kim
    • Organizer
      Symposium on Algorithmic Foundations of Dynamic Networks (SAND)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K16838
  • [Presentation] 有向グラフに対する(1+e)-近似単一始点距離感度オラクルをほぼ線形時間で構築するアルゴリズム2023

    • Author(s)
      原田海音,北村直暉,泉泰介,増澤利光
    • Organizer
      情報科学ワークショップ
    • Data Source
      KAKENHI-PROJECT-23K16838
  • [Presentation] 距離制限を設けたToken Jumping問題の計算困難性2023

    • Author(s)
      羽田野 裕貴, 北村 直輝, 泉 泰介, 伊藤 健洋, 増澤 利光
    • Organizer
      LAシンポジウム
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] 2体の無記憶エージェントによる記憶ありエージェントの模倣2023

    • Author(s)
      高本 皇輝, 北村 直暉, 泉 泰介, 増澤 利光
    • Organizer
      LAシンポジウム
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] 最短経路の最致命辺問題のパラメータ化複雑性2023

    • Author(s)
      芦田雄斗, 北村直暉, 泉泰介, 増澤利光
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] Circulating Exploration of an Arbitrary Graph by Energy-sharing Agents2022

    • Author(s)
      Xingzhe Sun, Naoki Kitamura, Taisuke Izumi, Toshimitu Masuzawa
    • Organizer
      電子情報通信学会総合大会
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs2022

    • Author(s)
      Taichi Inoue, Naoki Kitamura; Taisuke Izumi, Toshimitsu Masuzawa
    • Organizer
      26th International Conference on Principles of Distributed Systems (OPODIS)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22K21277
  • [Presentation] Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs2022

    • Author(s)
      Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman
    • Organizer
      34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-22K21277
  • 1.  Masuzawa Toshimitsu (50199692)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 2.  泉 泰介 (20432461)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi