| Publication | Date of Publication | Type |
|---|
Bottleneck vehicle routing for planning power supply during disasters
Journal of the Operations Research Society of Japan | 2026-03-20 | Paper |
Rate constant matrix contraction method for stiff master equations with detailed balance
SIAM Journal on Scientific Computing | 2026-02-20 | Paper |
| Index reduction for differential-algebraic equations with mixed matrices | 2024-05-14 | Paper |
Combinatorial and geometric approaches to counting problems on linear matroids, graphic arrangements, and partial orders
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Rate Constant Matrix Contraction Method for Stiff Master Equations with Detailed Balance | 2023-12-09 | Paper |
Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
SIAM Journal on Computing | 2023-10-26 | Paper |
A Pfaffian formula for matching polynomials of outerplanar graphs
Optimization Methods & Software | 2021-07-06 | Paper |
A weighted linear matroid parity algorithm
SIAM Journal on Computing | 2021-02-08 | Paper |
A Blossom Algorithm for Maximum Edge-Disjoint <i>T</i>-Paths
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Weighted linear matroid parity | 2020-11-25 | Paper |
Finding a stable allocation in polymatroid intersection
Mathematics of Operations Research | 2020-04-30 | Paper |
Index Reduction for Differential-algebraic Equations with Mixed Matrices
Journal of the ACM | 2020-02-11 | Paper |
List supermodular coloring
Combinatorica | 2019-06-12 | Paper |
| scientific article; zbMATH DE number 7051294 (Why is no real title available?) | 2019-05-06 | Paper |
| scientific article; zbMATH DE number 7051222 (Why is no real title available?) | 2019-05-06 | Paper |
Correction to: ``Counting minimum weight arborescences''
Algorithmica | 2019-01-11 | Paper |
Counting minimum weight arborescences
Algorithmica | 2018-10-18 | Paper |
Index reduction via unimodular transformations
SIAM Journal on Matrix Analysis and Applications | 2018-07-20 | Paper |
Improved approximation algorithms for \(k\)-submodular function maximization
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Finding a stable allocation in polymatroid intersection
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Making bipartite graphs DM-irreducible
SIAM Journal on Discrete Mathematics | 2018-03-05 | Paper |
Index Reduction for Differential-Algebraic Equations with Mixed Matrices
(available as arXiv preprint) | 2017-12-07 | Paper |
A weighted linear matroid parity algorithm
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
SIAM Journal on Control and Optimization | 2017-07-13 | Paper |
Solving the trust-region subproblem by a generalized eigenvalue problem
SIAM Journal on Optimization | 2017-03-01 | Paper |
Solving generalized CDT problems via two-parameter eigenvalues
SIAM Journal on Optimization | 2016-09-02 | Paper |
Extended formulations for sparsity matroids
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
A fast cost scaling algorithm for submodular flow
Information Processing Letters | 2016-06-16 | Paper |
Computing the signed distance between overlapping ellipsoids
SIAM Journal on Optimization | 2015-11-25 | Paper |
Graph-TSP from Steiner cycles
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Orientations and detachments of graphs with prescribed degrees and connectivity
Discrete Optimization | 2015-04-09 | Paper |
| scientific article; zbMATH DE number 6381750 (Why is no real title available?) | 2014-12-18 | Paper |
Improved algorithms for submodular function minimization and submodular flow
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Submodular Function Minimization under Covering Constraints
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Approximating max-min weighted \(T\)-joins
Operations Research Letters | 2014-05-14 | Paper |
Finding 2-factors closer to TSP tours in cubic graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
Algorithmica | 2013-05-13 | Paper |
Computational geometric approach to submodular function minimization for multiclass queueing systems
Japan Journal of Industrial and Applied Mathematics | 2012-12-28 | Paper |
Approximating Minimum Linear Ordering Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
A flow model based on polylinking system
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Tractability index of hybrid equations for circuit simulation
Mathematics of Computation | 2012-04-26 | Paper |
| Submodular functions: optimization and approximation | 2011-11-11 | Paper |
Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
On the Kronecker canonical form of mixed matrix pencils
SIAM Journal on Matrix Analysis and Applications | 2011-06-15 | Paper |
Computing the degrees of all cofactors in mixed polynomial matrices
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation
International Journal of Circuit Theory and Applications | 2010-05-31 | Paper |
An algorithm for minimum cost arc-connectivity orientations
Algorithmica | 2010-02-23 | Paper |
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
The Independent Even Factor Problem
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Recent results on well-balanced orientations
Discrete Optimization | 2008-11-19 | Paper |
Finding coherent cyclic orders in strong digraphs
Combinatorica | 2008-10-21 | Paper |
Index reduction for differential-algebraic equations by substitution method
Linear Algebra and its Applications | 2008-10-06 | Paper |
Solving linear programs from sign patterns
Mathematical Programming. Series A. Series B | 2008-06-04 | Paper |
LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
Journal of the Operations Research Society of Japan | 2008-04-29 | Paper |
Combinatorial Analysis of Singular Matrix Pencils
SIAM Journal on Matrix Analysis and Applications | 2008-03-06 | Paper |
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM | 2008-02-11 | Paper |
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Submodular function minimization
Mathematical Programming. Series A. Series B | 2007-09-10 | Paper |
Combinatorial Analysis of Generic Matrix Pencils
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Computing the Inertia from Sign Patterns
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Computing the inertia from sign patterns
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Matroid matching via mixed skew-symmetric matrices
Combinatorica | 2006-10-05 | Paper |
Bisubmodular Function Minimization
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
A capacity scaling algorithm for M-convex submodular flow
Mathematical Programming. Series A. Series B | 2005-05-12 | Paper |
A network flow approach to cost allocation for rooted trees
Networks | 2005-01-12 | Paper |
| scientific article; zbMATH DE number 2119755 (Why is no real title available?) | 2004-11-29 | Paper |
Fast cycle canceling algorithms for minimum cost submodular flow
Combinatorica | 2004-10-19 | Paper |
| scientific article; zbMATH DE number 2086909 (Why is no real title available?) | 2004-08-11 | Paper |
A constrained independent set problem for matroids
Operations Research Letters | 2004-07-01 | Paper |
A push-relabel framework for submodular function minimization and applications to parametric optimization
Discrete Applied Mathematics | 2003-10-14 | Paper |
Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
Algorithmica | 2003-08-19 | Paper |
The linear delta-matroid parity problem
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
A Faster Scaling Algorithm for Minimizing Submodular Functions
SIAM Journal on Computing | 2003-06-19 | Paper |
Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization
SIAM Journal on Optimization | 2003-01-05 | Paper |
A fully combinatorial algorithm for submodular function minimization.
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
Locating sources to meet flow demands in undirected networks
Journal of Algorithms | 2002-09-11 | Paper |
A descent method for submodular function minimization
Mathematical Programming. Series A. Series B | 2002-08-20 | Paper |
| scientific article; zbMATH DE number 1757955 (Why is no real title available?) | 2002-06-20 | Paper |
On matroid intersection adjacency
Discrete Mathematics | 2002-06-19 | Paper |
A faster capacity scaling algorithm for minimum cost submodular flow
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
Minimizing a submodular function arising from a concave function
Discrete Applied Mathematics | 2001-12-05 | Paper |
Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1617268 (Why is no real title available?) | 2001-07-11 | Paper |
Combinatorial relaxation algorithm for mixed polynomial matrices
Mathematical Programming. Series A. Series B | 2001-06-26 | Paper |
| scientific article; zbMATH DE number 1568067 (Why is no real title available?) | 2001-02-21 | Paper |
| scientific article; zbMATH DE number 1395409 (Why is no real title available?) | 2000-01-30 | Paper |
| scientific article; zbMATH DE number 1380864 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1342135 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1303553 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1305439 (Why is no real title available?) | 1999-01-01 | Paper |
A fast bipartite network flow algorithm for selective assembly
Operations Research Letters | 1998-12-06 | Paper |
Patterns that preserve sparsity in orthogonal factorization
Linear Algebra and its Applications | 1998-07-08 | Paper |
A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
Mathematics of Operations Research | 1998-04-13 | Paper |
Block triangularization of skew-symmetric matrices
Linear Algebra and its Applications | 1998-03-17 | Paper |
Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants
SIAM Journal on Scientific Computing | 1997-10-01 | Paper |
A capacity scaling algorithm for convex cost submodular flows
Mathematical Programming. Series A. Series B | 1997-08-07 | Paper |
A cost-scaling algorithm for \(0-1\) submodular flows
Discrete Applied Mathematics | 1997-04-27 | Paper |
Erratum to: Principal structure of submodular systems and Hitchcock-type independent flows
Combinatorica | 1996-12-16 | Paper |
Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections
SIAM Journal on Discrete Mathematics | 1996-10-29 | Paper |
A dual approximation approach to weighted matroid intersection
Operations Research Letters | 1996-08-01 | Paper |
| scientific article; zbMATH DE number 871947 (Why is no real title available?) | 1996-06-18 | Paper |
Principal structure of submodular systems and Hitchcock-type independent flows
Combinatorica | 1996-05-30 | Paper |
A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
SIAM Journal on Matrix Analysis and Applications | 1996-01-24 | Paper |
\(H_ \infty\) optimal control for symmetric linear systems
Japan Journal of Industrial and Applied Mathematics | 1995-11-16 | Paper |
A theorem on the principal structure for independent matchings
Discrete Applied Mathematics | 1995-08-27 | Paper |
Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
SIAM Journal on Matrix Analysis and Applications | 1994-11-16 | Paper |
