Satoru Iwata

According to our database, Satoru Iwata authored at least 95 papers between 1994 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Finding Maximum Edge-Disjoint Paths Between Multiple Terminals.

Satoru Iwata, Yu Yokoi

SIAM J. Comput., October, 2023

Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance.

Satoru Iwata, Taihei Oki, Shinsaku Sakaue

CoRR, 2023

2022

A Weighted Linear Matroid Parity Algorithm.

Satoru Iwata, Yusuke Kobayashi

SIAM J. Comput., 2022

Lazy and Fast Greedy MAP Inference for Determinantal Point Process.

Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021

A Pfaffian formula for matching polynomials of outerplanar graphs.

Satoru Iwata

Optim. Methods Softw., 2021

2020

Finding a Stable Allocation in Polymatroid Intersection.

Satoru Iwata, Yu Yokoi

Math. Oper. Res., 2020

A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths.

Satoru Iwata, Yu Yokoi

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Index Reduction for Differential-algebraic Equations with Mixed Matrices.

Satoru Iwata, Taihei Oki, Mizuyo Takamatsu

J. ACM, 2019

Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow.

Satoru Iwata, Yu Yokoi

CoRR, 2019

Correction to: Counting Minimum Weight Arborescences.

Koyo Hayashi, Satoru Iwata

Algorithmica, 2019

2018

Index Reduction via Unimodular Transformations.

Satoru Iwata, Mizuyo Takamatsu

SIAM J. Matrix Anal. Appl., 2018

Making Bipartite Graphs DM-Irreducible.

Kristóf Bérczi, Satoru Iwata, Jun Kato, Yutaro Yamaguchi

SIAM J. Discret. Math., 2018

List Supermodular Coloring.

Satoru Iwata, Yu Yokoi

Comb., 2018

Counting Minimum Weight Arborescences.

Koyo Hayashi, Satoru Iwata

Algorithmica, 2018

2017

Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem.

Satoru Adachi, Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda

SIAM J. Optim., 2017

On the Kronecker Canonical Form of Singular Mixed Matrix Pencils.

Satoru Iwata, Mizuyo Takamatsu

SIAM J. Control. Optim., 2017

Household energy consumption prediction by feature selection of lifestyle data.

Kosuke Nishida, Akiko Takeda, Satoru Iwata, Mariko Kiho, Isao Nakayama

Proceedings of the 2017 IEEE International Conference on Smart Grid Communications, 2017

Weighted Linear Matroid Parity.

Satoru Iwata

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Solving Generalized CDT Problems via Two-Parameter Eigenvalues.

Shinsaku Sakaue, Yuji Nakatsukasa, Akiko Takeda, Satoru Iwata

SIAM J. Optim., 2016

Extended formulations for sparsity matroids.

Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto

Math. Program., 2016

Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization.

Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.

Yutaro Yamaguchi, Anna Ogawa, Akiko Takeda, Satoru Iwata

IEEE Trans. Smart Grid, 2015

Computing the Signed Distance Between Overlapping Ellipsoids.

Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda

SIAM J. Optim., 2015

Improved Approximation Algorithms for k-Submodular Function Maximization.

Satoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida

CoRR, 2015

2014

Chemical Structure Elucidation from ¹³C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms.

Shungo Koichi, Masaki Arisaka, Hiroyuki Koshino, Atsushi Aoki, Satoru Iwata, Takeaki Uno, Hiroko Satoh

J. Chem. Inf. Model., 2014

Orientations and detachments of graphs with prescribed degrees and connectivity.

Satoru Iwata, Tibor Jordán

Discret. Optim., 2014

Graph-TSP from Steiner Cycles.

Satoru Iwata, Alantha Newman, R. Ravi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Exact SVM training by Wolfe's minimum norm point algorithm.

Masashi Kitamura, Akiko Takeda, Satoru Iwata

Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing, 2014

Global Optimization Methods for Extended Fisher Discriminant Analysis.

Satoru Iwata, Yuji Nakatsukasa, Akiko Takeda

Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2013

