Takazawa Kenjiro 高澤兼二郎

… Alternative Names

TAKAZAWA Kenjiro 高澤兼二郎

Less

Researcher Number	10583859
Other IDs
Affiliation (Current)	2025: 法政大学, 理工学部, 教授
Affiliation (based on the past Project Information) *help	2023 – 2024: 法政大学, 理工学部, 教授 2016 – 2022: 法政大学, 理工学部, 准教授 2011 – 2015: 京都大学, 数理解析研究所, 助教 2013: 京都大学, 数理解析研究所, 助教(Research Associate)
Review Section/Research Field	Principal Investigator Basic Section 60010:Theory of informatics-related / Basic Section 60020:Mathematical informatics-related / Mathematical informatics / Fundamental theory of informatics Except Principal Investigator Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related / Basic Section 60020:Mathematical informatics-related / Basic Section 60010:Theory of informatics-related / Theory of informatics / Mathematical informatics / Fundamental theory of informatics
Keywords	Principal Investigator 混雑ゲーム / マトロイド / アルゴリズム / アルゴリズム的ゲーム理論 / 巡回セールスマン問題 / マッチング理論 / 離散凸解析 / ポピュラーマッチング / 社会的最適解 / 公平分割 … More / 有向森 / ポピュラー有向木 / 離散凸最適化 / 純粋ナッシュ均衡 / 数理工学 / 制約付きマッチング / ゲーム理論 / ポリマトロイド / マトロイド交わり / 巡回セールスマン / 制約付き 2-マッチング / 有向木 / マッチング / フランス / 国際情報交流 / グルノーブル / 国際情報交換 / 組合せ最適化 … More Except Principal Investigator アルゴリズム / 組合せ最適化 / 劣モジュラ関数 / 離散最適化 / 固定パラメータ容易 / 正モジュラ / 組合せゲーム / アルゴリズム論 / 最適化 / 離散数学 / 数理計画 / 劣モジュラ構造 / 離散アルゴリズム / 組合せ剛性理論 / 巡回セールスマン問題 / 離散凸性 / ネットワーク / NP困難 / 近似アルゴリズム Less

多面体的手法と離散構造を用いた組合せ最適化問題の解法
- Principal Investigator
  
  小林佑輔
- Project Period (FY)
  2024 – 2028
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
  Basic Section 60020:Mathematical informatics-related
  Sections That Are Subject to Joint Review: Basic Section60010:Theory of informatics-related , Basic Section60020:Mathematical informatics-related
- Research Institution
  Kyoto University
マトロイド理論を軸とするアルゴリズム的ゲーム理論の体系的な研究Principal Investigator
- Principal Investigator
  
  高澤兼二郎
- Project Period (FY)
  2024 – 2028
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Hosei University
マトロイド理論・離散凸解析理論に基づく社会システム解析理論の構築Principal Investigator
- Principal Investigator
  
  高澤兼二郎
- Project Period (FY)
  2020 – 2024
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60020:Mathematical informatics-related
- Research Institution
  Hosei University
Matching, matroid, and traveling salesman problemPrincipal Investigator
- Principal Investigator
  
  Takazawa Kenjiro
- Project Period (FY)
  2016 – 2020
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Mathematical informatics
- Research Institution
  Hosei University
Development of efficient algorithms based on enumeration structures
- Principal Investigator
  
  Makino Kazuhisa
- Project Period (FY)
  2014 – 2019
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Theory of informatics
- Research Institution
  Kyoto University
Developments of discrete optimization theory and efficient algorithms based on submodular structures
- Principal Investigator
  
  Fujishige Satoru
- Project Period (FY)
  2013 – 2018
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Mathematical informatics
- Research Institution
  Kyoto University
Approximation Algorithms for Submodular Optimization
- Principal Investigator
  
  Iwata Satoru
- Project Period (FY)
  2011 – 2015
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  The University of Tokyo
  Kyoto University
Designing Efficient Algorithms for Combinatorial Optimization Problems with Discrete ConvexityPrincipal Investigator
- Principal Investigator
  
  TAKAZAWA Kenjiro
- Project Period (FY)
  2011 – 2014
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Kyoto University

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

All Journal Article Presentation

