Satoru Iwata
Title
Cited by
Cited by
Year
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
7132001
Approximating submodular functions everywhere
MX Goemans, NJA Harvey, S Iwata, V Mirrokni
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1732009
A simple combinatorial algorithm for submodular function minimization
S Iwata, JB Orlin
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
1592009
Submodular function minimization
S Iwata
Mathematical Programming 112 (1), 45-64, 2008
1502008
Submodular function minimization under covering constraints
S Iwata, K Nagano
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 671-680, 2009
1462009
A faster scaling algorithm for minimizing submodular functions
S Iwata
SIAM Journal on Computing 32 (4), 833-840, 2003
1292003
Learning submodular functions
MF Balcan, NJA Harvey
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
1282011
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
1182003
A faster scaling algorithm for minimizing submodular functions
S Iwata
SIAM Journal on Computing 32 (4), 833-840, 2003
1182003
A fully combinatorial algorithm for submodular function minimization
S Iwata
Journal of Combinatorial Theory, Series B 84 (2), 203-212, 2002
792002
A fully combinatorial algorithm for submodular function minimization
S Iwata
Journal of Combinatorial Theory, Series B 84 (2), 203-212, 2002
792002
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
672017
Learning valuation functions
MF Balcan, F Constantin, S Iwata, L Wang
Conference on Learning Theory, 4.1-4.24, 2012
632012
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
602002
An algorithmic framework for wireless information flow
MX Goemans, S Iwata, R Zenklusen
2009 47th Annual Allerton Conference on Communication, Control, and …, 2009
582009
Bisubmodular function minimization
S Fujishige, S Iwata
SIAM Journal on Discrete Mathematics 19 (4), 1065-1073, 2005
552005
A capacity scaling algorithm for convex cost submodular flows
S Iwata
Mathematical programming 76 (2), 299-308, 1997
491997
Minimum average cost clustering
K Nagano, Y Kawahara, S Iwata
Advances in Neural Information Processing Systems 23, 1759-1767, 2010
482010
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
422010
The linear delta-matroid parity problem
JF Geelen, S Iwata, K Murota
Journal of Combinatorial Theory, Series B 88 (2), 377-398, 2003
422003
Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
M Jünger, V Kaibel
Springer-Verlag, 2005
41*2005
Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization
S Iwata, M Shigeno
SIAM Journal on Optimization 13 (1), 204-211, 2002
412002
A faster capacity scaling algorithm for minimum cost submodular flow
L Fleischer, S Iwata, ST McCormick
Mathematical Programming 92 (1), 119-139, 2002
382002
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
372000
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
352015
Matroid matching via mixed skew-symmetric matrices
J Geelen, S Iwata
Combinatorica 25 (2), 187-215, 2005
332005
Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms
S Koichi, M Arisaka, H Koshino, A Aoki, S Iwata, T Uno, H Satoh
Journal of chemical information and modeling 54 (4), 1027-1035, 2014
302014
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
302013
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
272005
Algorithms for submodular flows
S Fujishige, S Iwata
IEICE TRANSACTIONS on Information and Systems 83 (3), 322-329, 2000
272000
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
262000
A fast bipartite network flow algorithm for selective assembly
S Iwata, T Matsui, ST McCormick
Operations research letters 22 (4-5), 137-143, 1998
261998
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
251999
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
242016
Index reduction for differential–algebraic equations by substitution method
M Takamatsu, S Iwata
Linear algebra and its applications 429 (8-9), 2268-2277, 2008
232008
A weighted linear matroid parity algorithm
S Iwata, Y Kobayashi
SIAM Journal on Computing, STOC17-238-STOC17-280, 2021
222021
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
212016
A capacity scaling algorithm for M-convex submodular flow
S Iwata, S Moriguchi, K Murota
Mathematical programming 103 (1), 181-202, 2005
212005
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
201999
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation
S Iwata, M Takamatsu
Mathematical programming 121 (1), 105-121, 2010
192010
Combinatorial analysis of singular matrix pencils
S Iwata, R Shimizu
SIAM journal on matrix analysis and applications 29 (1), 245-259, 2007
192007
Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
S Iwata
Algorithmica 36 (4), 331-341, 2003
192003
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
182007
A fast cost scaling algorithm for submodular flow
S Iwata, ST McCormick, M Shigeno
Information Processing Letters 74 (3-4), 123-128, 2000
182000
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
181994
in pharmaceutical systems... clays as dispersion stabilizers
M Barr
Journal of the American Pharmaceutical Association (1961) 4 (4), 180-183, 1964
181964
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
171995
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
162016
Bisubmodular function maximization and extensions
S Iwata, S Tanigawa, Y Yoshida
Technical Report METR 2013-16, The University of Tokyo, 2013
162013
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
162000
Tractability index of hybrid equations for circuit simulation
S Iwata, M Takamatsu, C Tischendorf
Mathematics of Computation 81 (278), 923-939, 2012
152012
Combinatorial relaxation algorithm for mixed polynomial matrices
S Iwata, K Murota
Mathematical programming 90 (2), 353-371, 2001
152001
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
151997
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
151996
A Faster Algorithm for Minimum Cost Submodular Flows.
S Iwata, ST McCormick, M Shigeno
SODA, 167-174, 1998
141998
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
141996
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
141996
A flow model based on polylinking system
MX Goemans, S Iwata, R Zenklusen
Mathematical programming 135 (1), 1-23, 2012
122012
Approximating minimum linear ordering problems
S Iwata, P Tetali, P Tripathi
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2012
122012
The independent even factor problem
S Iwata, K Takazawa
SIAM Journal on Discrete Mathematics 22 (4), 1411-1427, 2008
122008
H∞ optimal control for symmetric linear systems
S Iwata
Japan journal of industrial and applied mathematics 10 (1), 97-107, 1993
121993
Computing the signed distance between overlapping ellipsoids
S Iwata, Y Nakatsukasa, A Takeda
SIAM Journal on Optimization 25 (4), 2359-2384, 2015
112015
A dual approximation approach to weighted matroid intersection
M Shigeno, S Iwata
Operations research letters 18 (3), 153-156, 1995
111995
Solving linear programs from sign patterns
S Iwata, N Kakimura
Mathematical Programming 114 (2), 393-418, 2008
102008
A descent method for submodular function minimization
S Fujishige, S Iwata
Mathematical programming 92 (2), 387-390, 2002
102002
Extended formulations for sparsity matroids
S Iwata, N Kamiyama, N Katoh, S Kijima, Y Okamoto
Mathematical Programming 158 (1), 565-574, 2016
92016
Minimizing a submodular function arising from a concave function
S Fujishige, S Iwata
Discrete applied mathematics 92 (2-3), 211-215, 1999
91999
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
82017
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
S Iwata, M Takamatsu
Algorithmica 66 (2), 346-368, 2013
82013
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
S Iwata, M Takamatsu
Algorithmica 66 (2), 346-368, 2013
82013
Computational geometric approach to submodular function minimization for multiclass queueing systems
T Itoko, S Iwata
International Conference on Integer Programming and Combinatorial …, 2007
82007
Finding a stable allocation in polymatroid intersection
S Iwata, Y Yokoi
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
72016
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
72011
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
72008
A network flow approach to cost allocation for rooted trees
S Iwata, N Zuiki
Networks: An International Journal 44 (4), 297-301, 2004
72004
Fast cycle canceling algorithms for minimum cost submodular flow
S Iwata, ST McCormick, M Shigeno
Combinatorica 23 (3), 503-525, 2003
72003
Bisubmodular function minimization
S Fujishige, S Iwata
International Conference on Integer Programming and Combinatorial …, 2001
72001
" 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
62015
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
62015
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
62014
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
61999
Block triangularization of skew-symmetric matrices
S Iwata
Linear algebra and its applications 273 (1-3), 215-226, 1998
61998
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
61996
Index reduction via unimodular transformations
S Iwata, M Takamatsu
SIAM Journal on Matrix Analysis and Applications 39 (3), 1135-1151, 2018
52018
Weighted linear matroid parity
S Iwata
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017
52017
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
52010
Computing the degrees of all cofactors in mixed polynomial matrices
S Iwata, M Takamatsu
SIAM Journal on Discrete Mathematics 23 (2), 647-660, 2009
52009
Finding coherent cyclic orders in strong digraphs
S Iwata, T Matsuda
Combinatorica 28 (1), 83-88, 2008
52008
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 …, 2005
52005
On matroid intersection adjacency
S Iwata
Discrete mathematics 242 (1-3), 277-281, 2002
52002
Principal structure of submodular systems and Hitchcock-type independent flows
S Iwata
Combinatorica 15 (4), 515-532, 1995
51995
A theorem on the principal structure for independent matchings
S Iwata, K Murota
Discrete applied mathematics 61 (3), 229-244, 1995
51995
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
42019
Global optimization methods for extended Fisher discriminant analysis
S Iwata, Y Nakatsukasa, A Takeda
Artificial Intelligence and Statistics, 411-419, 2014
42014
Computing the inertia from sign patterns
N Kakimura, S Iwata
Mathematical programming 110 (1), 229-244, 2007
42007
Combinatorial analysis of generic matrix pencils
S Iwata, R Shimizu
International Conference on Integer Programming and Combinatorial …, 2005
42005
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
42005
A constrained independent set problem for matroids
T Fleiner, A Frank, S Iwata
Operations Research Letters 32 (1), 23-26, 2004
42004
Conjugate scaling technique for Fenchel-type duality in discrete convex optimization
S Iwata
Discrete Mathematics and Systems Science Research Report, 99-02, 1999
41999
G-RMSD: Root Mean Square Deviation Based Method for Three-dimensional Molecular Similarity Determination
T Fukutani, K Miyazawa, S Iwata, H Satoh
Bulletin of the Chemical Society of Japan 94 (2), 655-665, 2021
32021
The system can't perform the operation now. Try again later.
Articles 1–100