| Publication | Date of Publication | Type |
|---|
| Curved detonation equations with analysis and its applications | 2024-12-04 | Paper |
| Three-stage assembly flow shop scheduling problem with a fixed maintenance period | 2024-05-23 | Paper |
| An improved approximation algorithm for a scheduling problem with transporter coordination | 2024-04-02 | Paper |
| A modified inverse-free dynamical system for absolute value equations | 2024-01-15 | Paper |
| Flow shop scheduling problems with transportation constraints revisited | 2024-01-08 | Paper |
| Flow shop scheduling problems with transportation constraints revisited | 2023-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875590 | 2023-02-03 | Paper |
| A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\) | 2022-10-18 | Paper |
| Open shop scheduling problem with a non-resumable flexible maintenance period | 2022-06-29 | Paper |
| A PTAS for non-resumable open shop scheduling with an availability constraint | 2022-04-13 | Paper |
| Approximation algorithms for two-stage flexible flow shop scheduling | 2020-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5195670 | 2019-10-02 | Paper |
| Unit cost buyback problem | 2019-09-05 | Paper |
| Online knapsack problem under concave functions | 2019-08-20 | Paper |
| Proportional cost buyback problem with weight bounds | 2019-06-25 | Paper |
| Online Knapsack Problem Under Concave Functions | 2019-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4623631 | 2019-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4613673 | 2019-01-24 | Paper |
| A general bin packing game: interest taken into account | 2018-05-18 | Paper |
| Online buffer management for transmitting packets with processing cycles | 2018-04-04 | Paper |
| Scheduling on parallel identical machines with late work criterion: offline and online cases | 2018-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132226 | 2018-01-29 | Paper |
| Dynamic bin packing with unit fraction items revisited | 2017-11-03 | Paper |
| Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited | 2017-03-16 | Paper |
| Online bin packing problem with buffer and bounded size revisited | 2017-02-22 | Paper |
| Approximate strip packing: revisited | 2016-07-07 | Paper |
| Proportional Cost Buyback Problem with Weight Bounds | 2016-02-05 | Paper |
| Black and White Bin Packing Revisited | 2016-02-05 | Paper |
| Modified dispersion relations and (A)dS Schwarzschild black holes | 2016-01-12 | Paper |
| Online minimization knapsack problem | 2015-12-08 | Paper |
| Complexity of problem \(TF2|v=1,c=2|C_{\max}\) | 2015-11-05 | Paper |
| Bin Packing Game with an Interest Matrix | 2015-10-29 | Paper |
| Online bin packing with \((1,1)\) and \((2,R)\) bins | 2015-07-28 | Paper |
| Online hierarchical scheduling on two machines with known total size of low-hierarchy jobs | 2015-04-27 | Paper |
| Online unweighted knapsack problem with removal cost | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934715 | 2014-12-18 | Paper |
| Randomized algorithms for online knapsack problems | 2014-12-02 | Paper |
| Online minimum makespan scheduling with a buffer | 2014-11-14 | Paper |
| Online algorithms for 1-space bounded 2-dimensional bin packing and square packing | 2014-10-06 | Paper |
| A new upper bound 2.5545 on 2D Online Bin Packing | 2014-09-09 | Paper |
| Online removable knapsack problem under convex function | 2014-06-06 | Paper |
| Randomized Algorithms for Removable Online Knapsack Problems | 2014-04-03 | Paper |
| The Train Delivery Problem Revisited | 2014-01-14 | Paper |
| Unit Cost Buyback Problem | 2014-01-14 | Paper |
| Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\) | 2014-01-13 | Paper |
| 2D knapsack: packing squares | 2013-12-19 | Paper |
| Online Bin Packing with (1,1) and (2,R) Bins | 2013-12-10 | Paper |
| A note on a selfish bin packing problem | 2013-08-07 | Paper |
| Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing | 2013-08-02 | Paper |
| A harmonic algorithm for the 3D strip packing problem | 2013-07-24 | Paper |
| Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing | 2013-06-11 | Paper |
| Semi-online hierarchical scheduling problems with buffer or rearrangements | 2013-03-20 | Paper |
| Online scheduling with one rearrangement at the end: revisited | 2012-10-23 | Paper |
| Online Knapsack Problem with Removal Cost | 2012-09-25 | Paper |
| Online Minimum Makespan Scheduling with a Buffer | 2012-07-16 | Paper |
| Online removable knapsack with limited cuts | 2012-04-03 | Paper |
| Online call control in cellular networks revisited | 2012-03-09 | Paper |
| Optimal algorithms for online scheduling with bounded rearrangement at the end | 2012-01-09 | Paper |
| Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing | 2011-06-03 | Paper |
| 2D Knapsack: Packing Squares | 2011-06-03 | Paper |
| Online scheduling with rearrangement on two related machines | 2011-02-21 | Paper |
| Online multiple-strip packing | 2011-01-28 | Paper |
| Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing | 2010-12-09 | Paper |
| Deadline scheduling and power management for speed bounded processors | 2010-10-11 | Paper |
| Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks | 2010-09-07 | Paper |
| Deterministic on-line call control in cellular networks | 2010-07-07 | Paper |
| A note on on-line broadcast scheduling with deadlines | 2010-06-16 | Paper |
| Online Minimization Knapsack Problem | 2010-05-11 | Paper |
| Online Knapsack Problems with Limited Cuts | 2009-12-17 | Paper |
| A note on online strip packing | 2009-07-10 | Paper |
| On-Line Multiple-Strip Packing | 2009-07-07 | Paper |
| Modified (A)dS Schwarzschild black holes in rainbow spacetime | 2009-04-21 | Paper |
| A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection | 2009-03-03 | Paper |
| Online removable square packing | 2008-06-06 | Paper |
| A fast asymptotic approximation scheme for bin packing with rejection | 2008-04-15 | Paper |
| Strip Packing vs. Bin Packing | 2008-01-04 | Paper |
| Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs | 2008-01-04 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
