Kenjiro Takazawa

Orcid: 0000-0002-7662-7374

According to our database1, Kenjiro Takazawa authored at least 37 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A note on upgrading the min-max weight of a base of a matroid.
JSIAM Lett., 2024

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

2023
Finding popular branchings in vertex-weighted directed graphs.
Theor. Comput. Sci., April, 2023

An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint.
Oper. Res. Lett., March, 2023

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

A Faster Deterministic Approximation Algorithm for TTP-2.
CoRR, 2023

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

An improved heuristic algorithm for the maximum benefit Chinese postman problem.
RAIRO Oper. Res., 2022

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

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

Minimizing submodular functions on diamonds via generalized fractional matroid matchings.
J. Comb. Theory, Ser. B, 2022

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs.
Discret. Math. Theor. Comput. Sci., 2022

Posimodular Function Optimization.
Algorithmica, 2022

Finding Popular Branchings in Vertex-Weighted Digraphs.
Proceedings of the WALCOM: Algorithms and Computation, 2022

A Common Generalization of Budget Games and Congestion Games.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

2020
The b-branching problem in digraphs.
Discret. Appl. Math., 2020

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

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs.
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.
J. Comb. Optim., 2019

A generalized-polymatroid approach to disjoint common independent sets in two matroids.
Discret. Math., 2019

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

2018
M-convexity of the minimum-cost packings of arborescences.
CoRR, 2018

2017
Randomized strategies for cardinality robustness in the knapsack problem.
Theor. Comput. Sci., 2017

Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs.
Discret. Optim., 2017

Decomposition theorems for square-free 2-matchings in bipartite graphs.
Discret. Appl. Math., 2017

Relationship of Two Formulations for Shortest Bibranchings.
CoRR, 2017

Excluded t-Factors in Bipartite Graphs: A Unified Framework for Nonbipartite Matchings and Restricted 2-Matchings.
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.
Inf. Process. Lett., 2016

2014
Optimal Matching Forests and Valuated Delta-Matroids.
SIAM J. Discret. Math., 2014

2013
Finding 2-Factors Closer to TSP Tours in Cubic Graphs.
SIAM J. Discret. Math., 2013

2012
A weighted independent even factor algorithm.
Math. Program., 2012

A proof of Cunningham's conjecture on restricted subgraphs and jump systems.
J. Comb. Theory, Ser. B, 2012

2009
A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs.
Math. Oper. Res., 2009

Even factors, jump systems, and discrete convexity.
J. Comb. Theory, Ser. B, 2009

2008
The Independent Even Factor Problem.
SIAM J. Discret. Math., 2008

A weighted even factor algorithm.
Math. Program., 2008

A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2008


  Loading...