[Journal Article] A note on upgrading the min–max weight of a base of a matroid2024
- Author(s)
  Yukiya Hatajima, Kenjiro Takazawa
- Journal Title
  
  JSIAM Letters
  
  Volume: 16 Issue: 0 Pages: 1-4
- DOI
  10.14495/jsiaml.16.1
- ISSN
  1883-0609, 1883-0617
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] Pure Nash equilibria in weighted congestion games with complementarities and beyond2024
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2024)
  
  Volume: - Pages: 2495-2497
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] Finding popular branchings in vertex-weighted directed graphs2023
- Author(s)
  Kei Natsui, Kenjiro Takazawa
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 953 Pages: 113799-113799
- DOI
  10.1016/j.tcs.2023.113799
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] Finding a Maximum Restricted t-Matching via Boolean Edge-CSP2023
- Author(s)
  Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
- Journal Title
  
  arXiv
  
  Volume: -
- Open Access
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint2023
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Operations Research Letters
  
  Volume: 51 Issue: 2 Pages: 128-132
- DOI
  10.1016/j.orl.2023.01.003
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] A Faster Deterministic Approximation Algorithm for TTP-22023
- Author(s)
  Yuga Kanaya, Kenjiro Takazawa
- Journal Title
  
  arXiv
  
  Volume: -
- Open Access
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] Excluded t-factors in bipartite graphs: A unified framework for nonbipartite matchings, restricted 2-matchings, and matroids2022
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  SIAM Journal on Discrete Mathematics
  
  Volume: 36 Issue: 1 Pages: 702-727
- DOI
  10.1137/18m1176737
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] Posimodular Function Optimization2022
- Author(s)
  Magnus M. Halldorsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
- Journal Title
  
  Algorithmica
  
  Volume: 84 Issue: 4 Pages: 1107-1131
- DOI
  10.1007/s00453-021-00910-y
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-20K11699, KAKENHI-PROJECT-19K22841
[Journal Article] Minimizing submodular functions on diamonds via generalized fractional matroid matchings2022
- Author(s)
  Fujishige Satoru、Kiraly Tamas、Makino Kazuhisa、Takazawa Kenjiro、Tanigawa Shin-ichi
- Journal Title
  
  Journal of Combinatorial Theory, Series B
  
  Volume: 157 Pages: 294-345
- DOI
  10.1016/j.jctb.2022.07.005
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-19K11839, KAKENHI-PROJECT-20K11699, KAKENHI-PROJECT-19K22841, KAKENHI-PLANNED-20H05967
[Journal Article] Finding popular branchings in vertex-weighted digraphs2022
- Author(s)
  Kei Natsui, Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 13174 Pages: 303-314
- DOI
  10.1007/978-3-030-96731-4_25
- ISBN
  9783030967307, 9783030967314
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] An improved heuristic algorithm for the maximum benefit Chinese postman problem2022
- Author(s)
  Shiori Matsuura, Kenjiro Takazawa
- Journal Title
  
  RAIRO - Operations Research
  
  Volume: 56 Issue: 3 Pages: 1283-1291
- DOI
  10.1051/ro/2022044
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] Notes on equitable partitions into matching forests in mixed graphs and into b-branchings in digraphs2022
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Discrete Mathematics and Theoretical Computer Science
  
  Volume: 24 Issue: Graph Theory
- DOI
  10.46298/dmtcs.8719
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] A common generalization of budget games and congestion games2022
- Author(s)
  Fuga Kiyosue, Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 13584 Pages: 258-274
- DOI
  10.1007/978-3-031-15714-1_15
- ISBN
  9783031157134, 9783031157141
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699
[Journal Article] Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications2021
- Author(s)
  Yuni Iwamasa, Kenjiro Takazawa
- Journal Title
  
  Mathematical Programming
  
  Volume: - Issue: 1-2 Pages: 229-256
- DOI
  10.1007/s10107-021-01625-2
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699, KAKENHI-PROJECT-20K23323, KAKENHI-PROJECT-16K16012, KAKENHI-PLANNED-20H05795
[Journal Article] The b-bibranching problem: TDI system, packing, and discrete convexity2021
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Networks
  
  Volume: － Issue: 1 Pages: 32-46
