Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations. - Hisashi Ito; Satoru Iwata 001; Kazuo Murota (SIAM J. Matrix Anal. Appl., 1994)

Principal Structure of Submodular Systems and Hitchcock-Type Independent Flows. - Satoru Iwata 001 (Comb., 1995)

A Theorem on the Principal Structure for Independent Matchings. - Satoru Iwata 001; Kazuo Murota (Discret. Appl. Math., 1995)

A dual approximation approach to weighted matroid intersection. - Maiko Shigeno; Satoru Iwata 001 (Oper. Res. Lett., 1995)

A Minimax Theorem and a Dulmage-Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices. - Satoru Iwata 001; Kazuo Murota (SIAM J. Matrix Anal. Appl., 1995)

Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders. - Hiroshi Imai; Satoru Iwata 001; Kyoko Sekine; Kensyu Yoshida (COCOON, 1996)

A capacity scaling algorithm for convex cost submodular flows. - Satoru Iwata 001 (Math. Program., 1996)

Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections. - Satoru Iwata 001; Kazuo Murota (SIAM J. Discret. Math., 1996)

Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants. - Satoru Iwata 001; Kazuo Murota; Izumi Sakuta (SIAM J. Sci. Comput., 1996)

A Cost-scaling Algorithm for 0-1 Submodular Flows. - Maiko Shigeno; Satoru Iwata 001 (Discret. Appl. Math., 1997)

A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences. - Satoru Iwata 001; Kazuo Murota; Maiko Shigeno (Math. Oper. Res., 1997)

A Faster Algorithm for Minimum Cost Submodular Flows. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (SODA, 1998)

A fast bipartite network flow algorithm for selective assembly. - Satoru Iwata 001; Tomomi Matsui; S. Thomas McCormick (Oper. Res. Lett., 1998)

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (IPCO, 1999)

Minimizing a Submodular Function Arising From a Concave Function. - Satoru Fujishige; Satoru Iwata 001 (Discret. Appl. Math., 1999)

Improved algorithms for submodular function minimization and submodular flow. - Lisa Fleischer; Satoru Iwata 001 (STOC, 2000)

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions. - Satoru Iwata 001; Lisa Fleischer; Satoru Fujishige (STOC, 2000)

A fast cost scaling algorithm for submodular flow. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (Inf. Process. Lett., 2000)

Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow. - Maiko Shigeno; Satoru Iwata 001; S. Thomas McCormick (Math. Oper. Res., 2000)

A combinatorial strongly polynomial algorithm for minimizing submodular functions. - Satoru Iwata 001; Lisa Fleischer; Satoru Fujishige (J. ACM, 2001)

Combinatorial relaxation algorithm for mixed polynomial matrices. - Satoru Iwata 001; Kazuo Murota (Math. Program., 2001)

On matroid intersection adjacency. - Satoru Iwata 001 (Discret. Math., 2002)

Locating Sources to Meet Flow Demands in Undirected Networks. - Kouji Arata; Satoru Iwata 001; Kazuhisa Makino; Satoru Fujishige (J. Algorithms, 2002)

A Fully Combinatorial Algorithm for Submodular Function Minimization. - Satoru Iwata 001 (J. Comb. Theory B, 2002)

A faster capacity scaling algorithm for minimum cost submodular flow. - Lisa Fleischer; Satoru Iwata 001; S. Thomas McCormick (Math. Program., 2002)

A descent method for submodular function minimization. - Satoru Fujishige; Satoru Iwata 001 (Math. Program., 2002)

Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization. - Satoru Iwata 001; Maiko Shigeno (SIAM J. Optim., 2002)

Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation. - Satoru Iwata 001 (Algorithmica, 2003)

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (Comb., 2003)

A push-relabel framework for submodular function minimization and applications to parametric optimization. - Lisa Fleischer; Satoru Iwata 001 (Discret. Appl. Math., 2003)

The linear delta-matroid parity problem. - James F. Geelen; Satoru Iwata 001; Kazuo Murota (J. Comb. Theory B, 2003)

A Faster Scaling Algorithm for Minimizing Submodular Functions. - Satoru Iwata 001 (SIAM J. Comput., 2003)

A network flow approach to cost allocation for rooted trees. - Satoru Iwata 001; Nozomu Zuiki (Networks, 2004)

A constrained independent set problem for matroids. - Tamás Fleiner; András Frank; Satoru Iwata 001 (Oper. Res. Lett., 2004)

Combinatorial Analysis of Generic Matrix Pencils. - Satoru Iwata 001; Ryo Shimizu (IPCO, 2005)

Matroid Matching Via Mixed Skew-Symmetric Matrices. - James F. Geelen; Satoru Iwata 001 (Comb., 2005)

A capacity scaling algorithm for M-convex submodular flow. - Satoru Iwata 001; Satoko Moriguchi; Kazuo Murota (Math. Program., 2005)

