Yutaro YAMAGUCHI
(Last Update: January 17, 2023)
Associate Professor
Department of Information and Physical Sciences,
Graduate School of Information Science and Technology,
Osaka University
Information Science and Technology Building C, Room C506,
1-5 Yamadaoka, Suita, Osaka 565-0871, Japan
Email: yutaro.yamaguchi [at] ist.osaka-u.ac.jp
(old: ymgc [at] kurims.kyoto-u.ac.jp, yutaro_yamaguchi [at] mist.i.u-tokyo.ac.jp, yutaro_yamaguchi [at] ist.osaka-u.ac.jp, yutaro_yamaguchi [at] inf.kyushu-u.ac.jp)
>> Japanese Version
C.V.
Education
Mar. 2008: Graduation from Tennoji High School attached to Osaka Kyoiku University, Japan.
Mar. 2011: Withdrawal from Undergraduate School of Informatics and Mathematical Science,
Faculty of Engineering, Kyoto University, Japan. (Due to proceeding to master's course.)
Mar. 2013: Master of Science from Department of Mathematical Sciences,
Graduate School of Science, Kyoto University, Japan.
Mar. 2016: Doctor of Philosophy in the field of Mathematical Informatics from Department of Mathematical Informatics,
Graduate School of Information Science and Technology, University of Tokyo, Japan.
Work
Feb. 2013 – Mar. 2013: Project Assistant of JST ERATO Kawarabayashi Large Graph Project (Link)
"The Network Graph Theories and Optimization" Group.
Apr. 2013 – Mar. 2016: Research Fellow of the Japan Society for the Promotion of Science (DC1).
Apr. 2016 – Feb. 2020: Assistant Professor at Osaka University.
Aug. 2017 – Feb. 2020: Visiting Researcher at Discrete Optimization Unit, RIKEN Center for Advanced Intelligence Project.
Mar. 2020 – Aug. 2021: Associate Professor at Kyushu University.
Jun. 2020 – Oct. 2020: Visiting Researcher at Discrete Optimization Unit, RIKEN Center for Advanced Intelligence Project.
Sep. 2021 – Today: Associate Professor at Osaka University.
Joint Research
Apr. 2013 – Mar. 2018: Research Collaborator of JST ERATO Kawarabayashi Large Graph Project (Link)
"The Network Graph Theories and Optimization" Group.
Aug. 2013 – Sep. 2013: Visit to NEC Laboratories at Kawasaki, Kanagawa, Japan.
Feb. 2014 – Mar. 2014: Visit to NEC Laboratories America at Cupertino, California, U.S.
Oct. 2014 – Mar. 2020: Research Collaborator of "Developing Optimal Modeling Methods for Large-Scale Complex Systems" Team (Link)
in JST CREST "Modeling Methods allied with Modern Mathematics" Area.
Sep. 2019 – Nov. 2019: Visit to Egerváry Research Group on Combinatorial Optimization (EGRES) in Eötvös Loránd University, Hungary.
Classes
Oct. 2013 – Mar. 2014: Teaching Assistant of the class "Algorithm Design" at Department of Mathematical Informatics,
Graduate School of Information Science and Technology, University of Tokyo.
Oct. 2014 – Mar. 2015: Teaching Assistant of the class "Algorithm Design" at Department of Mathematical Informatics,
Graduate School of Information Science and Technology, University of Tokyo.
Apr. 2015 – Aug. 2015: Teaching Assistant of "First-Year Seminar for Natural Sciences Students" (Theme: Introduction to Operations Research)
at College of Arts and Sciences, University of Tokyo.
1st Semester in 2017: "Information Literacy A" at Division of Applied Science, School of Engineering, Osaka University.
2nd Semester in 2017: "Exercises in Information Physics and Sciences I" at Department of Applied Physics, School of Engineering, Osaka University.
1st Semester in 2018: "Information Literacy A" at Division of Applied Science, School of Engineering, Osaka University.
2nd Semester in 2018: "Exercises in Information Physics and Sciences I" at Department of Applied Physics, School of Engineering, Osaka University.
2nd Semester in 2019: "Exercises in Information Physics and Sciences I" at Department of Applied Physics, School of Engineering, Osaka University.
1st Semester in 2020: "Introduction to Computational Complexity"
at Section of Informatics in Department of Physics, School of Science, Kyushu University.
2nd Semester in 2020: "Study on Information Science"
at Section of Informatics in Department of Physics, School of Science, Kyushu University.
1st Semester in 2021: "Introduction to Computational Complexity"
at Section of Informatics in Department of Physics, School of Science, Kyushu University.
2nd Semester in 2021: "Mathematical Programming" at Department of Applied Physics, School of Engineering, Osaka University.
2nd Semester in 2021: "Mathematical Analysis II" at School of Engineering, Osaka University.
1st Semester in 2022: "Mathematical Programming" at Department of Information and Physical Sciences, Graduate School of Information Science and Technology, Osaka University.
1st Semester in 2022: "Advanced Operations Research" at Department of Information and Physical Sciences, Graduate School of Information Science and Technology, Osaka University.
2nd Semester in 2022: "Mathematical Programming" at Department of Applied Physics, School of Engineering, Osaka University.
2nd Semester in 2022: "Mathematical Analysis II" at School of Engineering, Osaka University.
Grants
Apr. 2013 – Mar. 2016: Grant-in-Aid for JSPS Research Fellow (No. 13J02522).
Aug. 2016 – Mar. 2018: JSPS KAKENHI, Grant-in-Aid for Research Activity Start-up (No. 16H06931).
Dec. 2016 – Mar. 2018: JST ACT-I "Information and Future" (No. JPMJPR16UR).
Apr. 2020 – Mar. 2024: JSPS KAKENHI, Grant-in-Aid for Early-Career Scientists (No. 20K19743).
Apr. 2020 – Mar. 2025: JSPS KAKENHI, Grant-in-Aid for Scientific Research (A) (No. 20H00605). [Co-Investigator]
Societies
Apr. 2013 – Mar. 2016: A student member of the Operations Research Society of Japan (No. 05000219).
During 2015: A student member of the Institute of Electrical and Electronics Engineers (IEEE) (No. 93303728).
Apr. 2016 – Today: A member of the Operations Research Society of Japan (No. 05000219).
Apr. 2018 – Today: A member of the Japan Society for Industrial and Applied Mathematics (No. 164-596-5504).
Research Interests
Combinatorial Optimization, Graph Theory, Matroid Theory, Discrete Algorithms, Game Theory, Quantum Computing, etc.
Pubilications
Refereed Journal Articles
-
Yoichi Iwata, Yutaro Yamaguchi:
Finding a Shortest Non-zero Path in Group-Labeled Graphs.
Combinatorica, in press (available online). (DOI: 10.1007/s00493-021-4736-x).
-
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph Characterization of Split Matroids.
Journal of Combinatorial Theory, Series A, 194 (2023), No. 105697. (DOI: 10.1016/j.jcta.2022.105697).
-
Takanori Maehara, So Nakashima, Yutaro Yamaguchi:
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice — Continuous Greedy Algorithm on Median Complex —.
Mathematical Programming (Series A), 194 (2022), pp. 85–119. (DOI: 10.1007/s10107-021-01620-7).
-
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems.
Theoretical Computer Science, 910 (2022), pp. 48–53. (DOI: 10.1016/j.tcs.2022.01.035)
-
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 Convex Polygon.
IEICE Transactions on Information and Systems, E105-D:3 (2022), pp. 503–507. (DOI: 10.1587/transinf.2021FCP0013)
-
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem.
Algorithmica, 83 (2021), pp. 3681–3714. (DOI: 10.1007/s00453-021-00868-x)
-
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi:
List Coloring of Two Matroids through Reduction to Partition Matroids.
SIAM Journal on Discrete Mathematics, 35:3 (2021), pp. 2192–2209. (DOI: 10.1137/20M1385615).
-
Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization.
Mathematics of Operations Research, 46:4 (2021), pp. 1599–1610. (DOI: 10.1287/moor.2020.1088)
-
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path with Two Labels Forbidden in Group-Labeled Graphs.
Journal of Combintorial Theory, Series B, 143 (2020), pp. 65–122. (DOI: 10.1016/j.jctb.2019.12.001).
-
Takanori Maehara, Yutaro Yamaguchi:
Stochastic Packing Integer Programs with Few Queries.
Mathematical Programming (Series A), 182 (2020), pp. 141–174. (DOI: 10.1007/s10107-019-01388-x).
-
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Subgame Perfect Equilibria of Sequential Matching Games.
ACM Transactions on Economics and Computation, 7:4 (2020), No. 21, 30pp. (DOI: 10.1145/3373717)
-
Yasushi Kawase, Yutaro Yamaguchi:
Antimatroids Induced by Matchings.
Discrete Applied Mathematics, 257 (2019), pp. 342–349. (DOI: 10.1016/j.dam.2018.09.032)
-
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-irreducible.
SIAM Journal on Discrete Mathematics, 32:1 (2018), pp. 560–590. (DOI: 10.1137/16M1106717)
-
Shin-ichi Tanigawa, Yutaro Yamaguchi:
Packing Non-zero A-paths via Matroid Matching.
Discrete Applied Mathematics, 214 (2016), pp. 169–178. (DOI: 10.1016/j.dam.2016.06.001)
-
Yutaro Yamaguchi:
Realizing Symmetric Set Functions as Hypergraph Cut Capacity.
Discrete Mathematics, 339:8 (2016), pp. 2007–2017. (DOI: 10.1016/j.disc.2016.02.010)
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity.
SIAM Journal on Discrete Mathematics, 30:1 (2016), pp. 474–492. (DOI: 10.1137/130949877)
-
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.
IEEE Transactions on Smart Grid, 6:5 (2015), pp. 2189–2199. (DOI: 10.1109/TSG.2015.2394791)
Refereed Conference Proceedings
-
Yasuaki Kobayashi, Shin-ichi Nakano, Kei Uchizawa, Takeaki Uno, Yutaro Yamaguchi, Katsuhisa Yamanaka:
Max-Min 3-dispersion on a Convex Polygon.
Proceedings of the 37th European Workshop on Computational Geometry (EuroCG 2021), No. 9, 7pp.
-
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem.
Proceedings of the 6th International Symposium on Combinatorial Optimization (ISCO 2020), pp. 237–248. (DOI: 10.1007/978-3-030-53262-8_20)
-
Yutaro Yamaguchi: A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.
Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pp. 1923–1932. (DOI: 10.1137/1.9781611975994.118)
-
Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms.
Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018), pp. 462–473. (DOI: 10.1109/FOCS.2018.00051)
-
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game.
Proceedings of the 19th ACM Conference on Economics and Computation (EC 2018), pp. 131–148. (DOI: 10.1145/3219166.3219200)
-
Takanori Maehara, Yutaro Yamaguchi:
Stochastic Packing Integer Programs with Few Queries.
Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018), pp. 293–310. (DOI: 10.1137/1.9781611975031.21)
-
Yutaro Yamaguchi:
Shortest Disjoint S-paths via Weighted Linear Matroid Parity.
Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC 2016), No. 63, 13pp. (DOI: 10.4230/LIPIcs.ISAAC.2016.63)
-
Naoto Ohsaka, Yutaro Yamaguchi, Naonori Kakimura, Ken-ichi Kawarabayashi:
Maximizing Time-decaying Influence in Social Networks.
Proceedings of European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2016), pp. 132–147. (DOI: 10.1007/978-3-319-46128-1_9)
-
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden.
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), pp. 797–809. (DOI: 10.1007/978-3-662-47672-7_65)
-
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.
Proceedings of the 5th IEEE International Conference on Smart Grid Communications (SmartGridComm 2014), pp. 830–835. (DOI: 10.1109/SmartGridComm.2014.7007750)
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity.
Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 562–569. (DOI: 10.1137/1.9781611973402.42)
Preprints
-
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Matroid Intersection under Restricted Oracles.
arXiv preprints, arXiv:2209.14516 (Link), 2022.
-
Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi:
Maintaining Optimality in Assignment Problem against Weight Updates around Vertices.
arXiv preprints, arXiv:2208.11325 (Link), 2022.
-
Kristóf Bérczi, Tamás Király, Tamás Schwarcz, Yutaro Yamaguchi, Yu Yokoi:
Hypergraph Characterization of Split Matroids.
arXiv preprints, arXiv:2202.04371 (Link), 2022.
* This also appeared as an EGRES Technical Report, TR-2022-07 (Link).
-
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.
arXiv preprints, arXiv:2201.08118 (Link), 2022.
-
Kristóf Bérczi, Tamás Király, Yutaro Yamaguchi, Yu Yokoi:
Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems.
arXiv preprints, arXiv:2107.09897 (Link), 2021.
* This also appeared as an EGRES Technical Report, TR-2021-08 (Link).
-
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem.
arXiv preprints, arXiv:2004.11166 (Link), 2020.
-
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi:
List Coloring of Two Matroids through Reduction to Partition Matroids.
arXiv preprints, arXiv:1911.10485 (Link), 2019.
* This also appeared as an EGRES Technical Report, TR-2020-10 (Link).
-
Takanori Maehara, So Nakashima, Yutaro Yamaguchi:
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice — Continuous Greedy Algorithm on Median Complex —.
arXiv preprints, arXiv:1907.04279 (Link), 2019.
-
Takanori Maehara, Yutaro Yamaguchi:
Stochastic Monotone Submodular Maximization with Queries.
arXiv preprints, arXiv:1907.04083 (Link), 2019.
-
Yoichi Iwata, Yutaro Yamaguchi:
Finding a Shortest Non-zero Path in Group-Labeled Graphs.
arXiv preprints, arXiv:1906.04062 (Link), 2019.
* A preliminary version was entitled A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.
-
Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization.
arXiv preprints, arXiv:1811.09045 (Link), 2018.
-
Yasushi Kawase, Yutaro Yamaguchi, Yu Yokoi:
Subgame Perfect Equilibria of Sequential Matching Games.
arXiv preprints, arXiv:1804.10353 (Link), 2018.
* A preliminary version was entitled Computing a Subgame Perfect Equilibrium of a Sequential Matching Game.
-
Takanori Maehara, Yutaro Yamaguchi:
Stochastic Packing Integer Programs with Few Queries.
arXiv preprints, arXiv:1707.04020 (Link), 2017.
-
Yasushi Kawase, Yutaro Yamaguchi:
Antimatroids Induced by Matchings.
arXiv preprints, arXiv:1705.05510 (Link), 2017.
-
Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida:
0/1/all CSPs, Half-Integral A-path Packing, and Linear-Time FPT Algorithms.
arXiv preprints, arXiv:1704.02700 (Link), 2017.
* A preliminary version was entitled Linear-Time FPT Algorithms via Half-Integral Non-returning A-path Packing.
-
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-irreducible.
arXiv preprints, arXiv:1612.08828 (Link), 2016.
* A preliminary version had appeared as a Mathematical Engineering Technical Report, METR 2016-14 (Link).
-
Yoshinobu Kawahara, Yutaro Yamaguchi:
Parametric Maxflows for Structured Sparse Learning with Convex Relaxations of Submodular Functions.
arXiv preprints, arXiv:1509.03946 (Link), 2015.
-
Yutaro Yamaguchi:
Shortest Disjoint Non-zero A-paths via Weighted Matroid Matching.
Mathematical Engineering Technical Reports, METR 2015-20 (Link), Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Japan, 2015.
-
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path with Two Labels Forbidden in Group-Labeled Graphs.
arXiv preprints, arXiv:1807.00109 (Link), 2018.
* A preliminary version, entitled Finding a Path in Group-Labeled Graphs with Two Labels Forbidden, had appeared in 2014 as a Mathematical Engineering Technical Report, METR 2014-41 (Link).
-
Yutaro Yamaguchi:
Realizing Symmetric Set Functions as Hypergraph Cut Capacity.
Mathematical Engineering Technical Reports, METR 2014-28 (Link), Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Japan, 2014.
-
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.
Mathematical Engineering Technical Reports, METR 2014-12 (Link), Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Japan, 2014.
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity.
Mathematical Engineering Technical Reports, METR 2013-35 (Link), Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Japan, 2013.
-
Shin-ichi Tanigawa, Yutaro Yamaguchi:
Packing Non-zero A-paths via Matroid Matching.
Mathematical Engineering Technical Reports, METR 2013-08 (Link), Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, Japan, 2013.
Theses
[Ph.D. Thesis] Combinatorial Optimization on Group-Labeled Graphs. (Supervised by Prof. Satoru Iwata)
Department of Mathematical Informatics, Graduate School of Information Science and Technology, University of Tokyo, Japan, March 2016.
[Master's Thesis] Structures and Algorithms for Path-Packing Problems. (Supervised by Prof. Satoru Iwata)
Department of Mathematical Sciences, Graduate School of Science, Kyoto University, Japan, January 2013.
Others
-
Ryoma Sin'ya, Yutaro Yamaguchi, Masaki Nakamura:
On Regular Languages Approximable by Testing Appearance of Subwords.
Proceedings of the 24th Workshop on Programming and Programming Languages (PPL 2022), 2022.
* This article is written in Japanese, and the English title is informal.
-
Takanori Maehara, Yutaro Yamaguchi:
A Unified Framework for Combinatorial Optimization with Queries.
Bulletin of the Japan Society for Industrial and Applied Mathematics, 29:2, pp. 2–9, 2019.
* This article is written in Japanese except for the abstract, and the English title is informal.
-
Yutaro Yamaguchi:
An Efficient Dijkstra-Like Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.
Proceedings of the 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 479–485, 2019.
-
Takanori Maehara, Yutaro Yamaguchi:
Stochastic Monotone Submodular Maximization with Queries.
Proceedings of the 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 46–56, 2019.
-
Yusuke Kobayashi, Yutaro Yamaguchi:
On Applications of Weighted Linear Matroid Parity.
Proceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp. 363–372, 2017.
-
Ryohei Fujimaki, Yutaro Yamaguchi, Riki Eto:
Piecewise Sparse Linear Classification via Factorized Asymptotic Bayesian Inference.
Transactions of the Japanese Society for Artificial Intelligence, 31:6 (2016), No. AI30-I_1-9 (Link).
* This article is written in Japanese except for the title and abstract.
-
Yutaro Yamaguchi:
Realizing Symmetric Set Functions as Hypergraph Cut Capacity.
Proceedings of the 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 137–146, 2015.
-
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Zero Path in Z3-Labeled Graphs.
RIMS Kokyuroku "Optimization Algorithms: Theory, Application and Implementation," No. 1931, pp. 148–160 (Link), Research Institute for Mathematical Sciences (RIMS), Kyoto University, Japan, 2015.
* This is a resume of the technical report METR 2014-41.
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity.
RIMS Kokyuroku "Optimization: Theory and Application," No. 1879, pp. 157–163 (Link), Research Institute for Mathematical Sciences (RIMS), Kyoto University, Japan, 2014.
* This is a resume of the same-title paper in SODA 2014.
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Matroid Matching.
Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, pp. 495–503, 2013.
International Talks
-
Yutaro Yamaguchi:
A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.
The 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, Utah, U.S., January 2020. (Slide)
-
Yutaro Yamaguchi:
An Efficient Dijkstra-Like Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs.
The 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Tokyo, Japan, May 2019. (Slide)
-
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
Making Bipartite Graphs DM-irreducible.
The 23rd International Symposium on Mathematical Programming (ISMP 2018), Bordeaux, France, July 2018. (Slide)
-
Yusuke Kobayashi, Yutaro Yamaguchi:
On Applications of Weighted Linear Matroid Parity.
The 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Budapest, Hungary, May 2017. (Slide)
-
Yutaro Yamaguchi:
Shortest Disjoint S-paths via Weighted Linear Matroid Parity.
The 27th International Symposium on Algorithms and Computation (ISAAC 2016), Sydney, Australia, December 2016. (Slide)
-
Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
How to Make a Bipartite Graph DM-irreducible by Adding Edges.
The Japanese Conference on Combinatorics and its Applications (JCCA 2016), Kyoto, Japan, May 2016. (Slide)
-
Satoru Iwata, Jun Kato, Yutaro Yamaguchi:
How to Make a Bipartite Graph DM-irreducible by Adding Edges.
NII Shonan Meeting Seminar 071 "Current Trend in Combinatorial Optimization," Kanagawa, Japan, April 2016. (Slide)
-
Yutaro Yamaguchi:
Packing Non-zero A-paths via Linear Matroid Parity.
The 6th Cargèse Workshop on Combinatorial Optimization, Cargèse, Corsica, France, September 2015. (Slide)
-
Shin-ichi Tanigawa, Yutaro Yamaguchi:
Packing Non-zero A-paths via Matroid Matching.
The 22nd International Symposium on Mathematical Programming (ISMP 2015), Pittsburgh, Pennsylvania, U.S., July 2015. (Slide)
-
Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden.
The 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Kyoto, Japan, July 2015. (Slide)
-
Yutaro Yamaguchi:
Realizing Symmetric Set Functions as Hypergraph Cut Capacity.
The 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Fukuoka, Japan, June 2015. (Slide)
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labeled Graphs via Linear Matroid Parity.
IMA Annual Program Year Workshop "Convexity and Optimization: Theory and Applications," Minneapolis, Minnesota, U.S., February 2015. (Poster, Summary)
-
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata:
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.
The 5th IEEE International Conference on Smart Grid Communications (SmartGridComm 2014), Venice, Italy, November 2014. (Slide)
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Linear Matroid Parity.
The 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), Portland, Oregon, U.S., January 2014. (Slide)
-
Yutaro Yamaguchi:
Packing A-paths in Group-Labelled Graphs via Matroid Matching.
The 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Veszprém, Hungary, June 2013.
Visited Cities
-
Gárdony (+ Mislolc) in Hungary: July 2022.
The 12th Emléktábla Workshop.
-
Salt Lake City in Utah, U.S.: January 2020.
Talk in the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020).
-
Eger, Tokaj, Visegrad, and Szeged in Hungary, Wien (Vienna) in Austria, Praha (Prague) in Czech Republic, Dubrovnik in Croatia, and Bratislava in Slovakia: October – November 2019.
Private Visits (Weekend Trips).
-
Bordeaux in France: July 2018.
Talk in the 23rd International Symposium on Mathematical Programming (ISMP 2018).
-
Ithaca in New York, U.S.: June 2018.
The 19th ACM Conference on Economics and Computation (EC 2018).
-
New Orleans in Louisiana, U.S.: January 2018.
The 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018).
-
Barcelona in Spain: January 2017.
The 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017).
-
Sydney in Australia: December 2016.
Talk in the 27th International Symposium on Algorithms and Computation (ISAAC 2016).
-
Arlington in Virginia, U.S.: January 2016.
The 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016).
-
Bonn (+ Frankfurt, Stuttgart, München (Munich), Köln, and Mainz) in Germany: October 2015.
HIM Trimester Program "Combinatorial Optimization," Rigidity Workshop.
-
Cargèse in Corsica (+ Paris) in France: September 2015.
Talk in the 6th Cargèse Workshop on Combinatorial Optimization.
-
Seattle in Washington, U.S.: August 2015.
Private Visit.
-
Pittsburgh in Pennsylvania, U.S.: July 2015.
Talk in the 22nd International Symposium on Mathematical Programming (ISMP 2015).
-
Minneapolis in Minnesota, U.S.: February 2015.
IMA Annual Program Year Workshop "Convexity and Optimization: Theory and Applications."
-
Venezia (Venice) in Italy: November 2014.
Talk in the 5th IEEE International Conference on Smart Grid Communications (SmartGridComm 2014).
-
Budapest in Hungary:
- Summer School in Mathematics at Institute of Mathematics in Eötvös Loránd University; June 2014.
- Talk in the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications; May 2017.
- Research Visit to Egerváry Research Group on Combinatorial Optimization (EGRES); September – November 2019, June 2022.
-
Silicon Valley (San Jose, Mountain View, and Cupertino) and San Francisco (+ Yosemite Park) in California, U.S.: February – March 2014.
Joint Research to NEC Laboratories America at Cupertino.
-
Portland in Oregon, U.S.: January 2014.
Talk in the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014).
-
Veszprém in Hungary: June 2013.
Talk in the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications.
-
Zurich and Engelberg in Switzerland: March 2012.
The 1st ETH-Japan Symposium for the Promotion of Academic Exchanges and the 1st ETH-Japan Workshop on Science and Computing.
-
Toronto and Waterloo in Canada: September 2011.
Invited to a special program on Quantum Computing at Institute for Quantum Computing (IQC) in University of Waterloo.