- DOI
  10.1002/net.22035
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-20K11699
[Journal Article] Notes on equitable partitions into matching forests in mixed graphs and b-branchings in digraphs2020
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 12176 Pages: 214-224
- DOI
  10.1007/978-3-030-53262-8_18
- ISBN
  9783030532611, 9783030532628
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11699, KAKENHI-PROJECT-16K16012
[Journal Article] Relationship of two formulations for shortest bibranchings2020
- Author(s)
  K. Murota, K. Takazawa
- Journal Title
  
  Japan Journal of Industrial and Applied Mathematics
  
  Volume: 38 Issue: 1 Pages: 141-161
- DOI
  10.1007/s13160-020-00432-0
- NAID
  210000178025
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20K11697, KAKENHI-PROJECT-20K11699, KAKENHI-PROJECT-16K16012
[Journal Article] Notes on equitable partitions into matching forests in mixed graphs and into b-branchings in digraphs2020
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: －
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012
[Journal Article] Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications2020
- Author(s)
  Yuni Iwamasa, Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: －
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012
[Journal Article] A NOTE ON A NEARLY UNIFORM PARTITION INTO COMMON INDEPENDENT SETS OF TWO MATROIDS2020
- Author(s)
  Fujishige Satoru、Takazawa Kenjiro、Yokoi Yu
- Journal Title
  
  Journal of the Operations Research Society of Japan
  
  Volume: 63 Issue: 3 Pages: 71-77
- DOI
  10.15807/jorsj.63.71
- NAID
  130007882296
- ISSN
  0453-4514, 2188-8299
- Year and Date
  2020-07-31
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-19K11839, KAKENHI-PROJECT-18K18004, KAKENHI-PROJECT-16K16012
[Journal Article] IMPROVING APPROXIMATION RATIOS FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM2020
- Author(s)
  Masamune Kawasaki, Kenjiro Takazawa
- Journal Title
  
  Journal of the Operations Research Society of Japan
  
  Volume: 63 Issue: 2 Pages: 60-70
- DOI
  10.15807/jorsj.63.60
- NAID
  130007838841
- ISSN
  0453-4514, 2188-8299
- Year and Date
  2020-04-30
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012
[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] A generalized-polymatroid approach to disjoint common independent sets in two matroids2019
- Author(s)
  Kenjiro Takazawa and Yu Yokoi
- Journal Title
  
  Discrete Mathematics
  
  Volume: 342 Issue: 7 Pages: 2002-2011
- DOI
  10.1016/j.disc.2019.03.009
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012
[Journal Article] Generalizations of weighted matroid congestion games: Pure Nash equilibrium, sensitivity analysis, and discrete convex function2019
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 11436 Pages: 594-614
- DOI
  10.1007/978-3-030-14812-6_37
- ISBN
  9783030148119, 9783030148126
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-26280001
[Journal Article] Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function2019
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Journal of Combinatorial Optimization
  
  Volume: 38 Issue: 4 Pages: 1043-1065
- DOI
  10.1007/s10878-019-00435-9
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012
[Journal Article] The b-branching problem in digraphs2018
- Author(s)
  Naonori Kakimura, Naoyuki Kamiyama, and Kenjiro Takazawa
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 117
- DOI
  10.4230/LIPICS.MFCS.2018.12
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-26280001
[Journal Article] Excluded t-factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2-matchings2017
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 10328 Pages: 430-441
- DOI
  10.1007/978-3-319-59250-3_35
- ISBN
  9783319592497, 9783319592503
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-25280004
[Journal Article] Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs2017
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Discrete Optimization
  
  Volume: 26 Pages: 26-40
- DOI
  10.1016/j.disopt.2017.05.003
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-25280004
[Journal Article] Posimodular function optimization2017
- Author(s)
  Magnus M. Halldorsson, Toshimasa Ishii，Kazuhisa Makino, Kenjiro Takazawa
- Journal Title
  
  Lecture Notes in Computer Science, Algorithms and Data Structures
  
  Volume: 10389 Pages: 437-448
- DOI
  10.1007/978-3-319-62127-2_37
- ISBN
  9783319621265, 9783319621272
