TAKAZAWA Kenjiro

タカザワケンジロウ | TAKAZAWA Kenjiro

Affiliation and department：
Job title： Associate Professor

Research field (4)： Applied mathematics and statistics , Basic mathematics , Mathematical informatics , Information theory

Research keywords (3)： Combinatorial Optimization , Discrete Mathematics , Mathematical Engineering

Research theme for competitive and other funds (9)：

Show all

Papers (36)：

Kei Natsui, Kenjiro Takazawa. Finding popular branchings in vertex-weighted directed graphs. Theoretical Computer Science. 2023. 953, 113799. 303-314
Kenjiro Takazawa. An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint. Operations Research Letters. 2023. 51. 2. 128-132
Yukiya Hatajima, Kenjiro Takazawa. A note on upgrading the min-max weight of a base of a matroid. JSIAM Letters. 2023
Yuni Iwamasa, Kenjiro Takazawa. Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications. Mathematical Programming. 2022. 194. 229-256
Shiori Matsuura, Kenjiro Takazawa. An improved heuristic algorithm for the maximum benefit Chinese postman problem. RAIRO - Operations Research. 2022. 56. 3. 1283-1291

ｍore...

MISC (3)：

Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa. Finding a maximum restricted t-matching via Boolean edge-CSP. arXiv. 2023
Yuga Kanaya, Kenjiro Takazawa. A faster deterministic approximation algorithm for TTP-2. arXiv. 2023
Satoru Fujishige, Tamas Kiraly, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa. Minimizing submodular functions on diamonds via generalized fractional matroid matching. EGRES Technical Reports. 2014

Books (2)：

Lectures and oral presentations (61)：

予算ゲームと混雑ゲームの共通の一般化
(電子情報通信学会コンピュテーション研究会 2022)
A common generalization of budget games and congestion games
(The 15th International Symposium on Algorithmic Game Theory (SAGT 2022) 2022)
Notes on equitable partitions into matching forests in mixed graphs and b-branchings in digraphs
(The 6th International Symposium on Combinatorial Optimization (ISCO 2020) 2020)
The b-branching problem: Branchings with high indegree
(The 10th Cargese Workshop on Combinatorial Optimization 2019)
b-branchings: Branchings with high indegree
(The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2019) 2019)

ｍore...

Education (2)：

2007 - 2010 The University of Tokyo Graduate School of Information Science and Technology Department of Mathematical Informatics
2005 - 2007 University of Tokyo Graduate School of Information Science and Technology Department of Mathematical Informatics

Professional career (1)：

Work history (3)：

2023/04 - 現在 Hosei University Department of Industrial and Systems Engineering, Faculty of Science and Engineering Professor
2016/04 - 2023/03 法政大学理工学部経営システム工学科准教授
2010/04 - 2016/03 Kyoto University Research Institute for Mathematical Sciences Assistant Professor

Committee career (13)：

2021/04 - 現在日本応用数理学会論文誌編集委員
2019/03 - 現在日本オペレーションズ・リサーチ学会研究普及委員
2018/04 - 2022/03 情報処理学会アルゴリズム研究会運営委員
2018/04 - 2019/03 The Japanese Conference on Combinatorics and Its Applications (JCCA 2018) Organizing Committee
2016/04 - 2017/03 日本オペレーションズ・リサーチ学会 RAMP シンポジウム (RAMP2016) セッションオーガナイザー

Show all

Awards (4)：

2011/04 - 日本応用数理学会日本応用数理学会第 7 回若手優秀講演賞制約付き t-マッチングとジャンプシステム: Cunninghamの予想の証明
2010/03 - 日本オペレーションズ・リサーチ学会日本オペレーションズ・リサーチ学会第 5 回文献賞奨励賞 A weighted even factor algorithm, A weighted Kt,t-free t-factor algorithm for bipartite graphs
2007/09 - 日本オペレーションズ・リサーチ学会日本オペレーションズ・リサーチ学会第 25 回学生論文賞 A Unified Approach to Combinatorial Algorithms for Matchings and Matroids
2007/03 - 東京大学東京大学大学院情報理工学系研究科長賞 A Unified Approach to Combinatorial Algorithms for Matchings and Matroids

Association Membership(s) (2)：

日本応用数理学会 , 日本オペレーションズ・リサーチ学会

※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page