( en | de | ru )

 

Disambiguation of "Haraguchi, Kazuya"

Author of the publication

copydeleteadd this publication to your clipboard
On a generalization of “Eight Blocks to Madness” puzzle

. Discrete Mathematics, 339 (4): 1400--1409 (2016)
DOI: 10.1016/j.disc.2015.12.014

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kazuya Yamashita

 

Other publications of authors with the same name

Extension of ICF Classifiers to Real World Data Sets., and . IEA/AIE, volume 4570 of Lecture Notes in Computer Science, page 776-785. Springer, (2007)An Efficient Local Search for Partial Latin Square Extension Problem.. CPAIOR, volume 9075 of Lecture Notes in Computer Science, page 182-198. Springer, (2015)Molecular Design Based on Integer Programming and Quadratic Descriptors in a Two-layered Model., , , , , , , and . CoRR, (2022)Data mining method of single-cell omics data to evaluate a pure tissue environmental effect on gene expression level., , , , and . CoRR, (2024)A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively.. WCO@FedCSIS, volume 580 of Studies in Computational Intelligence, page 67-84. Springer, (2013)Polynomial-delay Enumeration Algorithms in Set Systems., and . CoRR, (2020)How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately., and . J. Inf. Process., 23 (3): 276-283 (2015)COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets., , , and . J. Graph Algorithms Appl., 23 (2): 434-458 (2019)A Polynomial-Delay Algorithm for Enumerating Connectors Under Various Connectivity Conditions., and . ISAAC, volume 149 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Approximability of Latin Square Completion-Type Puzzles., and . FUN, volume 8496 of Lecture Notes in Computer Science, page 218-229. Springer, (2014)