6 citations · 9 across the 10 of their papers we have counts for
10 papers
Characterizing the integer points in 2-decomposable polyhedra by closedness under operations
Kei Kimura, Kazuhisa Makino, Shota Yamada +1
Characterizing the solution sets in a problem by closedness under operations is recognized as one of the key aspects of algorithm development, especially in constraint satisfaction…
Computing Remoteness Functions of Moore, Wythoff, and Euclid's games
Endre Boros, Vladimir Gurvich, Kazuhisa Makino +1
We study remoteness function of impartial games introduced by Smith in 1966. The player who moves from a position can win if and only if is odd. Th…
Arborescences, Colorful Forests, and Popularity
Telikepalli Kavitha, Kazuhisa Makino, Ildikó Schlotter +1
Our input is a directed, rooted graph where each vertex in has a partial order preference over its incoming edges. The preferences of a vertex extend nat…
Towards Optimal Subsidy Bounds for Envy-freeable Allocations
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita +2
We study the fair division of indivisible items with subsidies among agents, where the absolute marginal valuation of each item is at most one. Under monotone valuations (where…
Matroid Horn functions
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Hypergraph Horn functions were introduced as a subclass of Horn functions that can be represented by a collection of circular implication rules. These functions possess distinguish…
Hypergraph Horn functions
Kristóf Bérczi, Endre Boros, Kazuhisa Makino
Horn functions form a subclass of Boolean functions possessing interesting structural and computational properties. These functions play a fundamental role in algebra, artificial i…