7 citations · 17 across the 15 of their papers we have counts for
4 papers · 1 filter
Design of Polynomial-delay Enumeration Algorithms in Transitive Systems
Kazuya Haraguchi, Hiroshi Nagamochi
In this paper, as a new notion, we define a transitive system to be a set system on a finite set of elements such that every three sets $X,Y,Z\…
Polynomial-delay Enumeration Algorithms in Set Systems
Kazuya Haraguchi, Hiroshi Nagamochi
We consider a set system on a finite set of elements, where we call a set a component. We assume that two oracles $\mathrm{…
Recycling Solutions for Vertex Coloring Heuristics
Yasutaka Uchida, Kaito Yajima, Kazuya Haraguchi
The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-…
On A Generalization of "Eight Blocks to Madness"
Kazuya Haraguchi
We consider a puzzle such that a set of colored cubes is given as an instance. Each cube has unit length on each edge and its surface is colored so that what we call the Surface Co…