Pict a

HARAGUCHI Kazuya

Job title: Professor
Department: Department of Logistics and Information Engineering

Link

Researchmap

To the head of this page.▲

Research Interests 【 display / non-display 】

  • オペレーションズ・リサーチ（OR）

  • グラフの連結性

  • グラフ理論

  • 部分グラフ列挙問題

  • 離散最適化（組合せ最適化）

display all >>

To the head of this page.▲

Research Areas 【 display / non-display 】

  • Informatics / Mathematical informatics  / 最適化理論、組合せ最適化

  • Social Infrastructure (Civil Engineering, Architecture, Disaster Prevention) / Social systems engineering  / オペレーションズ・リサーチ（OR）

  • Informatics / Theory of informatics  / 離散構造、アルゴリズム理論

To the head of this page.▲
 

Papers 【 display / non-display 】

  • A Linear-Delay Algorithm for Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System

    Kan Shota, Kazuya Haraguchi , 2026.06

    Journal of Computer and System Sciences

    DOI

  • An Inverse QSAR Method Based on a Two-Layered Model and Integer Programming

    Yu Shi, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu , 2021.03

    International Journal of Molecular Sciences

    DOI

  • Iterated local search with Trellis-neighborhood for the partial Latin square extension problem

    Kazuya Haraguchi , 2016.10

    JOURNAL OF HEURISTICS

    DOI

  • Enumeration of Bases in Matroid with Exponentially Large Ground Set

    Yuki Nishimura, Kazuya Haraguchi , 2026.03

    Proceedings of The 20th International Conference and Workshops on Algorithms and Computation (WALCOM 2026)

    DOI

  • Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model

    Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu , 2025.12

    Proceedings of 2025 9th International Conference on Computational Biology and Bioinformatics (ICCBB 2025)

    DOI

display all >>

To the head of this page.▲

Books 【 display / non-display 】

  • 実践Pythonライブラリー「Kivyプログラミング ～Pythonで作るマルチタッチアプリ～」

    久保幹雄, 原口和也 , 2018.06

    朝倉書店 , 0-0

To the head of this page.▲

Grant-in-Aid for Scientific Research 【 display / non-display 】

  • SSDグラフ分解に関する理論の確立と応用可能性の追求

    Project Period (FY)： 2025/04  -  2028/03  Investigator(s): 原口 和也

    Grant-in-Aid for Scientific Research(C)  Principal Investigator  25K14993 

  • Advanced Studies and Developments on Discrete Preimage Problems

    Project Period (FY)： 2022/04  -  2027/03  Investigator(s): 阿久津 達也

    Grant-in-Aid for Scientific Research(A)  Co-Investigator  22H00532 

  • Modeling and Algorithms for Discrete Problems

    Project Period (FY)： 2020/04  -  2023/03  Investigator(s): Haraguchi Kazuya

    Grant-in-Aid for Scientific Research(C)  Principal Investigator  20K04978 

    It is the enumeration problem that we have made remarkable achievements. Suppose that a set system (i.e., a hypergraph) with an item set is implicitly given by means of an oracle that generates maximal solutions that are subsets of an input subset. We consider a problem that asks to enumerate all maximal solutions with respect to the common item set. We have developed polynomial-delay algorithms for a case when there is no assumption on the set system and a case when the set system is “confluent”. These results are so general that enabled us to find a way to new research problems that include implementation of algorithms that enumerate all maximal connected induced subgraphs with respect to the common itemset and enumeration of subgraphs that satisfy various connectivity conditions (e.g., 2-edge/vertex-connected induced subgraphs in undirected graphs and strongly-connected induced subgraphs in digraphs).

To the head of this page.▲