The following pages link to Satoru Iwata (Q185376):
Displayed 50 items.
- (Q3096724) (← links)
- A network flow approach to cost allocation for rooted trees (Q3157039) (← links)
- Approximating Minimum Linear Ordering Problems (Q3167397) (← links)
- Index Reduction via Unimodular Transformations (Q3176353) (← links)
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions (Q3191976) (← links)
- Improved algorithms for submodular function minimization and submodular flow (Q3191977) (← links)
- Computing the Signed Distance Between Overlapping Ellipsoids (Q3454510) (← links)
- Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation (Q3563603) (← links)
- Computing the Degrees of All Cofactors in Mixed Polynomial Matrices (Q3563931) (← links)
- Combinatorial Analysis of Generic Matrix Pencils (Q3596338) (← links)
- Computing the Inertia from Sign Patterns (Q3596342) (← links)
- The Independent Even Factor Problem (Q3648506) (← links)
- (Q4250177) (← links)
- (Q4252323) (← links)
- (Q4263717) (← links)
- Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations (Q4313375) (← links)
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences (Q4385162) (← links)
- (Q4537743) (← links)
- Improved Approximation Algorithms for <i>k</i>-Submodular Function Maximization (Q4575607) (← links)
- Finding a Stable Allocation in Polymatroid Intersection (Q4575653) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- (Q4633864) (← links)
- (Q4633938) (← links)
- (Q4705576) (← links)
- A Faster Scaling Algorithm for Minimizing Submodular Functions (Q4706234) (← links)
- (Q4737512) (← links)
- (Q4761871) (← links)
- Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization (Q4785876) (← links)
- (Q4829030) (← links)
- A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices (Q4842560) (← links)
- (Q4875222) (← links)
- Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections (Q4875437) (← links)
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants (Q4891748) (← links)
- (Q4935243) (← links)
- A weighted linear matroid parity algorithm (Q4977977) (← links)
- A Pfaffian formula for matching polynomials of outerplanar graphs (Q4999332) (← links)
- Finding a Stable Allocation in Polymatroid Intersection (Q5108257) (← links)
- (Q5136215) (← links)
- A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths (Q5146904) (← links)
- A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
- Submodular Function Minimization under Covering Constraints (Q5171203) (← links)
- Index Reduction for Differential-algebraic Equations with Mixed Matrices (Q5215464) (← links)
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils (Q5278177) (← links)
- LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385036) (← links)
- Tractability index of hybrid equations for circuit simulation (Q5389439) (← links)
- Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems (Q5429273) (← links)
- Combinatorial Analysis of Singular Matrix Pencils (Q5446462) (← links)
- A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow (Q5470761) (← links)
- Bisubmodular Function Minimization (Q5470810) (← links)
- Integer Programming and Combinatorial Optimization (Q5712466) (← links)