- Peer Reviewed / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K00001, KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-26280001, KAKENHI-WRAPUP-17H06074, KAKENHI-PROJECT-15H02965
[Journal Article] Randomized strategies for cardinality robustness in the knapsack problem2017
- Author(s)
  Yusuke Kobayashi and Kenjiro Takazawa
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 699 Pages: 53-62
- DOI
  10.1016/j.tcs.2016.12.019
- NAID
  120007128720
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012, KAKENHI-PLANNED-24106002, KAKENHI-PROJECT-26280001
[Journal Article] Decomposition theorems for square-free 2-matchings in bipartite graphs2017
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 233 Pages: 215-223
- DOI
  10.1016/j.dam.2017.07.035
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16K16012, KAKENHI-PROJECT-25280004
[Journal Article] Randomized strategies for cardinality robustness in the knapsack problem2016
- Author(s)
  Yusuke Kobayashi and Kenjiro Takazawa
- Journal Title
  
  ANALCO 2016
  
  Volume: ANALCO2016 Pages: 25-33
- DOI
  10.1137/1.9781611974324.3
- NAID
  120007128720
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-26280001
[Journal Article] A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs2016
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  Information Processing Letters
  
  Volume: 116 Issue: 9 Pages: 550-553
- DOI
  10.1016/j.ipl.2016.04.011
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-16K16012
[Journal Article] Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs2016
- Author(s)
  K. Takazawa
- Journal Title
  
  Leibniz International Proceedings in Informatics
  
  Volume: 58
- DOI
  10.4230/LIPIcs.MFCS.2016.87
- Peer Reviewed / Acknowledgement Compliant / Open Access
- Data Source
  KAKENHI-PROJECT-25280004
[Journal Article] Optimal matching forests and valuated delta-matroids,2014
- Author(s)
  Kenjiro Takazawa
- Journal Title
  
  SIAM Journal on Discrete Mathematics
  
  Volume: 28 Issue: 1 Pages: 445-467
- DOI
  10.1137/110827661
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23300002, KAKENHI-PROJECT-23700016, KAKENHI-PROJECT-25280004
[Journal Article] Finding 2-Factors Closer to TSP Tours in Cubic Graphs2013
- Author(s)
  S. Boyd, S. Iwata, and K. Takazawa
- Journal Title
  
  SIAM Journal on Discrete Mathematics
  
  Volume: 27 Issue: 2 Pages: 918-939
- DOI
  10.1137/110841837
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23300002
[Journal Article] Finding 2-factors closer to TSP tours in cubic graphs2013
- Author(s)
  S. Boyd, S. Iwata, and K. Takazawa
- Journal Title
  
  SIAM Journal on Discrete Mathematics
  
  Volume: Vol.27 Issue: 2 Pages: 918-939
- DOI
  10.1137/110843514
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20310088, KAKENHI-PROJECT-21360045, KAKENHI-PROJECT-23700016, KAKENHI-PLANNED-24106005, KAKENHI-PROJECT-25280004
[Journal Article] Finding 2-factors closer to TSP tours in cubic graphs2013
- Author(s)
  S. Boyd, S. Iwata and K. Takazawa
- Journal Title
  
  SIAM Journal on Discrete Mathematics
  
  Volume: --
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700016
[Journal Article] The Weighted Independent Even Factor Algorithm2012
- Author(s)
  K. Takazawa
- Journal Title
  
  Mathematical Programming, Series A
  
  Volume: 132 Issue: 1-2 Pages: 261-276
- DOI
  10.1007/s10107-010-0397-z
- NAID
  120003988372
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700016
[Journal Article] Shortest Bibranchings and Valuated Matroid Intersection2012
- Author(s)
  K. Takazawa
- Journal Title
  
  Japan Journal of Industrial and Applied Mathematics
  
  Volume: --
- NAID
  10031126884
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700016
[Journal Article] Shortest bibranchings and valuated matroid intersection2012
- Author(s)
  K. Takazawa
- Journal Title
  
  Japan Journal of Industrial and Applied Mathematics
  
  Volume: 29 Issue: 3 Pages: 561-573
- DOI
  10.1007/s13160-012-0072-2
- NAID
  10031126884
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700016
[Journal Article] A Proof of Cunningham's Conjecture on Restricted Subgraphs and Jump Systems2012
- Author(s)
  Y. Kobayashi, J. Szabo, K. Takazawa
