| Publication | Date of Publication | Type |
|---|
| Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques | 2025-01-08 | Paper |
| Algorithms and Complexities of Matching Variants in Covariate Balancing | 2024-03-12 | Paper |
| Applications and efficient algorithms for integer programming problems on monotone constraints | 2023-12-11 | Paper |
| Obituary for Professor Emeritus Jakob Kraurp | 2023-07-11 | Paper |
| Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem | 2022-10-04 | Paper |
| HNCcorr: combinatorial optimization for neuron identification | 2022-07-26 | Paper |
| A unified approach for a 1D generalized total variation problem | 2022-06-29 | Paper |
| Network flow methods for the minimum covariate imbalance problem | 2022-03-18 | Paper |
| Complexity, algorithms and applications of the integer network flow with fractional supplies problem | 2021-12-13 | Paper |
| A fully polynomial time approximation scheme for the replenishment storage problem | 2021-04-07 | Paper |
| Adjacency-Clustering and Its Application for Yield Prediction in Integrated Circuit Manufacturing | 2020-11-08 | Paper |
| The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem | 2020-10-26 | Paper |
| An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals | 2020-06-02 | Paper |
| Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer | 2020-04-03 | Paper |
| Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems | 2020-04-01 | Paper |
| Isolation branching: a branch and bound algorithm for the k-terminal cut problem | 2019-10-11 | Paper |
| Algorithms and complexity of range clustering | 2019-03-19 | Paper |
| Dispatch: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals | 2019-01-15 | Paper |
| Complexity and approximations for submodular minimization problems on two variables per inequality constraints | 2018-10-26 | Paper |
| Weighted matching with pair restrictions | 2018-05-28 | Paper |
| Security routing games with multivehicle Chinese postman problem | 2018-05-23 | Paper |
| A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems | 2018-01-10 | Paper |
| Range contracts: risk sharing and beyond | 2016-10-06 | Paper |
| An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane | 2016-09-01 | Paper |
| Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems | 2014-12-05 | Paper |
| Evaluating performance of image segmentation criteria and techniques | 2014-09-30 | Paper |
| Experimental analysis of the MRF algorithm for segmentation of noisy medical images | 2013-12-11 | Paper |
| Multi-label Markov random fields as an efficient and effective tool for image segmentation, total variations and regularization | 2013-11-19 | Paper |
| Simplifications and speedups of the pseudoflow algorithm | 2013-08-06 | Paper |
| A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant | 2013-07-02 | Paper |
| The bounded cycle-cover problem | 2012-05-30 | Paper |
| Rating customers according to their promptness to adopt new products | 2012-03-26 | Paper |
| Solving the Convex Cost Integer Dual Network Flow Problem | 2012-02-19 | Paper |
| Capacity Acquisition, Subcontracting, and Lot Sizing | 2012-02-19 | Paper |
| Nuclear threat detection with mobile distributed sensor networks | 2011-11-17 | Paper |
| Complexity of some inverse shortest path lengths problems | 2010-11-24 | Paper |
| How to allocate review tasks for robust ranking | 2010-10-08 | Paper |
| A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem | 2010-03-06 | Paper |
| Covering the edges of bipartite graphs using \(K_{2,2}\) graphs | 2009-12-01 | Paper |
| The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem | 2009-08-13 | Paper |
| TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time | 2009-08-13 | Paper |
| The multi‐integer set cover and the facility terminal cover problem | 2009-07-28 | Paper |
| Efficient Algorithms for the Inverse Spanning-Tree Problem | 2009-07-09 | Paper |
| Country credit-risk rating aggregation via the separation-deviation model† | 2009-02-23 | Paper |
| Dynamic evolution of economically preferred facilities | 2008-11-18 | Paper |
| The inequality-satisfiability problem | 2008-08-06 | Paper |
| Complexity and algorithms for nonlinear optimization problems | 2008-03-31 | Paper |
| The k-Allocation Problem and Its Variants | 2008-02-21 | Paper |
| Covering the Edges of Bipartite Graphs Using K 2,2 Graphs | 2008-02-20 | Paper |
| An efficient algorithm for image segmentation, Markov random fields and related problems | 2008-02-11 | Paper |
| Optimizing over Consecutive 1's and Circular 1's Constraints | 2007-05-22 | Paper |
| Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms | 2007-02-20 | Paper |
| Complexity and algorithms for convex network optimization and other nonlinear problems | 2006-03-09 | Paper |
| A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem | 2004-12-13 | Paper |
| Monotonizing linear programs with up to two nonzeroes per column | 2004-07-01 | Paper |
| Minimizing a Convex Cost Closure Set | 2004-01-08 | Paper |
| The SONET edge‐partition problem | 2003-03-10 | Paper |
| Minimax problems with bitonic matrices | 2002-12-17 | Paper |
| A new-old algorithm for minimum-cut and maximum-flow in closure graphs. | 2002-07-30 | Paper |
| Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753721 | 2002-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753941 | 2001-12-18 | Paper |
| Approximating a generalization of MAX 2SAT and MIN 2SAT | 2001-10-30 | Paper |
| A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine | 2001-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4255028 | 2000-06-27 | Paper |
| A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs | 1999-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263700 | 1999-09-22 | Paper |
| Generalized \(p\)-center problems: Complexity results and approximation algorithms | 1999-08-24 | Paper |
| A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources | 1999-01-01 | Paper |
| Approximating Clique and Biclique Problems | 1998-11-11 | Paper |
| Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime | 1998-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3840369 | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400849 | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400848 | 1998-08-02 | Paper |
| \(k\)-edge subgraph problems | 1997-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344458 | 1997-07-15 | Paper |
| An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane | 1997-05-29 | Paper |
| Scheduling with batching: Two job types | 1997-04-21 | Paper |
| Approximation Algorithms for the k-Clique Covering Problem | 1997-02-26 | Paper |
| On the Complexity of the Production-Transportation Problem | 1996-05-13 | Paper |
| About strongly polynomial time algorithms for quadratic optimization over submodular constraints | 1996-04-10 | Paper |
| A nonlinear knapsack problem | 1996-01-16 | Paper |
| Approximation Algorithms for Network Design Problems on Bounded Subsets | 1996-01-01 | Paper |
| Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems | 1995-09-14 | Paper |
| Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality | 1995-04-06 | Paper |
| Scheduling with batching: Minimizing the weighted number of tardy jobs | 1995-01-11 | Paper |
| Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources | 1994-12-12 | Paper |
| A modified greedy heuristic for the set covering problem with improved worst case bound | 1994-09-25 | Paper |
| A Polynomial Algorithm for the k-cut Problem for Fixed k | 1994-05-18 | Paper |
| The empirical performance of a polynomial algorithm for constrained nonlinear optimization | 1994-01-06 | Paper |
| Why should biconnected components be identified first | 1993-06-29 | Paper |
| The multicovering problem | 1993-04-01 | Paper |
| A polynomial algorithm for an integer quadratic non-separable transportation problem | 1993-01-16 | Paper |
| An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs | 1993-01-05 | Paper |
| Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality | 1993-01-01 | Paper |
| Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem | 1992-06-26 | Paper |
| Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph | 1992-06-25 | Paper |
| A Fast Perfect-Matching Algorithm in Random Graphs | 1990-01-01 | Paper |
| Minimizing the number of tardy job units under release time constraints | 1990-01-01 | Paper |
| Convex separable optimization is not much harder than linear optimization | 1990-01-01 | Paper |
| Analysis of a flow problem with fixed charges | 1989-01-01 | Paper |
| An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem | 1989-01-01 | Paper |
| An algorithm for the detection and construction of Monge sequences | 1989-01-01 | Paper |
| A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815886 | 1988-01-01 | Paper |
| Fast approximation algorithms for a nonconvex covering problem | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761689 | 1986-01-01 | Paper |
| OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing | 1986-01-01 | Paper |
| A Packing Problem You Can Almost Solve by Sitting on Your Suitcase | 1986-01-01 | Paper |
| A fast approximation algorithm for the multicovering problem | 1986-01-01 | Paper |
| A better than “best possible” algorithm to edge color multigraphs | 1986-01-01 | Paper |
| Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem | 1986-01-01 | Paper |
| The linzertorte problem, or a unified approach to painting, baking and weaving | 1986-01-01 | Paper |
| A Best Possible Heuristic for the k-Center Problem | 1985-01-01 | Paper |
| Approximation schemes for covering and packing problems in image processing and VLSI | 1985-01-01 | Paper |
| An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3675519 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824076 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3221406 | 1984-01-01 | Paper |
| Efficient bounds for the stable set, vertex cover and set packing problems | 1983-01-01 | Paper |
| On the Fractional Solution to the Set Covering Problem | 1983-01-01 | Paper |
| Approximation Algorithms for the Set Covering and Vertex Cover Problems | 1982-01-01 | Paper |
| Heuristics for the fixed cost median problem | 1982-01-01 | Paper |
| Steinhaus's geometric location problem for random samples in the plane | 1982-01-01 | Paper |
| Database Location in Computer Networks | 1980-01-01 | Paper |
| Probabilistic Analysis of the Planar k-Median Problem | 1980-01-01 | Paper |
