Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity. - Yutaro Yamaguchi 001 (SODA, 2014)

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (ICALP (1), 2015)

Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions. - Yoshinobu Kawahara; Yutaro Yamaguchi 001 (CoRR, 2015)

Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms. - Yutaro Yamaguchi 001; Anna Ogawa; Akiko Takeda; Satoru Iwata 001 (IEEE Trans. Smart Grid, 2015)

Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity. - Yutaro Yamaguchi 001 (ISAAC, 2016)

Maximizing Time-Decaying Influence in Social Networks. - Naoto Ohsaka; Yutaro Yamaguchi 001; Naonori Kakimura; Ken-ichi Kawarabayashi (ECML/PKDD (1), 2016)

Packing non-zero A-paths via matroid matching. - Shin-ichi Tanigawa; Yutaro Yamaguchi 001 (Discret. Appl. Math., 2016)

Realizing symmetric set functions as hypergraph cut capacity. - Yutaro Yamaguchi 001 (Discret. Math., 2016)

Packing A-Paths in Group-Labelled Graphs via Linear Matroid Parity. - Yutaro Yamaguchi 001 (SIAM J. Discret. Math., 2016)

Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. - Yoichi Iwata; Yutaro Yamaguchi 001; Yuichi Yoshida (CoRR, 2017)

0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. - Yoichi Iwata; Yutaro Yamaguchi 001; Yuichi Yoshida (FOCS, 2018)

Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. - Yasushi Kawase; Yutaro Yamaguchi 001; Yu Yokoi (EC, 2018)

Tight Approximation for Unconstrained XOS Maximization. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (CoRR, 2018)

Making Bipartite Graphs DM-Irreducible. - Kristóf Bérczi; Satoru Iwata 001; Jun Kato 003; Yutaro Yamaguchi 001 (SIAM J. Discret. Math., 2018)

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

Stochastic Monotone Submodular Maximization with Queries. - Takanori Maehara; Yutaro Yamaguchi 001 (CoRR, 2019)

Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -. - Takanori Maehara; So Nakashima; Yutaro Yamaguchi 001 (CoRR, 2019)

List colouring of two matroids through reduction to partition matroids. - Kristóf Bérczi; Tamás Schwarcz; Yutaro Yamaguchi 001 (CoRR, 2019)

Antimatroids induced by matchings. - Yasushi Kawase; Yutaro Yamaguchi 001 (Discret. Appl. Math., 2019)

A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. - Yutaro Yamaguchi 001 (SODA, 2020)

Finding a path with two labels forbidden in group-labeled graphs. - Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (J. Comb. Theory B, 2020)

Stochastic packing integer programs with few queries. - Takanori Maehara; Yutaro Yamaguchi 001 (Math. Program., 2020)

Subgame Perfect Equilibria of Sequential Matching Games. - Yasushi Kawase; Yutaro Yamaguchi 001; Yu Yokoi (ACM Trans. Economics and Comput., 2020)

Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. - Yuya Masumura; Taihei Oki; Yutaro Yamaguchi 001 (Algorithmica, 2021)

Tight Approximation for Unconstrained XOS Maximization. - Yuval Filmus; Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (Math. Oper. Res., 2021)

List Coloring of Two Matroids through Reduction to Partition Matroids. - Kristóf Bérczi; Tamás Schwarcz; Yutaro Yamaguchi 001 (SIAM J. Discret. Math., 2021)

Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. - Shin-ichi Minato; Mutsunori Banbara; Takashi Horiyama; Jun Kawahara; Ichigaku Takigawa; Yutaro Yamaguchi 001 (CoRR, 2022)

Maintaining Optimality in Assignment Problem against Weight Updates around Vertices. - Kohei Morita; Shinya Shiroshita; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2022)

An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. - Yasuaki Kobayashi; Shin-Ichi Nakano; Kei Uchizawa; Takeaki Uno; Yutaro Yamaguchi 001; Katsuhisa Yamanaka (IEICE Trans. Inf. Syst., 2022)

Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. - Takanori Maehara; So Nakashima; Yutaro Yamaguchi 001 (Math. Program., 2022)

Approximation by lexicographically maximal solutions in matching and matroid intersection problems. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (Theor. Comput. Sci., 2022)

Finding a Shortest Non-Zero Path in Group-Labeled Graphs. - Yoichi Iwata; Yutaro Yamaguchi 001 (Comb., 2022)

Hypergraph characterization of split matroids. - Kristóf Bérczi; Tamás Király; Tamás Schwarcz; Yutaro Yamaguchi 001; Yu Yokoi (J. Comb. Theory A, 2023)

Matroid Intersection under Restricted Oracles. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (SIAM J. Discret. Math., 2023)

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. - Taisuke Izumi; Naoki Kitamura; Yutaro Yamaguchi 001 (SODA, 2024)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs. - Ryoma Norose; Yutaro Yamaguchi 001 (CoRR, 2024)

Matroid Intersection under Minimum Rank Oracle. - Mihály Bárász; Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

Rainbow Arborescence Conjecture. - Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)

Shortest odd paths in undirected graphs with conservative weight functions. - Alpár Jüttner; Csaba Király 001; Lydia Mirabel Mendoza Cadena; Gyula Pap; Ildikó Schlotter; Yutaro Yamaguchi 001 (Discret. Appl. Math., 2024)

Fast primal-dual update against local weight update in linear assignment problem and its application. - Kohei Morita; Shinya Shiroshita; Yutaro Yamaguchi 001; Yu Yokoi (Inf. Process. Lett., 2024)

Towards the Proximity Conjecture on Group-Labeled Matroids. - Dániel Garamvölgyi; Ryuhei Mizutani; Taihei Oki; Tamás Schwarcz; Yutaro Yamaguchi 001 (ICALP, 2025)

Finding spanning trees with perfect matchings. - Kristóf Bérczi; Tamás Király; Yusuke Kobayashi 001; Yutaro Yamaguchi 001; Yu Yokoi (Discret. Appl. Math., 2025)

An FPT Algorithm for the Exact Matching Problem and NP-Hardness of Related Problems. - Hitoshi Murakami; Yutaro Yamaguchi 001 (IEICE Trans. Inf. Syst., 2025)

Code for finding a non-SIBO matroid. - Dániel Garamvölgyi; Ryuhei Mizutani; Taihei Oki; Tamás Schwarcz; Yutaro Yamaguchi 001 (DROPS Artifacts, 2025)

LZSE: an LZ-style compressor supporting O(log n)-time random access. - Hiroki Shibata 001; Yuto Nakashima 001; Yutaro Yamaguchi 001; Shunsuke Inenaga (CoRR, 2025)

Finding One Local Optimum Is Easy - But What about Two? - Yasuaki Kobayashi; Kazuhiro Kurita; Yutaro Yamaguchi 001 (CoRR, 2025)

Exact Matching in Matrix Multiplication Time. - Ryotaro Sato; Yutaro Yamaguchi 001 (CoRR, 2025)