| Publication | Date of Publication | Type |
|---|
| Knapsack problems with position-dependent item weights or profits | 2023-07-31 | Paper |
| Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint | 2023-06-07 | Paper |
| Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs | 2022-10-24 | Paper |
| Strongly polynomial FPTASes for monotone dynamic programs | 2022-10-06 | Paper |
| An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences | 2022-04-22 | Paper |
| Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier | 2021-12-01 | Paper |
| A faster FPTAS for counting two-rowed contingency tables | 2021-09-15 | Paper |
| Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions | 2021-06-16 | Paper |
| Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs | 2021-02-01 | Paper |
| A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times | 2020-12-11 | Paper |
| An FPTAS for the knapsack problem with parametric weights | 2020-02-10 | Paper |
| Bi-criteria path problem with minimum length and maximum survival probability | 2020-01-15 | Paper |
| Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States | 2019-05-07 | Paper |
| The TV advertisements scheduling problem | 2019-03-21 | Paper |
| On the complexity of energy storage problems | 2018-08-17 | Paper |
| Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints | 2018-07-12 | Paper |
| Approximating convex functions via non-convex oracles under the relative noise model | 2018-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636439 | 2018-04-19 | Paper |
| A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs | 2017-01-13 | Paper |
| A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy | 2016-08-31 | Paper |
| Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs | 2015-04-17 | Paper |
| A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs | 2013-09-17 | Paper |
| Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle | 2012-10-01 | Paper |
| A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand | 2011-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579452 | 2010-08-06 | Paper |
| Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks | 2009-08-14 | Paper |
| A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane | 2009-03-23 | Paper |
| On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model | 2009-03-16 | Paper |
| Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks | 2008-11-27 | Paper |
| Discrete and lexicographic Helly-type theorems | 2008-08-19 | Paper |
| Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems | 2007-11-28 | Paper |
| The convex dimension of a graph | 2007-07-19 | Paper |
| One-way and round-trip center location problems | 2005-10-10 | Paper |
| Continuous bottleneck tree partitioning problems | 2004-08-06 | Paper |