- Journal Title
  
  Journal of Combinatorial Theory, Series B
  
  Volume: published online Issue: 4 Pages: 948-966
- DOI
  10.1016/j.jctb.2012.03.003
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-23700016, KAKENHI-PROJECT-24700004
[Presentation] Pure Nash equilibria in weighted congestion games with complementarities and beyond2024
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 23rd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] A faster deterministic approximation algorithm for TTP-22024
- Author(s)
  Yuga Kanaya, Kenjiro Takazawa
- Organizer
  The 8th International Symposium on Combinatorial Optimization (ISCO 2024)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 巡回トーナメント問題に対する近似アルゴリズムの改良2023
- Author(s)
  金谷祐河, 高澤兼二郎
- Organizer
  日本応用数理学会第 19 回研究部会連合発表会
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 巡回トーナメント問題に対する1+11/n近似アルゴリズム2023
- Author(s)
  金谷祐河, 高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会研究部会「最適化の理論とアルゴリズム」未来を担う若手研究者の集い 2023
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 全域木における最小の最大辺重みを改善する問題の一般化2023
- Author(s)
  畑島志哉, 高澤兼二郎
- Organizer
  日本応用数理学会第 19 回研究部会連合発表会
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 巡回トーナメント問題に対する近似アルゴリズムの改良2023
- Author(s)
  金谷祐河, 高澤兼二郎
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 制限付きt-マッチング問題に対する制約充足的アプローチ2023
- Author(s)
  岩政勇仁, 小林佑輔, 高澤兼二郎
- Organizer
  アルゴリズム研究発表会
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] Finding popular branchings in vertex-weighted digraphs2022
- Author(s)
  Kei Natsui, Kenjiro Takazawa
- Organizer
  The 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 重みつきポピュラー有向木のアルゴリズム2022
- Author(s)
  夏井慧, 高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 2022 年春季研究発表会
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 重みつきポピュラー有向木のアルゴリズム2022
- Author(s)
  夏井慧, 高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会研究部会「最適化手法とアルゴリズム ─未来を担う若手研究者の集い 2022─」
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] A common generalization of budget games and congestion games2022
- Author(s)
  Fuga Kiyosue, Kenjiro Takazawa
- Organizer
  The 15th International Symposium on Algorithmic Game Theory (SAGT 2022)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 予算ゲームの一般化におけるナッシュ均衡2022
- Author(s)
  清末風雅, 高澤兼二郎
- Organizer
  日本応用数理学会第 18 回研究部会連合発表会
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 予算ゲームと混雑ゲームの共通の一般化2022
- Author(s)
  清末風雅, 高澤兼二郎
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] Notes on equitable partitions into matching forests in mixed graphs and b-branchings in digraphs2020
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 6th International Symposium on Combinatorial Optimization (ISCO 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Notes on equitable partitions into matching forests in mixed graphs and b-branchings in digraphs2020
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 6th International Symposium on Combinatorial Optimization (ISCO 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications2020
- Author(s)
  Yuni Iwamasa, Kenjiro Takazawa
- Organizer
  The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] 交叉制約下でのマトロイドの最適基とその一般化2020
- Author(s)
  岩政勇仁, 高澤兼二郎
- Organizer
  京都大学数理解析研究所共同研究（グループ型）数理最適化の理論・アルゴリズム・応用
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] 交叉制約下でのマトロイドの最適基とその一般化2020
- Author(s)
  岩政勇仁, 高澤兼二郎
- Organizer
  京都大学数理解析研究所共同研究（グループ型）数理最適化の理論・アルゴリズム・応用
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications2020
- Author(s)
  Yuni Iwamasa, Kenjiro Takazawa
- Organizer
  The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] Notes on equitable partitions into matching forests in mixed graphs and b-branchings in digraphs2020
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 6th International Symposium on Combinatorial Optimization (ISCO 2020)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-20K11699
[Presentation] クラスター巡回セールスマン問題に対する近似率の改善2019
- Author(s)
  河崎政宗，高澤兼二郎