Finding 2-Factors Closer to TSP Tours in Cubic Graphs.

Sylvia C. Boyd, Satoru Iwata, Kenjiro Takazawa

SIAM J. Discret. Math., 2013

Approximating max-min weighted T-joins.

Satoru Iwata, R. Ravi

Oper. Res. Lett., 2013

Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation.

Satoru Iwata, Mizuyo Takamatsu

Algorithmica, 2013

2012

A flow model based on polylinking system.

Michel X. Goemans, Satoru Iwata, Rico Zenklusen

Math. Program., 2012

Tractability index of hybrid equations for circuit simulation.

Satoru Iwata, Mizuyo Takamatsu, Caren Tischendorf

Math. Comput., 2012

Learning Valuation Functions.

Maria-Florina Balcan, Florin Constantin, Satoru Iwata, Lei Wang

Proceedings of the COLT 2012, 2012

Approximating Minimum Linear Ordering Problems.

Satoru Iwata, Prasad Tetali, Pushkar Tripathi

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

On the Kronecker Canonical Form of Mixed Matrix Pencils.

Satoru Iwata, Mizuyo Takamatsu

SIAM J. Matrix Anal. Appl., 2011

Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1).

Satoru Iwata, Ken-ichi Kawarabayashi

NII Shonan Meet. Rep., 2011

2010

Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation.

Satoru Iwata, Mizuyo Takamatsu

Math. Program., 2010

Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation.

Mizuyo Takamatsu, Satoru Iwata

Int. J. Circuit Theory Appl., 2010

An Algorithm for Minimum Cost Arc-Connectivity Orientations.

Satoru Iwata, Yusuke Kobayashi

Algorithmica, 2010

Minimum Average Cost Clustering.

Kiyohito Nagano, Yoshinobu Kawahara, Satoru Iwata

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

2009

Computing the Degrees of All Cofactors in Mixed Polynomial Matrices.

Satoru Iwata, Mizuyo Takamatsu

SIAM J. Discret. Math., 2009

A simple combinatorial algorithm for submodular function minimization.

Satoru Iwata, James B. Orlin

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximating submodular functions everywhere.

Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Submodular Function Minimization under Covering Constraints.

Satoru Iwata, Kiyohito Nagano

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

An algorithmic framework for wireless information flow.

Michel X. Goemans, Satoru Iwata, Rico Zenklusen

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

The Independent Even Factor Problem.

Satoru Iwata, Kenjiro Takazawa

SIAM J. Discret. Math., 2008

Solving linear programs from sign patterns.

Satoru Iwata, Naonori Kakimura

Math. Program., 2008

Submodular function minimization.

Satoru Iwata

Math. Program., 2008

Recent results on well-balanced orientations.

Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti

Discret. Optim., 2008

Finding coherent cyclic orders in strong digraphs.

Satoru Iwata, Takuro Matsuda

Comb., 2008

2007

Computing the inertia from sign patterns.

Naonori Kakimura, Satoru Iwata

Math. Program., 2007

Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information.

Shungo Koichi, Satoru Iwata, Takeaki Uno, Hiroyuki Koshino, Hiroko Satoh

J. Chem. Inf. Model., 2007

Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems.

Toshinari Itoko, Satoru Iwata

Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006

Combinatorial Analysis of Singular Matrix Pencils.

Satoru Iwata, Ryo Shimizu

SIAM J. Matrix Anal. Appl., 2006

2005

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

SIAM J. Discret. Math., 2005

Bisubmodular Function Minimization.

Satoru Fujishige, Satoru Iwata

SIAM J. Discret. Math., 2005

A capacity scaling algorithm for M-convex submodular flow.

Satoru Iwata, Satoko Moriguchi, Kazuo Murota

Math. Program., 2005

Matroid Matching Via Mixed Skew-Symmetric Matrices.

James F. Geelen, Satoru Iwata

Comb., 2005

Combinatorial Analysis of Generic Matrix Pencils.

Satoru Iwata, Ryo Shimizu

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

A constrained independent set problem for matroids.

