Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYutaro Yamaguchi 0001
Person information
- affiliation: Kyushu University, Fukuoka, Japan
- affiliation (former): Osaka University, Japan
Other persons with the same name
- Yutaro Yamaguchi 0002 — Mitsubishi Electric Corporation, Japan
- Yutaro Yamaguchi 0003 — University of Tsukuba, Japan
- Yutaro Yamaguchi 0004 — Tokyo Institute of Technology, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j19]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: 106432 (2024)- 2023
- [j18]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: 105697 (2023) - [j17]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. SIAM J. Discret. Math. 37(2): 1311-1330 (2023) - 2022
- [j16]Yoichi Iwata, Yutaro Yamaguchi:
Finding a Shortest Non-Zero Path in Group-Labeled Graphs. Comb. 42(Supplement 2): 1253-1282 (2022) - [j15]Yasuaki Kobayashi, Shin-Ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka:
An O(n2)-Time Algorithm for Computing a Max-Min 3-Dispersion on a Point Set in Convex Position. IEICE Trans. Inf. Syst. 105-D(3): 503-507 (2022) - [j14]Takanori Maehara, So Nakashima, Yutaro Yamaguchi:
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice. Math. Program. 194(1): 85-119 (2022) - [j13]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: 48-53 (2022) - 2021
- [j12]Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. Algorithmica 83(12): 3681-3714 (2021) - [j11]Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. 46(4): 1599-1610 (2021) - [j10]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): 2192-2209 (2021) - 2020
- [j9]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a path with two labels forbidden in group-labeled graphs. J. Comb. Theory, Ser. B 143: 65-122 (2020) - [j8]Takanori Maehara, Yutaro Yamaguchi:
Stochastic packing integer programs with few queries. Math. Program. 182(1): 141-174 (2020) - [j7]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Subgame Perfect Equilibria of Sequential Matching Games. ACM Trans. Economics and Comput. 7(4): 21:1-21:30 (2020) - 2019
- [j6]Yasushi Kawase, Yutaro Yamaguchi:
Antimatroids induced by matchings. Discret. Appl. Math. 257: 342-349 (2019) - 2018
- [j5]Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. 32(1): 560-590 (2018) - 2016
- [j4]Shin-ichi Tanigawa, Yutaro Yamaguchi:
Packing non-zero A-paths via matroid matching. Discret. Appl. Math. 214: 169-178 (2016) - [j3]Yutaro Yamaguchi:
Realizing symmetric set functions as hypergraph cut capacity. Discret. Math. 339(8): 2007-2017 (2016) - [j2]Yutaro Yamaguchi:
Packing A-Paths in Group-Labelled Graphs via Linear Matroid Parity. SIAM J. Discret. Math. 30(1): 474-492 (2016) - 2015
- [j1]Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms. IEEE Trans. Smart Grid 6(5): 2189-2199 (2015)
Conference and Workshop Papers
- 2024
- [c11]Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi:
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA 2024: 4062-4082 - 2020
- [c10]Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. ISCO 2020: 237-248 - [c9]Yutaro Yamaguchi:
A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. SODA 2020: 1923-1932 - 2018
- [c8]Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. FOCS 2018: 462-473 - [c7]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. EC 2018: 131-148 - [c6]Yutaro Yamaguchi, Takanori Maehara:
Stochastic Packing Integer Programs with Few Queries. SODA 2018: 293-310 - 2016
- [c5]Yutaro Yamaguchi:
Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity. ISAAC 2016: 63:1-63:13 - [c4]Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi:
Maximizing Time-Decaying Influence in Social Networks. ECML/PKDD (1) 2016: 132-147 - 2015
- [c3]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. ICALP (1) 2015: 797-809 - 2014
- [c2]Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber security analysis of power networks by hypergraph cut algorithms. SmartGridComm 2014: 824-829 - [c1]Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity. SODA 2014: 562-569
Informal and Other Publications
- 2023
- [i20]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. CoRR abs/2308.12653 (2023) - [i19]Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi:
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR abs/2311.04140 (2023) - 2022
- [i18]Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama, Jun Kawahara, Ichigaku Takigawa, Yutaro Yamaguchi:
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions. CoRR abs/2201.08118 (2022) - [i17]Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph characterization of split matroids. CoRR abs/2202.04371 (2022) - [i16]Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi:
Maintaining Optimality in Assignment Problem against Weight Updates around Vertices. CoRR abs/2208.11325 (2022) - [i15]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles. CoRR abs/2209.14516 (2022) - 2021
- [i14]Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems. CoRR abs/2107.09897 (2021) - 2020
- [i13]Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. CoRR abs/2004.11166 (2020) - 2019
- [i12]Yutaro Yamaguchi:
A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. CoRR abs/1906.04062 (2019) - [i11]Takanori Maehara, Yutaro Yamaguchi:
Stochastic Monotone Submodular Maximization with Queries. CoRR abs/1907.04083 (2019) - [i10]Takanori Maehara, So Nakashima, Yutaro Yamaguchi:
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice - Continuous Greedy Algorithm on Median Complex -. CoRR abs/1907.04279 (2019) - [i9]Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi:
List colouring of two matroids through reduction to partition matroids. CoRR abs/1911.10485 (2019) - 2018
- [i8]Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game. CoRR abs/1804.10353 (2018) - [i7]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. CoRR abs/1807.00109 (2018) - [i6]Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization. CoRR abs/1811.09045 (2018) - 2017
- [i5]Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing. CoRR abs/1704.02700 (2017) - [i4]Yasushi Kawase, Yutaro Yamaguchi:
Antimatroids Induced by Matchings. CoRR abs/1705.05510 (2017) - [i3]Takanori Maehara, Yutaro Yamaguchi:
Stochastic Packing Integer Programs with Few Queries. CoRR abs/1707.04020 (2017) - 2016
- [i2]Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-irreducible. CoRR abs/1612.08828 (2016) - 2015
- [i1]Yoshinobu Kawahara, Yutaro Yamaguchi:
Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions. CoRR abs/1509.03946 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
