Kazuya Haraguchi

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 29

Top Topics

Integer Programming

Top Venues

J. Inf. Process.

Publications

Daigo Okada, Jianshen Zhu, Kan Shota, Yuuki Nishimura, Kazuya Haraguchi
Data mining method of single-cell omics data to evaluate a pure tissue environmental effect on gene expression level. CoRR (2024)
Kazuya Haraguchi, Hiroshi Nagamochi
Polynomial-delay enumeration algorithms in set systems. Theor. Comput. Sci. 963 (2023)
Takumi Tada, Kazuya Haraguchi
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs. IWOCA (2023)
Takumi Tada, Kazuya Haraguchi
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs. CoRR (2023)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. CoRR (2023)
Jianshen Zhu, Naveed Ahmed Azam, Shengjuan Cao, Ryota Ido, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model. CoRR (2022)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
A Method for Molecular Design Based on Linear Regression and Integer Programming. ICBBB (2022)
Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu
Adjustive Linear Regression and Its Application to the Inverse QSAR. BIOINFORMATICS (2022)
Kazuya Haraguchi, Hiroshi Nagamochi
Enumeration of Support-Closed Subsets in Confluent Systems. Algorithmica 84 (5) (2022)
Jianshen Zhu, Naveed Ahmed Azam, Fan Zhang, Aleksandar Shurbevski, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 19 (6) (2022)
Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
An Inverse QSAR Method Based on Decision Tree and Integer Programming. ICIC (2) (2021)
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. BIBM (2021)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures. IEA/AIE (1) (2021)
Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. CoRR (2021)
Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
An Inverse QSAR Method Based on Linear Regression and Integer Programming. CoRR (2021)
Ryota Ido, Shengjuan Cao, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
A Method for Inferring Polymers Based on Linear Regression and Integer Programming. CoRR (2021)
Kazuya Haraguchi, Kotaro Torii, Motomu Endo
Maximum weighted matching with few edge crossings for 2-layered bipartite graph. Discret. Appl. Math. 287 (2020)
Kazuya Haraguchi, Hiroshi Nagamochi
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems. CoRR (2020)
Kazuya Haraguchi, Hiroshi Nagamochi
Polynomial-delay Enumeration Algorithms in Set Systems. CoRR (2020)
Yasutaka Uchida, Kazuya Haraguchi
Recycling Solutions for Vertex Coloring Heuristics. CoRR (2019)
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. J. Graph Algorithms Appl. 23 (2) (2019)
Kazuya Haraguchi, Kotaro Torii, Motomu Endo
Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph. CoRR (2019)
Kazuya Haraguchi, Hiroshi Nagamochi
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. ISAAC (2019)
Kazuya Haraguchi, Hideki Hashimoto, Junji Itoyanagi, Mutsunori Yagiura
An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem. Int. Trans. Oper. Res. 26 (4) (2019)
Kazuya Haraguchi
An Efficient Local Search for the Minimum Independent Dominating Set Problem. CoRR (2018)
Kazuya Haraguchi
An Efficient Local Search for the Minimum Independent Dominating Set Problem. SEA (2018)
Kazuya Haraguchi, Ryoya Tanaka
The Building Puzzle Is Still Hard Even in the Single Lined Version. J. Inf. Process. 25 (2017)
Kazuya Haraguchi
On a generalization of "Eight Blocks to Madness" puzzle. Discret. Math. 339 (4) (2016)
Kazuya Haraguchi
Iterated local search with Trellis-neighborhood for the partial Latin square extension problem. J. Heuristics 22 (5) (2016)
Kazuya Haraguchi
An Efficient Local Search for Partial Latin Square Extension Problem. CPAIOR (2015)
Kazuya Haraguchi, Hirotaka Ono
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. J. Inf. Process. 23 (3) (2015)
Kazuya Haraguchi
On A Generalization of "Eight Blocks to Madness". CoRR (2014)
Kazuya Haraguchi
An Efficient Local Search for Partial Latin Square Extension Problem. CoRR (2014)
Kazuya Haraguchi, Hirotaka Ono
Approximability of Latin Square Completion-Type Puzzles. FUN (2014)
Kazuya Haraguchi
A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively. WCO@FedCSIS (2013)
Kazuya Haraguchi, Hirotaka Ono
BLOCKSUM is NP-Complete. IEICE Trans. Inf. Syst. (3) (2013)
Kazuya Haraguchi
The Number of Inequality Signs in the Design of Futoshiki Puzzle. J. Inf. Process. 21 (1) (2013)
Kazuya Haraguchi
The Number of Inequality Signs in the Design of Futoshiki Puzzle. Inf. Media Technol. 8 (1) (2013)
Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka
A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem. FedCSIS (2013)
Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka
How to Produce BlockSum Instances with Various Levels of Difficulty. Inf. Media Technol. 7 (3) (2012)
Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka
How to Produce BlockSum Instances with Various Levels of Difficulty. J. Inf. Process. 20 (3) (2012)
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. LION (2010)
Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
Bipartite Graph Representation of Multiple Decision Table Classifiers. SAGA (2009)
Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. IEICE Trans. Inf. Syst. (3) (2008)
Kazuya Haraguchi, Hiroshi Nagamochi
Extension of ICF Classifiers to Real World Data Sets. IEA/AIE (2007)
Kazuya Haraguchi, Toshihide Ibaraki
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2006)