| 2026 | AAAI | Finding One Local Optimum Is Easy - but What About Two? | Yasuaki Kobayashi, Kazuhiro Kurita, Yutaro Yamaguchi |
| 2026 | COCOON | Envy-Free School Redistricting Between Two Groups. | Daisuke Shibatani, Yutaro Yamaguchi |
| 2026 | CPM | LZBE: An LZ-Style Compressor Supporting O(log n)-Time Random Access. | Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi, Shunsuke Inenaga |
| 2026 | FUN | Computational Complexity of Swish Is Solved. | Takashi Horiyama, Takehiro Ito, Jun Kawahara, Shin-ichi Minato, Akira Suzuki, Ryuhei Uehara, Yutaro Yamaguchi |
| 2025 | ICALP | Towards the Proximity Conjecture on Group-Labeled Matroids. | Dniel Garamvlgyi, Ryuhei Mizutani, Taihei Oki, Tams Schwarcz, Yutaro Yamaguchi |
| 2024 | SODA | A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. | Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi |
| 2020 | SODA | A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs. | Yutaro Yamaguchi |
| 2019 | ISCAS | Millimeter-Wave GaN Power Amplifier MMICs for 5G Application. | Keigo Nakatani, Yutaro Yamaguchi, Yuji Komatsuzaki, Shintaro Shinjo |
| 2018 | FOCS | 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms. | Yoichi Iwata, Yutaro Yamaguchi, Yuichi Yoshida |
| 2018 | SODA | Stochastic Packing Integer Programs with Few Queries. | Yutaro Yamaguchi, Takanori Maehara |
| 2016 | ISAAC | Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity. | Yutaro Yamaguchi |
| 2015 | ICALP | Finding a Path in Group-Labeled Graphs with Two Labels Forbidden. | Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi |
| 2014 | SODA | Packing | Yutaro Yamaguchi |
| 2013 | IIWAS | Behavior Analysis of Microblog Users Based on Transitions in Posting Activities. | Yutaro Yamaguchi, Shuhei Yamamoto, Tetsuji Satoh |