Rchr
J-GLOBAL ID：201101059426853346   Update date: Jan. 31, 2024

Ozeki Kenta

オゼキ ケンタ | Ozeki Kenta
Affiliation and department：
Yokohama National University Faculty of Environment and Information Sciences Division of Social Environment and Information

About Yokohama National University Faculty of Environment and Information Sciences Division of Social Environment and Information


Homepage URL  (2)： http://tgt.ynu.ac.jp/ozeki/ ,  http://hamilton.comb.math.keio.ac.jp/ozeki/
Research field  (1)： Applied mathematics and statistics
Research keywords  (2)： Graph Theory ,  Discrete Mathematics
Research theme for competitive and other funds  (11)：
  • 2022 - 2024 グラフの strong Gallai-Ramsey 理論の提案と発展
  • 2021 - 2024 グラフの strong Gallai-Ramsey 理論の提案と発展
  • 2021 - 2023 グラフの strong Gallai-Ramsey 理論の提案と発展
  • 2021 - 2023 グラフの strong Gallai-Ramsey 理論の提案と発展
  • 2020 - 2023 Development of Combinatorial Reconfiguration by Mathematics Approach: From Examples to New Methods
Show all
Papers (110)：
  • Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. On reachable assignments under dichotomous preferences. Theoretical Computer Science. 2023. 979. 114196-114196
  • Michitaka Furuya, Naoki Matsumoto, Yumiko Ohno, Kenta Ozeki. Note on fair game edge-connectivity of graphs. Discrete Applied Mathematics. 2023. 333. 132-135
  • Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. Rerouting Planar Curves and Disjoint Paths. ICALP. 2023. 81-19
  • Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. On Reachable Assignments Under Dichotomous Preferences. PRIMA 2022: Principles and Practice of Multi-Agent Systems. 2023. 650-658
  • Takehiro Ito, Yuni Iwamasa, Naonori Kakimura, Yusuke Kobayashi 0001, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto, Kenta Ozeki. Rerouting Planar Curves and Disjoint Paths. CoRR. 2022. abs/2210.11778
ｍore...
MISC (8)：
  • A Hamiltonian Cycles in Graphs on Surfaces. The Institute of Electronics, Information and Communication Engineers. 2018. 101. 3. 258-261
  • Formula in combinatorics. 2017. 5月. 25-29
  • 小関 健太. 組合せ和の公式 (特集 中学・高校の公式から大学数学へ). 数学セミナー. 2017. 56. 5. 25-29
  • 小関 健太. ハミルトン閉路について (特集 グラフ理論とOR). オペレーションズ・リサーチ = Communications of the Operations Research Society of Japan : 経営の科学. 2016. 61. 12. 844-851
  • Set-$(g,f)$-factors in graphs (Designs, Codes, Graphs and Related Areas). 2016. 1986. 11-22
ｍore...
Education (1)：
  • - 2009 Keio University Graduate School, Division of Science and Engineering
Professional career (2)：
  • Master(Science) (Keio University)
  • Doctor(Science) (Keio University)
Awards (2)：
  • 2015/03 - The Mathematical Society of Japan The 2014 MSJ Prize for Exellent Applied Mathematicians (g, f)-factors in directed graphs
  • 2013/03 - The Mathematical Society of Japan MSJ Takebe Katahiro Prize for Encouragement of Young Researchers
Association Membership(s) (1)：
THE MATHEMATICAL SOCIETY OF JAPAN
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page

TOP

BOTTOM