Satoru Iwata
Orcid: 0000-0002-6467-1335Affiliations:
- 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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method.
CoRR, 2024
2023
SIAM J. Comput., October, 2023
Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance.
CoRR, 2023
2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
2021
Optim. Methods Softw., 2021
2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
2019
J. ACM, 2019
CoRR, 2019
2018
2017
SIAM J. Optim., 2017
SIAM J. Control. Optim., 2017
Proceedings of the 2017 IEEE International Conference on Smart Grid Communications, 2017
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
IEEE Trans. Smart Grid, 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
Discret. Optim., 2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Proceedings of the IEEE International Workshop on Machine Learning for Signal Processing, 2014
Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, 2014
2013
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation.
Algorithmica, 2013
2012
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012
2011
SIAM J. Matrix Anal. Appl., 2011
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
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
SIAM J. Discret. Math., 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Proceedings of the 47th Annual Allerton Conference on Communication, 2009
2008
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
2005
SIAM J. Discret. Math., 2005
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
2004
2003
SIAM J. Comput., 2003
A push-relabel framework for submodular function minimization and applications to parametric optimization.
Discret. Appl. Math., 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
Math. Program., 2002
J. Comb. Theory B, 2002
2001
Math. Program., 2001
J. ACM, 2001
2000
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow.
Math. Oper. Res., 2000
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
1999
Discret. Appl. Math., 1999
Proceedings of the Integer Programming and Combinatorial Optimization, 1999
1998
Oper. Res. Lett., 1998
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
1997
Math. Oper. Res., 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
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
Oper. Res. Lett., 1995
Discret. Appl. Math., 1995
Comb., 1995
1994
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations.
SIAM J. Matrix Anal. Appl., October, 1994