Kazuya Haraguchi

61 papers B 4C 4Misc 1Journal 43Unranked 9
YearRankTypeTitle / Venue / Authors
2026 B conf
Enumeration of Bases in Matroid with Exponentially Large Ground Set.
WALCOM
Yuki Nishimura, Kazuya Haraguchi
2025 C conf
A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System.
IWOCA
Kan Shota, Kazuya Haraguchi
2025 J jnl
A linear delay algorithm in SD set system and its application to subgraph enumeration.
J. Comput. Syst. Sci.
Takumi Tada, Kazuya Haraguchi
2025 J jnl
A unified approach to inferring chemical compounds with the desired aqueous solubility.
J. Cheminformatics
Muniba Batool, Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2025 J jnl
Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2025 J jnl
Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference.
J. Cheminformatics
Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2025 J jnl
Enumeration of Bases in Matroid with Exponentially Large Ground Set.
CoRR
Yuki Nishimura, Kazuya Haraguchi
2025 J jnl
Towards Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming.
CoRR
Jianshen Zhu, Mao Takekida, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 J jnl
A Method for Inferring Polymers Based on Linear Regression and Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform.
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2024 J jnl
A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility.
CoRR
Muniba Batool, Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 J jnl
Comparison of Algorithms and Implementations for Enumerating Support-closed Connected Induced Subgraphs.
J. Inf. Process.
Daiki Watanabe, Takumi Tada, Kazuya Haraguchi
2024 — conf
Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference.
BIBM
Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 J jnl
Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference.
CoRR
Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu
2024 J jnl
Data mining method of single-cell omics data to evaluate a pure tissue environmental effect on gene expression level.
CoRR
Daigo Okada, Jianshen Zhu, Kan Shota, Yuuki Nishimura, Kazuya Haraguchi
2024 J jnl
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2024 J jnl
SSD Set System, Graph Decomposition and Hamiltonian Cycle.
CoRR
Kan Shota, Kazuya Haraguchi
2023 C conf
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs.
IWOCA
Takumi Tada, Kazuya Haraguchi
2023 J jnl
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs.
CoRR
Takumi Tada, Kazuya Haraguchi
2023 J jnl
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2023 J jnl
Polynomial-delay enumeration algorithms in set systems.
Theor. Comput. Sci.
Kazuya Haraguchi, Hiroshi Nagamochi
2022 — conf
A Method for Molecular Design Based on Linear Regression and Integer Programming.
ICBBB
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2022 — conf
Adjustive Linear Regression and Its Application to the Inverse QSAR.
BIOINFORMATICS
Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu
2022 J jnl
Enumeration of Support-Closed Subsets in Confluent Systems.
Algorithmica
Kazuya Haraguchi, Hiroshi Nagamochi
2022 J jnl
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao, Ryota Ido, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
A Method for Inferring Polymers Based on Linear Regression and Integer Programming.
CoRR
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.
IEA/AIE (1)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
An Inverse QSAR Method Based on Decision Tree and Integer Programming.
ICIC (2)
Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
An Inverse QSAR Method Based on Linear Regression and Integer Programming.
CoRR
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 — conf
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
BIBM
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2021 J jnl
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
CoRR
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
2020 J jnl
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems.
CoRR
Kazuya Haraguchi, Hiroshi Nagamochi
2020 J jnl
Maximum weighted matching with few edge crossings for 2-layered bipartite graph.
Discret. Appl. Math.
Kazuya Haraguchi, Kotaro Torii, Motomu Endo
2020 J jnl
Polynomial-delay Enumeration Algorithms in Set Systems.
CoRR
Kazuya Haraguchi, Hiroshi Nagamochi
2019 B conf
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions.
ISAAC
Kazuya Haraguchi, Hiroshi Nagamochi
2019 J jnl
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem.
Int. Trans. Oper. Res.
Kazuya Haraguchi, Hideki Hashimoto, Junji Itoyanagi, Mutsunori Yagiura
2019 J jnl
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets.
J. Graph Algorithms Appl.
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi
2019 J jnl
Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph.
CoRR
Kazuya Haraguchi, Kotaro Torii, Motomu Endo
2019 J jnl
Recycling Solutions for Vertex Coloring Heuristics.
CoRR
Yasutaka Uchida, Kazuya Haraguchi
2018 B conf
An Efficient Local Search for the Minimum Independent Dominating Set Problem.
SEA
Kazuya Haraguchi
2018 J jnl
An Efficient Local Search for the Minimum Independent Dominating Set Problem.
CoRR
Kazuya Haraguchi
2017 J jnl
The Building Puzzle Is Still Hard Even in the Single Lined Version.
J. Inf. Process.
Kazuya Haraguchi, Ryoya Tanaka
2016 J jnl
Iterated local search with Trellis-neighborhood for the partial Latin square extension problem.
J. Heuristics
Kazuya Haraguchi
2016 J jnl
On a generalization of "Eight Blocks to Madness" puzzle.
Discret. Math.
Kazuya Haraguchi
2015 B conf
An Efficient Local Search for Partial Latin Square Extension Problem.
CPAIOR
Kazuya Haraguchi
2015 J jnl
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately.
J. Inf. Process.
Kazuya Haraguchi, Hirotaka Ono
2014 J jnl
An Efficient Local Search for Partial Latin Square Extension Problem.
CoRR
Kazuya Haraguchi
2014 Misc conf
Approximability of Latin Square Completion-Type Puzzles.
FUN
Kazuya Haraguchi, Hirotaka Ono
2014 J jnl
On A Generalization of "Eight Blocks to Madness".
CoRR
Kazuya Haraguchi
2013 — conf
A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively.
WCO@FedCSIS
Kazuya Haraguchi
2013 C conf
A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem.
FedCSIS
Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka
2013 J jnl
BLOCKSUM is NP-Complete.
IEICE Trans. Inf. Syst.
Kazuya Haraguchi, Hirotaka Ono
2013 J jnl
The Number of Inequality Signs in the Design of Futoshiki Puzzle.
Inf. Media Technol.
Kazuya Haraguchi
2013 J jnl
The Number of Inequality Signs in the Design of Futoshiki Puzzle.
J. Inf. Process.
Kazuya Haraguchi
2012 J jnl
How to Produce BlockSum Instances with Various Levels of Difficulty.
Inf. Media Technol.
Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka
2012 J jnl
How to Produce BlockSum Instances with Various Levels of Difficulty.
J. Inf. Process.
Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka
2010 — conf
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables.
LION
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
2009 — conf
Bipartite Graph Representation of Multiple Decision Table Classifiers.
SAGA
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
2008 J jnl
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.
IEICE Trans. Inf. Syst.
Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki
2007 C conf
Extension of ICF Classifiers to Real World Data Sets.
IEA/AIE
Kazuya Haraguchi, Hiroshi Nagamochi
2006 J jnl
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuya Haraguchi, Toshihide Ibaraki