Kazuya Haraguchi

According to our database, Kazuya Haraguchi authored at least 42 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Molecular Design Based on Integer Programming and Splitting Data Sets by Hyperplanes.

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

IEEE ACM Trans. Comput. Biol. Bioinform., 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, Hiroshi Nagamochi, Tatsuya Akutsu

IEEE ACM Trans. Comput. Biol. Bioinform., 2024

Comparison of Algorithms and Implementations for Enumerating Support-closed Connected Induced Subgraphs.

Daiki Watanabe, Takumi Tada, Kazuya Haraguchi

J. Inf. Process., 2024

A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility.

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

CoRR, 2024

Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference.

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

CoRR, 2024

SSD Set System, Graph Decomposition and Hamiltonian Cycle.

Kan Shota, Kazuya Haraguchi

CoRR, 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

2023

Polynomial-delay enumeration algorithms in set systems.

Kazuya Haraguchi, Hiroshi Nagamochi

Theor. Comput. Sci., 2023

A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs.

Takumi Tada, Kazuya Haraguchi

Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

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, Hiroshi Nagamochi, Tatsuya Akutsu

IEEE ACM Trans. Comput. Biol. Bioinform., 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, Hiroshi Nagamochi, Tatsuya Akutsu

CoRR, 2022

Enumeration of Support-Closed Subsets in Confluent Systems.

Kazuya Haraguchi, Hiroshi Nagamochi

Algorithmica, 2022

A Method for Molecular Design Based on Linear Regression and Integer Programming.

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

Proceedings of the ICBBB 2022: 12th International Conference on Bioscience, Biochemistry and Bioinformatics, Tokyo, Japan, January 7, 2022

Adjustive Linear Regression and Its Application to the Inverse QSAR.

Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu

Proceedings of the 15th International Joint Conference on Biomedical Engineering Systems and Technologies, 2022

2021

An Inverse QSAR Method Based on Linear Regression and Integer Programming.

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

CoRR, 2021

An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.

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

Proceedings of the Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices, 2021

An Inverse QSAR Method Based on Decision Tree and Integer Programming.

Kouki Tanaka, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu

Proceedings of the Intelligent Computing Theories and Application, 2021

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.

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

Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021

2020

Maximum weighted matching with few edge crossings for 2-layered bipartite graph.

Kazuya Haraguchi, Kotaro Torii, Motomu Endo

Discret. Appl. Math., 2020

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems.

Kazuya Haraguchi, Hiroshi Nagamochi

CoRR, 2020

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

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

Recycling Solutions for Vertex Coloring Heuristics.

Yasutaka Uchida, Kazuya Haraguchi

CoRR, 2019

A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions.

Kazuya Haraguchi, Hiroshi Nagamochi

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

An Efficient Local Search for the Minimum Independent Dominating Set Problem.

Kazuya Haraguchi

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017

The Building Puzzle Is Still Hard Even in the Single Lined Version.

Kazuya Haraguchi, Ryoya Tanaka

J. Inf. Process., 2017

2016

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

Kazuya Haraguchi

J. Heuristics, 2016

On a generalization of "Eight Blocks to Madness" puzzle.

Kazuya Haraguchi

Discret. Math., 2016

2015

How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately.

Kazuya Haraguchi, Hirotaka Ono

J. Inf. Process., 2015

An Efficient Local Search for Partial Latin Square Extension Problem.

Kazuya Haraguchi

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014

On A Generalization of "Eight Blocks to Madness".

Kazuya Haraguchi

CoRR, 2014

Approximability of Latin Square Completion-Type Puzzles.

Kazuya Haraguchi, Hirotaka Ono

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

The Number of Inequality Signs in the Design of Futoshiki Puzzle.

Kazuya Haraguchi

J. Inf. Process., 2013

BLOCKSUM is NP-Complete.

Kazuya Haraguchi, Hirotaka Ono

IEICE Trans. Inf. Syst., 2013

A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem.

Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka

Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively.

Kazuya Haraguchi

Proceedings of the Recent Advances in Computational Optimization, 2013

2012

How to Produce BlockSum Instances with Various Levels of Difficulty.

Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka

J. Inf. Process., 2012

2010

Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables.

Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi

Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

2009

Bipartite Graph Representation of Multiple Decision Table Classifiers.

Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2008

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

2007

Extension of ICF Classifiers to Real World Data Sets.

Kazuya Haraguchi, Hiroshi Nagamochi

Proceedings of the New Trends in Applied Artificial Intelligence, 2007

2006

Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.

Kazuya Haraguchi, Toshihide Ibaraki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006