Yutaro Yamaguchi

68 papers A* 8B 1C 1Journal 55Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computational Complexity of Swish. CoRR Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi
2026	J	`jnl`	Envy-Free School Redistricting Between Two Groups. CoRR Daisuke Shibatani, Yutaro Yamaguchi
2026	A*	`conf`	Finding One Local Optimum Is Easy - but What About Two? AAAI Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
2026	J	`jnl`	Regret Analysis of Sleeping Competing Bandits. CoRR Shinnosuke Uba, Yutaro Yamaguchi
2025	J	`jnl`	An FPT Algorithm for the Exact Matching Problem and NP-Hardness of Related Problems. IEICE Trans. Inf. Syst. Hitoshi Murakami, Yutaro Yamaguchi
2025	J	`jnl`	Exact Matching in Matrix Multiplication Time. CoRR Ryotaro Sato, Yutaro Yamaguchi
2025	J	`jnl`	Finding One Local Optimum Is Easy - But What about Two? CoRR Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi
2025	J	`jnl`	Finding spanning trees with perfect matchings. Discret. Appl. Math. Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
2025	J	`jnl`	Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation. CoRR Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2025	J	`jnl`	LZSE: an LZ-style compressor supporting O(log n)-time random access. CoRR Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga
2025	J	`jnl`	Odd and Even Harder Problems on Cycle-Factors. CoRR Florian Hörsch, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Eszter Szabó, Yutaro Yamaguchi
2025	A*	`conf`	Towards the Proximity Conjecture on Group-Labeled Matroids. ICALP Dániel Garamvölgyi, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz, Yutaro Yamaguchi
2024	A*	`conf`	A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2024	J	`jnl`	An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems. CoRR Hitoshi Murakami, Yutaro Yamaguchi
2024	J	`jnl`	Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs. CoRR Ryoma Norose, Yutaro Yamaguchi
2024	J	`jnl`	Fast primal-dual update against local weight update in linear assignment problem and its application. Inf. Process. Lett. Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi
2024	J	`jnl`	Finding Spanning Trees with Perfect Matchings. CoRR Kristóf Bérczi, Tamás Király, Yusuke Kobayashi, Yutaro Yamaguchi, Yu Yokoi
2024	J	`jnl`	Matroid Intersection under Minimum Rank Oracle. CoRR Mihály Bárász, Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2024	J	`jnl`	Rainbow Arborescence Conjecture. CoRR Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2024	J	`jnl`	Shortest odd paths in undirected graphs with conservative weight functions. Discret. Appl. Math. Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
2023	J	`jnl`	A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi
2023	J	`jnl`	Hypergraph characterization of split matroids. J. Comb. Theory A Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
2023	J	`jnl`	Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2023	J	`jnl`	Shortest Odd Paths in Undirected Graphs with Conservative Weight Functions. CoRR Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi
2022	J	`jnl`	An IEICE Trans. Inf. Syst. Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka
2022	J	`jnl`	Approximation by lexicographically maximal solutions in matching and matroid intersection problems. Theor. Comput. Sci. Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2022	J	`jnl`	Finding a Shortest Non-Zero Path in Group-Labeled Graphs. Comb. Yoichi Iwata, Yutaro Yamaguchi
2022	J	`jnl`	Hypergraph characterization of split matroids. CoRR Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi
2022	J	`jnl`	Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. CoRR Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama, Jun Kawahara, Ichigaku Takigawa, Yutaro Yamaguchi
2022	J	`jnl`	Maintaining Optimality in Assignment Problem against Weight Updates around Vertices. CoRR Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi
2022	J	`jnl`	Matroid Intersection under Restricted Oracles. CoRR Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2022	J	`jnl`	Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. Math. Program. Takanori Maehara, So Nakashima, Yutaro Yamaguchi
2021	J	`jnl`	Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi
2021	J	`jnl`	Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. Algorithmica Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
2021	J	`jnl`	List Coloring of Two Matroids through Reduction to Partition Matroids. SIAM J. Discret. Math. Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
2021	J	`jnl`	Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2020	A*	`conf`	A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. SODA Yutaro Yamaguchi
2020	C	`conf`	Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. ISCO Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
2020	J	`jnl`	Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. CoRR Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
2020	J	`jnl`	Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory B Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2020	J	`jnl`	Stochastic packing integer programs with few queries. Math. Program. Takanori Maehara, Yutaro Yamaguchi
2020	J	`jnl`	Subgame Perfect Equilibria of Sequential Matching Games. ACM Trans. Economics and Comput. Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
2019	J	`jnl`	A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. CoRR Yutaro Yamaguchi
2019	J	`jnl`	Antimatroids induced by matchings. Discret. Appl. Math. Yasushi Kawase, Yutaro Yamaguchi
2019	J	`jnl`	List colouring of two matroids through reduction to partition matroids. CoRR Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
2019	J	`jnl`	Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -. CoRR Takanori Maehara, So Nakashima, Yutaro Yamaguchi
2019	J	`jnl`	Stochastic Monotone Submodular Maximization with Queries. CoRR Takanori Maehara, Yutaro Yamaguchi
2018	A*	`conf`	0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. FOCS Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida
2018	A*	`conf`	Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. EC Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
2018	J	`jnl`	Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. CoRR Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi
2018	J	`jnl`	Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. CoRR Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2018	J	`jnl`	Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
2018	A*	`conf`	Stochastic Packing Integer Programs with Few Queries. SODA Yutaro Yamaguchi, Takanori Maehara
2018	J	`jnl`	Tight Approximation for Unconstrained XOS Maximization. CoRR Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2017	J	`jnl`	Antimatroids Induced by Matchings. CoRR Yasushi Kawase, Yutaro Yamaguchi
2017	J	`jnl`	Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. CoRR Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida
2017	J	`jnl`	Stochastic Packing Integer Programs with Few Queries. CoRR Takanori Maehara, Yutaro Yamaguchi
2016	J	`jnl`	Making Bipartite Graphs DM-irreducible. CoRR Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
2016	—	`conf`	Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi
2016	J	`jnl`	Packing A-Paths in Group-Labelled Graphs via Linear Matroid Parity. SIAM J. Discret. Math. Yutaro Yamaguchi
2016	J	`jnl`	Packing non-zero A-paths via matroid matching. Discret. Appl. Math. Shin-ichi Tanigawa, Yutaro Yamaguchi
2016	J	`jnl`	Realizing symmetric set functions as hypergraph cut capacity. Discret. Math. Yutaro Yamaguchi
2016	B	`conf`	Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity. ISAAC Yutaro Yamaguchi
2015	J	`jnl`	Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms. IEEE Trans. Smart Grid Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
2015	—	`conf`	Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. ICALP (1) Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi
2015	J	`jnl`	Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions. CoRR Yoshinobu Kawahara, Yutaro Yamaguchi
2014	—	`conf`	Cyber security analysis of power networks by hypergraph cut algorithms. SmartGridComm Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
2014	A*	`conf`	Packing SODA Yutaro Yamaguchi