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 | 647 | 2001 |

Approximating submodular functions everywhere MX Goemans, NJA Harvey, S Iwata, V Mirrokni Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 144 | 2009 |

A simple combinatorial algorithm for submodular function minimization S Iwata, JB Orlin Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 141 | 2009 |

Submodular function minimization S Iwata Mathematical Programming 112 (1), 45, 2008 | 133 | 2008 |

Submodular function minimization under covering constraints S Iwata, K Nagano 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 671-680, 2009 | 128 | 2009 |

A faster scaling algorithm for minimizing submodular functions S Iwata SIAM Journal on Computing 32 (4), 833-840, 2003 | 114 | 2003 |

A faster scaling algorithm for minimizing submodular functions S Iwata SIAM Journal on Computing 32 (4), 833-840, 2003 | 105 | 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 | 101 | 2003 |

Learning submodular functions MF Balcan, NJA Harvey Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 96 | 2011 |

A fully combinatorial algorithm for submodular function minimization S Iwata Journal of Combinatorial Theory, Series B 84 (2), 203-212, 2002 | 74 | 2002 |

A fully combinatorial algorithm for submodular function minimization S Iwata Journal of Combinatorial Theory, Series B 84 (2), 203-212, 2002 | 74 | 2002 |

An algorithmic framework for wireless information flow MX Goemans, S Iwata, R Zenklusen 2009 47th Annual Allerton Conference on Communication, Control, and …, 2009 | 57 | 2009 |

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 | 56 | 2002 |

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 | 49 | 2017 |

Learning valuation functions MF Balcan, F Constantin, S Iwata, L Wang Conference on Learning Theory, 4.1-4.24, 2012 | 48 | 2012 |

A capacity scaling algorithm for convex cost submodular flows S Iwata Mathematical programming 76 (2), 299-308, 1997 | 47 | 1997 |

Minimum average cost clustering K Nagano, Y Kawahara, S Iwata Advances in Neural Information Processing Systems, 1759-1767, 2010 | 44 | 2010 |

Bisubmodular function minimization S Fujishige, S Iwata SIAM Journal on Discrete Mathematics 19 (4), 1065-1073, 2005 | 44 | 2005 |

The linear delta-matroid parity problem JF Geelen, S Iwata, K Murota Journal of Combinatorial Theory, Series B 88 (2), 377-398, 2003 | 42 | 2003 |

Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization S Iwata, M Shigeno SIAM Journal on Optimization 13 (1), 204-211, 2002 | 39 | 2002 |

A faster capacity scaling algorithm for minimum cost submodular flow L Fleischer, S Iwata, ST McCormick Mathematical Programming 92 (1), 119-139, 2002 | 37 | 2002 |

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 | 36 | 2010 |

Improved algorithms for submodular function minimization and submodular flow L Fleischer, S Iwata Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 36 | 2000 |

Matroid matching via mixed skew-symmetric matrices J Geelen, S Iwata Combinatorica 25 (2), 187-215, 2005 | 32 | 2005 |

Finding 2-factors closer to TSP tours in cubic graphs S Boyd, S Iwata, K Takazawa SIAM Journal on Discrete Mathematics 27 (2), 918-939, 2013 | 27 | 2013 |

Chemical Structure Elucidation from ^{13}C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique AlgorithmsS Koichi, M Arisaka, H Koshino, A Aoki, S Iwata, T Uno, H Satoh Journal of chemical information and modeling 54 (4), 1027-1035, 2014 | 25 | 2014 |

Effective consideration of ring structures in CAST/CNMR for highly accurate 13C NMR chemical shift prediction H Satoh, H Koshino, T Uno, S Koichi, S Iwata, T Nakata Tetrahedron 61 (31), 7431-7437, 2005 | 25 | 2005 |

Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow M Shigeno, S Iwata, ST McCormick Mathematics of Operations Research 25 (1), 76-104, 2000 | 25 | 2000 |

Algorithms for submodular flows S Fujishige, S Iwata IEICE TRANSACTIONS on Information and Systems 83 (3), 322-329, 2000 | 24 | 2000 |

Cyber security analysis of power networks by hypergraph cut algorithms Y Yamaguchi, A Ogawa, A Takeda, S Iwata IEEE Transactions on Smart Grid 6 (5), 2189-2199, 2015 | 23 | 2015 |

