Yutaro Yamaguchi

Orcid: 0000-0002-1919-7195

Affiliations:
  • Kyushu University, Fukuoka, Japan
  • Osaka University, Japan (former)


According to our database1, Yutaro Yamaguchi authored at least 37 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast primal-dual update against local weight update in linear assignment problem and its application.
Inf. Process. Lett., January, 2024

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Matroid Intersection under Restricted Oracles.
SIAM J. Discret. Math., June, 2023

Hypergraph characterization of split matroids.
J. Comb. Theory, Ser. A, 2023

Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions.
CoRR, 2023

2022
Finding a Shortest Non-Zero Path in Group-Labeled Graphs.
Comb., December, 2022

Approximation by lexicographically maximal solutions in matching and matroid intersection problems.
Theor. Comput. Sci., 2022

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice.
Math. Program., 2022

An <i>O</i>(<i>n</i><sup>2</sup>)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position.
IEICE Trans. Inf. Syst., 2022

Maintaining Optimality in Assignment Problem against Weight Updates around Vertices.
CoRR, 2022

Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions.
CoRR, 2022

2021
List Coloring of Two Matroids through Reduction to Partition Matroids.
SIAM J. Discret. Math., 2021

Tight Approximation for Unconstrained XOS Maximization.
Math. Oper. Res., 2021

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem.
Algorithmica, 2021

2020
Subgame Perfect Equilibria of Sequential Matching Games.
ACM Trans. Economics and Comput., 2020

Stochastic packing integer programs with few queries.
Math. Program., 2020

Finding a path with two labels forbidden in group-labeled graphs.
J. Comb. Theory, Ser. B, 2020

A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Antimatroids induced by matchings.
Discret. Appl. Math., 2019

List colouring of two matroids through reduction to partition matroids.
CoRR, 2019

Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -.
CoRR, 2019

Stochastic Monotone Submodular Maximization with Queries.
CoRR, 2019

A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.
CoRR, 2019

2018
Making Bipartite Graphs DM-Irreducible.
SIAM J. Discret. Math., 2018

Tight Approximation for Unconstrained XOS Maximization.
CoRR, 2018

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing.
CoRR, 2017

2016
Packing A-Paths in Group-Labelled Graphs via Linear Matroid Parity.
SIAM J. Discret. Math., 2016

Realizing symmetric set functions as hypergraph cut capacity.
Discret. Math., 2016

Packing non-zero A-paths via matroid matching.
Discret. Appl. Math., 2016

Maximizing Time-Decaying Influence in Social Networks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.
IEEE Trans. Smart Grid, 2015

Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions.
CoRR, 2015

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
Packing <i>A</i>-paths in Group-Labelled Graphs via Linear Matroid Parity.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014


  Loading...