- Organizer
  最適化とその応用―未来を担う若手研究者の集い 2019―
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] b-branchings: Branchings with high indegree2019
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (HJ 2019)
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Generalizations of weighted matroid congestion games: Pure Nash equilibrium, sensitivity analysis, and discrete convex function2019
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 15th Annual Conference on Theory and Applications of Models of Computation (TAMC 2019)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] The b-branching problem: Branchings with high indegree2019
- Author(s)
  Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
- Organizer
  The 10th Cargese Workshop on Combinatorial Optimization
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] The b-bibranching problem: TDI System, packing, and discrete convexity2018
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 23rd International Symposium on Mathematical Programming (ISMP 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] 有向グラフにおける b-有向木2018
- Author(s)
  垣村尚徳, 神山直之, 高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 2018 年春季研究発表会
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Excluded t-factors in bipartite graphs: A unified framework for nonbipartite matchings and restricted 2-matchings2018
- Author(s)
  Kenjiro Takazawa
- Organizer
  The Traveling Salesman Problem: Algorithms & Optimization
- Invited / Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] The b-branching problem in digraphs2018
- Author(s)
  Naonori Kakimura, Naoyuki Kamiyama, and Kenjiro Takazawa
- Organizer
  The 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] The b-bibranching problem: TDI System, packing, and discrete convexity2018
- Author(s)
  K. Takazawa
- Organizer
  The 23rd International Symposium on Mathematical Programming (ISMP 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-26280001
[Presentation] 制約付きマッチングとその応用2018
- Author(s)
  高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 RAMP シンポジウム (RAMP2018)
- Invited
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Excluded $t$-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings2017
- Author(s)
  K. Takazawa
- Organizer
  The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings2017
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 19th Conference on Integer Programming and Combinatorial Optimization (IPCO 2017)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] 制約付き t-マッチングの統一的な枠組2017
- Author(s)
  高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 2017 年春季研究発表会
- Place of Presentation
  沖縄県市町村自治会館（沖縄県那覇市）
- Year and Date
  2017-03-15
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings2017
- Author(s)
  K. Takazawa
- Organizer
  The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Excluded t-factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-matchings2017
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (JH 2017)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] 有向グラフにおけるマトロイド交わりの多段階貪欲アルゴリズム2017
- Author(s)
  垣村尚徳, 神山直之, 高澤兼二郎
- Organizer
  2017 年度応用数学合同研究集会
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs2016
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
- Place of Presentation
  Krakow, Poland
- Year and Date
  2016-08-22
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] 双有向森問題に対する二つの双対定理の関係2016
- Author(s)
  室田一雄，高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 2016 年春季研究発表会
- Place of Presentation
  慶應義塾大学(横浜市、神奈川県)
- Year and Date
  2016-03-17
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Finding a maximum 2-matching excluding prescribed cycle s in bipartite graphs2016
- Author(s)
  K. Takazawa
- Organizer
  41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
- Place of Presentation
  AGH University (Krakow, Poland)
- Year and Date
  2016-08-22
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs2016
- Author(s)
  Kenjiro Takazawa
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  富山県立大学（富山県射水市）
- Data Source
  KAKENHI-PROJECT-16K16012
[Presentation] Finding a maximum 2-matching excluding prescribed cycle s in bipartite graphs2016
- Author(s)
  K. Takazawa
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  富山県立大学(富山県、富山市)
- Year and Date
  2016-09-06
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] 正則 2 部グラフにおける制約付き 2-マッチングと近似アルゴリズム2015
- Author(s)
  高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 2015 年秋季研究発表会
- Place of Presentation
  九州工業大学(北九州市、福岡県)
- Year and Date
  2015-09-10
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Structure theorems for square-free 2-matchings in bipartite graphs2015
- Author(s)
  K. Takazawa
- 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-25280004
[Presentation] Decomposition theorems for square-free 2-matchings in bipartite graphs2015
- Author(s)
  K. Takazawa
- Organizer
  The 41st International Workshop on Graph-Theoretic Concepts in Computer Science
- Place of Presentation
  Munich, Germany
- Year and Date
  2015-06-17
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Decomposition theorems for square-free 2-matchings in bipartite graphs2015
- Author(s)
  K. Takazawa
- Organizer
  The 22nd International Symposium on Mathematical Programming