Bisubmodular Function Minimization. - Satoru Fujishige; Satoru Iwata 001 (SIAM J. Discret. Math., 2005)

A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow. - Satoru Iwata 001; S. Thomas McCormick; Maiko Shigeno (SIAM J. Discret. Math., 2005)

Combinatorial Analysis of Singular Matrix Pencils. - Satoru Iwata 001; Ryo Shimizu (SIAM J. Matrix Anal. Appl., 2006)

Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems. - Toshinari Itoko; Satoru Iwata 001 (IPCO, 2007)

Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information. - Shungo Koichi; Satoru Iwata 001; Takeaki Uno; Hiroyuki Koshino; Hiroko Satoh (J. Chem. Inf. Model., 2007)

Computing the inertia from sign patterns. - Naonori Kakimura; Satoru Iwata 001 (Math. Program., 2007)

Finding coherent cyclic orders in strong digraphs. - Satoru Iwata 001; Takuro Matsuda (Comb., 2008)

Recent results on well-balanced orientations. - Attila Bernáth; Satoru Iwata 001; Tamás Király; Zoltán Király; Zoltán Szigeti (Discret. Optim., 2008)

Submodular function minimization. - Satoru Iwata 001 (Math. Program., 2008)

Solving linear programs from sign patterns. - Satoru Iwata 001; Naonori Kakimura (Math. Program., 2008)

The Independent Even Factor Problem. - Satoru Iwata 001; Kenjiro Takazawa (SIAM J. Discret. Math., 2008)

An algorithmic framework for wireless information flow. - Michel X. Goemans; Satoru Iwata 001; Rico Zenklusen (Allerton, 2009)

Submodular Function Minimization under Covering Constraints. - Satoru Iwata 001; Kiyohito Nagano (FOCS, 2009)

Approximating submodular functions everywhere. - Michel X. Goemans; Nicholas J. A. Harvey; Satoru Iwata 001; Vahab S. Mirrokni (SODA, 2009)

A simple combinatorial algorithm for submodular function minimization. - Satoru Iwata 001; James B. Orlin (SODA, 2009)

Computing the Degrees of All Cofactors in Mixed Polynomial Matrices. - Satoru Iwata 001; Mizuyo Takamatsu (SIAM J. Discret. Math., 2009)

Minimum Average Cost Clustering. - Kiyohito Nagano; Yoshinobu Kawahara; Satoru Iwata 001 (NIPS, 2010)

An Algorithm for Minimum Cost Arc-Connectivity Orientations. - Satoru Iwata 001; Yusuke Kobayashi 001 (Algorithmica, 2010)

Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation. - Mizuyo Takamatsu; Satoru Iwata 001 (Int. J. Circuit Theory Appl., 2010)

Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation. - Satoru Iwata 001; Mizuyo Takamatsu (Math. Program., 2010)

Graph Algorithm and Combinatorial Optimization (NII Shonan Meeting 2011-1). - Satoru Iwata 001; Ken-ichi Kawarabayashi (NII Shonan Meet. Rep., 2011)

On the Kronecker Canonical Form of Mixed Matrix Pencils. - Satoru Iwata 001; Mizuyo Takamatsu (SIAM J. Matrix Anal. Appl., 2011)

Approximating Minimum Linear Ordering Problems. - Satoru Iwata 001; Prasad Tetali; Pushkar Tripathi (APPROX-RANDOM, 2012)

Learning Valuation Functions. - Maria-Florina Balcan; Florin Constantin; Satoru Iwata 001; Lei Wang (COLT, 2012)

Tractability index of hybrid equations for circuit simulation. - Satoru Iwata 001; Mizuyo Takamatsu; Caren Tischendorf (Math. Comput., 2012)

A flow model based on polylinking system. - Michel X. Goemans; Satoru Iwata 001; Rico Zenklusen (Math. Program., 2012)

Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. - Satoru Iwata 001; Mizuyo Takamatsu (Algorithmica, 2013)

Approximating max-min weighted T-joins. - Satoru Iwata 001; R. Ravi 001 (Oper. Res. Lett., 2013)

Finding 2-Factors Closer to TSP Tours in Cubic Graphs. - Sylvia C. Boyd; Satoru Iwata 001; Kenjiro Takazawa (SIAM J. Discret. Math., 2013)

Global Optimization Methods for Extended Fisher Discriminant Analysis. - Satoru Iwata 001; Yuji Nakatsukasa; Akiko Takeda (AISTATS, 2014)

Exact SVM training by Wolfe's minimum norm point algorithm. - Masashi Kitamura; Akiko Takeda; Satoru Iwata 001 (MLSP, 2014)

Graph-TSP from Steiner Cycles. - Satoru Iwata 001; Alantha Newman; R. Ravi 001 (WG, 2014)

