| Publication | Date of Publication | Type |
|---|
| 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 | 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 | 2023-10-26 | Paper |
| A Pfaffian formula for matching polynomials of outerplanar graphs | 2021-07-06 | Paper |
| A Weighted Linear Matroid Parity Algorithm | 2021-02-08 | Paper |
| A Blossom Algorithm for Maximum Edge-Disjoint T-Paths | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136215 | 2020-11-25 | Paper |
| Finding a Stable Allocation in Polymatroid Intersection | 2020-04-30 | Paper |
| Index Reduction for Differential-algebraic Equations with Mixed Matrices | 2020-02-11 | Paper |
| List supermodular coloring | 2019-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633864 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633938 | 2019-05-06 | Paper |
| Correction to: ``Counting minimum weight arborescences | 2019-01-11 | Paper |
| Counting minimum weight arborescences | 2018-10-18 | Paper |
| Index Reduction via Unimodular Transformations | 2018-07-20 | Paper |
| Improved Approximation Algorithms for k-Submodular Function Maximization | 2018-07-16 | Paper |
| Finding a Stable Allocation in Polymatroid Intersection | 2018-07-16 | Paper |
| Making Bipartite Graphs DM-Irreducible | 2018-03-05 | Paper |
| Index Reduction for Differential-Algebraic Equations with Mixed Matrices | 2017-12-07 | Paper |
| A weighted linear matroid parity algorithm | 2017-08-17 | Paper |
| On the Kronecker Canonical Form of Singular Mixed Matrix Pencils | 2017-07-13 | Paper |
| Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem | 2017-03-01 | Paper |
| Solving Generalized CDT Problems via Two-Parameter Eigenvalues | 2016-09-02 | Paper |
| Extended formulations for sparsity matroids | 2016-08-25 | Paper |
| A fast cost scaling algorithm for submodular flow | 2016-06-16 | Paper |
| Computing the Signed Distance Between Overlapping Ellipsoids | 2015-11-25 | Paper |
| Graph-TSP from Steiner Cycles | 2015-09-09 | Paper |
| Orientations and detachments of graphs with prescribed degrees and connectivity | 2015-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934712 | 2014-12-18 | Paper |
| A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions | 2014-09-26 | Paper |
| Improved algorithms for submodular function minimization and submodular flow | 2014-09-26 | Paper |
| Submodular Function Minimization under Covering Constraints | 2014-07-25 | Paper |
| Approximating max-min weighted \(T\)-joins | 2014-05-14 | Paper |
| Finding 2-Factors Closer to TSP Tours in Cubic Graphs | 2013-09-26 | Paper |
| Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation | 2013-05-13 | Paper |
| Computational geometric approach to submodular function minimization for multiclass queueing systems | 2012-12-28 | Paper |
| Approximating Minimum Linear Ordering Problems | 2012-11-02 | Paper |
| A flow model based on polylinking system | 2012-10-15 | Paper |
| Tractability index of hybrid equations for circuit simulation | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096724 | 2011-11-11 | Paper |
| Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation | 2011-06-24 | Paper |
| On the Kronecker Canonical Form of Mixed Matrix Pencils | 2011-06-15 | Paper |
| Computing the Degrees of All Cofactors in Mixed Polynomial Matrices | 2010-06-01 | Paper |
| Index characterization of differential-algebraic equations in hybrid analysis for circuit simulation | 2010-05-31 | Paper |
| An algorithm for minimum cost arc-connectivity orientations | 2010-02-23 | Paper |
| Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation | 2010-02-19 | Paper |
| The Independent Even Factor Problem | 2009-11-27 | Paper |
| Recent results on well-balanced orientations | 2008-11-19 | Paper |
| Finding coherent cyclic orders in strong digraphs | 2008-10-21 | Paper |
| Index reduction for differential-algebraic equations by substitution method | 2008-10-06 | Paper |
| Solving linear programs from sign patterns | 2008-06-04 | Paper |
| LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) | 2008-04-29 | Paper |
| Combinatorial Analysis of Singular Matrix Pencils | 2008-03-06 | Paper |
| A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions | 2008-02-11 | Paper |
| Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems | 2007-11-29 | Paper |
| Submodular function minimization | 2007-09-10 | Paper |
| Combinatorial Analysis of Generic Matrix Pencils | 2007-08-30 | Paper |
| Computing the Inertia from Sign Patterns | 2007-08-30 | Paper |
| Computing the inertia from sign patterns | 2007-04-19 | Paper |
| Matroid matching via mixed skew-symmetric matrices | 2006-10-05 | Paper |
| A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow | 2006-06-01 | Paper |
| Bisubmodular Function Minimization | 2006-06-01 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| A capacity scaling algorithm for M-convex submodular flow | 2005-05-12 | Paper |
| A network flow approach to cost allocation for rooted trees | 2005-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829030 | 2004-11-29 | Paper |
| Fast cycle canceling algorithms for minimum cost submodular flow | 2004-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737512 | 2004-08-11 | Paper |
| A constrained independent set problem for matroids | 2004-07-01 | Paper |
| A push-relabel framework for submodular function minimization and applications to parametric optimization | 2003-10-14 | Paper |
| Computing the maximum degree of minors in matrix pencils via combinatorial relaxation | 2003-08-19 | Paper |
| The linear delta-matroid parity problem | 2003-08-17 | Paper |
| A Faster Scaling Algorithm for Minimizing Submodular Functions | 2003-06-19 | Paper |
| Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization | 2003-01-05 | Paper |
| A fully combinatorial algorithm for submodular function minimization. | 2002-12-10 | Paper |
| Locating Sources to Meet Flow Demands in Undirected Networks | 2002-09-11 | Paper |
| A descent method for submodular function minimization | 2002-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537743 | 2002-06-20 | Paper |
| On matroid intersection adjacency | 2002-06-19 | Paper |
| A faster capacity scaling algorithm for minimum cost submodular flow | 2002-01-01 | Paper |
| Minimizing a submodular function arising from a concave function | 2001-12-05 | Paper |
| Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721990 | 2001-07-11 | Paper |
| Combinatorial relaxation algorithm for mixed polynomial matrices | 2001-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761871 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4935243 | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705576 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263717 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250177 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252323 | 1999-01-01 | Paper |
| A fast bipartite network flow algorithm for selective assembly | 1998-12-06 | Paper |
| Patterns that preserve sparsity in orthogonal factorization | 1998-07-08 | Paper |
| A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences | 1998-04-13 | Paper |
| Block triangularization of skew-symmetric matrices | 1998-03-17 | Paper |
| Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants | 1997-10-01 | Paper |
| A capacity scaling algorithm for convex cost submodular flows | 1997-08-07 | Paper |
| A cost-scaling algorithm for \(0-1\) submodular flows | 1997-04-27 | Paper |
| Erratum to: Principal structure of submodular systems and Hitchcock-type independent flows | 1996-12-16 | Paper |
| Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections | 1996-10-29 | Paper |
| A dual approximation approach to weighted matroid intersection | 1996-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875222 | 1996-06-18 | Paper |
| Principal structure of submodular systems and Hitchcock-type independent flows | 1996-05-30 | Paper |
| A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices | 1996-01-24 | Paper |
| \(H_ \infty\) optimal control for symmetric linear systems | 1995-11-16 | Paper |
| A theorem on the principal structure for independent matchings | 1995-08-27 | Paper |
| Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations | 1994-11-16 | Paper |
