Kenjiro Takazawa
Orcid: 0000-0002-7662-7374
According to our database1,
Kenjiro Takazawa
authored at least 37 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
CoRR, 2024
2023
Theor. Comput. Sci., April, 2023
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint.
Oper. Res. Lett., March, 2023
2022
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids.
SIAM J. Discret. Math., 2022
RAIRO Oper. Res., 2022
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
Proceedings of the WALCOM: Algorithms and Computation, 2022
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
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
CoRR, 2019
2018
2017
Theor. Comput. Sci., 2017
Discret. Optim., 2017
Discret. Appl. Math., 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
2013
2012
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
2008
Proceedings of the Integer Programming and Combinatorial Optimization, 2008