Kenjiro Takazawa

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