| Publication | Date of Publication | Type |
|---|
| One-dimensional stock cutting resilient against singular random defects | 2023-07-03 | Paper |
| Number of bins and maximum lateness minimization in two-dimensional bin packing | 2021-06-04 | Paper |
| Almost always observable hybrid systems | 2020-05-07 | Paper |
| Codon optimization by 0-1 linear programming | 2020-05-06 | Paper |
| Competitive location and pricing on a line with metric transportation costs | 2020-01-08 | Paper |
| On envy-free perfect matching | 2019-05-17 | Paper |
| An improved integer linear programming formulation for the closest 0-1 string problem | 2018-07-11 | Paper |
| Sorting common operations to minimize the number of tardy jobs | 2018-05-23 | Paper |
| Optimum Solution of the Closest String Problem via Rank Distance | 2016-11-30 | Paper |
| One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model | 2016-05-04 | Paper |
| Exact and asymptotically exact solutions for a class of assortment problems | 2012-07-28 | Paper |
| Cutting stock with no three parts per pattern: work-in-process and pattern minimization | 2012-06-20 | Paper |
| Scheduling two chains of unit jobs on one machine: A polyhedral study | 2011-11-21 | Paper |
| On LP relaxations for the pattern minimization problem | 2011-06-22 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Cutting and Reuse: An Application from Automobile Component Manufacturing | 2009-07-03 | Paper |
| Annals of OR-special volume in memory of Mario Lucertini | 2008-03-31 | Paper |
| An optimization model for trim loss minimization in an automotive glass plant | 2007-08-27 | Paper |
| Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application | 2005-02-09 | Paper |
| A competitive scheduling problem and its relevance to UMTS channel assignment | 2005-01-12 | Paper |
| On the stability number of the edge intersection of two graphs. | 2003-01-21 | Paper |
| On (\(P_{5}\), diamond)-free graphs | 2002-08-29 | Paper |
| On the upper chromatic number of \((v_3,b_2)\)-configurations | 2002-08-29 | Paper |
| A primal-dual property of the upper chromatic number of mixed hypergraphs | 2001-09-23 | Paper |
| An optimization problem arising in the design of multiring systems | 2000-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495286 | 2000-08-10 | Paper |
| How to survive while visiting a graph | 2000-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264549 | 1999-11-23 | Paper |
| A three-dimensional matching model for perishable production scheduling | 1999-04-13 | Paper |
| Concurrent operations assignment and sequencing for particular assembly problems in flow lines | 1997-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139126 | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3139224 | 1994-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028110 | 1993-03-28 | Paper |
| Predicting deadlock in store‐and‐forward networks | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3835330 | 1989-01-01 | Paper |
| A polynomial characterization of some graph partitioning problems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3032060 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817607 | 1988-01-01 | Paper |
