| 2020 | SODA | A Blossom Algorithm for Maximum Edge-Disjoint | Satoru Iwata, Yu Yokoi |
| 2017 | ISAAC | Weighted Linear Matroid Parity. | Satoru Iwata |
| 2017 | STOC | A weighted linear matroid parity algorithm. | Satoru Iwata, Yusuke Kobayashi |
| 2016 | SODA | Improved Approximation Algorithms for | Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida |
| 2016 | SODA | Finding a Stable Allocation in Polymatroid Intersection. | Satoru Iwata, Yu Yokoi |
| 2014 | AISTATS | Global Optimization Methods for Extended Fisher Discriminant Analysis. | Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda |
| 2014 | WG | Graph-TSP from Steiner Cycles. | Satoru Iwata, Alantha Newman, R. Ravi |
| 2011 | IPCO | Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. | Satoru Iwata, Mizuyo Takamatsu |
| 2009 | FOCS | Submodular Function Minimization under Covering Constraints. | Satoru Iwata, Kiyohito Nagano |
| 2009 | SODA | Approximating submodular functions everywhere. | Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni |
| 2009 | SODA | A simple combinatorial algorithm for submodular function minimization. | Satoru Iwata, James B. Orlin |
| 2007 | IPCO | Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems. | Toshinari Itoko, Satoru Iwata |
| 2007 | SODA | The independent even factor problem. | Satoru Iwata, Kenjiro Takazawa |
| 2005 | IPCO | Combinatorial Analysis of Generic Matrix Pencils. | Satoru Iwata, Ryo Shimizu |
| 2005 | IPCO | Computing the Inertia from Sign Patterns. | Naonori Kakimura, Satoru Iwata |
| 2004 | IPCO | A Capacity Scaling Algorithm for M-convex Submodular Flow. | Satoru Iwata, Satoko Moriguchi, Kazuo Murota |
| 2003 | ICRA | Development of a remote minimally-invasive surgical system with operational environment transmission capability. | Mamoru Mitsuishi, Jumpei Arata, Katsuya Tanaka, Manabu Miyamoto, Takumi Yoshidome, Satoru Iwata, Shin'ichi Warisawa, Makoto Hashizume |
| 2002 | IPCO | A Faster Scaling Algorithm for Minimizing Submodular Functions. | Satoru Iwata |
| 2002 | SODA | A fully combinatorial algorithm for submodular function minimization. | Satoru Iwata |
| 2001 | IPCO | Bisubmodular Function Minimization. | Satoru Fujishige, Satoru Iwata |
| 2000 | STOC | Improved algorithms for submodular function minimization and submodular flow. | Lisa Fleischer, Satoru Iwata |
| 2000 | STOC | A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. | Satoru Iwata, Lisa Fleischer, Satoru Fujishige |
| 1999 | IPCO | A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. | Satoru Iwata, S. Thomas McCormick, Maiko Shigeno |
| 1999 | SODA | Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. | Satoru Iwata |
| 1998 | SODA | A Faster Algorithm for Minimum Cost Submodular Flows. | Satoru Iwata, S. Thomas McCormick, Maiko Shigeno |
| 1996 | COCOON | Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. | Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida |
| 1996 | SODA | A Capacity Scaling Algorithm for Convex Cost Submodular Flows. | Satoru Iwata |