- Place of Presentation
  Pittsburgh, USA
- Year and Date
  2015-07-12
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] ナップサック問題に対する確率的ロバスト最適化2015
- Author(s)
  小林佑輔, 高澤兼二郎
- Organizer
  日本応用数理学会 2015 年度年会
- Place of Presentation
  金沢大学
- Year and Date
  2015-09-09
- Data Source
  KAKENHI-PROJECT-26280001
[Presentation] Finding 2-factors closer to TSP tours in cubic graphs2014
- Author(s)
  K. Takazawa
- Organizer
  18th Combinatorial Optimization Workshop
- Place of Presentation
  Aussois, France
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Finding 2-Factors Closer to TSP Tours in Cubic Graphs2014
- Author(s)
  K. Takazawa
- Organizer
  The 18th Aussois Combinatorial Optimization Workshop
- Place of Presentation
  Aussois, France
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] Shortest ｂibranchings and ｖaluated matroid intersection2013
- Author(s)
  K. Takazawa
- Organizer
  Combinatorial Geometries: Matroids, Oriented Matroids and Applications
- Place of Presentation
  Marseille, France
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Shortest Bibranchings and Valuated Matroid Intersection2013
- Author(s)
  K. Takazawa
- Organizer
  Combinatorial Geometries: Matroids, Oriented Matroids and Applications
- Place of Presentation
  Marseille, France
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] Shortest bibranchings and valuated matroid intersection2013
- Author(s)
  K. Takazawa
- Organizer
  Combinatorial Geometries: Matroids, Oriented Matroids and Applications
- Place of Presentation
  マルセイユ，フランス
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] Finding 2-factors closer to TSP tours in cubic graphs2012
- Author(s)
  K. Takazawa
- Organizer
  The 3rd Cargese Workshop on Combinatorial Optimization
- Place of Presentation
  カージェス，フランス
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] Covering cuts in bridgeless cubic graphs2012
- Author(s)
  K. Takazawa
- Organizer
  The 21st International Symposium on Mathematical Programming
- Place of Presentation
  ベルリン，ドイツ
- Invited
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] Discrete convexity in network optimization2012
- Author(s)
  K. Takazawa
- Organizer
  Kyoto RIMS Workshop "Discrete Convexity and Optimization"
- Place of Presentation
  京都大学
- Invited
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] 離散凸構造を持つ組合せ最適化問題2012
- Author(s)
  高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会「最適化の理論と応用」研究部会
- Place of Presentation
  東京大学
- Invited
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] Optimal Matching Forests and Valuated Delta-Matroids2011
- Author(s)
  K. Takazawa
- Organizer
  The 15th Conference on Integer Programming and Combinatorial Optimization
- Place of Presentation
  New York, USA
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] マッチング森とデルタマトロイド2011
- Author(s)
  高澤兼二郎
- Organizer
  離散幾何解析セミナー(招待講演)
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] 制約付き 2-因子の構造とアルゴリズム: 2-因子からハミルトン閉路へ
- Author(s)
  高澤兼二郎
- Organizer
  2014 年度 RIMS 共同研究「禁止マイナー・因子理論に関する諸問題の研究」
- Place of Presentation
  京都大学
- Year and Date
  2014-09-02 – 2014-09-05
- Invited
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Finding 2-Factors Closer to TSP Tours in Cubic Graphs
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 18th Aussois Combinatorial Optimization Workshop
- Place of Presentation
  Aussois, フランス
- Year and Date
  2014-01-06 – 2014-01-10
- Data Source
  KAKENHI-PROJECT-23300002
[Presentation] 2 部グラフにおける制約付き 2-マッチングの分解定理
- Author(s)
  高澤兼二郎
- Organizer
  研究集会「最適化：モデリングとアルゴリズム」
- Place of Presentation
  統計数理研究所
- Year and Date
  2015-03-19 – 2015-03-20
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] Decomposition theorems for square-free 2-matchings in bipartite graphs
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 22nd International Symposium on Mathematical Programming
- Place of Presentation
  Pittsburgh, USA
- Year and Date
  2015-07-12 – 2015-07-17
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] 2 部グラフにおける制約付き 2-マッチングの分解定理
- Author(s)
  高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 2015 年春季研究発表会
