• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

KAKIMURA NAONORI  垣村 尚徳

ORCIDConnect your ORCID iD *help
… Alternative Names

KAKIMURA Naonori  垣村 尚徳

Less
Researcher Number 30508180
Other IDs
Affiliation (Current) 2025: 慶應義塾大学, 理工学部(矢上), 教授
Affiliation (based on the past Project Information) *help 2024: 慶應義塾大学, 理工学部(矢上), 教授
2017 – 2024: 慶應義塾大学, 理工学部(矢上), 准教授
2022: 慶應義塾大学, 理工学部(矢上), 教授
2015 – 2017: 東京大学, 大学院総合文化研究科, 講師
2012 – 2015: 東京大学, 総合文化研究科, 講師 … More
2014: 東京大学, 大学院総合文化研究科, 特任講師
2013: 東京大学, 大学院総合文化研究科, 講師
2011: 東京大学, 教養学部, 特任講師
2009 – 2010: 東京大学, 大学院・情報理工学系研究科, 助教 Less
Review Section/Research Field
Principal Investigator
Basic Section 60010:Theory of informatics-related / Mathematical informatics / Theory of informatics / Engineering fundamentals
Except Principal Investigator
Broad Section J / Transformative Research Areas, Section (IV) / Medium-sized Section 62:Applied informatics and related fields / Science and Engineering / Engineering fundamentals
Keywords
Principal Investigator
アルゴリズム / 近似アルゴリズム / マッチング / 組合せ最適化 / 離散構造 / 線形相補性問題 / 疎性 / オンライン最適化 / アルゴリズム理論 / オンラインマッチング … More / 数理モデル / 情報基礎 / 数理工学 / コミュニティ検出 / マトロイド / ストリーミングアルゴリズム / 劣モジュラ関数 / ストリーミング計算 / 整数性 / 被覆 / 多項式時間アルゴリズム / マトロイド交わり / 固定パラメータアルゴリズム / パッキング / イマージョン / グラフ彩色 / 固定パラメータ・アルゴリズム / グラフマイナー理論 / 半正定値対称行列 / 数理計画 / 組合せ的行列理論 / ビンパッキング問題 / フィードバック点集合 / ナップサック問題 / 点素サイクル / グラフアルゴリズム / 定性的行列理論 … More
Except Principal Investigator
アルゴリズム / 離散数学 / 組合せ最適化 / グラフ / グラフ理論 / グラフアルゴリズム / 離散最適化 / グラフ構造 / 計算複雑性 / 数学 / 組合せ遷移 / ゲノムデータ / ハプロタイプ / poygenic risk score / 最適化理論 / 遺伝統計学 / 計算理論 / サブモジュラー関数 / 分散計算 / 計算複雑度 / 実数計算量 / 回路計算量 / 反マトロイド / 計算量 / computation / 最適化 / 数理工学 / マトロイド / 劣モジュラ関数 / 双対性 / 凸関数 Less
  • Research Projects

    (10 results)
  • Research Products

    (161 results)
  • Co-Researchers

    (30 People)
  •  Graph Algorithms and Optimization: Theory and Scalable Algorithms

    • Principal Investigator
      河原林 健一
    • Project Period (FY)
      2022 – 2026
    • Research Category
      Grant-in-Aid for Scientific Research (S)
    • Review Section
      Broad Section J
    • Research Institution
      National Institute of Informatics
  •  Theory and algorithms for combinatorial optimization under uncertaintyPrincipal Investigator

    • Principal Investigator
      垣村 尚徳
    • Project Period (FY)
      2021 – 2025
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Keio University
  •  Re-annotation of large-scale human genome data by integration of statistical genetics and operations research

    • Principal Investigator
      Okada Yukinori
    • Project Period (FY)
      2020 – 2021
    • Research Category
      Grant-in-Aid for Challenging Research (Exploratory)
    • Review Section
      Medium-sized Section 62:Applied informatics and related fields
    • Research Institution
      Osaka University
  •  Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods

    • Principal Investigator
      OKAMOTO Yoshio
    • Project Period (FY)
      2020 – 2022
    • Research Category
      Grant-in-Aid for Transformative Research Areas (B)
    • Review Section
      Transformative Research Areas, Section (IV)
    • Research Institution
      The University of Electro-Communications
  •  Large Graphs: Theory and Algorithms

    • Principal Investigator
      河原林 健一
    • Project Period (FY)
      2018 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (S)
    • Review Section
      Broad Section J
    • Research Institution
      National Institute of Informatics
  •  Designing Algorithms for Network Analysis with Combinatorial Optimization TheoryPrincipal Investigator

    • Principal Investigator
      Kakimura Naonori
    • Project Period (FY)
      2017 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Mathematical informatics
    • Research Institution
      Keio University
  •  Designing Efficient Algorithms for Optimization Problems with Combinatorial StructuresPrincipal Investigator

    • Principal Investigator
      KAKIMURA Naonori
    • Project Period (FY)
      2013 – 2016
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Theory of informatics
    • Research Institution
      The University of Tokyo
  •  Exploring the limits of computation from mathematical logic

    • Principal Investigator
      Makino Kazuhisa
    • Project Period (FY)
      2012 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
    • Review Section
      Science and Engineering
    • Research Institution
      Kyoto University
  •  Unified Optimization Theory by Discrete Convex Paradigm

    • Principal Investigator
      MUROTA Kazuo
    • Project Period (FY)
      2009 – 2014
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      Engineering fundamentals
    • Research Institution
      The University of Tokyo
  •  Structural Analysis of Mathematical Programming based on CombinatorialMatrix TheoryPrincipal Investigator

    • Principal Investigator
      KAKIMURA Naonori
    • Project Period (FY)
      2009 – 2011
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Engineering fundamentals
    • Research Institution
      The University of Tokyo

All 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 Other

