Rchr
J-GLOBAL ID:202001020800888260   Update date: Nov. 05, 2024

Kurita Kazuhiro

クリタ カズヒロ | Kurita Kazuhiro
Affiliation and department:
Job title: Assistant Professor
Research field  (1): Mathematical informatics
Research keywords  (4): Top-K/K-best enumeration ,  Optimization ,  Algorithm ,  Enumeration
Research theme for competitive and other funds  (8):
  • 2024 - 2029 文学的読解を通じた意図の推察に基づくSNS上の誹謗中傷・悪口の分析手法の開発
  • 2022 - 2027 Foundation of Japanese stylistics for social media analysis
  • 2022 - 2026 列挙や数え上げなどを統一的に扱うための基盤技術
  • 2021 - 2026 A Method for Analyzing Collective Behavior Based on Structuring Topics on Large-Scale SNS
  • 2021 - 2025 サイズ制約付き極小部分集合列挙問題に対する多項式遅延近似列挙アルゴリズムの研究
Show all
Papers (37):
  • Yasuaki Kobayashi, Kazuhiro Kurita, Kunihiro Wasa. Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints. Discrete Applied Mathematics. 2025
  • Caroline Brosse, Oscar Defrain, Kazuhiro Kurita, Vincent Limouzy, Takeaki Uno, Kunihiro Wasa. On the hardness of inclusion-wise minimal separators enumeration. Information Processing Letters. 2024. 185. 106469-106469
  • Kazuhiro Kurita, Kunihiro Wasa. An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints. Theor. Comput. Sci. 2024. 1005. 114628-114628
  • Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Hirotaka Ono 0001. Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints. IWOCA. 2024. 232-246
  • Alessio Conte, Roberto Grossi, Yasuaki Kobayashi, Kazuhiro Kurita, Davide Rucci, Takeaki Uno, Kunihiro Wasa. Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size. CoRR. 2024. abs/2405.13613
more...
MISC (26):
  • Computing diverse pair of solutions for SAT. 2024
  • オノラト ドロゲット ニコラス, 栗田 和宏, 土中 哲秀, 小野 廣隆. An Edit Model and Algorithms for Achieving Properties on Intersection Graphs. 2023年度冬のLAシンポジウム. 2024
  • Computing diverse pair of solutions for SAT. 2024
  • 小林 靖明, 栗田 和宏. 極小シュタイナー多点対頂点カット列挙の計算困難性. 2023年度冬のLAシンポジウム. 2024
  • Nicolás Honorato Drogue, Kazuhiro Kurita, Tesshu Hanaka, Hirotaka Ono. Algorithms for Optimally Shifting Intervals under Intersection Graph Models. 日本オペレーションズ・リサーチ学会 九州支部 九州地区におけるOR若手研究交流会. 2023
more...
Education (1):
  • 2017 - 2020 Hokkaido University Graduate School of Information Science and Technology
Professional career (1):
  • 博士(情報科学) (北海道大学)
Work history (3):
  • 2022/07 - 現在 Nagoya University Graduate School of Informatics Assistant Professor
  • 2020/04 - 2022/06 National Institute of Informatics
  • 2019/04 - 2021/03 Japan Society for the Promotion of Science
Awards (1):
  • 2020/06 - 人工知能学会 研究会優秀賞 多様な部分グラフを発見するアルゴリズム
Association Membership(s) (2):
一般社団法人人工知能学会 ,  一般社団法人情報処理学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page