Satoru Iwata

121 papers A* 16A 1B 11Misc 1Journal 84Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance.
SIAM J. Sci. Comput.
Satoru Iwata, Taihei Oki, Shinsaku Sakaue
2025 J jnl
Mathematical Framework to Identify Optimal Molecule Based on Virtual Ligand Strategy.
J. Chem. Inf. Model.
Wataru Matsuoka, Ken Hirose, Ren Yamada, Taihei Oki, Satoru Iwata, Satoshi Maeda
2024 J jnl
A Faster Deterministic Algorithm for Mader's 𝒮-Path Packing.
CoRR
Satoru Iwata, Hirota Kinoshita
2024 J jnl
Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method.
CoRR
Shinichi Hemmi, Satoru Iwata, Taihei Oki
2023 B ed.
34th International Symposium on Algorithms and Computation, ISAAC 2023, Kyoto, Japan, December 3-6, 2023
ISAAC
Satoru Iwata, Naonori Kakimura
2023 J jnl
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals.
SIAM J. Comput.
Satoru Iwata, Yu Yokoi
2023 J jnl
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance.
CoRR
Satoru Iwata, Taihei Oki, Shinsaku Sakaue
2022 J jnl
A Weighted Linear Matroid Parity Algorithm.
SIAM J. Comput.
Satoru Iwata, Yusuke Kobayashi
2022 A* conf
Lazy and Fast Greedy MAP Inference for Determinantal Point Process.
NeurIPS
Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata
2022 J jnl
Lazy and Fast Greedy MAP Inference for Determinantal Point Process.
CoRR
Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata
2021 J jnl
A Pfaffian formula for matching polynomials of outerplanar graphs.
Optim. Methods Softw.
Satoru Iwata
2020 A* conf
A Blossom Algorithm for Maximum Edge-Disjoint
SODA
Satoru Iwata, Yu Yokoi
2020 J jnl
Finding a Stable Allocation in Polymatroid Intersection.
Math. Oper. Res.
Satoru Iwata, Yu Yokoi
2019 J jnl
A Weighted Linear Matroid Parity Algorithm.
CoRR
Satoru Iwata, Yusuke Kobayashi
2019 J jnl
Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow.
CoRR
Satoru Iwata, Yu Yokoi
2019 J jnl
Correction to: Counting Minimum Weight Arborescences.
Algorithmica
Koyo Hayashi, Satoru Iwata
2019 J jnl
Index Reduction for Differential-algebraic Equations with Mixed Matrices.
J. ACM
Satoru Iwata, Taihei Oki, Mizuyo Takamatsu
2018 J jnl
Counting Minimum Weight Arborescences.
Algorithmica
Koyo Hayashi, Satoru Iwata
2018 — conf
Index Reduction for Differential-Algebraic Equations with Mixed Matrices.
CSC
Satoru Iwata, Taihei Oki, Mizuyo Takamatsu
2018 J jnl
Index Reduction via Unimodular Transformations.
SIAM J. Matrix Anal. Appl.
Satoru Iwata, Mizuyo Takamatsu
2018 J jnl
List Supermodular Coloring.
Comb.
Satoru Iwata, Yu Yokoi
2018 J jnl
Making Bipartite Graphs DM-Irreducible.
SIAM J. Discret. Math.
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
2017 A* conf
A weighted linear matroid parity algorithm.
STOC
Satoru Iwata, Yusuke Kobayashi
2017 — conf
Household energy consumption prediction by feature selection of lifestyle data.
SmartGridComm
Kosuke Nishida, Akiko Takeda, Satoru Iwata, Mariko Kiho, Isao Nakayama
2017 J jnl
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils.
SIAM J. Control. Optim.
Satoru Iwata, Mizuyo Takamatsu
2017 J jnl
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem.
SIAM J. Optim.
Satoru Adachi, Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda
2017 B conf
Weighted Linear Matroid Parity.
ISAAC
Satoru Iwata
2016 J jnl
Extended formulations for sparsity matroids.
Math. Program.
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2016 A* conf
Finding a Stable Allocation in Polymatroid Intersection.
SODA
Satoru Iwata, Yu Yokoi
2016 A* conf
Improved Approximation Algorithms for
SODA
Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida
2016 J jnl
Making Bipartite Graphs DM-irreducible.
CoRR
Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi
2016 J jnl
Solving Generalized CDT Problems via Two-Parameter Eigenvalues.
SIAM J. Optim.
Shinsaku Sakaue, Yuji Nakatsukasa, Akiko Takeda, Satoru Iwata
2015 J jnl
Computing the Signed Distance Between Overlapping Ellipsoids.
SIAM J. Optim.
Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda
2015 J jnl
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.
IEEE Trans. Smart Grid
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
2015 J jnl
Improved Approximation Algorithms for k-Submodular Function Maximization.
CoRR
Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida
2014 J jnl
Chemical Structure Elucidation from
J. Chem. Inf. Model.
Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh
2014 — conf
Cyber security analysis of power networks by hypergraph cut algorithms.
SmartGridComm
Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata
2014 — conf
Exact SVM training by Wolfe's minimum norm point algorithm.
MLSP
Masashi Kitamura, Akiko Takeda, Satoru Iwata
2014 J jnl
Extended Formulations for Sparsity Matroids.
CoRR
Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
2014 A conf
Global Optimization Methods for Extended Fisher Discriminant Analysis.
AISTATS
Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda
2014 B conf
Graph-TSP from Steiner Cycles.
WG
Satoru Iwata, Alantha Newman, R. Ravi
2014 J jnl
Graph-TSP from Steiner Cycles.
CoRR
Satoru Iwata, Alantha Newman, R. Ravi
2014 J jnl
Orientations and detachments of graphs with prescribed degrees and connectivity.
Discret. Optim.
Satoru Iwata, Tibor Jordán
2013 J jnl
Approximating max-min weighted T-joins.
Oper. Res. Lett.
Satoru Iwata, R. Ravi
2013 J jnl
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation.
Algorithmica
Satoru Iwata, Mizuyo Takamatsu
2013 J jnl
Finding 2-Factors Closer to TSP Tours in Cubic Graphs.
SIAM J. Discret. Math.
Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa
2012 J jnl
A flow model based on polylinking system.
Math. Program.
Michel X. Goemans, Satoru Iwata, Rico Zenklusen
2012 — conf
Approximating Minimum Linear Ordering Problems.
APPROX-RANDOM
Satoru Iwata, Prasad Tetali, Pushkar Tripathi
2012 A* conf
Learning Valuation Functions.
COLT
Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang
2012 J jnl
Tractability index of hybrid equations for circuit simulation.
Math. Comput.
Satoru Iwata, Mizuyo Takamatsu, Caren Tischendorf
2011 B conf
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation.
IPCO
Satoru Iwata, Mizuyo Takamatsu
2011 J jnl
Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1).
NII Shonan Meet. Rep.
Satoru Iwata, Ken-ichi Kawarabayashi
2011 J jnl
Learning Valuation Functions
CoRR
Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang
2011 J jnl
On the Kronecker Canonical Form of Mixed Matrix Pencils.
SIAM J. Matrix Anal. Appl.
Satoru Iwata, Mizuyo Takamatsu
2010 J jnl
An Algorithm for Minimum Cost Arc-Connectivity Orientations.
Algorithmica
Satoru Iwata, Yusuke Kobayashi
2010 J jnl
Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation.
Int. J. Circuit Theory Appl.
Mizuyo Takamatsu, Satoru Iwata
2010 J jnl
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation.
Math. Program.
Satoru Iwata, Mizuyo Takamatsu
2010 — conf
Minimum Average Cost Clustering.
NIPS
Kiyohito Nagano, Yoshinobu Kawahara, Satoru Iwata
2009 A* conf
A simple combinatorial algorithm for submodular function minimization.
SODA
Satoru Iwata, James B. Orlin
2009 — conf
An algorithmic framework for wireless information flow.
Allerton
Michel X. Goemans, Satoru Iwata, Rico Zenklusen
2009 A* conf
Approximating submodular functions everywhere.
SODA
Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni
2009 J jnl
Computing the Degrees of All Cofactors in Mixed Polynomial Matrices.
SIAM J. Discret. Math.
Satoru Iwata, Mizuyo Takamatsu
2009 A* conf
Submodular Function Minimization under Covering Constraints.
FOCS
Satoru Iwata, Kiyohito Nagano
2008 J jnl
Finding coherent cyclic orders in strong digraphs.
Comb.
Satoru Iwata, Takuro Matsuda
2008 J jnl
Recent results on well-balanced orientations.
Discret. Optim.
Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti
2008 J jnl
Solving linear programs from sign patterns.
Math. Program.
Satoru Iwata, Naonori Kakimura
2008 J jnl
Submodular function minimization.
Math. Program.
Satoru Iwata
2008 J jnl
The Independent Even Factor Problem.
SIAM J. Discret. Math.
Satoru Iwata, Kenjiro Takazawa
2007 J jnl
Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information.
J. Chem. Inf. Model.
Shungo Koichi, Satoru Iwata, Takeaki Uno, Hiroyuki Koshino, Hiroko Satoh
2007 B conf
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems.
IPCO
Toshinari Itoko, Satoru Iwata
2007 J jnl
Computing the inertia from sign patterns.
Math. Program.
Naonori Kakimura, Satoru Iwata
2007 A* conf
The independent even factor problem.
SODA
Satoru Iwata, Kenjiro Takazawa
2006 J jnl
Combinatorial Analysis of Singular Matrix Pencils.
SIAM J. Matrix Anal. Appl.
Satoru Iwata, Ryo Shimizu
2005 J jnl
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.
SIAM J. Discret. Math.
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
2005 J jnl
A capacity scaling algorithm for M-convex submodular flow.
Math. Program.
Satoru Iwata, Satoko Moriguchi, Kazuo Murota
2005 J jnl
Bisubmodular Function Minimization.
SIAM J. Discret. Math.
Satoru Fujishige, Satoru Iwata
2005 B conf
Combinatorial Analysis of Generic Matrix Pencils.
IPCO
Satoru Iwata, Ryo Shimizu
2005 B conf
Computing the Inertia from Sign Patterns.
IPCO
Naonori Kakimura, Satoru Iwata
2005 J jnl
Matroid Matching Via Mixed Skew-Symmetric Matrices.
Comb.
James F. Geelen, Satoru Iwata
2004 B conf
A Capacity Scaling Algorithm for M-convex Submodular Flow.
IPCO
Satoru Iwata, Satoko Moriguchi, Kazuo Murota
2004 J jnl
A constrained independent set problem for matroids.
Oper. Res. Lett.
Tamás Fleiner, András Frank, Satoru Iwata
2004 J jnl
A network flow approach to cost allocation for rooted trees.
Networks
Satoru Iwata, Nozomu Zuiki
2003 J jnl
A Faster Scaling Algorithm for Minimizing Submodular Functions.
SIAM J. Comput.
Satoru Iwata
2003 J jnl
A push-relabel framework for submodular function minimization and applications to parametric optimization.
Discret. Appl. Math.
Lisa Fleischer, Satoru Iwata
2003 J jnl
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.
Algorithmica
Satoru Iwata
2003 J jnl
Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.
Comb.
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
2003 J jnl
The linear delta-matroid parity problem.
J. Comb. Theory B
James F. Geelen, Satoru Iwata, Kazuo Murota
2002 B conf
A Faster Scaling Algorithm for Minimizing Submodular Functions.
IPCO
Satoru Iwata
2002 J jnl
A Fully Combinatorial Algorithm for Submodular Function Minimization.
J. Comb. Theory B
Satoru Iwata
2002 J jnl
A descent method for submodular function minimization.
Math. Program.
Satoru Fujishige, Satoru Iwata
2002 J jnl
A faster capacity scaling algorithm for minimum cost submodular flow.
Math. Program.
Lisa Fleischer, Satoru Iwata, S. Thomas McCormick
2002 A* conf
A fully combinatorial algorithm for submodular function minimization.
SODA
Satoru Iwata
2002 J jnl
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization.
SIAM J. Optim.
Satoru Iwata, Maiko Shigeno
2002 J jnl
Locating Sources to Meet Flow Demands in Undirected Networks.
J. Algorithms
Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
2002 J jnl
On matroid intersection adjacency.
Discret. Math.
Satoru Iwata
2001 J jnl
A combinatorial strongly polynomial algorithm for minimizing submodular functions.
J. ACM
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
2001 B conf
Bisubmodular Function Minimization.
IPCO
Satoru Fujishige, Satoru Iwata
2001 J jnl
Combinatorial relaxation algorithm for mixed polynomial matrices.
Math. Program.
Satoru Iwata, Kazuo Murota
2000 A* conf
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.
STOC
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
2000 J jnl
A fast cost scaling algorithm for submodular flow.
Inf. Process. Lett.
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
2000 A* conf
Improved algorithms for submodular function minimization and submodular flow.
STOC
Lisa Fleischer, Satoru Iwata
2000 — conf
Locating Sources to Meet Flow Demands in Undirected Networks.
SWAT
Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
2000 J jnl
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.
Math. Oper. Res.
Maiko Shigeno, Satoru Iwata, S. Thomas McCormick
1999 B conf
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.
IPCO
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
1999 A* conf
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.
SODA
Satoru Iwata
1999 J jnl
Minimizing a Submodular Function Arising From a Concave Function.
Discret. Appl. Math.
Satoru Fujishige, Satoru Iwata
1998 A* conf
A Faster Algorithm for Minimum Cost Submodular Flows.
SODA
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
1998 J jnl
A fast bipartite network flow algorithm for selective assembly.
Oper. Res. Lett.
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
1997 J jnl
A Cost-scaling Algorithm for 0-1 Submodular Flows.
Discret. Appl. Math.
Maiko Shigeno, Satoru Iwata
1997 J jnl
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences.
Math. Oper. Res.
Satoru Iwata, Kazuo Murota, Maiko Shigeno
1996 A* conf
A Capacity Scaling Algorithm for Convex Cost Submodular Flows.
SODA
Satoru Iwata
1996 J jnl
A capacity scaling algorithm for convex cost submodular flows.
Math. Program.
Satoru Iwata
1996 Misc conf
Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders.
COCOON
Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida
1996 J jnl
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections.
SIAM J. Discret. Math.
Satoru Iwata, Kazuo Murota
1996 J jnl
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants.
SIAM J. Sci. Comput.
Satoru Iwata, Kazuo Murota, Izumi Sakuta
1996 J jnl
Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows.
Comb.
Satoru Iwata
1995 J jnl
A Minimax Theorem and a Dulmage-Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices.
SIAM J. Matrix Anal. Appl.
Satoru Iwata, Kazuo Murota
1995 J jnl
A Theorem on the Principal Structure for Independent Matchings.
Discret. Appl. Math.
Satoru Iwata, Kazuo Murota
1995 J jnl
A dual approximation approach to weighted matroid intersection.
Oper. Res. Lett.
Maiko Shigeno, Satoru Iwata
1995 J jnl
Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows.
Comb.
Satoru Iwata
1994 J jnl
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations.
SIAM J. Matrix Anal. Appl.
Hisashi Ito, Satoru Iwata, Kazuo Murota