Items where Author is "Makino, Kazuhisa"

Article

Bérczi, Kristóf and Bérczi-Kovács, Erika R. and Boros, Endre and Gedefa, Fekadu Tolessa and Kamiyama, Naoyuki and Kavitha, Telikepalli and Kobayashi, Yusuke and Makino, Kazuhisa (2024) Envy-free relaxations for goods, chores, and mixed items. Theoretical Computer Science, 1002. p. 114596. ISSN 03043975

Bérczi, Kristóf and Boros, Endre and Cepek, Ondrej and Kucera, Petr and Makino, Kazuhisa (2021) Approximating minimum representations of key Horn functions. SIAM JOURNAL ON COMPUTING. ISSN 0097-5397 (print); 1095-7111 (online) (Submitted)

Bérczi, Kristóf and Boros, Endre and Cepek, Ondrej and Elbassioni, Khaled and Kucera, Petr and Makino, Kazuhisa (2021) Generating clause sequences of a CNF formula. THEORETICAL COMPUTER SCIENCE, 856 (8). pp. 68-74. ISSN 0304-3975

Fujishige, Satoru and Király, Tamás and Makino, Kazuhisa and Takazawa, Kenjiro and Tanigawa, Shin-ichi (2014) Minimizing Submodular Functions on Diamonds via Generalized Fractional Matroid Matchings. JOURNAL OF COMBINATORIAL THEORY SERIES B. ISSN 0095-8956 (Submitted)

Book Section

Kavitha, Telikepalli and Makino, Kazuhisa and Schlotter, Ildikó Anna and Yokoi, Yu (2024) Arborescences, Colorful Forests, and Popularity. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, Philadelphia (PA), pp. 3724-3746. ISBN 9781611977912

Monograph

Bérczi, Kristóf and Bérczi-Kovács, Erika Renáta and Boros, Endre and Gedefa, Fekadu Tolessa and Kamiyama, Naoyuki and Telikepalli, Kavitha and Kobayashi, Yusuke and Makino, Kazuhisa (2020) Envy-free Relaxations for Goods, Chores, and Mixed Items. Technical Report. UNSPECIFIED.

Bérczi, Kristóf and Boros, Endre and Cepek, Ondrej and Kucera, Petr and Makino, Kazuhisa (2020) Unique key Horn functions. Technical Report. UNSPECIFIED.