Kenjiro Takazawa

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 42

Top Topics

Bipartite Graph

Top Venues

SIAM J. Discret. Math.

Publications

Kenjiro Takazawa
A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria. CoRR (2024)
Yukiya Hatajima, Kenjiro Takazawa
A note on upgrading the min-max weight of a base of a matroid. JSIAM Lett. 16 (2024)
Kenjiro Takazawa
Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond. AAMAS (2024)
Kenjiro Takazawa
Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond. CoRR (2024)
Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi
Popular Maximum-Utility Matchings with Matroid Constraints. CoRR (2024)
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. CoRR (2023)
Kenjiro Takazawa
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint. Oper. Res. Lett. 51 (2) (2023)
Kei Natsui, Kenjiro Takazawa
Finding popular branchings in vertex-weighted directed graphs. Theor. Comput. Sci. 953 (2023)
Yuga Kanaya, Kenjiro Takazawa
A Faster Deterministic Approximation Algorithm for TTP-2. CoRR (2023)
Kei Natsui, Kenjiro Takazawa
Finding Popular Branchings in Vertex-Weighted Digraphs. WALCOM (2022)
Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa
Minimizing submodular functions on diamonds via generalized fractional matroid matchings. J. Comb. Theory, Ser. B 157 (2022)
Kenjiro Takazawa
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids. SIAM J. Discret. Math. 36 (1) (2022)
Fuga Kiyosue, Kenjiro Takazawa
A Common Generalization of Budget Games and Congestion Games. SAGT (2022)
Shiori Matsuura, Kenjiro Takazawa
An improved heuristic algorithm for the maximum benefit Chinese postman problem. RAIRO Oper. Res. 56 (3) (2022)
Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
Posimodular Function Optimization. Algorithmica 84 (4) (2022)
Kenjiro Takazawa
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Yuni Iwamasa, Kenjiro Takazawa
Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications. Math. Program. 194 (1) (2022)
Kenjiro Takazawa
The b-bibranching problem: TDI system, packing, and discrete convexity. Networks 79 (1) (2022)
Kei Natsui, Kenjiro Takazawa
Finding popular branchings in vertex-weighted digraphs. CoRR (2021)
Kenjiro Takazawa
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs. ISCO (2020)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-branching problem in digraphs. Discret. Appl. Math. 283 (2020)
Yuni Iwamasa, Kenjiro Takazawa
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications. CoRR (2020)
Yuni Iwamasa, Kenjiro Takazawa
Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications. TAMC (2020)
Kenjiro Takazawa
Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs. CoRR (2020)
Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids. CoRR (2019)
Kenjiro Takazawa, Yu Yokoi
A generalized-polymatroid approach to disjoint common independent sets in two matroids. Discret. Math. 342 (7) (2019)
Kenjiro Takazawa
Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function. TAMC (2019)
Kenjiro Takazawa
Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function. J. Comb. Optim. 38 (4) (2019)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-branching problem in digraphs. CoRR (2018)
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
The b-Branching Problem in Digraphs. MFCS (2018)
Kenjiro Takazawa
The b-bibranching Problem: TDI System, Packing, and Discrete Convexity. CoRR (2018)
Kenjiro Takazawa
M-convexity of the minimum-cost packings of arborescences. CoRR (2018)
Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa
Posimodular Function Optimization. WADS (2017)
Yusuke Kobayashi, Kenjiro Takazawa
Randomized strategies for cardinality robustness in the knapsack problem. Theor. Comput. Sci. 699 (2017)
Kenjiro Takazawa
Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings. IPCO (2017)
Kenjiro Takazawa
Decomposition theorems for square-free 2-matchings in bipartite graphs. Discret. Appl. Math. 233 (2017)
Kenjiro Takazawa
Excluded t-factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids. CoRR (2017)
Kenjiro Takazawa
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs. Discret. Optim. 26 (2017)
Kazuo Murota, Kenjiro Takazawa
Relationship of Two Formulations for Shortest Bibranchings. CoRR (2017)
Yusuke Kobayashi, Kenjiro Takazawa
Randomized Strategies for Cardinality Robustness in the Knapsack Problem. ANALCO (2016)
Kenjiro Takazawa
A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs. Inf. Process. Lett. 116 (9) (2016)
Kenjiro Takazawa
Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs. MFCS (2016)
Kenjiro Takazawa
Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs. WG (2015)
Kenjiro Takazawa
Optimal Matching Forests and Valuated Delta-Matroids. SIAM J. Discret. Math. 28 (1) (2014)
Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa
Finding 2-Factors Closer to TSP Tours in Cubic Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa
A proof of Cunningham's conjecture on restricted subgraphs and jump systems. J. Comb. Theory, Ser. B 102 (4) (2012)
Kenjiro Takazawa
A weighted independent even factor algorithm. Math. Program. 132 (1-2) (2012)
Kenjiro Takazawa
Optimal Matching Forests and Valuated Delta-Matroids. IPCO (2011)
Yusuke Kobayashi, Kenjiro Takazawa
Even factors, jump systems, and discrete convexity. J. Comb. Theory, Ser. B 99 (1) (2009)
Kenjiro Takazawa
-Factor Algorithm for Bipartite Graphs. Math. Oper. Res. 34 (2) (2009)
Kenjiro Takazawa
A weighted even factor algorithm. Math. Program. 115 (2) (2008)
Satoru Iwata, Kenjiro Takazawa
The Independent Even Factor Problem. SIAM J. Discret. Math. 22 (4) (2008)
Kenjiro Takazawa
A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs. IPCO (2008)
Satoru Iwata, Kenjiro Takazawa
The independent even factor problem. SODA (2007)