research
∙
10/07/2021
Finding popular branchings in vertex-weighted digraphs
Popular matchings have been intensively studied recently as a relaxed co...
share
research
∙
03/24/2020
Notes on Equitable Partition into Matching Forests in Mixed Graphs and into b-branchings in Digraphs
An equitable partition into branchings in a digraph is a partition of th...
research
∙
03/05/2020
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications
For two matroids M_1 and M_2 with the same ground set V and two cost fun...
research
∙
09/29/2019
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids
The present note is a strengthening of a recent paper by K. Takazawa and...
research
∙
05/22/2018
M-convexity of the minimum-cost packings of arborescences
In this paper, we first prove that the minimum-cost packings of disjoint...
research
∙
02/09/2018
The b-bibranching Problem: TDI System, Packing, and Discrete Convexity
In this paper, we introduce the b-bibranching problem in digraphs, which...
research
∙
02/07/2018