Yutaro Yamaguchi

From MaRDI portal
Revision as of 13:13, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:284711

Available identifiers

zbMath Open yamaguchi.yutaroMaRDI QIDQ284711

List of research outcomes





PublicationDate of PublicationType
Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs2024-12-04Paper
A nearly linear-time distributed algorithm for exact maximum matching2024-11-28Paper
Shortest odd paths in undirected graphs with conservative weight functions2024-09-26Paper
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching2023-11-07Paper
Fast primal-dual update against local weight update in linear assignment problem and its application2023-10-12Paper
Matroid Intersection under Restricted Oracles2023-06-27Paper
Hypergraph characterization of split matroids2022-11-29Paper
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --2022-06-29Paper
Approximation by lexicographically maximal solutions in matching and matroid intersection problems2022-03-23Paper
Tight Approximation for Unconstrained XOS Maximization2022-02-08Paper
Dynamic programming approach to the generalized minimum Manhattan network problem2022-01-18Paper
List Coloring of Two Matroids through Reduction to Partition Matroids2021-10-18Paper
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems2021-07-21Paper
Dynamic programming approach to the generalized minimum Manhattan network problem2021-02-04Paper
A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs2021-02-02Paper
Stochastic packing integer programs with few queries2020-06-26Paper
Finding a path with two labels forbidden in group-labeled graphs2020-04-22Paper
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity2019-06-20Paper
Finding a Shortest Non-zero Path in Group-Labeled Graphs2019-06-10Paper
Antimatroids induced by matchings2019-03-11Paper
Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q46078992018-03-15Paper
Making Bipartite Graphs DM-Irreducible2018-03-05Paper
Packing non-zero \(A\)-paths via matroid matching2016-09-30Paper
Realizing symmetric set functions as hypergraph cut capacity2016-05-18Paper
Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity2016-04-04Paper
Finding a path with two labels forbidden in group-labeled graphs2015-10-27Paper
Approximation and FPT Algorithms for Finding DM-Irreducible Spanning SubgraphsN/APaper
An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related ProblemsN/APaper

Research outcomes over time

This page was built for person: Yutaro Yamaguchi