Satoru Iwata

From MaRDI portal
Person:185376

Available identifiers

zbMath Open iwata.satoruMaRDI QIDQ185376

List of research outcomes

PublicationDate of PublicationType
Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders2024-01-29Paper
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals2023-10-26Paper
A Pfaffian formula for matching polynomials of outerplanar graphs2021-07-06Paper
A Weighted Linear Matroid Parity Algorithm2021-02-08Paper
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths2021-02-02Paper
https://portal.mardi4nfdi.de/entity/Q51362152020-11-25Paper
Finding a Stable Allocation in Polymatroid Intersection2020-04-30Paper
Index Reduction for Differential-algebraic Equations with Mixed Matrices2020-02-11Paper
List supermodular coloring2019-06-12Paper
https://portal.mardi4nfdi.de/entity/Q46338642019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46339382019-05-06Paper
Correction to: ``Counting minimum weight arborescences2019-01-11Paper
Counting minimum weight arborescences2018-10-18Paper
Index Reduction via Unimodular Transformations2018-07-20Paper
Improved Approximation Algorithms for k-Submodular Function Maximization2018-07-16Paper
Finding a Stable Allocation in Polymatroid Intersection2018-07-16Paper
Making Bipartite Graphs DM-Irreducible2018-03-05Paper
Index Reduction for Differential-Algebraic Equations with Mixed Matrices2017-12-07Paper
A weighted linear matroid parity algorithm2017-08-17Paper
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils2017-07-13Paper
Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem2017-03-01Paper
Solving Generalized CDT Problems via Two-Parameter Eigenvalues2016-09-02Paper
Extended formulations for sparsity matroids2016-08-25Paper
A fast cost scaling algorithm for submodular flow2016-06-16Paper
Computing the Signed Distance Between Overlapping Ellipsoids2015-11-25Paper
Graph-TSP from Steiner Cycles2015-09-09Paper
Orientations and detachments of graphs with prescribed degrees and connectivity2015-04-09Paper
https://portal.mardi4nfdi.de/entity/Q29347122014-12-18Paper
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions2014-09-26Paper
Improved algorithms for submodular function minimization and submodular flow2014-09-26Paper
Submodular Function Minimization under Covering Constraints2014-07-25Paper
Approximating max-min weighted \(T\)-joins2014-05-14Paper
Finding 2-Factors Closer to TSP Tours in Cubic Graphs2013-09-26Paper
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation2013-05-13Paper
Computational geometric approach to submodular function minimization for multiclass queueing systems2012-12-28Paper
Approximating Minimum Linear Ordering Problems2012-11-02Paper
A flow model based on polylinking system2012-10-15Paper
Tractability index of hybrid equations for circuit simulation2012-04-26Paper
https://portal.mardi4nfdi.de/entity/Q30967242011-11-11Paper
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation2011-06-24Paper
On the Kronecker Canonical Form of Mixed Matrix Pencils2011-06-15Paper
Computing the Degrees of All Cofactors in Mixed Polynomial Matrices2010-06-01Paper
Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation2010-05-31Paper
An algorithm for minimum cost arc-connectivity orientations2010-02-23Paper
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation2010-02-19Paper
The Independent Even Factor Problem2009-11-27Paper
Recent results on well-balanced orientations2008-11-19Paper
Finding coherent cyclic orders in strong digraphs2008-10-21Paper
Index reduction for differential-algebraic equations by substitution method2008-10-06Paper
Solving linear programs from sign patterns2008-06-04Paper
LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)2008-04-29Paper
Combinatorial Analysis of Singular Matrix Pencils2008-03-06Paper
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions2008-02-11Paper
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems2007-11-29Paper
Submodular function minimization2007-09-10Paper
Combinatorial Analysis of Generic Matrix Pencils2007-08-30Paper
Computing the Inertia from Sign Patterns2007-08-30Paper
Computing the inertia from sign patterns2007-04-19Paper
Matroid matching via mixed skew-symmetric matrices2006-10-05Paper
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow2006-06-01Paper
Bisubmodular Function Minimization2006-06-01Paper
Integer Programming and Combinatorial Optimization2005-12-23Paper
A capacity scaling algorithm for M-convex submodular flow2005-05-12Paper
A network flow approach to cost allocation for rooted trees2005-01-12Paper
https://portal.mardi4nfdi.de/entity/Q48290302004-11-29Paper
Fast cycle canceling algorithms for minimum cost submodular flow2004-10-19Paper
https://portal.mardi4nfdi.de/entity/Q47375122004-08-11Paper
A constrained independent set problem for matroids2004-07-01Paper
A push-relabel framework for submodular function minimization and applications to parametric optimization2003-10-14Paper
Computing the maximum degree of minors in matrix pencils via combinatorial relaxation2003-08-19Paper
The linear delta-matroid parity problem2003-08-17Paper
A Faster Scaling Algorithm for Minimizing Submodular Functions2003-06-19Paper
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization2003-01-05Paper
A fully combinatorial algorithm for submodular function minimization.2002-12-10Paper
Locating Sources to Meet Flow Demands in Undirected Networks2002-09-11Paper
A descent method for submodular function minimization2002-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45377432002-06-20Paper
On matroid intersection adjacency2002-06-19Paper
A faster capacity scaling algorithm for minimum cost submodular flow2002-01-01Paper
Minimizing a submodular function arising from a concave function2001-12-05Paper
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q27219902001-07-11Paper
Combinatorial relaxation algorithm for mixed polynomial matrices2001-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47618712001-02-21Paper
https://portal.mardi4nfdi.de/entity/Q49352432000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q47055761999-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42637171999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42501771999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42523231999-01-01Paper
A fast bipartite network flow algorithm for selective assembly1998-12-06Paper
Patterns that preserve sparsity in orthogonal factorization1998-07-08Paper
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences1998-04-13Paper
Block triangularization of skew-symmetric matrices1998-03-17Paper
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants1997-10-01Paper
A capacity scaling algorithm for convex cost submodular flows1997-08-07Paper
A cost-scaling algorithm for \(0-1\) submodular flows1997-04-27Paper
Erratum to: Principal structure of submodular systems and Hitchcock-type independent flows1996-12-16Paper
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections1996-10-29Paper
A dual approximation approach to weighted matroid intersection1996-08-01Paper
https://portal.mardi4nfdi.de/entity/Q48752221996-06-18Paper
Principal structure of submodular systems and Hitchcock-type independent flows1996-05-30Paper
A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices1996-01-24Paper
\(H_ \infty\) optimal control for symmetric linear systems1995-11-16Paper
A theorem on the principal structure for independent matchings1995-08-27Paper
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations1994-11-16Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Satoru Iwata