| Publication | Date of Publication | Type |
|---|
| Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts | 2022-10-14 | Paper |
| Complexity of source-sink monotone 2-parameter min cut | 2022-03-11 | Paper |
| A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards | 2022-02-16 | Paper |
| Matroid optimization problems with monotone monomials in the objective | 2022-01-05 | Paper |
| A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices | 2021-11-04 | Paper |
| Complexity of Source-Sink Monotone 2-Parameter Min Cut | 2021-07-20 | Paper |
| Rerouting Flows when Links Fail | 2020-10-27 | Paper |
| Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005) | 2020-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111420 | 2020-05-27 | Paper |
| A polynomial time algorithm for solving the closest vector problem in zonotopal lattices | 2020-04-16 | Paper |
| Protection of flows under targeted attacks | 2019-02-21 | Paper |
| Matroid optimisation problems with nested non-linear monomials in the objective function | 2018-06-25 | Paper |
| On Integral Policies in Deterministic and Stochastic Distribution Systems | 2018-03-06 | Paper |
| Primal-dual algorithms for precedence constrained covering problems | 2017-10-09 | Paper |
| A fast cost scaling algorithm for submodular flow | 2016-06-16 | Paper |
| Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs | 2015-12-09 | Paper |
| Primal-Dual Algorithms for Precedence Constrained Covering Problems | 2015-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501829 | 2015-08-14 | Paper |
| A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts | 2014-06-02 | Paper |
| Structural and algorithmic properties for parametric minimum cuts | 2012-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3109935 | 2012-01-26 | Paper |
| A Primal-Dual Algorithm for Weighted Abstract Cut Packing | 2011-06-24 | Paper |
| Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation | 2010-09-16 | Paper |
| Separation, dimension, and facet algorithms for node flow polyhedra | 2010-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579438 | 2010-08-06 | Paper |
| Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization | 2010-02-19 | Paper |
| A Polynomial Algorithm for Weighted Abstract Flow | 2008-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5292089 | 2007-06-19 | Paper |
| A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow | 2006-06-01 | Paper |
| Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut | 2006-01-13 | Paper |
| Fast cycle canceling algorithms for minimum cost submodular flow | 2004-10-19 | Paper |
| A faster capacity scaling algorithm for minimum cost submodular flow | 2002-01-01 | Paper |
| Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow | 2001-11-26 | Paper |
| A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952722 | 2001-02-08 | Paper |
| Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks | 2001-01-01 | Paper |
| Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow | 2000-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234154 | 1999-11-14 | 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/Q4228485 | 1999-03-01 | Paper |
| A fast bipartite network flow algorithm for selective assembly | 1998-12-06 | Paper |
| Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications | 1998-02-10 | Paper |
| Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser | 1998-01-26 | Paper |
| How to compute least infeasible flows | 1997-11-25 | Paper |
| Submodular containment is hard, even for networks | 1997-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875223 | 1996-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886036 | 1996-07-28 | Paper |
| Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis | 1995-10-09 | Paper |
| Approximate binary search algorithms for mean cuts and cycles | 1994-12-18 | Paper |
| Computing maximum mean cuts | 1994-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283444 | 1994-05-26 | Paper |
| Two strongly polynomial cut cancelling algorithms for minimum cost network flow | 1994-01-02 | Paper |
| Canceling most helpful total cuts for minimum cost network flow | 1993-06-29 | Paper |
| The Weighted Sparsity Problem: Complexity and Algorithms | 1993-06-29 | Paper |
| A hierarchical algorithm for making sparse matrices sparser | 1993-04-01 | Paper |
| Finding disjoint paths with different path-costs: Complexity and algorithms | 1993-01-17 | Paper |
| On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems | 1992-12-17 | Paper |
| The point-to-point delivery and connection problems: Complexity and algorithms | 1992-09-27 | Paper |
| Integral infeasibility and testing total dual integrality | 1991-01-01 | Paper |
| The complexity of finding two disjoint paths with min-max objective function | 1990-01-01 | Paper |
| Making sparse matrices sparser: Computational results | 1990-01-01 | Paper |
| Sequencing in an Assembly Line with Blocking to Minimize Cycle Time | 1989-01-01 | Paper |
| Conditional covering: greedy heuristics and computational results | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3683420 | 1984-01-01 | Paper |
| Optimal approximation of sparse hessians and its equivalence to a graph coloring problem | 1983-01-01 | Paper |