A strongly polynomial cut canceling algorithm for the submodular flow problem S Iwata, ST McCormick, M Shigeno International Conference on Integer Programming and Combinatorial …, 1999 | 23 | 1999 |

A fast bipartite network flow algorithm for selective assembly S Iwata, T Matsui, ST McCormick Operations research letters 22 (4-5), 137-143, 1998 | 22 | 1998 |

Index reduction for differential–algebraic equations by substitution method M Takamatsu, S Iwata Linear algebra and its applications 429 (8-9), 2268-2277, 2008 | 21 | 2008 |

A weighted linear matroid parity algorithm S Iwata, Y Kobayashi Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 18 | 2017 |

Combinatorial analysis of singular matrix pencils S Iwata, R Shimizu SIAM journal on matrix analysis and applications 29 (1), 245-259, 2007 | 18 | 2007 |

Computing the maximum degree of minors in matrix pencils via combinatorial relaxation S Iwata Algorithmica 36 (4), 331-341, 2003 | 18 | 2003 |

Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation S Iwata, M Takamatsu Mathematical programming 121 (1), 105-121, 2010 | 17 | 2010 |

A capacity scaling algorithm for M-convex submodular flow S Iwata, S Moriguchi, K Murota Mathematical programming 103 (1), 181, 2005 | 17 | 2005 |

A fast cost scaling algorithm for submodular flow S Iwata, ST McCormick, M Shigeno Information Processing Letters 74 (3-4), 123-128, 2000 | 17 | 2000 |

A strongly polynomial-time algorithm for minimizing submodular functions S Iwata, L Fleischer, S Fujishige Université Catholique de Louvain. Center for Operations Research and …, 1999 | 17 | 1999 |

Locating sources to meet flow demands in undirected networks K Arata, S Iwata, K Makino, S Fujishige Scandinavian Workshop on Algorithm Theory, 300-313, 2000 | 16 | 2000 |

A fast parametric submodular intersection algorithm for strong map sequences S Iwata, K Murota, M Shigeno Mathematics of operations research 22 (4), 803-813, 1997 | 15 | 1997 |

Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders H Imai, S Iwata, K Sekine, K Yoshida International Computing and Combinatorics Conference, 68-80, 1996 | 15 | 1996 |

Block-triangularizations of partitioned matrices under similarity/equivalence transformations H Ito, S Iwata, K Murota SIAM Journal on Matrix Analysis and Applications 15 (4), 1226-1255, 1994 | 15 | 1994 |

in pharmaceutical systems... clays as dispersion stabilizers M Barr Journal of the American Pharmaceutical Association (1961) 4 (4), 180-183, 1964 | 15 | 1964 |

Combinatorial relaxation algorithm for mixed polynomial matrices S Iwata, K Murota Mathematical programming 90 (2), 353-371, 2001 | 14 | 2001 |

Primal-dual combinatorial relaxation algorithms for the maximum degree of subdeterminants S Iwata, K Murota, I Sakuta SIAM Journal on Scientific Computing 17 (4), 993-1012, 1996 | 14 | 1996 |

Primal-dual combinatorial relaxation algorithms for the maximum degree of subdeterminants S Iwata, K Murota, I Sakuta SIAM Journal on Scientific Computing 17 (4), 993-1012, 1996 | 14 | 1996 |

Potential Energy Surface-Based Automatic Deduction of Conformational Transition Networks and Its Application on Quantum Mechanical Landscapes of d-Glucose … H Satoh, T Oda, K Nakakoji, T Uno, H Tanaka, S Iwata, K Ohno Journal of chemical theory and computation 12 (11), 5293-5308, 2016 | 13 | 2016 |

Improved Approximation Algorithms for *k*-Submodular Function MaximizationS Iwata, S Tanigawa, Y Yoshida Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 13 | 2016 |

Tractability index of hybrid equations for circuit simulation S Iwata, M Takamatsu, C Tischendorf Mathematics of Computation 81 (278), 923-939, 2012 | 13 | 2012 |

A Faster Algorithm for Minimum Cost Submodular Flows. S Iwata, ST McCormick, M Shigeno SODA, 167-174, 1998 | 13 | 1998 |

The independent even factor problem S Iwata, K Takazawa SIAM Journal on Discrete Mathematics 22 (4), 1411-1427, 2008 | 12 | 2008 |

