| Publication | Date of Publication | Type |
|---|
| Worst-case analysis for on-line data compression | 2024-07-05 | Paper |
| Fair allocation algorithms for indivisible items under structured conflict constraints | 2023-10-02 | Paper |
| Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs | 2023-07-13 | Paper |
| Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case | 2023-07-04 | Paper |
| One-dimensional stock cutting resilient against singular random defects | 2023-07-03 | Paper |
| Approximating single- and multi-objective nonlinear sum and product knapsack problems | 2023-06-30 | Paper |
| Allocation of indivisible items with individual preference graphs | 2023-05-11 | Paper |
| Fair allocation of indivisible items with conflict graphs | 2023-04-28 | Paper |
| Allocating indivisible items with minimum dissatisfaction on preference graphs | 2023-03-31 | Paper |
| Fair Packing of Independent Sets | 2022-10-13 | Paper |
| The random linear bottleneck assignment problem | 2022-08-30 | Paper |
| Optimally rescheduling jobs with a last-in-first-out buffer | 2022-01-14 | Paper |
| Approximating the product knapsack problem | 2021-09-28 | Paper |
| On the Stackelberg knapsack game | 2021-06-04 | Paper |
| Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem | 2020-09-29 | Paper |
| Fair allocation of indivisible items with conflict graphs | 2020-03-25 | Paper |
| A Stackelberg knapsack game with weight control | 2019-11-13 | Paper |
| Geometric and LP-based heuristics for angular travelling salesman problems in the plane | 2019-07-08 | Paper |
| On approximating the incremental knapsack problem | 2019-06-20 | Paper |
| Approximating the 3-period incremental knapsack problem | 2019-01-18 | Paper |
| New exact approaches and approximation results for the penalized knapsack problem | 2018-12-18 | Paper |
| Integer optimization with penalized fractional values: the knapsack case | 2018-12-06 | Paper |
| Approximation results for the incremental knapsack problem | 2018-06-15 | Paper |
| Price of fairness for allocating a bounded resource | 2018-05-24 | Paper |
| Improved dynamic programming and approximation results for the knapsack problem with setups | 2018-05-22 | Paper |
| Competitive multi-agent scheduling with an iterative selection rule | 2018-04-13 | Paper |
| The core concept for the Multidimensional Knapsack problem | 2018-04-12 | Paper |
| Personnel Planning with Multi-tasking and Structured Qualifications | 2017-12-01 | Paper |
| The shortest connection game | 2017-09-12 | Paper |
| Approximation of knapsack problems with conflict and forcing graphs | 2017-08-03 | Paper |
| Minimization and maximization versions of the quadratic travelling salesman problem | 2017-07-12 | Paper |
| Generating subtour elimination constraints for the TSP from pure integer solutions | 2017-06-21 | Paper |
| Maximin fairness in project budget allocation | 2017-02-14 | Paper |
| Linear models and computational experiments for the quadratic TSP | 2017-02-14 | Paper |
| On the shortest path game | 2016-12-22 | Paper |
| Exact solution of the robust knapsack problem | 2016-11-10 | Paper |
| Approximation of the Quadratic Knapsack Problem | 2016-08-12 | Paper |
| The Subset Sum game | 2016-06-24 | Paper |
| Scheduling two agent task chains with a central selection mechanism | 2015-07-28 | Paper |
| Two agent scheduling with a central selection mechanism | 2015-07-24 | Paper |
| The Shortest Path Game: Complexity and Algorithms | 2014-09-15 | Paper |
| Approximating the Quadratic Knapsack Problem on Special Graph Classes | 2014-09-02 | Paper |
| On the Robust Knapsack Problem | 2014-04-09 | Paper |
| Two Agents Competing for a Shared Machine | 2013-12-17 | Paper |
| A two-period portfolio selection model for Asset-Backed Securitization | 2013-12-11 | Paper |
| Strategies in competing subset selection | 2013-09-16 | Paper |
| The maximum flow problem with disjunctive constraints | 2013-08-09 | Paper |
| Committee selection under weight constraints | 2012-09-11 | Paper |
| The multidimensional knapsack problem: structure and algorithms | 2012-07-28 | Paper |
| Approximating Multiobjective Knapsack Problems | 2012-02-19 | Paper |
| Competitive subset selection with two agents | 2011-10-27 | Paper |
| Paths, trees and matchings under disjunctive constraints | 2011-10-27 | Paper |
| The Maximum Flow Problem with Conflict and Forcing Conditions | 2011-09-09 | Paper |
| ILP Models for a Nurse Scheduling Problem | 2011-04-07 | Paper |
| A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks | 2011-04-07 | Paper |
| Finding socially best spanning treesî | 2011-04-05 | Paper |
| Resource allocation with time intervals | 2010-11-19 | Paper |
| A note on maximizing the minimum voter satisfaction on spanning trees | 2010-09-07 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Modified subset sum heuristics for bin packing | 2009-12-18 | Paper |
| Inverse 1-center location problems with edge length augmentation on trees | 2009-12-11 | Paper |
| Determining a Minimum Spanning Tree with Disjunctive Constraints | 2009-11-17 | Paper |
| Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals | 2009-11-17 | Paper |
| Subset Weight Maximization with Two Competing Agents | 2009-11-17 | Paper |
| The Knapsack Problem with Conflict Graphs | 2009-10-21 | Paper |
| Maximizing the minimum voter satisfaction on spanning trees | 2009-10-15 | Paper |
| The traveling group problem | 2007-10-11 | Paper |
| An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem | 2006-01-13 | Paper |
| Improved dynamic programming in connection with an FPTAS for the knapsack problem | 2005-03-15 | Paper |
| Securitization of financial assets: approximation in theory and practice | 2005-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4821303 | 2004-10-12 | Paper |
| Approximation schemes for ordered vector packing problems | 2004-03-15 | Paper |
| Worst-case analysis of the subset sum algorithm for bin packing. | 2004-01-05 | Paper |
| A 3/4-approximation algorithm for multiple subset sum | 2003-08-28 | Paper |
| An efficient fully polynomial approximation scheme for the Subset-Sum problem. | 2003-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780784 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778556 | 2002-11-18 | Paper |
| A PTAS for the multiple subset sum problem with different knapsack capacities | 2002-07-25 | Paper |
| The multiple subset sum problem | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4492899 | 2000-07-27 | Paper |
| Approximation algorithms for knapsack problems with cardinality constraints | 2000-07-09 | Paper |
| Dynamic programming revisited: Improving knapsack algorithms | 2000-03-16 | Paper |
| Cardinality constrained bin-packing problems | 2000-01-11 | Paper |
| Stochastic analysis of greedy algorithms for the subset sum problem | 1999-11-08 | Paper |
| A new fully polynomial time approximation scheme for the Knapsack problem | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4233409 | 1999-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4210638 | 1998-09-24 | Paper |
| Greedy Algorithms for On-Line Data Compression | 1998-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4400850 | 1998-08-02 | Paper |
| The inverse-parametric knapsack problem | 1998-06-11 | Paper |
| Solution methods and computational investigations for the linear bottleneck assignment problem | 1998-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370212 | 1998-01-14 | Paper |
| Simple but efficient approaches for the collapsing knapsack problem | 1997-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126749 | 1997-04-01 | Paper |
| The random linear bottleneck assignment problem | 1997-01-07 | Paper |
| The fractional greedy algorithm for data compression | 1996-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4836291 | 1995-07-25 | Paper |
| Monge matrices make maximization manageable | 1995-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311199 | 1994-11-08 | Paper |
| Linear programs with an additional rank two reverse convex constraint | 1994-06-19 | Paper |
| Operational Research: Methods and Applications | N/A | Paper |
