Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge. - Kazuya Haraguchi; Toshihide Ibaraki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Extension of ICF Classifiers to Real World Data Sets. - Kazuya Haraguchi; Hiroshi Nagamochi (IEA/AIE, 2007)

A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns. - Kazuya Haraguchi; Mutsunori Yagiura; Endre Boros; Toshihide Ibaraki (IEICE Trans. Inf. Syst., 2008)

Bipartite Graph Representation of Multiple Decision Table Classifiers. - Kazuya Haraguchi; Seok-Hee Hong 001; Hiroshi Nagamochi (SAGA, 2009)

Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. - Kazuya Haraguchi; Seok-Hee Hong 001; Hiroshi Nagamochi (LION, 2010)

How to Produce BlockSum Instances with Various Levels of Difficulty. - Kazuya Haraguchi; Yasutaka Abe; Akira Maruoka (Inf. Media Technol., 2012)

A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively. - Kazuya Haraguchi (WCO@FedCSIS, 2013)

A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem. - Kazuya Haraguchi; Masaki Ishigaki; Akira Maruoka (FedCSIS, 2013)

BLOCKSUM is NP-Complete. - Kazuya Haraguchi; Hirotaka Ono 001 (IEICE Trans. Inf. Syst., 2013)

The Number of Inequality Signs in the Design of Futoshiki Puzzle. - Kazuya Haraguchi (Inf. Media Technol., 2013)

Approximability of Latin Square Completion-Type Puzzles. - Kazuya Haraguchi; Hirotaka Ono 001 (FUN, 2014)

On A Generalization of "Eight Blocks to Madness". - Kazuya Haraguchi (CoRR, 2014)

An Efficient Local Search for Partial Latin Square Extension Problem. - Kazuya Haraguchi (CPAIOR, 2015)

How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. - Kazuya Haraguchi; Hirotaka Ono 001 (J. Inf. Process., 2015)

On a generalization of "Eight Blocks to Madness" puzzle. - Kazuya Haraguchi (Discret. Math., 2016)

Iterated local search with Trellis-neighborhood for the partial Latin square extension problem. - Kazuya Haraguchi (J. Heuristics, 2016)

The Building Puzzle Is Still Hard Even in the Single Lined Version. - Kazuya Haraguchi; Ryoya Tanaka (J. Inf. Process., 2017)

An Efficient Local Search for the Minimum Independent Dominating Set Problem. - Kazuya Haraguchi (SEA, 2018)

A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. - Kazuya Haraguchi; Hiroshi Nagamochi (ISAAC, 2019)

Recycling Solutions for Vertex Coloring Heuristics. - Yasutaka Uchida; Kazuya Haraguchi (CoRR, 2019)

An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem. - Kazuya Haraguchi; Hideki Hashimoto; Junji Itoyanagi; Mutsunori Yagiura (Int. Trans. Oper. Res., 2019)

COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets. - Kazuya Haraguchi; Yusuke Momoi; Aleksandar Shurbevski; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2019)

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems. - Kazuya Haraguchi; Hiroshi Nagamochi (CoRR, 2020)

Maximum weighted matching with few edge crossings for 2-layered bipartite graph. - Kazuya Haraguchi; Kotaro Torii; Motomu Endo (Discret. Appl. Math., 2020)

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search. - Naveed Ahmed Azam; Jianshen Zhu; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (BIBM, 2021)

An Inverse QSAR Method Based on Decision Tree and Integer Programming. - Kouki Tanaka; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (ICIC (2), 2021)

An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEA/AIE (1), 2021)

An Inverse QSAR Method Based on Linear Regression and Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2021)

Adjustive Linear Regression and Its Application to the Inverse QSAR. - Jianshen Zhu; Kazuya Haraguchi; Hiroshi Nagamochi; Tatsuya Akutsu (BIOINFORMATICS, 2022)

A Method for Molecular Design Based on Linear Regression and Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (ICBBB, 2022)

Enumeration of Support-Closed Subsets in Confluent Systems. - Kazuya Haraguchi; Hiroshi Nagamochi (Algorithmica, 2022)

Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model. - Jianshen Zhu; Naveed Ahmed Azam; Shengjuan Cao; Ryota Ido; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (CoRR, 2022)

A Novel Method for Inferring Chemical Compounds With Prescribed Topological Substructures Based on Integer Programming. - Jianshen Zhu; Naveed Ahmed Azam; Fan Zhang; Aleksandar Shurbevski; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs. - Takumi Tada; Kazuya Haraguchi (IWOCA, 2023)

Polynomial-delay enumeration algorithms in set systems. - Kazuya Haraguchi; Hiroshi Nagamochi (Theor. Comput. Sci., 2023)

Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference. - Bowen Song; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (BIBM, 2024)

Data mining method of single-cell omics data to evaluate a pure tissue environmental effect on gene expression level. - Daigo Okada; Jianshen Zhu; Kan Shota; Yuuki Nishimura; Kazuya Haraguchi (CoRR, 2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle. - Kan Shota; Kazuya Haraguchi (CoRR, 2024)

Comparison of Algorithms and Implementations for Enumerating Support-closed Connected Induced Subgraphs. - Daiki Watanabe; Takumi Tada; Kazuya Haraguchi (J. Inf. Process., 2024)

A Method for Inferring Polymers Based on Linear Regression and Integer Programming. - Ryota Ido; Shengjuan Cao; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)

Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes. - Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Hiroshi Nagamochi; Tatsuya Akutsu (IEEE ACM Trans. Comput. Biol. Bioinform., 2024)

A Linear Delay Algorithm of Enumerating Strongly-Connected Induced Subgraphs Based on SSD Set System. - Kan Shota; Kazuya Haraguchi (IWOCA, 2025)

A linear delay algorithm in SD set system and its application to subgraph enumeration. - Takumi Tada; Kazuya Haraguchi (J. Comput. Syst. Sci., 2025)

Towards Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming. - Jianshen Zhu; Mao Takekida; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (CoRR, 2025)

Chi-Parameter Data Sets for "Towards Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming". - Jianshen Zhu; Mao Takekida; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (Zenodo, 2025)

Enumeration of Bases in Matroid with Exponentially Large Ground Set. - Yuki Nishimura; Kazuya Haraguchi (CoRR, 2025)

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 013; Tatsuya Akutsu (CoRR, 2025)

A unified approach to inferring chemical compounds with the desired aqueous solubility. - Muniba Batool; Naveed Ahmed Azam; Jianshen Zhu; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (J. Cheminformatics, 2025)

Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference. - Bowen Song; Jianshen Zhu; Naveed Ahmed Azam; Kazuya Haraguchi; Liang Zhao 013; Tatsuya Akutsu (J. Cheminformatics, 2025)