Algorithm for advanced canonical coding of planar chemical structures that considers stereochemical and symmetric information S Koichi, S Iwata, T Uno, H Koshino, H Satoh Journal of chemical information and modeling 47 (5), 1734-1746, 2007 | 12 | 2007 |

H∞ optimal control for symmetric linear systems S Iwata Japan journal of industrial and applied mathematics 10 (1), 97, 1993 | 12 | 1993 |

Solving generalized CDT problems via two-parameter eigenvalues S Sakaue, Y Nakatsukasa, A Takeda, S Iwata SIAM Journal on Optimization 26 (3), 1669-1694, 2016 | 11 | 2016 |

Bisubmodular function maximization and extensions S Iwata, S Tanigawa, Y Yoshida Technical Report METR 2013-16, The University of Tokyo, 2013 | 11 | 2013 |

A flow model based on polylinking system MX Goemans, S Iwata, R Zenklusen Mathematical programming 135 (1-2), 1-23, 2012 | 11 | 2012 |

A minimax theorem and a Dulmage–Mendelsohn type decomposition for a class of generic partitioned matrices S Iwata, K Murota SIAM journal on matrix analysis and applications 16 (3), 719-734, 1995 | 11 | 1995 |

Solving linear programs from sign patterns S Iwata, N Kakimura Mathematical Programming 114 (2), 393-418, 2008 | 10 | 2008 |

A dual approximation approach to weighted matroid intersection M Shigeno, S Iwata Operations research letters 18 (3), 153-156, 1995 | 10 | 1995 |

A descent method for submodular function minimization S Fujishige, S Iwata Mathematical programming 92 (2), 387-390, 2002 | 9 | 2002 |

Computing the signed distance between overlapping ellipsoids S Iwata, Y Nakatsukasa, A Takeda SIAM Journal on Optimization 25 (4), 2359-2384, 2015 | 8 | 2015 |

Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation S Iwata, M Takamatsu Algorithmica 66 (2), 346-368, 2013 | 8 | 2013 |

Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation S Iwata, M Takamatsu Algorithmica 66 (2), 346-368, 2013 | 8 | 2013 |

Minimizing a submodular function arising from a concave function S Fujishige, S Iwata Discrete applied mathematics 92 (2-3), 211-215, 1999 | 8 | 1999 |

On the Kronecker canonical form of mixed matrix pencils S Iwata, M Takamatsu SIAM journal on matrix analysis and applications 32 (1), 44-71, 2011 | 7 | 2011 |

Computational geometric approach to submodular function minimization for multiclass queueing systems T Itoko, S Iwata International Conference on Integer Programming and Combinatorial …, 2007 | 7 | 2007 |

Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization M Jünger, V Kaibel Springer-Verlag, 2005 | 7* | 2005 |

A network flow approach to cost allocation for rooted trees S Iwata, N Zuiki Networks: An International Journal 44 (4), 297-301, 2004 | 7 | 2004 |

Fast cycle canceling algorithms for minimum cost submodular flow S Iwata, ST McCormick, M Shigeno Combinatorica 23 (3), 503-525, 2003 | 7 | 2003 |

Horizontal principal structure of layered mixed matrices: Decomposition of discrete systems by design-variable selections S Iwata, K Murota SIAM Journal on Discrete Mathematics 9 (1), 71-86, 1996 | 7 | 1996 |

Extended formulations for sparsity matroids S Iwata, N Kamiyama, N Katoh, S Kijima, Y Okamoto Mathematical Programming 158 (1-2), 565-574, 2016 | 6 | 2016 |

A polynomial-time algorithm for nonconvex quadratic optimization with two quadratic constraints S Sakaue, Y Nakatsukasa, A Takeda, S Iwata Preprint, Department of Mathematical Informatics, The University of Tokyo …, 2015 | 6 | 2015 |

Exact SVM training by Wolfe's minimum norm point algorithm M Kitamura, A Takeda, S Iwata 2014 IEEE International Workshop on Machine Learning for Signal Processing …, 2014 | 6 | 2014 |

Approximating minimum linear ordering problems S Iwata, P Tetali, P Tripathi Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012 | 6 | 2012 |

Bisubmodular function minimization S Fujishige, S Iwata International Conference on Integer Programming and Combinatorial …, 2001 | 6 | 2001 |

