| A combinatorial strongly polynomial algorithm for minimizing submodular functions S Iwata, L Fleischer, S Fujishige Journal of the ACM (JACM) 48 (4), 761-777, 2001 | 769 | 2001 |
| Approximating submodular functions everywhere MX Goemans, NJA Harvey, S Iwata, V Mirrokni Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 191 | 2009 |
| A simple combinatorial algorithm for submodular function minimization S Iwata, JB Orlin Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 182 | 2009 |
| Submodular function minimization S Iwata Mathematical Programming 112, 45-64, 2008 | 171 | 2008 |
| Submodular function minimization under covering constraints S Iwata, K Nagano 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 671-680, 2009 | 150 | 2009 |
| A faster scaling algorithm for minimizing submodular functions S Iwata SIAM Journal on Computing 32 (4), 833-840, 2003 | 142 | 2003 |
| Learning submodular functions MF Balcan, NJA Harvey Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 141 | 2011 |
| A faster scaling algorithm for minimizing submodular functions S Iwata SIAM Journal on Computing 32 (4), 833-840, 2003 | 131 | 2003 |
| A push-relabel framework for submodular function minimization and applications to parametric optimization L Fleischer, S Iwata Discrete Applied Mathematics 131 (2), 311-322, 2003 | 129 | 2003 |
| Solving the trust-region subproblem by a generalized eigenvalue problem S Adachi, S Iwata, Y Nakatsukasa, A Takeda SIAM Journal on Optimization 27 (1), 269-291, 2017 | 87 | 2017 |
| A fully combinatorial algorithm for submodular function minimization S Iwata J. Comb. Theory, Ser. B 84 (2), 203-212, 2002 | 79 | 2002 |
| A fully combinatorial algorithm for submodular function minimization S Iwata J. Comb. Theory, Ser. B 84 (2), 203-212, 2002 | 79 | 2002 |
| Learning valuation functions MF Balcan, F Constantin, S Iwata, L Wang Conference on Learning Theory, 4.1-4.24, 2012 | 68 | 2012 |
| Locating sources to meet flow demands in undirected networks K Arata, S Iwata, K Makino, S Fujishige Journal of Algorithms 42 (1), 54-68, 2002 | 64 | 2002 |
| Bisubmodular function minimization S Fujishige, S Iwata SIAM Journal on Discrete Mathematics 19 (4), 1065-1073, 2005 | 59 | 2005 |
| An algorithmic framework for wireless information flow MX Goemans, S Iwata, R Zenklusen 2009 47th Annual Allerton Conference on Communication, Control, and …, 2009 | 56 | 2009 |
| Improved Approximation Algorithms for k-Submodular Function Maximization S Iwata, S Tanigawa, Y Yoshida Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 52 | 2016 |
| Minimum average cost clustering K Nagano, Y Kawahara, S Iwata Advances in Neural Information Processing Systems 23, 2010 | 51 | 2010 |
| A capacity scaling algorithm for convex cost submodular flows S Iwata Mathematical programming 76, 299-308, 1997 | 48 | 1997 |
| Index characterization of differential–algebraic equations in hybrid analysis for circuit simulation M Takamatsu, S Iwata International Journal of Circuit Theory and Applications 38 (4), 419-440, 2010 | 44 | 2010 |
S. Thomas McCormickProfessor of Management, Sauder School of BusinessVerified email at sauder.ubc.ca