- Place of Presentation
  東京理科大学
- Year and Date
  2015-03-26 – 2015-03-27
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] 制約付き 2-因子の構造とアルゴリズム: 2-因子からハミルトン閉路へ
- Author(s)
  高澤兼二郎
- Organizer
  2014 年度 RIMS 共同研究「禁止マイナー・因子理論に関する諸問題の研究」
- Place of Presentation
  京都大学
- Year and Date
  2014-09-02 – 2014-09-05
- Invited
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] 2 部グラフにおける制約付き 2-マッチングの分解定理
- Author(s)
  高澤兼二郎
- Organizer
  研究集会「最適化：モデリングとアルゴリズム」
- Place of Presentation
  統計数理研究所
- Year and Date
  2015-03-19 – 2015-03-20
- Data Source
  KAKENHI-PROJECT-25280004
[Presentation] Shortest Bibranchings and Valuated Matroid Intersection
- Author(s)
  Kenjiro Takazawa
- Organizer
  Combinatorial Geometries: Matroids, Oriented Matroids and Applications
- Place of Presentation
  Marseille, フランス
- Year and Date
  2013-04-02 – 2013-04-06
- Data Source
  KAKENHI-PROJECT-23300002
[Presentation] Structure theorems for square-free 2-matchings in bipartite graphs
- Author(s)
  Kenjiro Takazawa
- Organizer
  The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
- Place of Presentation
  九州大学
- Year and Date
  2015-06-02 – 2015-06-05
- Data Source
  KAKENHI-PROJECT-23700016
[Presentation] 2 部グラフにおける制約付き 2-マッチングの分解定理
- Author(s)
  高澤兼二郎
- Organizer
  日本オペレーションズ・リサーチ学会 2015 年春季研究発表会
- Place of Presentation
  東京理科大学
- Year and Date
  2015-03-26 – 2015-03-27
- Data Source
  KAKENHI-PROJECT-23700016

1. TANIGAWA Shin-ichi (30623540)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
2. Fujishige Satoru (10092321)

# of Collaborated Projects: 2 results

# of Collaborated Products: 1 results
3. Makino Kazuhisa (60294162)

# of Collaborated Projects: 2 results

# of Collaborated Products: 0 results
4. Iwata Satoru (00263161)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results
5. 平井広志 (20378962)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
6. 石井利昌 (30324487)

# of Collaborated Projects: 1 results

# of Collaborated Products: 2 results
7. 小林佑輔 (40581591)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. 岩政勇仁 (70854602)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. KAKIMURA Naonori

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results
10. 室田一雄

# of Collaborated Projects: 0 results

# of Collaborated Products: 1 results

Takazawa Kenjiro 高澤 兼二郎

TAKAZAWA Kenjiro 高澤 兼二郎

Research Projects

Research Products

Co-Researchers

多面体的手法と離散構造を用いた組合せ最適化問題の解法

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

マトロイド理論を軸とするアルゴリズム的ゲーム理論の体系的な研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

マトロイド理論・離散凸解析理論に基づく社会システム解析理論の構築Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Matching, matroid, and traveling salesman problemPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of efficient algorithms based on enumeration structures

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Developments of discrete optimization theory and efficient algorithms based on submodular structures

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Approximation Algorithms for Submodular Optimization

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Designing Efficient Algorithms for Combinatorial Optimization Problems with Discrete ConvexityPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] A note on upgrading the min–max weight of a base of a matroid2024

Author(s)

Journal Title

DOI

ISSN

Language

Data Source

[Journal Article] Pure Nash equilibria in weighted congestion games with complementarities and beyond2024

Author(s)

Journal Title

Data Source

[Journal Article] Finding popular branchings in vertex-weighted directed graphs2023

Author(s)

Journal Title

DOI

Data Source

[Journal Article] Finding a Maximum Restricted t-Matching via Boolean Edge-CSP2023

Author(s)

Journal Title

Data Source

[Journal Article] An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint2023

Author(s)

Journal Title

DOI

Data Source

[Journal Article] A Faster Deterministic Approximation Algorithm for TTP-22023

Author(s)

Takazawa Kenjiro 高澤兼二郎

TAKAZAWA Kenjiro 高澤兼二郎