Orientations and detachments of graphs with prescribed degrees and connectivity. - Satoru Iwata 001; Tibor Jordán (Discret. Optim., 2014)

Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms. - Shungo Koichi; Masaki Arisaka; Hiroyuki Koshino; Atsushi Aoki; Satoru Iwata 001; Takeaki Uno; Hiroko Satoh (J. Chem. Inf. Model., 2014)

Improved Approximation Algorithms for k-Submodular Function Maximization. - Satoru Iwata 001; Shin-ichi Tanigawa; Yuichi Yoshida (CoRR, 2015)

Computing the Signed Distance Between Overlapping Ellipsoids. - Satoru Iwata 001; Yuji Nakatsukasa; Akiko Takeda (SIAM J. Optim., 2015)

Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms. - Yutaro Yamaguchi 001; Anna Ogawa; Akiko Takeda; Satoru Iwata 001 (IEEE Trans. Smart Grid, 2015)

Improved Approximation Algorithms for k-Submodular Function Maximization. - Satoru Iwata 001; Shin-ichi Tanigawa; Yuichi Yoshida (SODA, 2016)

Extended formulations for sparsity matroids. - Satoru Iwata 001; Naoyuki Kamiyama; Naoki Katoh; Shuji Kijima; Yoshio Okamoto (Math. Program., 2016)

Solving Generalized CDT Problems via Two-Parameter Eigenvalues. - Shinsaku Sakaue; Yuji Nakatsukasa; Akiko Takeda; Satoru Iwata 001 (SIAM J. Optim., 2016)

Weighted Linear Matroid Parity. - Satoru Iwata 001 (ISAAC, 2017)

Household energy consumption prediction by feature selection of lifestyle data. - Kosuke Nishida; Akiko Takeda; Satoru Iwata 001; Mariko Kiho; Isao Nakayama (SmartGridComm, 2017)

On the Kronecker Canonical Form of Singular Mixed Matrix Pencils. - Satoru Iwata 001; Mizuyo Takamatsu (SIAM J. Control. Optim., 2017)

Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem. - Satoru Adachi; Satoru Iwata 001; Yuji Nakatsukasa; Akiko Takeda (SIAM J. Optim., 2017)

Counting Minimum Weight Arborescences. - Koyo Hayashi; Satoru Iwata 001 (Algorithmica, 2018)

List Supermodular Coloring. - Satoru Iwata 001; Yu Yokoi (Comb., 2018)

Making Bipartite Graphs DM-Irreducible. - Kristóf Bérczi; Satoru Iwata 001; Jun Kato 003; Yutaro Yamaguchi 001 (SIAM J. Discret. Math., 2018)

Index Reduction via Unimodular Transformations. - Satoru Iwata 001; Mizuyo Takamatsu (SIAM J. Matrix Anal. Appl., 2018)

Correction to: Counting Minimum Weight Arborescences. - Koyo Hayashi; Satoru Iwata 001 (Algorithmica, 2019)

Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow. - Satoru Iwata 001; Yu Yokoi (CoRR, 2019)

Index Reduction for Differential-algebraic Equations with Mixed Matrices. - Satoru Iwata 001; Taihei Oki; Mizuyo Takamatsu (J. ACM, 2019)

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths. - Satoru Iwata 001; Yu Yokoi (SODA, 2020)

Finding a Stable Allocation in Polymatroid Intersection. - Satoru Iwata 001; Yu Yokoi (Math. Oper. Res., 2020)

A Pfaffian formula for matching polynomials of outerplanar graphs. - Satoru Iwata 001 (Optim. Methods Softw., 2021)

Lazy and Fast Greedy MAP Inference for Determinantal Point Process. - Shinichi Hemmi; Taihei Oki; Shinsaku Sakaue; Kaito Fujii; Satoru Iwata 001 (NeurIPS, 2022)

A Weighted Linear Matroid Parity Algorithm. - Satoru Iwata 001; Yusuke Kobayashi 001 (SIAM J. Comput., 2022)

Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance. - Satoru Iwata 001; Taihei Oki; Shinsaku Sakaue (CoRR, 2023)

Finding Maximum Edge-Disjoint Paths Between Multiple Terminals. - Satoru Iwata 001; Yu Yokoi (SIAM J. Comput., 2023)

Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method. - Shinichi Hemmi; Satoru Iwata 001; Taihei Oki (CoRR, 2024)

A Faster Deterministic Algorithm for Mader's 𝒮-Path Packing. - Satoru Iwata 001; Hirota Kinoshita (CoRR, 2024)

Mathematical Framework to Identify Optimal Molecule Based on Virtual Ligand Strategy. - Wataru Matsuoka; Ken Hirose; Ren Yamada; Taihei Oki; Satoru Iwata 001; Satoshi Maeda (J. Chem. Inf. Model., 2025)