Satoru Iwata

Orcid: 0000-0002-6467-1335

Affiliations:
  • University of Tokyo, Department of Mathematical Informatics, Japan


According to our database1, Satoru Iwata authored at least 96 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method.
CoRR, 2024

2023
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals.
SIAM J. Comput., October, 2023

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

2022
A Weighted Linear Matroid Parity Algorithm.
SIAM J. Comput., 2022

Lazy and Fast Greedy MAP Inference for Determinantal Point Process.
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.
Optim. Methods Softw., 2021

2020
Finding a Stable Allocation in Polymatroid Intersection.
Math. Oper. Res., 2020

A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Index Reduction for Differential-algebraic Equations with Mixed Matrices.
J. ACM, 2019

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

Correction to: Counting Minimum Weight Arborescences.
Algorithmica, 2019

2018
Index Reduction via Unimodular Transformations.
SIAM J. Matrix Anal. Appl., 2018

Making Bipartite Graphs DM-Irreducible.
SIAM J. Discret. Math., 2018

List Supermodular Coloring.
Comb., 2018

Counting Minimum Weight Arborescences.
Algorithmica, 2018

2017
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem.
SIAM J. Optim., 2017

On the Kronecker Canonical Form of Singular Mixed Matrix Pencils.
SIAM J. Control. Optim., 2017

Household energy consumption prediction by feature selection of lifestyle data.
Proceedings of the 2017 IEEE International Conference on Smart Grid Communications, 2017

Weighted Linear Matroid Parity.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Solving Generalized CDT Problems via Two-Parameter Eigenvalues.
SIAM J. Optim., 2016

Extended formulations for sparsity matroids.
Math. Program., 2016

Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Cyber Security Analysis of Power Networks by Hypergraph Cut Algorithms.
IEEE Trans. Smart Grid, 2015

Computing the Signed Distance Between Overlapping Ellipsoids.
SIAM J. Optim., 2015

Improved Approximation Algorithms for k-Submodular Function Maximization.
CoRR, 2015

2014
Chemical Structure Elucidation from <sup>13</sup>C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms.
J. Chem. Inf. Model., 2014

Orientations and detachments of graphs with prescribed degrees and connectivity.
Discret. Optim., 2014

Graph-TSP from Steiner Cycles.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Exact SVM training by Wolfe's minimum norm point algorithm.
Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing, 2014

Global Optimization Methods for Extended Fisher Discriminant Analysis.
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014

2013
Finding 2-Factors Closer to TSP Tours in Cubic Graphs.
SIAM J. Discret. Math., 2013

Approximating max-min weighted T-joins.
Oper. Res. Lett., 2013

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

2012
A flow model based on polylinking system.
Math. Program., 2012

Tractability index of hybrid equations for circuit simulation.
Math. Comput., 2012

Learning Valuation Functions.
Proceedings of the COLT 2012, 2012

Approximating Minimum Linear Ordering Problems.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
On the Kronecker Canonical Form of Mixed Matrix Pencils.
SIAM J. Matrix Anal. Appl., 2011

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

2010
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation.
Math. Program., 2010

Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation.
Int. J. Circuit Theory Appl., 2010

An Algorithm for Minimum Cost Arc-Connectivity Orientations.
Algorithmica, 2010

Minimum Average Cost Clustering.
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.
SIAM J. Discret. Math., 2009

A simple combinatorial algorithm for submodular function minimization.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Approximating submodular functions everywhere.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Submodular Function Minimization under Covering Constraints.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

An algorithmic framework for wireless information flow.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
The Independent Even Factor Problem.
SIAM J. Discret. Math., 2008

Solving linear programs from sign patterns.
Math. Program., 2008

Submodular function minimization.
Math. Program., 2008

Recent results on well-balanced orientations.
Discret. Optim., 2008

Finding coherent cyclic orders in strong digraphs.
Comb., 2008

2007
Computing the inertia from sign patterns.
Math. Program., 2007

Algorithm for Advanced Canonical Coding of Planar Chemical Structures That Considers Stereochemical and Symmetric Information.
J. Chem. Inf. Model., 2007

Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2007

2006
Combinatorial Analysis of Singular Matrix Pencils.
SIAM J. Matrix Anal. Appl., 2006

2005
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow.
SIAM J. Discret. Math., 2005

Bisubmodular Function Minimization.
SIAM J. Discret. Math., 2005

A capacity scaling algorithm for M-convex submodular flow.
Math. Program., 2005

Matroid Matching Via Mixed Skew-Symmetric Matrices.
Comb., 2005

Combinatorial Analysis of Generic Matrix Pencils.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004
A constrained independent set problem for matroids.
Oper. Res. Lett., 2004

A network flow approach to cost allocation for rooted trees.
Networks, 2004

2003
A Faster Scaling Algorithm for Minimizing Submodular Functions.
SIAM J. Comput., 2003

The linear delta-matroid parity problem.
J. Comb. Theory B, 2003

A push-relabel framework for submodular function minimization and applications to parametric optimization.
Discret. Appl. Math., 2003

Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*.
Comb., 2003

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

2002
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization.
SIAM J. Optim., 2002

A descent method for submodular function minimization.
Math. Program., 2002

A faster capacity scaling algorithm for minimum cost submodular flow.
Math. Program., 2002

A Fully Combinatorial Algorithm for Submodular Function Minimization.
J. Comb. Theory B, 2002

Locating Sources to Meet Flow Demands in Undirected Networks.
J. Algorithms, 2002

On matroid intersection adjacency.
Discret. Math., 2002

2001
Combinatorial relaxation algorithm for mixed polynomial matrices.
Math. Program., 2001

A combinatorial strongly polynomial algorithm for minimizing submodular functions.
J. ACM, 2001

2000
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.
Math. Oper. Res., 2000

A fast cost scaling algorithm for submodular flow.
Inf. Process. Lett., 2000

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Improved algorithms for submodular function minimization and submodular flow.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
Minimizing a Submodular Function Arising From a Concave Function.
Discret. Appl. Math., 1999

A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998
A fast bipartite network flow algorithm for selective assembly.
Oper. Res. Lett., 1998

A Faster Algorithm for Minimum Cost Submodular Flows.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences.
Math. Oper. Res., 1997

A Cost-scaling Algorithm for 0-1 Submodular Flows.
Discret. Appl. Math., 1997

1996
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants.
SIAM J. Sci. Comput., 1996

Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections.
SIAM J. Discret. Math., 1996

A capacity scaling algorithm for convex cost submodular flows.
Math. Program., 1996

Combinatorial and Geometric Approaches to Counting Problems on Linear Matroids, Graphic Arrangements, and Partial Orders.
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.
SIAM J. Matrix Anal. Appl., 1995

A dual approximation approach to weighted matroid intersection.
Oper. Res. Lett., 1995

A Theorem on the Principal Structure for Independent Matchings.
Discret. Appl. Math., 1995

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

1994
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations.
SIAM J. Matrix Anal. Appl., October, 1994


  Loading...