Rchr
J-GLOBAL ID:200901024318809857   Update date: Sep. 25, 2024

Makino Kazuhisa

マキノ カズヒサ | Makino Kazuhisa
Affiliation and department:
Homepage URL  (1): http://www-sflab.sys.es.osaka-u.ac.jp/~makino/makino.html
Research field  (2): Applied mathematics and statistics ,  Computational science
Research keywords  (4): Discrete Mathematics ,  Optimization ,  Algorithm Theory ,  Game Theory
Research theme for competitive and other funds  (23):
  • 2020 - 2025 アルゴリズム基礎理論の追究・発展
  • 2020 - 2025 Research Initiatives on Algorithmic Foundations for Social Advancement
  • 2020 - 2023 Creation of Incentive Design Science
  • 2019 - 2023 局所構造を利用した高速なアルゴリズムの開発
  • 2014 - 2020 Development of efficient algorithms based on enumeration structures
Show all
Papers (226):
  • Kristóf Bérczi, Erika R. Bérczi-Kovács, Endre Boros, Fekadu Tolessa Gedefa, Naoyuki Kamiyama, Telikepalli Kavitha, Yusuke Kobayashi, Kazuhisa Makino. Envy-free relaxations for goods, chores, and mixed items. Theoretical Computer Science. 2024. 1002. 114596-114596
  • Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo. A fair and truthful mechanism with limited subsidy. Games and Economic Behavior. 2024. 144. 49-70
  • Kei Kimura, Kazuhisa Makino, Shota Yamada, Ryo Yoshizumi. Characterizing the integer points in 2-decomposable polyhedra by closedness under operations. CoRR. 2024. abs/2401.06405
  • Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo. Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI. 2024. 9824-9831
  • Kei Kimura, Kazuhisa Makino. A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems. CoRR. 2023. abs/2306.03368
more...
MISC (56):
  • Khaled Elbassioni, Kazuhisa Makino. Guest Editors' Foreword. ALGORITHMICA. 2017. 79. 3. 884-885
  • Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita. Optimal Matroid Partitioning Problems. CoRR. 2017. abs/1710.00950
  • Kawase Yasushi, Makino Kazuhisa, Seimi Kento. RA-002 On the Complexity of finding Optimal Composition Orderings for Piecewise Linear Functions. 情報科学技術フォーラム講演論文集. 2015. 14. 1. 7-12
  • 河瀬 康志, 牧野 和久. 無秩序の代償と安定性の代償 (特集 はじめようゲーム理論). オペレーションズ・リサーチ. 2015. 60. 6. 337-342
  • 澄田 範奈, 垣村 尚徳, 牧野 和久. 1-B-13 線形相補性問題のパラメータ化計算量(学生セッション:離散最適化(3)). 日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集. 2015. 2015. 38-39
more...
Books (19):
  • Finding essential attributes in binary data(共著)
    IDEAL 2000, LNCS 1983 2000
  • Fully consistent extensions of partially defined Boolean functions with missing bits(共著)
    IFIP TCS2000, LNCS 1872 2000
  • Logical analysis of data with decomposable structures(共著)
    COCOON 2000, LNCS 1858 2000
  • Locating sources to meet flow demands in undirected networks(共著)
    SWAT 2000, LNCS 1851 2000
  • Max-and Min-neighborhood monopolies(共著)
    SWAT2000, LNCS 1851 2000
more...
Education (4):
  • - 1997 Kyoto University
  • - 1997 Kyoto University Graduate School, Division of Engineering
  • - 1992 Kyoto University
  • - 1992 Kyoto University
Professional career (1):
  • (BLANK) (Kyoto University)
Work history (3):
  • 1997 - 2000 大阪大学大学院
  • 1997 - 2000 Osaka University, Research Associate
  • 旧所属 大阪大学 大学院基礎工学研究科 システム創成専攻 社会システム数理領域 講師
Awards (17):
  • 2022 - 文部科学大臣表彰 科学技術賞
  • 2016 - ISAAC 2016 Best Paper Award
  • 2015 - FIT2015 船井ベストペーパー賞
  • 2015 - 人工知能学会 研究会優秀賞
  • 2013 - FAW-AAIM 2013 Best Paper Candidate
Show all
Association Membership(s) (3):
電気通信情報学会 ,  日本OR学会 ,  情報処理学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page