4 citations · 9 across the 14 of their papers we have counts for
9 papers · 1 filter
Finding a Maximum Restricted -Matching via Boolean Edge-CSP
Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa
The problem of finding a maximum -matching without short cycles has received significant attention due to its relevance to the Hamilton cycle problem. This problem is generalize…
Finding popular branchings in vertex-weighted digraphs
Kei Natsui, Kenjiro Takazawa
Popular matchings have been intensively studied recently as a relaxed concept of stable matchings. By applying the concept of popular matchings to branchings in directed graphs, Ka…
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into -branchings in Digraphs
Kenjiro Takazawa
An equitable partition into branchings in a digraph is a partition of the arc set into branchings such that the sizes of any two branchings differ at most by one. For a digraph who…
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications
Yuni Iwamasa, Kenjiro Takazawa
For two matroids and with the same ground set and two cost functions and on , we consider the problem of finding bases of and of…
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids
Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi
The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete…
M-convexity of the minimum-cost packings of arborescences
Kenjiro Takazawa
The aim of this paper is to reveal the discrete convexity of the minimum-cost packings of arborescences and branchings. We first prove that the minimum-cost packings of disjoint $k…
A Generalized-Polymatroid Approach to Disjoint Common Independent Sets in Two Matroids
Kenjiro Takazawa, Yu Yokoi
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set into common independent sets, where $E…
Excluded -factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids
Kenjiro Takazawa
We propose a framework for optimal -matchings excluding the prescribed -factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching p…
Relationship of Two Formulations for Shortest Bibranchings
Kazuo Murota, Kenjiro Takazawa
The shortest bibranching problem is a common generalization of the minimum-weight edge cover problem in bipartite graphs and the minimum-weight arborescence problem in directed gra…