The following pages link to Yutaro Yamaguchi (Q284711):
Displaying 20 items.
- Realizing symmetric set functions as hypergraph cut capacity (Q284712) (← links)
- Packing non-zero \(A\)-paths via matroid matching (Q317424) (← links)
- Antimatroids induced by matchings (Q1730258) (← links)
- Hypergraph characterization of split matroids (Q2102692) (← links)
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems (Q2118859) (← links)
- Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex -- (Q2149546) (← links)
- Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
- Stochastic packing integer programs with few queries (Q2191766) (← links)
- Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity (Q2797090) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- (Q4607899) (← links)
- Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity (Q4636549) (← links)
- Tight Approximation for Unconstrained XOS Maximization (Q5026453) (← links)
- A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs (Q5146903) (← links)
- List Coloring of Two Matroids through Reduction to Partition Matroids (Q5157385) (← links)
- Packing <i>A</i>-paths in Group-Labelled Graphs via Linear Matroid Parity (Q5384002) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5919077) (← links)
- Fast primal-dual update against local weight update in linear assignment problem and its application (Q6072219) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
