Satoru Iwata

ORCID

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 27

Top Venues

Publications

Satoru Iwata, Taihei Oki, Shinsaku Sakaue
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance. CoRR (2023)
Satoru Iwata, Yu Yokoi
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. SIAM J. Comput. 52 (5) (2023)
Satoru Iwata, Yusuke Kobayashi
A Weighted Linear Matroid Parity Algorithm. SIAM J. Comput. 51 (2) (2022)
Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. CoRR (2022)
Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata
Lazy and Fast Greedy MAP Inference for Determinantal Point Process. NeurIPS (2022)
Satoru Iwata
A Pfaffian formula for matching polynomials of outerplanar graphs. Optim. Methods Softw. 36 (2-3) (2021)
Satoru Iwata, Yu Yokoi
-Paths. SODA (2020)
Satoru Iwata, Yu Yokoi
Finding a Stable Allocation in Polymatroid Intersection. Math. Oper. Res. 45 (1) (2020)
Satoru Iwata, Yu Yokoi
Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow. CoRR (2019)
Satoru Iwata, Taihei Oki, Mizuyo Takamatsu
Index Reduction for Differential-algebraic Equations with Mixed Matrices. J. ACM 66 (5) (2019)
Satoru Iwata, Yusuke Kobayashi
A Weighted Linear Matroid Parity Algorithm. CoRR (2019)
Koyo Hayashi, Satoru Iwata
Correction to: Counting Minimum Weight Arborescences. Algorithmica 81 (1) (2019)
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
Making Bipartite Graphs DM-Irreducible. SIAM J. Discret. Math. 32 (1) (2018)
Satoru Iwata, Mizuyo Takamatsu
Index Reduction via Unimodular Transformations. SIAM J. Matrix Anal. Appl. 39 (3) (2018)
Koyo Hayashi, Satoru Iwata
Counting Minimum Weight Arborescences. Algorithmica 80 (12) (2018)
Satoru Iwata, Taihei Oki, Mizuyo Takamatsu
Index Reduction for Differential-Algebraic Equations with Mixed Matrices. CSC (2018)
Satoru Iwata, Yu Yokoi
List Supermodular Coloring. Comb. 38 (6) (2018)
Satoru Iwata, Yusuke Kobayashi
A weighted linear matroid parity algorithm. STOC (2017)
Satoru Iwata
Weighted Linear Matroid Parity. ISAAC (2017)
Satoru Adachi, Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem. SIAM J. Optim. 27 (1) (2017)
Kosuke Nishida, Akiko Takeda, Satoru Iwata, Mariko Kiho, Isao Nakayama
Household energy consumption prediction by feature selection of lifestyle data. SmartGridComm (2017)
Satoru Iwata, Mizuyo Takamatsu
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils. SIAM J. Control. Optim. 55 (3) (2017)
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
Extended formulations for sparsity matroids. Math. Program. 158 (1-2) (2016)
Satoru Iwata, Yu Yokoi
Finding a Stable Allocation in Polymatroid Intersection. SODA (2016)
Shinsaku Sakaue, Yuji Nakatsukasa, Akiko Takeda, Satoru Iwata
Solving Generalized CDT Problems via Two-Parameter Eigenvalues. SIAM J. Optim. 26 (3) (2016)
Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida
-Submodular Function Maximization. SODA (2016)
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
Making Bipartite Graphs DM-irreducible. CoRR (2016)
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms. IEEE Trans. Smart Grid 6 (5) (2015)
Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda
Computing the Signed Distance Between Overlapping Ellipsoids. SIAM J. Optim. 25 (4) (2015)
Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida
Improved Approximation Algorithms for k-Submodular Function Maximization. CoRR (2015)
Satoru Iwata, Alantha Newman, R. Ravi
Graph-TSP from Steiner Cycles. WG (2014)
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
Cyber security analysis of power networks by hypergraph cut algorithms. SmartGridComm (2014)
Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh
C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms. J. Chem. Inf. Model. 54 (4) (2014)
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
Extended Formulations for Sparsity Matroids. CoRR (2014)
Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda
Global Optimization Methods for Extended Fisher Discriminant Analysis. AISTATS (2014)
Masashi Kitamura, Akiko Takeda, Satoru Iwata
Exact SVM training by Wolfe's minimum norm point algorithm. MLSP (2014)
Satoru Iwata, Tibor Jordán
Orientations and detachments of graphs with prescribed degrees and connectivity. Discret. Optim. 12 (2014)
Satoru Iwata, Alantha Newman, R. Ravi
Graph-TSP from Steiner Cycles. CoRR (2014)
Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa
Finding 2-Factors Closer to TSP Tours in Cubic Graphs. SIAM J. Discret. Math. 27 (2) (2013)
Satoru Iwata, R. Ravi
Approximating max-min weighted T-joins. Oper. Res. Lett. 41 (4) (2013)
Satoru Iwata, Mizuyo Takamatsu
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. Algorithmica 66 (2) (2013)
Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang
Learning Valuation Functions. COLT (2012)
Michel X. Goemans, Satoru Iwata, Rico Zenklusen
A flow model based on polylinking system. Math. Program. 135 (1-2) (2012)
Satoru Iwata, Mizuyo Takamatsu, Caren Tischendorf
Tractability index of hybrid equations for circuit simulation. Math. Comput. 81 (278) (2012)
Satoru Iwata, Prasad Tetali, Pushkar Tripathi
Approximating Minimum Linear Ordering Problems. APPROX-RANDOM (2012)
Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang
Learning Valuation Functions CoRR (2011)
Satoru Iwata, Ken-ichi Kawarabayashi
Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1). NII Shonan Meet. Rep. 2011 (2011)
Satoru Iwata, Mizuyo Takamatsu
On the Kronecker Canonical Form of Mixed Matrix Pencils. SIAM J. Matrix Anal. Appl. 32 (1) (2011)
Satoru Iwata, Mizuyo Takamatsu
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. IPCO (2011)
Mizuyo Takamatsu, Satoru Iwata
Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation. Int. J. Circuit Theory Appl. 38 (4) (2010)
Satoru Iwata, Mizuyo Takamatsu
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation. Math. Program. 121 (1) (2010)
Kiyohito Nagano, Yoshinobu Kawahara, Satoru Iwata
Minimum Average Cost Clustering. NIPS (2010)
Satoru Iwata, Yusuke Kobayashi
An Algorithm for Minimum Cost Arc-Connectivity Orientations. Algorithmica 56 (4) (2010)
Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni
Approximating submodular functions everywhere. SODA (2009)
Satoru Iwata, Mizuyo Takamatsu
Computing the Degrees of All Cofactors in Mixed Polynomial Matrices. SIAM J. Discret. Math. 23 (2) (2009)
Satoru Iwata, James B. Orlin
A simple combinatorial algorithm for submodular function minimization. SODA (2009)
Satoru Iwata, Kiyohito Nagano
Submodular Function Minimization under Covering Constraints. FOCS (2009)
Michel X. Goemans, Satoru Iwata, Rico Zenklusen
An algorithmic framework for wireless information flow. Allerton (2009)
Satoru Iwata, Naonori Kakimura
Solving linear programs from sign patterns. Math. Program. 114 (2) (2008)
Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti
Recent results on well-balanced orientations. Discret. Optim. 5 (4) (2008)
Satoru Iwata, Takuro Matsuda
Finding coherent cyclic orders in strong digraphs. Comb. 28 (1) (2008)
Satoru Iwata, Kenjiro Takazawa
The Independent Even Factor Problem. SIAM J. Discret. Math. 22 (4) (2008)
Satoru Iwata
Submodular function minimization. Math. Program. 112 (1) (2008)
Toshinari Itoko, Satoru Iwata
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems. IPCO (2007)
Satoru Iwata, Kenjiro Takazawa
The independent even factor problem. SODA (2007)
Shungo Koichi, Satoru Iwata, Takeaki Uno, Hiroyuki Koshino, Hiroko Satoh
Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information. J. Chem. Inf. Model. 47 (5) (2007)
Naonori Kakimura, Satoru Iwata
Computing the inertia from sign patterns. Math. Program. 110 (1) (2007)
Satoru Iwata, Ryo Shimizu
Combinatorial Analysis of Singular Matrix Pencils. SIAM J. Matrix Anal. Appl. 29 (1) (2006)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. SIAM J. Discret. Math. 19 (2) (2005)
Satoru Iwata, Ryo Shimizu
Combinatorial Analysis of Generic Matrix Pencils. IPCO (2005)
Naonori Kakimura, Satoru Iwata
Computing the Inertia from Sign Patterns. IPCO (2005)
James F. Geelen, Satoru Iwata
Matroid Matching Via Mixed Skew-Symmetric Matrices. Comb. 25 (2) (2005)
Satoru Fujishige, Satoru Iwata
Bisubmodular Function Minimization. SIAM J. Discret. Math. 19 (4) (2005)
Satoru Iwata, Satoko Moriguchi, Kazuo Murota
A capacity scaling algorithm for M-convex submodular flow. Math. Program. 103 (1) (2005)
Satoru Iwata, Satoko Moriguchi, Kazuo Murota
A Capacity Scaling Algorithm for M-convex Submodular Flow. IPCO (2004)
Satoru Iwata, Nozomu Zuiki
A network flow approach to cost allocation for rooted trees. Networks 44 (4) (2004)
Tamás Fleiner, András Frank, Satoru Iwata
A constrained independent set problem for matroids. Oper. Res. Lett. 32 (1) (2004)
Lisa Fleischer, Satoru Iwata
A push-relabel framework for submodular function minimization and applications to parametric optimization. Discret. Appl. Math. 131 (2) (2003)
Satoru Iwata
A Faster Scaling Algorithm for Minimizing Submodular Functions. SIAM J. Comput. 32 (4) (2003)
Satoru Iwata
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. Algorithmica 36 (4) (2003)
James F. Geelen, Satoru Iwata, Kazuo Murota
The linear delta-matroid parity problem. J. Comb. Theory, Ser. B 88 (2) (2003)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. Comb. 23 (3) (2003)
Satoru Iwata
A Fully Combinatorial Algorithm for Submodular Function Minimization. J. Comb. Theory, Ser. B 84 (2) (2002)
Satoru Iwata
On matroid intersection adjacency. Discret. Math. 242 (1-3) (2002)
Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
Locating Sources to Meet Flow Demands in Undirected Networks. J. Algorithms 42 (1) (2002)
Satoru Iwata, Maiko Shigeno
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization. SIAM J. Optim. 13 (1) (2002)
Lisa Fleischer, Satoru Iwata, S. Thomas McCormick
A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. 92 (1) (2002)
Satoru Iwata
A Faster Scaling Algorithm for Minimizing Submodular Functions. IPCO (2002)
Satoru Fujishige, Satoru Iwata
A descent method for submodular function minimization. Math. Program. 92 (2) (2002)
Satoru Iwata
A fully combinatorial algorithm for submodular function minimization. SODA (2002)
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48 (4) (2001)
Satoru Fujishige, Satoru Iwata
Bisubmodular Function Minimization. IPCO (2001)
Satoru Iwata, Kazuo Murota
Combinatorial relaxation algorithm for mixed polynomial matrices. Math. Program. 90 (2) (2001)
Lisa Fleischer, Satoru Iwata
Improved algorithms for submodular function minimization and submodular flow. STOC (2000)
Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
Locating Sources to Meet Flow Demands in Undirected Networks. SWAT (2000)
Maiko Shigeno, Satoru Iwata, S. Thomas McCormick
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. Math. Oper. Res. 25 (1) (2000)
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. STOC (2000)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A fast cost scaling algorithm for submodular flow. Inf. Process. Lett. 74 (3-4) (2000)
Satoru Fujishige, Satoru Iwata
Minimizing a Submodular Function Arising From a Concave Function. Discret. Appl. Math. 92 (2-3) (1999)
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. IPCO (1999)

Satoru Iwata.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Satoru Iwata