Kazuya Haraguchi

J-GLOBAL         Last updated: Sep 25, 2019 at 14:38
 
Avatar
Name
Kazuya Haraguchi
Affiliation
Otaru University of Commerce
Section
Faculty of Commerce Department of Information and Management Science

Research Interests

 
 

Research Areas

 
 

Awards & Honors

 
Jul 2019
Recycling Solutions for Vertex Coloring Heuristics, Best paper award for scheduling theory, ISS2019
Winner: Yasutaka Uchida, Kazuya Haraguchi
 
Feb 2017
Student Paper Contest Encouraging prize, IEEE Sapporo Section
Winner: Junichi Sato (student in my lab)
 
Mar 2008
best poster award, IEEE VGTC Pacific Visualization Symposium 2008
Winner: Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi
 

Published Papers

 
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi
Journal of Graph Algorithms and Applications   23(2) 434-458   Jul 2019   [Refereed]
Recycling Solutions for Vertex Coloring Heuristics
Yasutaka Uchida, Kazuya Haraguchi
Proceedings of International Symposium on Scheduling 2019 (ISS2019)      Jul 2019   [Refereed]
Kazuya Haraguchi, Hideki Hashimoto, Junji Itoyanagi, Mutsunori Yagiura
International Transactions in Operational Research   26(4) 1244-1268   Jul 2019   [Refereed]
A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions
Kazuya Haraguchi and Hiroshi Nagamochi
Proceedings of The 30th International Symposium on Algorithms and Computation (ISAAC 2019)      2019   [Refereed]
Kazuya Haraguchi
Proceedings of 17th International Symposium on Experimental Algorithms (SEA2018)      Jun 2018   [Refereed]
Kazuya Haraguchi
Journal of Operations Research Society of Japan   60(4) 439-460   Oct 2017   [Refereed]
Kazuya Haraguchi, Ryoya Tanaka
Journal of Information Processing   25 730-734   Aug 2017   [Refereed]
Kazuya Haraguchi
Integration of AI and OR Techniques in Constraint Programming - 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings   182-198   2015   [Refereed]
Kazuya Haraguchi,Hirotaka Ono
Journal of Information Processing   23(3) 276-283   2015   [Refereed]
Kazuya Haraguchi,Hirotaka Ono
Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings   218-229   2014   [Refereed]

Misc

 
Kotaro Torii, Keisuke Inoue, Keita Bekki, Kazuya Haraguchi, Minoru Kubo, Yuki Kondo, Takamasa Suzuki, Hanako Shimizu, Kyohei Uemoto, Masato Saito, Hiroo Fukuda, Takashi Araki, Motomu Endo
bioRxiv      Jul 2019
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, and Hiroshi Nagamochi
Technical Reports, Department of Applied Mathematics and Physics, Kyoto University   2018(002)    Dec 2018
Exhaustive Analysis and Monte-Carlo Tree Search Player for Two-Player 2048
Kazuto Oka, Kiminori Matsuzaki, Kazuya Haraguchi
12 123-130   2015
Kazuya Haraguchi
arXiv   arXiv.1405.2571v1 [cs.DS]    May 2014
HARAGUCHI kazuya
石巻専修大学研究紀要   (24) 15-24   Mar 2013
HARAGUCHI kazuya
石巻専修大学研究紀要   (24) 7-13   Mar 2013
SATO YUICHI, HARAGUCHI KAZUYA, OKAMOTO TAKAHIRO, KITAGAWA NORITAKA, FURUKADO EMI
滋賀県琵琶湖環境科学研究センター研究報告書   (7) 182-195,5   Mar 2012
Haraguchi Kazuya, Hong Seok-Hee, Nagamochi Hiroshi
RIMS Kokyuroku   1726 73-83   Feb 2011
Visualization can improve multiple decision table classifiers
K. Haraguchi, S.H. Hong and H. Nagamochi
Proc. MDAI 2009   41-52   Nov 2009

Conference Activities & Talks

 
A polynomial-delay algorithm for enumerating connectors under various connectivity conditions
Kazuya Haraguchi, Hiroshi Nagamochi
5 Mar 2019   
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski and Hiroshi Nagamochi
WEPA 2018 (2nd International Workshop on Enumeration Problems & Applications)   7 Nov 2018   
COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi
26 May 2018   
The Word Allocation Problem on An nxn Grid
Kazuya Haraguchi
6 Mar 2017   
A Collection of Efficient Local Searches for Partial Latin Square Extension Problem and Its Variants
Kazuya Haraguchi
12 Jun 2015   
Sampling Site Location Problem in Lake Monitoring with Multiple Purposes and Constraints [Invited]
Kazuya Haraguchi, Yuichi Sato
aculty workshop (project SPAV - CZ.1.07/2.3.00/09.0050), University of West Bohemia   Mar 2012   
Sampling site location problem in lake monitoring
Kazuya Haraguchi, Yuichi Sato
KSMAP   29 Oct 2011   
Yasutaka Abe, Kazuya Haraguchi, Akira Maruoka
研究報告ゲーム情報学(GI)   26 Feb 2011   
For given partition of n × n grid into blocks and assignment of integers to the blocks, SumBlock puzzle asks to assign integers from {1, 2, . . . ,n} to all cells in the grid so that the completion satisfies the Latin square condition and the subs...
HARAGUCHI KAZUYA, SATO YUICHI
日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集   4 Mar 2010   
Learning classifier by edge crossing minimization
K. Haraguchi, S.H. Hong and H. Nagamochi
International workshop on Multi-dimensional Visualization   Feb 2010   

Works

 
Ryota Sekiya, Kazuya Haraguchi   Software   Sep 2016
Kazuya Haraguchi   Software   Jul 2016
Kazuya Haraguchi   Software   Jun 2016

Research Grants & Projects

 
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(基盤研究(C))
Project Year: 2008 - 2010    Investigator(s): Akira MARUOKA
Among results we obtained in this project there exists a framework that yields instances of certain combinatorial puzzles. To explore such a framework, we focus on certain types of puzzles that ask an assignment of numbers to cells of nxn grids so...
Ministry of Education, Culture, Sports, Science and Technology: Grants-in-Aid for Scientific Research(若手研究(スタートアップ))
Project Year: 2008 - 2009    Investigator(s): Kazuya HARAGUCHI
In this project, we have aimed at establishing a novel learning method based on combinatorial feature of data. For classification, an essential learning problem, we proposed a learning algorithm based on bipartite graph structure. In computational...