Tamás Fleiner, András Frank, Satoru Iwata

Oper. Res. Lett., 2004

A network flow approach to cost allocation for rooted trees.

Satoru Iwata, Nozomu Zuiki

Networks, 2004

2003

A Faster Scaling Algorithm for Minimizing Submodular Functions.

Satoru Iwata

SIAM J. Comput., 2003

The linear delta-matroid parity problem.

James F. Geelen, Satoru Iwata, Kazuo Murota

J. Comb. Theory, Ser. B, 2003

A push-relabel framework for submodular function minimization and applications to parametric optimization.

Lisa Fleischer, Satoru Iwata

Discret. Appl. Math., 2003

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Comb., 2003

Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.

Satoru Iwata

Algorithmica, 2003

2002

Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization.

Satoru Iwata, Maiko Shigeno

SIAM J. Optim., 2002

A descent method for submodular function minimization.

Satoru Fujishige, Satoru Iwata

Math. Program., 2002

A faster capacity scaling algorithm for minimum cost submodular flow.

Lisa Fleischer, Satoru Iwata, S. Thomas McCormick

Math. Program., 2002

A Fully Combinatorial Algorithm for Submodular Function Minimization.

Satoru Iwata

J. Comb. Theory, Ser. B, 2002

Locating Sources to Meet Flow Demands in Undirected Networks.

Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige

J. Algorithms, 2002

On matroid intersection adjacency.

Satoru Iwata

Discret. Math., 2002

2001

Combinatorial relaxation algorithm for mixed polynomial matrices.

Satoru Iwata, Kazuo Murota

Math. Program., 2001

A combinatorial strongly polynomial algorithm for minimizing submodular functions.

Satoru Iwata, Lisa Fleischer, Satoru Fujishige

J. ACM, 2001

2000

Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.

Maiko Shigeno, Satoru Iwata, S. Thomas McCormick

Math. Oper. Res., 2000

A fast cost scaling algorithm for submodular flow.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Inf. Process. Lett., 2000

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.

Satoru Iwata, Lisa Fleischer, Satoru Fujishige

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Improved algorithms for submodular function minimization and submodular flow.

Lisa Fleischer, Satoru Iwata

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999

Minimizing a Submodular Function Arising From a Concave Function.

Satoru Fujishige, Satoru Iwata

Discret. Appl. Math., 1999

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

A fast bipartite network flow algorithm for selective assembly.

Satoru Iwata, Tomomi Matsui, S. Thomas McCormick

Oper. Res. Lett., 1998

A Faster Algorithm for Minimum Cost Submodular Flows.

Satoru Iwata, S. Thomas McCormick, Maiko Shigeno

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences.

Satoru Iwata, Kazuo Murota, Maiko Shigeno

Math. Oper. Res., 1997

A Cost-scaling Algorithm for 0-1 Submodular Flows.

Maiko Shigeno, Satoru Iwata

Discret. Appl. Math., 1997

1996

Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants.

Satoru Iwata, Kazuo Murota, Izumi Sakuta

SIAM J. Sci. Comput., 1996

Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections.

Satoru Iwata, Kazuo Murota

SIAM J. Discret. Math., 1996

A capacity scaling algorithm for convex cost submodular flows.

Satoru Iwata

Math. Program., 1996

Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows.

Satoru Iwata

Comb., 1996

Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders.

Hiroshi Imai, Satoru Iwata, Kyoko Sekine, Kensyu Yoshida

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

A Minimax Theorem and a Dulmage-Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices.

Satoru Iwata, Kazuo Murota

SIAM J. Matrix Anal. Appl., 1995

A dual approximation approach to weighted matroid intersection.

Maiko Shigeno, Satoru Iwata

Oper. Res. Lett., 1995

A Theorem on the Principal Structure for Independent Matchings.

Satoru Iwata, Kazuo Murota

Discret. Appl. Math., 1995

1994

Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations.

Hisashi Ito, Satoru Iwata, Kazuo Murota

SIAM J. Matrix Anal. Appl., October, 1994