| Publication | Date of Publication | Type |
|---|
| A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs | 2023-12-22 | Paper |
| Makespan minimization on unrelated parallel machines with a few bags | 2023-10-16 | Paper |
| High multiplicity strip packing with three rectangle types | 2023-08-03 | Paper |
| A local search approximation algorithm for the multiway cut problem | 2023-08-02 | Paper |
| Experimental evaluation of a local search approximation algorithm for the multiway cut problem | 2022-03-24 | Paper |
| Structural parameters for scheduling with assignment restrictions | 2020-10-21 | Paper |
| Makespan minimization on unrelated parallel machines with a few bags | 2020-04-22 | Paper |
| Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments | 2020-01-29 | Paper |
| Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments | 2019-10-11 | Paper |
| Approximation algorithms for the graph balancing problem with two speeds and two job lengths | 2019-06-25 | Paper |
| A 3/2-approximation algorithm for the graph balancing problem with two weights | 2019-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4683282 | 2018-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4683303 | 2018-09-20 | Paper |
| Structural parameters for scheduling with assignment restrictions | 2017-07-21 | Paper |
| A 2-approximation algorithm for finding a spanning tree with maximum number of leaves | 2017-03-03 | Paper |
| \(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs | 2017-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2828921 | 2016-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2829061 | 2016-10-26 | Paper |
| Makespan minimization in job shops | 2016-09-29 | Paper |
| Analysis of a local search algorithm for the k-facility location problem | 2016-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501845 | 2015-08-14 | Paper |
| \(L(2,1)\)-labelings on the modular product of two graphs | 2013-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867317 | 2013-12-11 | Paper |
| A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption | 2013-03-28 | Paper |
| Packing Squares with Profits | 2012-08-22 | Paper |
| A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths | 2012-05-24 | Paper |
| An asymptotic approximation algorithm for 3D-strip packing | 2010-08-16 | Paper |
| \(L(2,1)\)-labelings on the composition of \(n\) graphs | 2010-08-11 | Paper |
| An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths | 2010-06-22 | Paper |
| APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS | 2010-03-09 | Paper |
| Rectangle packing with one-dimensional resource augmentation | 2009-08-19 | Paper |
| New Approximability Results for 2-Dimensional Packing Problems | 2008-09-17 | Paper |
| A Polynomial Time Approximation Scheme for the Square Packing Problem | 2008-06-10 | Paper |
| Gene Assembly Algorithms for Ciliates | 2008-04-04 | Paper |
| Approximation Algorithms for the k-Median Problem | 2008-03-14 | Paper |
| Parallel Processing and Applied Mathematics | 2007-09-25 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Efficient algorithms for robustness in resource allocation and scheduling problems | 2006-03-24 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS | 2005-09-12 | Paper |
| Approximation schemes for job shop scheduling problems with controllable processing times | 2005-08-04 | Paper |
| An asymptotic fully polynomial time approximation scheme for bin covering. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448360 | 2004-02-18 | Paper |
| Makespan Minimization in Job Shops: A Linear Time Approximation Scheme | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426361 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425952 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2765958 | 2002-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753955 | 2001-11-11 | Paper |
| Approximation algorithms for bounded facility location problems | 2001-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527196 | 2001-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508364 | 2000-10-03 | Paper |
| Increasing the Weight of Minimum Spanning Trees | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941835 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252040 | 2000-03-13 | Paper |
| Algorithms for measuring perturbality in matroid optimization | 1999-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875228 | 1996-04-28 | Paper |
