Yutaro Yamaguchi

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 47

Top Topics

Subgame Perfect

Multiple Knapsack

Submodular Functions

Top Venues

SIAM J. Discret. Math.

Discret. Appl. Math.

Publications

Ryoma Norose, Yutaro Yamaguchi
Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs. CoRR (2024)
Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA (2024)
Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Minimum Rank Oracle. CoRR (2024)
Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
Shortest odd paths in undirected graphs with conservative weight functions. Discret. Appl. Math. 357 (2024)
Hitoshi Murakami, Yutaro Yamaguchi
An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems. CoRR (2024)
Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
Finding Spanning Trees with Perfect Matchings. CoRR (2024)
Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi
Fast primal-dual update against local weight update in linear assignment problem and its application. Inf. Process. Lett. 183 (2024)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37 (2) (2023)
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
Hypergraph characterization of split matroids. J. Comb. Theory, Ser. A 194 (2023)
Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi
Maintaining Optimality in Assignment Problem against Weight Updates around Vertices. CoRR (2022)
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
Hypergraph characterization of split matroids. CoRR (2022)
Takanori Maehara, So Nakashima, Yutaro Yamaguchi
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. Math. Program. 194 (1) (2022)
Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. (3) (2022)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Matroid Intersection under Restricted Oracles. CoRR (2022)
Yoichi Iwata, Yutaro Yamaguchi
Finding a Shortest Non-Zero Path in Group-Labeled Graphs. Comb. 42 (Supplement 2) (2022)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. 910 (2022)
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. Algorithmica 83 (12) (2021)
Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. 46 (4) (2021)
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR (2021)
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
List Coloring of Two Matroids through Reduction to Partition Matroids. SIAM J. Discret. Math. 35 (3) (2021)
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
Subgame Perfect Equilibria of Sequential Matching Games. ACM Trans. Economics and Comput. 7 (4) (2020)
Takanori Maehara, Yutaro Yamaguchi
Stochastic packing integer programs with few queries. Math. Program. 182 (1) (2020)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory, Ser. B 143 (2020)
Yutaro Yamaguchi
A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. SODA (2020)
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. ISCO (2020)
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. CoRR (2020)
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
List colouring of two matroids through reduction to partition matroids. CoRR (2019)
Yasushi Kawase, Yutaro Yamaguchi
Antimatroids induced by matchings. Discret. Appl. Math. 257 (2019)
Takanori Maehara, Yutaro Yamaguchi
Stochastic Monotone Submodular Maximization with Queries. CoRR (2019)
Yutaro Yamaguchi
A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. CoRR (2019)
Takanori Maehara, So Nakashima, Yutaro Yamaguchi
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -. CoRR (2019)
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. 32 (1) (2018)
Yutaro Yamaguchi, Takanori Maehara
Stochastic Packing Integer Programs with Few Queries. SODA (2018)
Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida
0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. FOCS (2018)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Tight Approximation for Unconstrained XOS Maximization. CoRR (2018)
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. EC (2018)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. CoRR (2018)
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. CoRR (2018)
Yasushi Kawase, Yutaro Yamaguchi
Antimatroids Induced by Matchings. CoRR (2017)
Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. CoRR (2017)
Takanori Maehara, Yutaro Yamaguchi
Stochastic Packing Integer Programs with Few Queries. CoRR (2017)
Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi
Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) (2016)
Shin-ichi Tanigawa, Yutaro Yamaguchi
Packing non-zero A-paths via matroid matching. Discret. Appl. Math. 214 (2016)
Yutaro Yamaguchi
Packing A-Paths in Group-Labelled Graphs via Linear Matroid Parity. SIAM J. Discret. Math. 30 (1) (2016)
Yutaro Yamaguchi
Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity. ISAAC (2016)
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
Making Bipartite Graphs DM-irreducible. CoRR (2016)
Yutaro Yamaguchi
Realizing symmetric set functions as hypergraph cut capacity. Discret. Math. 339 (8) (2016)
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms. IEEE Trans. Smart Grid 6 (5) (2015)
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. ICALP (1) (2015)
Yoshinobu Kawahara, Yutaro Yamaguchi
Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions. CoRR (2015)
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
Cyber security analysis of power networks by hypergraph cut algorithms. SmartGridComm (2014)
Yutaro Yamaguchi
-paths in Group-Labelled Graphs via Linear Matroid Parity. SODA (2014)