Kazuya Haraguchi

Orcid: 0000-0002-2479-3135

According to our database1, Kazuya Haraguchi authored at least 37 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Polynomial-delay enumeration algorithms in set systems.
Theor. Comput. Sci., 2023

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

A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs.
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.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model.
CoRR, 2022

Enumeration of Support-Closed Subsets in Confluent Systems.
Algorithmica, 2022

A Method for Molecular Design Based on Linear Regression and Integer Programming.
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.
Proceedings of the 15th International Joint Conference on Biomedical Engineering Systems and Technologies, 2022

2021
A Method for Inferring Polymers Based on Linear Regression and Integer Programming.
CoRR, 2021

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

An Improved Integer Programming Formulation for Inferring Chemical Compounds with Prescribed Topological Structures.
Proceedings of the Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices, 2021

An Inverse QSAR Method Based on Decision Tree and Integer Programming.
Proceedings of the Intelligent Computing Theories and Application, 2021

Molecular Design Based on Artificial Neural Networks, Integer Programming and Grid Neighbor Search.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021

2020
Maximum weighted matching with few edge crossings for 2-layered bipartite graph.
Discret. Appl. Math., 2020

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems.
CoRR, 2020

2019
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets.
J. Graph Algorithms Appl., 2019

An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem.
Int. Trans. Oper. Res., 2019

Recycling Solutions for Vertex Coloring Heuristics.
CoRR, 2019

A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
An Efficient Local Search for the Minimum Independent Dominating Set Problem.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

2017
The Building Puzzle Is Still Hard Even in the Single Lined Version.
J. Inf. Process., 2017

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

On a generalization of "Eight Blocks to Madness" puzzle.
Discret. Math., 2016

2015
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately.
J. Inf. Process., 2015

An Efficient Local Search for Partial Latin Square Extension Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014
On A Generalization of "Eight Blocks to Madness".
CoRR, 2014

Approximability of Latin Square Completion-Type Puzzles.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
The Number of Inequality Signs in the Design of Futoshiki Puzzle.
J. Inf. Process., 2013

BLOCKSUM is NP-Complete.
IEICE Trans. Inf. Syst., 2013

A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem.
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.
Proceedings of the Recent Advances in Computational Optimization, 2013

2012
How to Produce BlockSum Instances with Various Levels of Difficulty.
J. Inf. Process., 2012

2010
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

2009
Bipartite Graph Representation of Multiple Decision Table Classifiers.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2008
A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.
IEICE Trans. Inf. Syst., 2008

2007
Extension of ICF Classifiers to Real World Data Sets.
Proceedings of the New Trends in Applied Artificial Intelligence, 2007

2006
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006


  Loading...