All Journal Article Presentation

  • [Journal Article] randomized counter-based algorithms for frequency estimation over data streams in O(log log N) space2024

    • Author(s)
      Naonori Kakimura, Riku Nitta
    • Journal Title

      Theoretical Computer Science

      Volume: 984 Pages: 114317-114317

    • DOI

      10.1016/j.tcs.2023.114317

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-22H05001
  • [Journal Article] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Proc. of 18th Algorithms and Data Structures Symposium (WADS 2023), Lecture Notes in Computer Science

      Volume: 14079 Pages: 533-546

    • DOI

      10.1007/978-3-031-38906-1_35

    • ISBN
      9783031389054, 9783031389061
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-22H05001
  • [Journal Article] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Journal Article] Deterministic primal-dual algorithms for online k-way matching with delays2023

    • Author(s)
      Naonori Kakimura, Tomohiro Nakayoshi
    • Journal Title

      Proc. of 29th International Computing and Combinatorics Conference (COCOON 2023), Lecture Notes in Computer Science

      Volume: 14423 Pages: 238-249

    • DOI

      10.1007/978-3-031-49193-1_18

    • ISBN
      9783031491924, 9783031491931
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-22H05001, KAKENHI-PROJECT-23K21646
  • [Journal Article] Bandit Task Assignment with Unknown Processing Time2023

    • Author(s)
      Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-Ichi Kawarabayashi
    • Journal Title

      Advances in Neural Information Processing Systems 36 (NeurIPS 2023)

      Volume: --

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K21646
  • [Journal Article] Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, and Yoshio Okamoto
    • Journal Title

      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP2023)

      Volume: 261

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K21646
  • [Journal Article] On reachable assignments under dichotomous preferences2023

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Theoretical Computer Science

      Volume: 979 Pages: 114196-114196

    • DOI

      10.1016/j.tcs.2023.114196

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-23K10982, KAKENHI-PROJECT-20K11670, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      ACM Transactions on Algorithms

      Volume: 19 Issue: 1 Pages: 6-6

    • DOI

      10.1145/3561302

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-22K13956, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-18K03391, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Journal Title

      Proc. of 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023), Leibniz International Proceedings in Informatics

      Volume: 261

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Journal Article] Monotone Edge Flips to an Orientation of Maximum Edge-connectivity \`a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      The ACM-SIAM Symposium on Discrete Algorithms(SODA)

      Volume: --

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Rerouting planar curves and disjoint paths2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity ? la Nash-Williams2022

    • Author(s)
      Ito Takehiro、Iwamasa Yuni、Kakimura Naonori、Kamiyama Naoyuki、Kobayashi Yusuke、Maezawa Shun-ichi、Nozaki Yuta、Okamoto Yoshio、Ozeki Kenta
    • Journal Title

      Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)

      Volume: なし Pages: 1342-1355

    • DOI

      10.1137/1.9781611977073.56

    • ISBN
      9781611977073
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K03391, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model2022

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 36 Issue: 1 Pages: 355-382

    • DOI

      10.1137/20m1357317

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PLANNED-20H05795
  • [Journal Article] Shortest reconfiguration of perfect matchings via alternating cycles2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 36 Issue: 2 Pages: 1102-1123

    • DOI

      10.1137/20m1364370

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-17K00028, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646, KAKENHI-PROJECT-18H04091
  • [Journal Article] Monotone Edge Flips to an Orientation of Maximum Edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      The ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)

      Volume: - Pages: 1342-1355

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K21646
  • [Journal Article] Online Task Assignment Problems with Reusable Resources2022

    • Author(s)
      Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      The 36th AAAI Conference on Artificial Intelligence (AAAI)

      Volume: --

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022), Lecture Notes in Computer Science

      Volume: 13753 Pages: 650-658

    • DOI

      10.1007/978-3-031-21203-1_43

    • ISBN
      9783031212024, 9783031212031
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K14317, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Reforming an Envy-Free Matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto and Kenta Ozeki
    • Journal Title

      The 36th AAAI Conference on Artificial Intelligence (AAAI)

      Volume: --

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Online Task Assignment Problems with Reusable Resources2022

    • Author(s)
      Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      The 36th AAAI Conference on Artificial Intelligence (AAAI2022)

      Volume: - Pages: 5199-5207

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-23K21646
  • [Journal Article] A parameterized view to the robust recoverable base problem of matroids under structural uncertainty2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Operations Research Letters

      Volume: 50 Issue: 3 Pages: 370-375

    • DOI

      10.1016/j.orl.2022.05.001

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-23K21646
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022)

      Volume: 36 Issue: 5 Pages: 5084-5091

    • DOI

      10.1609/aaai.v36i5.20441

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PLANNED-20H05793, KAKENHI-PLANNED-20H05795
  • [Journal Article] Reforming an Envy-Free Matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      The 36th AAAI Conference on Artificial Intelligence (AAAI2022)

      Volume: - Pages: 5084-5091

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-23K21646
  • [Journal Article] Reforming an envy-free matching2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Journal Article] Submodular Reassignment Problem for Reallocating Agents to Tasks with Synergy Effects2021

    • Author(s)
      Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Discrete Optimization

      Volume: to appear Pages: 100631-100631

    • DOI

      10.1016/j.disopt.2021.100631

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-20K11670, KAKENHI-PROJECT-20K11692, KAKENHI-PROJECT-20K20417, KAKENHI-PLANNED-20H05795
  • [Journal Article] Online task assignment problems with reusable resources2021

    • Author(s)
      Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      Proc. of 36th AAAI Conference on Artificial Intelligence (AAAI 2022)

      Volume: 36 Issue: 5 Pages: 5199-5207

    • DOI

      10.1609/aaai.v36i5.20455

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Journal Article] Market Pricing for Matroid Rank Valuations2021

    • Author(s)
      Kristof Berczi, Naonori Kakimura, Yusuke Kobayashi
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 35 Issue: 4 Pages: 2662-2678

    • DOI

      10.1137/20m1386335

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-20K11692, KAKENHI-PLANNED-20H05795, KAKENHI-PROJECT-23K21646
  • [Journal Article] Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization2021

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura
    • Journal Title

      Theory of Computing Systems

      Volume: 66 Issue: 1 Pages: 354-394

    • DOI

      10.1007/s00224-021-10065-6

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PLANNED-20H05795
  • [Journal Article] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Journal Title

      arXiv

      Volume: --

    • Open Access
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Journal Article] Dynamic bipartite matching market with arrivals and departures2021

    • Author(s)
      Naonori Kakimura, Donghao Zhu
    • Journal Title

      Proc. of 17th Conference on Web and Internet Economics (WINE 2021), Lecture Notes in Computer Science

      Volume: 13112 Pages: 544-544

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Journal Article] Dynamic Bipartite Matching Market with Arrivals and Departures2021

    • Author(s)
      Naonori Kakimura, Donghao Zhu
    • Journal Title

      The 17th Conference on Web and Internet Economics (WINE 2021)

      Volume: - Pages: 544-544

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K21646
  • [Journal Article] Dynamic Bipartite Matching Market with Arrivals and Departures2021

    • Author(s)
      Naonori Kakimura, Donghao Zhu
    • Journal Title

      The 17th Conference on Web and Internet Economics (WINE 2021)

      Volume: --

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2021

    • Author(s)
      Chien-Chung Huang and Naonori Kakimura
    • Journal Title

      Algorithmica

      Volume: 83 Issue: 3 Pages: 879-902

    • DOI

      10.1007/s00453-020-00786-4

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Complexity of the Multi-Service Center Problem2020

    • Author(s)
      Takehiro Ito, Naonori Kakimura, and Yusuke Kobayashi
    • Journal Title

      Theoretical Computer Science

      Volume: 842 Pages: 18-27

    • DOI

      10.1016/j.tcs.2020.07.021

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-19K11814, KAKENHI-PROJECT-20K20417, KAKENHI-PROJECT-18H04091, KAKENHI-PROJECT-18H05291
  • [Journal Article] Spectral Aspects of Symmetric Matrix Signings2020

    • Author(s)
      Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, and Alexandra Kolla
    • Journal Title

      Discrete Optimization

      Volume: 37 Pages: 100582-100582

    • DOI

      10.1016/j.disopt.2020.100582

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Market Pricing for Matroid Rank Valuations2020

    • Author(s)
      Kristof Berczi, Naonori Kakimura, and Yusuke Kobayashi
    • Journal Title

      The 31st International Symposium on Algorithms and Computation (ISAAC 2020)

      Volume: 39 Pages: 1-15

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2020

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida
    • Journal Title

      Algorithmica

      Volume: 82 Issue: 4 Pages: 1006-1032

    • DOI

      10.1007/s00453-019-00628-y

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] The b-branching problem in digraphs2020

    • Author(s)
      Naonori Kakimura, Naoyuki Kamiyama and Kenjiro Takazawa
    • Journal Title

      Discrete Applied Mathematics

      Volume: - Pages: 565-576

    • DOI

      10.1016/j.dam.2020.02.005

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16012
  • [Journal Article] Shortest Reconfiguration of Perfect Matchings via Alternating Cycles2019

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      The 27th Annual European Symposium on Algorithms (ESA 2019), LIPIcs

      Volume: 61 Pages: 1-15

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Spectral Aspects of Symmetric Matrix Signings2019

    • Author(s)
      Charlie Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura and Alexandra Kolla
    • Journal Title

      The 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), LIPIcs

      Volume: 81 Pages: 1-13

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2019

    • Author(s)
      Chien-Chung Huang and Naonori Kakimura
    • Journal Title

      The Algorithms and Data Structures Symposium (WADS), LNCS

      Volume: 11646 Pages: 438-451

    • DOI

      10.1007/978-3-030-24766-9_32

    • ISBN
      9783030247652, 9783030247669
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries2019

    • Author(s)
      Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, and Jakub Pachocki
    • Journal Title

      The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2019)

      Volume: -

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising2019

    • Author(s)
      Hatano Daisuke、Kuroki Yuko、Kawase Yasushi、Sumita Hanna、Kakimura Naonori、Kawarabayashi Ken-ichi
    • Journal Title

      The 16th Pacific Rim International Conference on Artificial Intelligence (PRICAI 2019), LNCS

      Volume: 16 Pages: 568-582

    • DOI

      10.1007/978-3-030-29908-8_45

    • ISBN
      9783030299071, 9783030299088
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H05291
  • [Journal Article] The b-Branching Problem in Digraphs2018

    • Author(s)
      Naonori Kakimura, Naoyuki Kamiyama, and Kenjiro Takazawa
    • Journal Title

      The 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Boosting PageRank Scores by Optimizing Internal Link Structure2018

    • Author(s)
      Naoto Ohsaka, Tomohiro Sonobe, Naonori Kakimura, Takuro Fukunaga, Sumio Fujita, Ken-ichi Kawarabayashi
    • Journal Title

      Database and Expert Systems Applications, DEXA 2018. Lecture Notes in Computer Science

      Volume: 11029 Pages: 424-439

    • DOI

      10.1007/978-3-319-98809-2_26

    • ISBN
      9783319988085, 9783319988092
    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00040, KAKENHI-PROJECT-18H05291
  • [Journal Article] Finding a Dense Subgraph with Sparse Cut2018

    • Author(s)
      Atsushi Miyauchi and Naonori Kakimura
    • Journal Title

      Proceedings of the 27th ACM International Conference on Information and Knowledge Management (CIKM 2018)

      Volume: - Pages: 547-556

    • DOI

      10.1145/3269206.3271720

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-17H07357
  • [Journal Article] Tight approximability of the server allocation problem for real-time applications2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto, and Taichi Shiitada
    • Journal Title

      Proceedings of 3rd International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD 2017)

      Volume: --- Pages: 41-55

    • DOI

      10.1007/978-3-319-74875-7_4

    • NAID

      120006998850

    • ISBN
      9783319748740, 9783319748757
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Exact and Approximation Algorithms for Weighted Matroid Intersection2018

    • Author(s)
      Chen-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama
    • Journal Title

      Mathematical Programming

      Volume: -

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Reconfiguration of maximum-weight b-matchings in a graph2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Journal of Combinatorial Optimization

      Volume: 37 Issue: 2 Pages: 454-464

    • DOI

      10.1007/s10878-018-0289-3

    • NAID

      120006960832

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118, KAKENHI-PROJECT-16K00004
  • [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Algorithmica

      Volume: 81 Issue: 1 Pages: 343-366

    • DOI

      10.1007/s00453-018-0448-z

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K00004
  • [Journal Article] Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs2017

    • Author(s)
      Kakimura Naonori、Kawarabayashi Ken-ichi、Kobayashi Yusuke
    • Journal Title

      SIAM J. Discrete Math.

      Volume: 31 Issue: 2 Pages: 766-782

    • DOI

      10.1137/15m1022239

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Complexity of the Multi-Service Center Problem2017

    • Author(s)
      Ito Takehiro、Kakimura Naonori、Kobayashi Yusuke
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.48

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Packing Edge-Disjoint Odd Eulerian Subgraphs through Prescribed Vertices in 4-Edge-Connected Graphs2017

    • Author(s)
      Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 掲載確定

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Journal Article] Parameterized Complexity of Sparse Linear Complementarity Problems2017

    • Author(s)
      Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino
    • Journal Title

      Algorithmica

      Volume: 掲載確定 Issue: 1 Pages: 42-65

    • DOI

      10.1007/s00453-016-0229-5

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25730001, KAKENHI-PROJECT-26280001, KAKENHI-WRAPUP-17H06074
  • [Journal Article] Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2017

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida
    • Journal Title

      Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)

      Volume: 81

    • DOI

      10.4230/LIPIcs.APPROX-RANDOM.2017.11

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Journal Article] Reconfiguration of Maximum-Weight b-Matchings in a Graph2017

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Proceedings of 23rd Annual International Computing and Combinatorics Conference (COCOON 2017)

      Volume: --- Pages: 287-296

    • DOI

      10.1007/978-3-319-62389-4_24

    • NAID

      120006960832

    • ISBN
      9783319623887, 9783319623894
    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-15K00009, KAKENHI-PROJECT-16K00004, KAKENHI-PROJECT-17K00028, KAKENHI-PROJECT-16K16010, KAKENHI-PROJECT-16H03118
  • [Journal Article] Efficient Stabilization of Cooperative Matching Games2017

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中 Pages: 69-82

    • DOI

      10.1016/j.tcs.2017.03.020

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PUBLICLY-15H00849, KAKENHI-PROJECT-16K00004, KAKENHI-PLANNED-24106002
  • [Journal Article] Exact and Approximation Algorithms for Weighted Matroid Intersection2016

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama
    • Journal Title

      Proceedings of the 27th Annual ACM/SIAM Symposium on Discrete Algorithms

      Volume: - Pages: 430-444

    • DOI

      10.1137/1.9781611974331.ch32

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-24106005, KAKENHI-PLANNED-24106002
  • [Journal Article] Coloring immersion-free graphs2016

    • Author(s)
      Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      J. Comb. Theory, Ser. B

      Volume: 121 Pages: 284-307

    • DOI

      10.1016/j.jctb.2016.07.005

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PLANNED-24106003, KAKENHI-PROJECT-25730001
  • [Journal Article] Exact and Approximation Algorithms for Weighted Matroid Intersection2016

    • Author(s)
      Chen-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama
    • Journal Title

      Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA 2016)

      Volume: - Pages: 430-444

    • Peer Reviewed / Acknowledgement Compliant / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Journal Article] Fixed-Parameter Tractability for Subset Feedback Set Problems with Parity Constraints2015

    • Author(s)
      Naonori Kakimura and Ken-ichi Kawarabayashi
    • Journal Title

      Theoretical Computer Science

      Volume: 576 Pages: 61-76

    • DOI

      10.1016/j.tcs.2015.02.004

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25730001, KAKENHI-PLANNED-24106003
  • [Journal Article] Parameterized complexity of sparse linear complementarity problems2015

    • Author(s)
      H. Sumita, N. Kakimura, and K. Makino
    • Journal Title

      Leibniz International Proceedings in Informatics

      Volume: 43 Pages: 355-364

    • DOI

      10.4230/LIPIcs.IPEC.2015.355

    • Peer Reviewed / Acknowledgement Compliant / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25280004, KAKENHI-PROJECT-26280001, KAKENHI-PLANNED-24106002
  • [Journal Article] Parameterized Complexity of Sparse Linear Complementarity Problems2015

    • Author(s)
      Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino
    • Journal Title

      Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)

      Volume: - Pages: 355-364

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Journal Article] The Linear Complementarity Problems with a Few Variables per Constraint2015

    • Author(s)
      Hanna Sumita, Naonori Kakimura and Kazuhisa Makino
    • Journal Title

      Mathematics of Operations Research

      Volume: 40 Issue: 4 Pages: 1015-1026

    • DOI

      10.1287/moor.2014.0708

    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-25730001, KAKENHI-PROJECT-26280001, KAKENHI-PLANNED-24106002
  • [Journal Article] Maximum Lifetime Coverage Problems with Battery Recovery Effects2014

    • Author(s)
      Norie Fu, Vorapong Suppakitpaisarn, Kei Kimura, and Naonori Kakimura
    • Journal Title

      Proceedings of IEEE Global Communications Conference

      Pages: 118-124

    • DOI

      10.1109/glocom.2014.7036794

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Journal Article] 詰め込み問題とグラフマイナー理論2014

    • Author(s)
      垣村尚徳
    • Journal Title

      数学セミナー

      Volume: 53 Pages: 25-29

    • Data Source
      KAKENHI-PROJECT-25730001
  • [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees2014

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8889 Pages: 195-207

    • DOI

      10.1007/978-3-319-13075-0_16

    • ISBN
      9783319130743, 9783319130750
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-24700004, KAKENHI-PROJECT-24700008, KAKENHI-PUBLICLY-25106504, KAKENHI-PROJECT-25330003, KAKENHI-PROJECT-25730001, KAKENHI-PLANNED-24106002
  • [Journal Article] Half-Integral Packing of Odd Cycles through Prescribed Vertices2013

    • Author(s)
      Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      Combinatorica

      Volume: 35 Issue: 5 Pages: 549-572

    • DOI

      10.1007/s00493-013-2865-6

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002, KAKENHI-PLANNED-24106003
  • [Journal Article] Packing edge-disjoint K_5-immersions in 4-edge-connected graphs2013

    • Author(s)
      Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Volume: 8 Pages: 291-299

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Sparse Linear Complementarity Problems2013

    • Author(s)
      Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
    • Journal Title

      LNCS

      Volume: 7878 Pages: 358-369

    • DOI

      10.1007/978-3-642-38233-8_30

    • ISBN
      9783642382321, 9783642382338
    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Sparse Linear Complementarity Problems2013

    • Author(s)
      Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
    • Journal Title

      Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications

      Volume: 8 Pages: 453-462

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Journal Article] Robust Independence Systems2013

    • Author(s)
      Naonori Kakimura, Kazuhisa Makino
    • Journal Title

      SIAM J. Discrete Math.

      Volume: 27 Issue: 3 Pages: 1257-1273

    • DOI

      10.1137/120899480

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22500007, KAKENHI-PLANNED-24106002, KAKENHI-PROJECT-25730001
  • [Journal Article] Packing Cycles through Prescribed Vertices under Modularity Constraints2012

    • Author(s)
      Naonori Kakimura and Ken-ichi Kawarabayashi
    • Journal Title

      Advances in Applied Mathematics

      Volume: 49(2) Issue: 2 Pages: 97-110

    • DOI

      10.1016/j.aam.2012.03.002

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Journal Article] Computing Knapsack solutions with cardinality robustness2012

    • Author(s)
      N. Kakimura, K. Makino, and K. Seimi
    • Journal Title

      Japan Journal of Industrial and Applied Mathematics

      Volume: Vol.29 Issue: 3 Pages: 469-483

    • DOI

      10.1007/s13160-012-0075-z

    • NAID

      10031126878

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-20310088, KAKENHI-PROJECT-21760057, KAKENHI-PLANNED-24106002
  • [Journal Article] Packing Cycles through Prescribed Vertices under Modularity Constraints2012

    • Author(s)
      Naonori Kakimura, Ken-ichi Kawarabayashi
    • Journal Title

      Advances in Applied Mathematics

      Volume: (掲載決定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Journal Article] Computing Knapsack Solutions with Cardinality Robustness2012

    • Author(s)
      Naonori Kakimura, Kazuhisa Makino, Kento Seimi
    • Journal Title

      Japan Journal of Industrial and Applied Mathematics

      Volume: 29 Pages: 469-483

    • NAID

      10031126878

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Journal Article] Packing Directed Circuits through Prescribed VerticesBounded-Fractionally2012

    • Author(s)
      Naonori Kakimura, and Ken-ichiKawarabayashi
    • Journal Title

      SIAM Journal onDiscrete Mathematics

      Volume: 26(3) Issue: 3 Pages: 1121-1133

    • DOI

      10.1137/100786423

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Journal Article] 数理計画と組合せ的行列理論2011

    • Author(s)
      垣村尚徳
    • Journal Title

      オペレーションズ・リサーチ

      Volume: 56,No.1 Pages: 21-26

    • NAID

      110008007157

    • Data Source
      KAKENHI-PROJECT-21760057
  • [Journal Article] Packing Cycles through Prescribed Vertices2011

    • Author(s)
      Naonori Kakimura, Ken-ichi Kawarabayashi, and Daniel Marx
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: 101 Issue: 5 Pages: 378-381

    • DOI

      10.1016/j.jctb.2011.03.004

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Journal Article] Matching Structure of Symmetric Bipartite Graphs and a Generalization of Polya's Problem2010

    • Author(s)
      Naonori Kakimura
    • Journal Title

      Journal of Combinatorial Theory, Series B

      Volume: 100 Issue: 6 Pages: 650-670

    • DOI

      10.1016/j.jctb.2010.06.003

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Journal Article] A Direct Proof for the Matrix Decomposition of Chordal-Structured Positive Semidefinite Matrices2010

    • Author(s)
      Naonori Kakimura
    • Journal Title

      Linear Algebra and Its Applications

      Volume: 433 Issue: 4 Pages: 819-823

    • DOI

      10.1016/j.laa.2010.04.012

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Matching in Bipartite Graphs with Stochastic Arrivals and Departures2023

    • Author(s)
      Naonori Kakimura
    • Organizer
      12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] Rerouting planar curves and disjoint paths2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] オンラインマッチングとその周辺2023

    • Author(s)
      垣村尚徳
    • Organizer
      第 35 回 RAMP 数理最適化シンポジウム (RAMP 2023)
    • Invited
    • Data Source
      KAKENHI-PROJECT-23K21646
  • [Presentation] Three open problems on combinatorial reconfiguration2023

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] Hardness of finding combinatorial shortest paths on graph associahedra2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto
    • Organizer
      50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] Algorithmic theory of qubit routing2023

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
    • Organizer
      3rd Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2023
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] Matchings in bipartite graphs with stochastic arrivals and departures2023

    • Author(s)
      Naonori Kakimura, Donghao Zhu
    • Organizer
      12th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2023)
    • Invited / Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    • Organizer
      24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] On reachable assignments under dichotomous preferences2022

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, and Kenta Ozeki
    • Organizer
      24th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      2022 ACM-SIAM Symposium on Discrete Algorithms (SODA 2022)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] ストリーミングデータにおけるアイテム頻出数を求める省領域乱択アルゴリズム2022

    • Author(s)
      垣村尚徳,新田陸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] ストリーミングデータにおけるアイテム頻出数を求める省領域乱択アルゴリズム2022

    • Author(s)
      垣村尚徳,新田陸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] Monotone edge flips to an orientation of maximum edge-connectivity a la Nash-Williams2022

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Invited
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] マトロイドランク効用関数をもつ組合せ市場の価格付け2021

    • Author(s)
      Berczi Kristof, 垣村 尚徳, 小林 佑輔
    • Organizer
      日本応用数理学会 2021年 研究部会連合発表会
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] Reformist Envy-Free Item Allocations: Algorithms and Complexity2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      第183回情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] マトロイドランク効用関数をもつ組合せ市場の価格付け2021

    • Author(s)
      Berczi Kristof,垣村 尚徳,小林 佑輔
    • Organizer
      日本応用数理学会 2021年 研究部会連合発表会
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] Reformist envy-free item allocations: algorithms and complexity2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      第183回情報処理学会アルゴリズム研究会
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] Reconfiguration of envy-free item allocations2021

    • Author(s)
      Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki
    • Organizer
      Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-20H05795
  • [Presentation] 大規模ネットワーク解析のための組合せ最適化アルゴリズム2019

    • Author(s)
      垣村尚徳
    • Organizer
      第32回回路とシステムワークショップ
    • Invited
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint2019

    • Author(s)
      垣村尚徳,Chien-Chung Huang
    • Organizer
      情報処理学会第174回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] 対称行列の符号付けとグラフスペクトル2018

    • Author(s)
      Carlson Charles, Chandrasekaran Karthekeyan, Chang Hsien-Chih, 垣村尚徳, Kolla Alexandra
    • Organizer
      日本応用数理学会2018年第14回研究部会連合発表会
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization2018

    • Author(s)
      垣村尚徳,Chien-Chung Huang,
    • Organizer
      情報処理学会第170回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] Complexity of the Multi-Service Center Problem2018

    • Author(s)
      Takehiro Ito, Naonori Kakimura and Yusuke Kobayashi
    • Organizer
      The Japanese Conference on Combinatorics and Its Applications (JCCA 2018)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] Streaming Submodular Maximization under a Knapsack Constraint2017

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Yuichi Yoshida
    • Organizer
      The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17K00028
  • [Presentation] マトロイド交わり問題とその解法2017

    • Author(s)
      垣村尚徳
    • Organizer
      第13回組合せ論若手研究集会
    • Place of Presentation
      慶應義塾大学(神奈川県横浜市)
    • Year and Date
      2017-03-01
    • Invited
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 劣モジュラ関数最大化に対するストリーミングアルゴリズム2017

    • Author(s)
      垣村尚徳
    • Organizer
      日本オペレーションズ・リサーチ学会「最適化の基盤とフロン ティア」研究部会(WOO)
    • Place of Presentation
      沖縄県市町村自治会館(沖縄県那覇市)
    • Invited
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] Efficient Stabilization of Cooperative Matching Games2016

    • Author(s)
      Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto
    • Organizer
      International Conference on Autonomous Agents and Multiagent Systems(AAMAS)
    • Place of Presentation
      Singapore(Singapore)
    • Year and Date
      2016-05-09
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] ネットワーク型交渉ゲームの安定化アルゴリ ズム2016

    • Author(s)
      伊藤建洋,垣村尚徳,神山直之,小林佑輔, 岡本吉央
    • Organizer
      アルゴリズム研究会
    • Place of Presentation
      電気通信大学
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] イマージョンを含まないグラフに対する彩色アルゴリズム2016

    • Author(s)
      垣村尚徳,河原林健一
    • Organizer
      日本応用数理学会2016年年会
    • Place of Presentation
      北九州国際会議場(福岡県北九州市)
    • Year and Date
      2016-09-12
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] ネットワーク型交渉ゲームの安定化アルゴリズム2016

    • Author(s)
      伊藤建洋,垣村尚徳,神山直之,小林佑輔,岡本吉央
    • Organizer
      第157回アルゴリズム研究会
    • Place of Presentation
      電気通信大学(東京都調布市)
    • Year and Date
      2016-03-06
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 重み付きマトロイド交わり問題に対する厳密解法と近似解法2015

    • Author(s)
      黄建中,垣村尚徳,神山直之
    • Organizer
      2015年日本オペレーションズ・リサーチ学会秋季研究発表会
    • Place of Presentation
      九州工業大学(福岡県北九州市)
    • Year and Date
      2015-09-10
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 線形相補性問題のパラメータ化計算量2015

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      2015年電子情報通信学会総合大会
    • Place of Presentation
      立命館大学 びわこ・くさつキャンパス(滋賀県草津市)
    • Year and Date
      2015-03-10
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] Total Dual Integrality of the Linear Complementarity Problem2015

    • Author(s)
      Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino
    • Organizer
      The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      九州大学西新プラザ(福岡県福岡市)
    • Year and Date
      2015-06-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] Exact and Approximation Algorithms for Weighted Matroid Intersection2015

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama
    • Organizer
      The 22nd International Symposium on Mathematical Programming (ISMP)
    • Place of Presentation
      Pittsburgh(U.S.)
    • Year and Date
      2015-07-12
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 線形相補性問題のパラメータ化計算量2015

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      電子情報通信学会 総合大会
    • Place of Presentation
      立命館大学
    • Year and Date
      2015-03-11
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Total dual integrality of the linear complementarity problem2015

    • Author(s)
      Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
    • Organizer
      The 22nd Interna- tional Symposium on Mathematical Pro- gramming
    • Place of Presentation
      Pittsurgh
    • Year and Date
      2015-07-12
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 劣モジュラ関数最大化とその機械学習への応用2015

    • Author(s)
      垣村尚徳
    • Organizer
      第18回情報論的学習理論ワークショップ (IBIS2015)
    • Place of Presentation
      つくば国際会議場(茨城県つくば市)
    • Year and Date
      2015-11-25
    • Invited
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 木における最小費用b-辺支配集合問題2015

    • Author(s)
      伊藤建洋,垣村尚徳,神山直之,小林佑輔,岡本吉央
    • Organizer
      日本オペレーションズ・リサーチ学会 春季研究発表会
    • Place of Presentation
      東京理科大学
    • Year and Date
      2015-03-26
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 線形相補性問題のパラメータ化計算量2015

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      日本オペレーションズ・リサーチ学会 春季研究発表会
    • Place of Presentation
      東京理科大学
    • Year and Date
      2015-03-26
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Total dual integrality of the linear complementarity problem2015

    • Author(s)
      Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
    • Organizer
      The 9th Japanese- Hungarian Symposium on Discrete Mathe- matics and Its Applications
    • Place of Presentation
      Fukuoka
    • Year and Date
      2015-06-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Total Dual Integrality of the Linear Complementarity Problem2015

    • Author(s)
      Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino
    • Organizer
      The 22nd International Symposium on Mathematical Programming (ISMP)
    • Place of Presentation
      Pittsburgh(U.S.)
    • Year and Date
      2015-07-12
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] Weighted Matroid Intersection Algorithms via Weight Decomposition2015

    • Author(s)
      Chien-Chung Huang, Naonori Kakimura, and Naoyuki Kamiyama
    • Organizer
      The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      九州大学西新プラザ(福岡県福岡市)
    • Year and Date
      2015-06-02
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 線形相補性問題の整数性2014

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      研究集会「最適化:モデリングとアルゴリズム」
    • Place of Presentation
      政策研究大学院大学 (東京都港区)
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 方向つき線形相補性問題の計算複雑度2014

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      日本オペレーションズ・リサーチ学会 秋季研究発表会
    • Place of Presentation
      北海道科学大学
    • Year and Date
      2014-08-28
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 線形相補性問題の完全双対整数性2014

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      2014年日本オペレーションズ・リサーチ学会春季研究発表会
    • Place of Presentation
      大阪大学 豊中キャンパス(大阪府豊中市)
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] Packing edge-disjoint K_5-immersions in 4-edge-connected graphs2013

    • Author(s)
      Naonori Kakimura and Ken-ichi Kawarabayashi
    • Organizer
      The Asian Mathematical Conference 2013(AMC 2013)
    • Place of Presentation
      BEXCO, Busan, Korea
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] Matching Problems with Delta-Matroid Constraints2012

    • Author(s)
      N. Kakimura
    • Organizer
      The 21th International Symposium on Mathematical Programming
    • Place of Presentation
      ベルリン,ドイツ
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] デルタマトロイド制約付きマッチング2012

    • Author(s)
      垣村尚徳,高松瑞代
    • Organizer
      日本オペレーションズ・リサーチ学会2012年春季研究発表会
    • Place of Presentation
      防衛大学校(神奈川県横須賀市)
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] 疎な線形相補性問題に対する組合せ的アルゴリズム2012

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      2012年日本オペレーションズ・リサーチ学会秋季研究発表会
    • Place of Presentation
      名古屋,日本
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] 疎な線形相補性問題に対する組合せ的アルゴリズム2012

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      2012年日本オペレーションズ・リサーチ学会秋季研究発表会
    • Place of Presentation
      ウインクあいち
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Computing Knapsack Solutions with Cardinality Robustness2012

    • Author(s)
      N. Kakimura
    • Organizer
      The 21th International Symposium on Mathematical Programming
    • Place of Presentation
      ベルリン,ドイツ
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Matching problems with delta-matroid constraints2012

    • Author(s)
      N. Kakimura and M. Takamatsu
    • Organizer
      The 21th International Symposium on Mathematical Programming (ISMP)
    • Place of Presentation
      Berlin, Germany
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Erdos-Posa Property and Its Algorithmic Applications - Parity Constraints Subset Feedback Set, and Subset Packing2012

    • Author(s)
      N. Kakimura, K. Kawarabayashi, and Y. Kobayashi
    • Organizer
      The 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2012)
    • Place of Presentation
      Kyoto, Japan
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Erdos-Posa Property and Its Algorithmic Applications …Parity Constraints, Subset Feedback Set, and Subset Packing2012

    • Author(s)
      N. Kakimura, K. Kawarabayashi, and Y. Kobayashi,
    • Organizer
      The 23rd Annual ACM-SLAM Symposium on Discrete Algorithras(SODA), 1726-1736January 17-19, 2012.
    • Place of Presentation
      京都,日本
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Computing Knapsack Solutions with Cardinality Robustness2012

    • Author(s)
      Naonori Kakimura, Kazuhisa Makino, and Kento Seimi
    • Organizer
      The 21th International Symposium on Mathematical Programming (ISMP)
    • Place of Presentation
      Berlin, Germany
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Computing Knapsack Solutions with Cardinality Robustness2012

    • Author(s)
      N. KAKIMURA, K. Makino, and K. Seimi
    • Organizer
      The 21th International Symposium on Mathematical Programming(ISMP)
    • Place of Presentation
      Berlin, Germany
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] 離散凸最適化ソルバとデモンストレーションソフトウェアの公開2011

    • Author(s)
      土村展之, 森口聡子, 垣村尚徳, 岩田覚, 室田一雄
    • Organizer
      情報処理学会第133回アルゴリズム研究会
    • Place of Presentation
      愛媛大学(愛媛県)
    • Year and Date
      2011-01-12
    • Data Source
      KAKENHI-PROJECT-21360045
  • [Presentation] Robust Independence Systems2011

    • Author(s)
      N. Kakimura and K. Makino
    • Organizer
      The 38th International Colloquium on Automata
    • Place of Presentation
      Languages and Programming (ICALP 2011), Zurich, Switzerland
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Set Covering with Ordered Replacement---Additive and Multiplicative Gaps2011

    • Author(s)
      Fritz Eisenbrand, Naonori Kakimura, Thomas Rothvoss, Laura Sanita
    • Organizer
      Poc.of IPCO 2011, LNCS 6655, 170-182
    • Place of Presentation
      New York, USA
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Robust Independence Systems2011

    • Author(s)
      Naonori KAKIMURA, Kazuhisa Makino
    • Organizer
      Proc.of ICALP 2011, LNCS 6755, 367-378
    • Place of Presentation
      Zurich, Switzerland
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Set Covering with OrderedReplacement - Additive and Multiplicative Gaps2011

    • Author(s)
      F. Eisenbrand, N. Kakimura, T. Rothvoss, and L. Sanita
    • Organizer
      The 15th International Conference on Integer Programming and Combinatorial Optimization(IPCO 2011)
    • Place of Presentation
      Yorktown Heights, U.S
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Robust Independence Systems2011

    • Author(s)
      Naonori KAKIMURA, Kazuhisa MAKINO
    • Organizer
      The SLAM Conference on Optimization
    • Place of Presentation
      Darmstadt, Germany
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] ロバスト独立システム2011

    • Author(s)
      垣村尚徳,牧野和久
    • Organizer
      2011年日本オペレーションズ・リサーチ学会春季研究発表会
    • Place of Presentation
      電気通信大学
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Computing Knapsack Solutions with Cardinality Robustness2011

    • Author(s)
      Naonori Kakimura, Kazuhisa Makino, and Kento Seimi
    • Organizer
      Proc. of ISAAC 2011, LNCS 7074, 693-702, 2011.
    • Place of Presentation
      December 5-8, 2011
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] 順序交換性を持つ集合被覆問題2011

    • Author(s)
      垣村尚徳(withF.Eisenbrand,T.RothvossandL.Sanita)
    • Organizer
      日本応用数理学会平成22年研究部会連合発表会
    • Place of Presentation
      電気通信大学
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Computing Knapsack Solutions with Cardinality Robustness2011

    • Author(s)
      N. Kakimura, K. Makino, and K. Seimi
    • Organizer
      The 22nd International Symposium on Algorithms and Computation (ISAAC 2011)
    • Place of Presentation
      Yokohama, Japan
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] 河原林健一.指定された頂点を通るパリティ制約付サイクルのパッキング2011

    • Author(s)
      垣村尚徳
    • Organizer
      日本応用数理学会2011年度年会
    • Place of Presentation
      同志社大学
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Robust Independence Systems2011

    • Author(s)
      N. Kakimura and K. Makino
    • Organizer
      The SIAM Conference on Optimization
    • Place of Presentation
      Darmstadt, Germany
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Packing Cycles of Length 0 Modulo p through Prescribed Vertices2011

    • Author(s)
      N. Kakimura and K. Kawarabayashi
    • Organizer
      The 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
    • Place of Presentation
      Kyoto, Japan
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] 指定された頂点を通るパリティ制約付サイクルのパッキング2011

    • Author(s)
      垣村尚徳, 河原林健一
    • Organizer
      日本応用数理学会2011年度年会
    • Place of Presentation
      同志社大学,京都,日本
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Matching Structure of Symmetric Bipartite Graphs and a Generalization of Polya's Problem2009

    • Author(s)
      N. Kakimura
    • Organizer
      The20th International Symposium on Mathematical Programming (ISMP)
    • Place of Presentation
      Chicago, U.S
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] コーダル構造を持つ半正定値対称行列に対する極大クリーク行列分解の直接的な証明2009

    • Author(s)
      垣村尚徳
    • Organizer
      2009年日本オペレーションズ・リサーチ学会秋季研究発表会
    • Place of Presentation
      長崎大学
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] Matching Structure of Symmetric Bipartite Graphs and a Generalization of Polya's Problem2009

    • Author(s)
      Naonori Kakimura
    • Organizer
      The 20th International Symposium on Mathematical Programming (ISMP)
    • Place of Presentation
      シカゴ, アメリカ
    • Year and Date
      2009-08-28
    • Data Source
      KAKENHI-PROJECT-21760057
  • [Presentation] 線形相補性問題の整数性

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      2014年研究集会「最適化:モデリングとアルゴリズム」
    • Place of Presentation
      政策研究大学院大学
    • Year and Date
      2014-03-25 – 2014-03-26
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 線形相補性問題の完全双対整数性

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      電子情報通信学会 総合大会
    • Place of Presentation
      新潟大学
    • Year and Date
      2014-03-18 – 2014-03-21
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] Packing Edge-Disjoint Odd S-Cycles in 4-Edge-Connected Graphs

    • Author(s)
      Naonori Kakimura, Yusuke Kobayashi and Ken-ichi Kawarabayashi
    • Organizer
      SIAM Conference on Discrete Mathematics
    • Place of Presentation
      Minneapolis (U.S.)
    • Year and Date
      2014-06-16 – 2014-06-19
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 方向つき線形相補性問題の計算複雑度

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      2014年日本オペレーションズ・リサーチ学会秋季研究発表会
    • Place of Presentation
      北海道科学大学(北海道札幌市)
    • Year and Date
      2014-08-28 – 2014-08-29
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] 木における最小費用b-辺支配集合問題

    • Author(s)
      伊藤建洋,垣村尚徳,神山直之,小林佑輔,岡本吉央
    • Organizer
      2015年日本オペレーションズ・リサーチ学会春季研究発表会
    • Place of Presentation
      東京理科大学 神楽坂キャンパス(東京都新宿区)
    • Year and Date
      2015-03-26 – 2015-03-27
    • Data Source
      KAKENHI-PROJECT-25730001
  • [Presentation] Maximum Lifetime Coverage Problems with Battery Recovery Effects (ポスター発表)

    • Author(s)
      夫紀恵, スッパキットパイサーン ウォラポン, 木村慧, 垣村尚徳
    • Organizer
      情報科学技術フォーラム
    • Place of Presentation
      鳥取県鳥取市
    • Year and Date
      2013-09-04 – 2013-09-06
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 線形相補性問題の完全双対整数性

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      日本オペレーションズ・リサーチ学会 春季研究発表会
    • Place of Presentation
      大阪大学
    • Year and Date
      2014-03-06 – 2014-03-07
    • Data Source
      KAKENHI-PLANNED-24106002
  • [Presentation] 線形相補性問題のパラメータ化計算量

    • Author(s)
      澄田範奈,垣村尚徳,牧野和久
    • Organizer
      2015年日本オペレーションズ・リサーチ学会春季研究発表会
    • Place of Presentation
      東京理科大学 神楽坂キャンパス(東京都新宿区)
    • Year and Date
      2015-03-26 – 2015-03-27
    • Data Source
      KAKENHI-PROJECT-25730001
  • 1.  KOBAYASHI Yusuke (40581591)
    # of Collaborated Projects: 5 results
    # of Collaborated Products: 19 results
  • 2.  TAMURA Akihisa (50217189)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 3.  河原林 健一 (40361159)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 2 results
  • 4.  吉田 悠一 (50636967)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 5.  Avis David (90584110)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 6.  黒木 祐子 (50889095)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 7.  MUROTA Kazuo (50134466)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 8.  IWATA Satoru (00263161)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 9.  SHIOURA Akiyoshi (10296882)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 10.  MORIGUCHI Satoko (60407351)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 11.  TSUCHIMURA Nobuyuki (20345119)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 1 results
  • 12.  Makino Kazuhisa (60294162)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 13 results
  • 13.  Okada Yukinori (70727411)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 14.  OKAMOTO Yoshio (00402660)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 18 results
  • 15.  河村 彰星 (20600117)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 16.  ロスマン ベンジャミン (90599177)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 17.  神山 直之 (10548134)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 14 results
  • 18.  小関 健太 (10649122)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 13 results
  • 19.  野崎 雄太 (40822648)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 15 results
  • 20.  岩政 勇仁 (70854602)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 10 results
  • 21.  前澤 俊一 (70905934)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 9 results
  • 22.  林 興養 (40963559)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 23.  澄田 範奈 (10761356)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 2 results
  • 24.  福永 拓郎 (60452314)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 3 results
  • 25.  COOK Stephen
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 26.  ZIEGLER Martin
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 27.  GURVICH Vladimir
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 28.  BOROS Endre
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 29.  伊藤 健洋
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 8 results
  • 30.  小林 靖明
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi