default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKazuya Haraguchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]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. IEEE ACM Trans. Comput. Biol. Bioinform. 21(5): 1529-1541 (2024)- [i17]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 abs/2406.06969 (2024) - [i16]Kan Shota, Kazuya Haraguchi:
SSD Set System, Graph Decomposition and Hamiltonian Cycle. CoRR abs/2408.04615 (2024) - [i15]Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu:
Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference. CoRR abs/2408.05136 (2024) - [i14]Muniba Batool, Naveed Ahmed Azam, Jianshen Zhu, Kazuya Haraguchi, Liang Zhao, Tatsuya Akutsu:
A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility. CoRR abs/2409.04301 (2024) - 2023
- [j17]Kazuya Haraguchi, Hiroshi Nagamochi:
Polynomial-delay enumeration algorithms in set systems. Theor. Comput. Sci. 963: 113963 (2023) - [c15]Takumi Tada, Kazuya Haraguchi:
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs. IWOCA 2023: 368-379 - [i13]Takumi Tada, Kazuya Haraguchi:
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs. CoRR abs/2302.05526 (2023) - [i12]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 abs/2305.00801 (2023) - 2022
- [j16]Kazuya Haraguchi, Hiroshi Nagamochi:
Enumeration of Support-Closed Subsets in Confluent Systems. Algorithmica 84(5): 1279-1315 (2022) - [j15]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): 3233-3245 (2022) - [c14]Jianshen Zhu, Kazuya Haraguchi, Hiroshi Nagamochi, Tatsuya Akutsu:
Adjustive Linear Regression and Its Application to the Inverse QSAR. BIOINFORMATICS 2022: 144-151 - [c13]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: 21-28 - [i11]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 abs/2209.13527 (2022) - 2021
- [c12]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: 360-363 - [c11]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: 628-644 - [c10]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: 197-209 - [i10]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 abs/2107.02381 (2021) - [i9]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 abs/2108.10266 (2021) - [i8]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 abs/2109.02628 (2021) - 2020
- [j14]Kazuya Haraguchi, Kotaro Torii, Motomu Endo:
Maximum weighted matching with few edge crossings for 2-layered bipartite graph. Discret. Appl. Math. 287: 40-52 (2020) - [i7]Kazuya Haraguchi, Hiroshi Nagamochi:
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems. CoRR abs/2004.01904 (2020) - [i6]Kazuya Haraguchi, Hiroshi Nagamochi:
Polynomial-delay Enumeration Algorithms in Set Systems. CoRR abs/2004.07823 (2020)
2010 – 2019
- 2019
- [j13]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): 1244-1268 (2019) - [j12]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): 434-458 (2019) - [c9]Kazuya Haraguchi, Hiroshi Nagamochi:
A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions. ISAAC 2019: 3:1-3:15 - [i5]Yasutaka Uchida, Kazuya Haraguchi:
Recycling Solutions for Vertex Coloring Heuristics. CoRR abs/1902.01206 (2019) - [i4]Kazuya Haraguchi, Kotaro Torii, Motomu Endo:
Maximum Weighted Matching with Few Edge Crossings for 2-Layered Bipartite Graph. CoRR abs/1905.04853 (2019) - 2018
- [c8]Kazuya Haraguchi:
An Efficient Local Search for the Minimum Independent Dominating Set Problem. SEA 2018: 13:1-13:13 - [i3]Kazuya Haraguchi:
An Efficient Local Search for the Minimum Independent Dominating Set Problem. CoRR abs/1802.06478 (2018) - 2017
- [j11]Kazuya Haraguchi, Ryoya Tanaka:
The Building Puzzle Is Still Hard Even in the Single Lined Version. J. Inf. Process. 25: 730-734 (2017) - 2016
- [j10]Kazuya Haraguchi:
On a generalization of "Eight Blocks to Madness" puzzle. Discret. Math. 339(4): 1400-1409 (2016) - [j9]Kazuya Haraguchi:
Iterated local search with Trellis-neighborhood for the partial Latin square extension problem. J. Heuristics 22(5): 727-757 (2016) - 2015
- [j8]Kazuya Haraguchi, Hirotaka Ono:
How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately. J. Inf. Process. 23(3): 276-283 (2015) - [c7]Kazuya Haraguchi:
An Efficient Local Search for Partial Latin Square Extension Problem. CPAIOR 2015: 182-198 - 2014
- [c6]Kazuya Haraguchi, Hirotaka Ono:
Approximability of Latin Square Completion-Type Puzzles. FUN 2014: 218-229 - [i2]Kazuya Haraguchi:
An Efficient Local Search for Partial Latin Square Extension Problem. CoRR abs/1405.2571 (2014) - [i1]Kazuya Haraguchi:
On A Generalization of "Eight Blocks to Madness". CoRR abs/1408.3696 (2014) - 2013
- [j7]Kazuya Haraguchi, Hirotaka Ono:
BLOCKSUM is NP-Complete. IEICE Trans. Inf. Syst. 96-D(3): 481-488 (2013) - [j6]Kazuya Haraguchi:
The Number of Inequality Signs in the Design of Futoshiki Puzzle. Inf. Media Technol. 8(1): 41-47 (2013) - [j5]Kazuya Haraguchi:
The Number of Inequality Signs in the Design of Futoshiki Puzzle. J. Inf. Process. 21(1): 26-32 (2013) - [c5]Kazuya Haraguchi:
A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively. WCO@FedCSIS 2013: 67-84 - [c4]Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka:
A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem. FedCSIS 2013: 347-354 - 2012
- [j4]Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka:
How to Produce BlockSum Instances with Various Levels of Difficulty. Inf. Media Technol. 7(3): 1033-1043 (2012) - [j3]Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka:
How to Produce BlockSum Instances with Various Levels of Difficulty. J. Inf. Process. 20(3): 727-737 (2012) - 2010
- [c3]Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi:
Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables. LION 2010: 169-183
2000 – 2009
- 2009
- [c2]Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi:
Bipartite Graph Representation of Multiple Decision Table Classifiers. SAGA 2009: 46-60 - 2008
- [j2]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. 91-D(3): 781-788 (2008) - 2007
- [c1]Kazuya Haraguchi, Hiroshi Nagamochi:
Extension of ICF Classifiers to Real World Data Sets. IEA/AIE 2007: 776-785 - 2006
- [j1]Kazuya Haraguchi, Toshihide Ibaraki:
Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(5): 1284-1291 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