A theorem on the principal structure for independent matchings S Iwata, K Murota Discrete applied mathematics 61 (3), 229-244, 1995 | 6 | 1995 |

Weighted linear matroid parity S Iwata 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017 | 5 | 2017 |

On the Kronecker canonical form of singular mixed matrix pencils S Iwata, M Takamatsu SIAM Journal on Control and Optimization 55 (3), 2134-2150, 2017 | 5 | 2017 |

" Maizo"-chemistry Project: toward Molecular-and Reaction Discovery from Quantum Mechanical Global Reaction Route Mappings H SATOH, T ODA, K NAKAKOJI, T UNO, S IWATA, K OHNO Journal of Computer Chemistry, Japan 14 (3), 77-79, 2015 | 5 | 2015 |

Computing the degrees of all cofactors in mixed polynomial matrices S Iwata, M Takamatsu SIAM Journal on Discrete Mathematics 23 (2), 647-660, 2009 | 5 | 2009 |

Recent results on well-balanced orientations A Bernáth, S Iwata, T Király, Z Király, Z Szigeti Discrete Optimization 5 (4), 663-676, 2008 | 5 | 2008 |

Finding coherent cyclic orders in strong digraphs S Iwata, T Matsuda Combinatorica 28 (1), 83, 2008 | 5 | 2008 |

On well-balanced orientations, counter-examples for related problems S Iwata, T Király, Z Király, Z Szigeti Tech. Report TR-2004-16, Egerváry Research Group, Budapest, 2004, www. cs …, 2004 | 5 | 2004 |

Computing the maximum degree of minors in matrix pencils via combinatorial relaxation S Iwata Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms …, 1999 | 5 | 1999 |

Block triangularization of skew-symmetric matrices S Iwata Linear algebra and its applications 273 (1-3), 215-226, 1998 | 5 | 1998 |

Principal structure of submodular systems and Hitchcock-type independent flows S Iwata Combinatorica 15 (4), 515-532, 1995 | 5 | 1995 |

Finding a stable allocation in polymatroid intersection S Iwata, Y Yokoi Mathematics of Operations Research, 2020 | 4 | 2020 |

Global optimization methods for extended Fisher discriminant analysis S Iwata, Y Nakatsukasa, A Takeda Artificial Intelligence and Statistics, 411-419, 2014 | 4 | 2014 |

Hybrid analysis of nonlinear time-varying circuits providing DAEs with index at most one S Iwata, M Takamatsu, C Tischendorf Scientific Computing in Electrical Engineering SCEE 2008, 151-158, 2010 | 4 | 2010 |

Combinatorial analysis of generic matrix pencils S Iwata, R Shimizu International Conference on Integer Programming and Combinatorial …, 2005 | 4 | 2005 |

A strongly polynomial cut canceling algorithm for minimum cost submodular flow S Iwata, ST McCormick, M Shigeno SIAM Journal on Discrete Mathematics 19 (2), 304-320, 2005 | 4 | 2005 |

A constrained independent set problem for matroids T Fleiner, A Frank, S Iwata Operations Research Letters 32 (1), 23-26, 2004 | 4 | 2004 |

On matroid intersection adjacency S Iwata Discrete Mathematics 242 (1-3), 277-281, 2002 | 4 | 2002 |

Graph-TSP from Steiner cycles S Iwata, A Newman, R Ravi International Workshop on Graph-Theoretic Concepts in Computer Science, 312-323, 2014 | 3 | 2014 |

Computing the inertia from sign patterns N Kakimura, S Iwata Mathematical programming 110 (1), 229-244, 2007 | 3 | 2007 |

LINKING SYSTEMS AND MATROID PENCILS (< Special Issue> the 50th Anniversary of the Operations Research Society of Japan) S Iwata Journal of the Operations Research Society of Japan 50 (4), 315-324, 2007 | 3 | 2007 |

Conjugate scaling technique for Fenchel-type duality in discrete convex optimization S Iwata Discrete Mathematics and Systems Science Research Report, 99-02, 1999 | 3 | 1999 |

Index reduction for differential-algebraic equations with mixed matrices S Iwata, T Oki, M Takamatsu Journal of the ACM (JACM) 66 (5), 1-34, 2019 | 2 | 2019 |