Kenjiro Takazawa

According to our database, Kenjiro Takazawa authored at least 39 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A common generalization of budget games and congestion games.

Fuga Kiyosue, Kenjiro Takazawa

J. Comb. Optim., October, 2024

A note on upgrading the min-max weight of a base of a matroid.

Yukiya Hatajima, Kenjiro Takazawa

JSIAM Lett., 2024

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria.

Kenjiro Takazawa

CoRR, 2024

Popular Maximum-Utility Matchings with Matroid Constraints.

Gergely Csáji, Tamás Király, Kenjiro Takazawa, Yu Yokoi

CoRR, 2024

Finding a Maximum Restricted t-Matching via Boolean Edge-CSP.

Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond.

Kenjiro Takazawa

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Finding popular branchings in vertex-weighted directed graphs.

Kei Natsui, Kenjiro Takazawa

Theor. Comput. Sci., April, 2023

An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint.

Kenjiro Takazawa

Oper. Res. Lett., March, 2023

A Faster Deterministic Approximation Algorithm for TTP-2.

Yuga Kanaya, Kenjiro Takazawa

CoRR, 2023

2022

Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids.

Kenjiro Takazawa

SIAM J. Discret. Math., 2022

An improved heuristic algorithm for the maximum benefit Chinese postman problem.

Shiori Matsuura, Kenjiro Takazawa

RAIRO Oper. Res., 2022

The b-bibranching problem: TDI system, packing, and discrete convexity.

Kenjiro Takazawa

Networks, 2022

Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications.

Yuni Iwamasa, Kenjiro Takazawa

Math. Program., 2022

Minimizing submodular functions on diamonds via generalized fractional matroid matchings.

Satoru Fujishige, Tamás Király, Kazuhisa Makino, Kenjiro Takazawa, Shin-ichi Tanigawa

J. Comb. Theory B, 2022

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs.

Kenjiro Takazawa

Discret. Math. Theor. Comput. Sci., 2022

Posimodular Function Optimization.

Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa

Algorithmica, 2022

Finding Popular Branchings in Vertex-Weighted Digraphs.

Kei Natsui, Kenjiro Takazawa

Proceedings of the WALCOM: Algorithms and Computation, 2022

2020

The b-branching problem in digraphs.

Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa

Discret. Appl. Math., 2020

Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs.

Kenjiro Takazawa

CoRR, 2020

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs.

Kenjiro Takazawa

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function.

Kenjiro Takazawa

J. Comb. Optim., 2019

A generalized-polymatroid approach to disjoint common independent sets in two matroids.

Kenjiro Takazawa, Yu Yokoi

Discret. Math., 2019

A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids.

Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi

CoRR, 2019

2018

M-convexity of the minimum-cost packings of arborescences.

Kenjiro Takazawa

CoRR, 2018

2017

Randomized strategies for cardinality robustness in the knapsack problem.

Yusuke Kobayashi, Kenjiro Takazawa

Theor. Comput. Sci., 2017

Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs.

Kenjiro Takazawa

Discret. Optim., 2017

Decomposition theorems for square-free 2-matchings in bipartite graphs.

Kenjiro Takazawa

Discret. Appl. Math., 2017

Relationship of Two Formulations for Shortest Bibranchings.

Kazuo Murota, Kenjiro Takazawa

CoRR, 2017

Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings.

Kenjiro Takazawa

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs.

Kenjiro Takazawa

Inf. Process. Lett., 2016

2014

Optimal Matching Forests and Valuated Delta-Matroids.

Kenjiro Takazawa

SIAM J. Discret. Math., 2014

2013

Finding 2-Factors Closer to TSP Tours in Cubic Graphs.

Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa

SIAM J. Discret. Math., 2013

2012

A weighted independent even factor algorithm.

Kenjiro Takazawa

Math. Program., 2012

A proof of Cunningham's conjecture on restricted subgraphs and jump systems.

Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa

J. Comb. Theory B, 2012

2009

A Weighted <i>k_{t, t}</i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs.

Kenjiro Takazawa

Math. Oper. Res., 2009

Even factors, jump systems, and discrete convexity.

Yusuke Kobayashi, Kenjiro Takazawa

J. Comb. Theory B, 2009

2008

The Independent Even Factor Problem.

Satoru Iwata, Kenjiro Takazawa

SIAM J. Discret. Math., 2008

A weighted even factor algorithm.

Kenjiro Takazawa

Math. Program., 2008

A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs.

Kenjiro Takazawa

Proceedings of the Integer Programming and Combinatorial Optimization, 2008