| Publication | Date of Publication | Type |
|---|
| An improved approximation algorithm for a scheduling problem with transporter coordination | 2024-04-02 | Paper |
| Exact approaches to late work scheduling on unrelated machines | 2023-09-07 | Paper |
| Two-machine flow-shop scheduling to minimize total late work: revisited | 2022-12-23 | Paper |
| Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work | 2022-12-23 | Paper |
| In memoriam: Moshe Dror | 2022-11-04 | Paper |
| Two-machine flow shop scheduling with a common due date to maximize total early work | 2022-03-18 | Paper |
| Mirror scheduling problems with early work and late work criteria | 2022-01-14 | Paper |
| Semi-online scheduling on two identical machines with a common due date to maximize total early work | 2021-01-13 | Paper |
| Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date | 2020-02-25 | Paper |
| Detecting life signatures with RNA sequence similarity measures | 2019-02-06 | Paper |
| An integrated model for the transshipment yard scheduling problem | 2018-04-03 | Paper |
| Scheduling on parallel identical machines with late work criterion: offline and online cases | 2018-02-28 | Paper |
| G-MAPSEQ -- a new method for mapping reads to a reference genome | 2018-01-26 | Paper |
| Graph algorithms for DNA sequencing -- origins, current models and the future | 2017-11-23 | Paper |
| Tabu search for the RNA partial degradation problem | 2017-07-27 | Paper |
| Novel dual discounting functions for the Internet shopping optimization problem: new algorithms | 2016-09-08 | Paper |
| Unified encoding for hyper-heuristics with application to bioinformatics | 2016-06-30 | Paper |
| Building the library of RNA 3D nucleotide conformations using the clustering approach | 2015-10-16 | Paper |
| A study of scheduling problems with preemptions on multi-core computers with GPU accelerators | 2015-09-30 | Paper |
| ModeLang: a new approach for experts-friendly viral infections modeling | 2015-03-16 | Paper |
| Erratum to: ``Internet shopping with price-sensitive discounts | 2015-02-23 | Paper |
| Optimal pathway reconstruction on 3D NMR maps | 2015-02-06 | Paper |
| Internet shopping with price sensitive discounts | 2014-09-26 | Paper |
| The Orderly Colored Longest Path Problem – a survey of applications and new algorithms | 2014-04-16 | Paper |
| A hyper-heuristic approach to sequencing by hybridization of DNA sequences | 2013-09-16 | Paper |
| New algorithms for coupled tasks scheduling – a survey | 2013-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2903774 | 2012-08-01 | Paper |
| A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem | 2012-07-28 | Paper |
| Reduced-by-matching Graphs: Toward Simplifying Hamiltonian Circuit Problem | 2012-07-11 | Paper |
| A simulated annealing hyper-heuristic methodology for flexible decision support | 2012-06-13 | Paper |
| DNA Sequencing—Tabu and Scatter Search Combined | 2012-06-08 | Paper |
| On the complexity of the independent set problem in triangle graphs | 2011-08-08 | Paper |
| Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion | 2011-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070845 | 2011-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070883 | 2011-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070894 | 2011-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070918 | 2011-01-28 | Paper |
| The simplified partial digest problem: approximation and a graph-theoretic model | 2011-01-28 | Paper |
| Towards prediction of HCV therapy efficiency | 2010-12-30 | Paper |
| Internet shopping optimization problem | 2010-09-02 | Paper |
| Genetic and Tabu search algorithms for peptide assembly problem | 2010-05-26 | Paper |
| Some operations research methods for analyzing protein sequences and structures | 2010-05-10 | Paper |
| On the approximability of the simplified partial digest problem | 2010-04-28 | Paper |
| DNA Sequencing by Hybridization via Genetic Search | 2009-08-13 | Paper |
| Modeling the process of human body iron homeostasis using a variant of timed Petri nets | 2009-06-24 | Paper |
| Finding Hamiltonian circuits in quasi-adjoint graphs | 2008-11-19 | Paper |
| Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem | 2008-02-11 | Paper |
| A polynomial time equivalence between DNA sequencing and the exact perfect matching problem | 2008-01-18 | Paper |
| Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date | 2007-10-10 | Paper |
| Handbook on Scheduling | 2007-08-20 | Paper |
| An analysis of the Petri net based model of the human body iron homeostasis process | 2007-07-17 | Paper |
| Dealing with repetitions in sequencing by hybridization | 2007-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3442353 | 2007-05-18 | Paper |
| Selected papers from the Dagstuhl Workshop | 2007-05-15 | Paper |
| A note on the two machine job shop with the weighted late work criterion | 2007-05-15 | Paper |
| Some operations research methods for analyzing protein sequences and structures | 2007-04-19 | Paper |
| KI 2005: Advances in Artificial Intelligence | 2006-11-13 | Paper |
| Multistage isothermic sequencing by hybridization | 2006-08-23 | Paper |
| Tabu search algorithm for DNA sequencing by hybridization with isothermic libraries | 2006-05-16 | Paper |
| Computational complexity of isothermic DNA sequencing by hybridization | 2006-04-28 | Paper |
| Evolutionary approaches to DNA sequencing with errors | 2006-03-07 | Paper |
| The two-machine flow-shop problem with weighted late work criterion and common due date | 2005-04-21 | Paper |
| Selected combinatorial problems of computational biology | 2005-02-09 | Paper |
| Sequencing by hybridization with isothermic oligonucleotide libraries | 2005-01-31 | Paper |
| An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints | 2004-11-22 | Paper |
| Scheduling jobs in open shops with limited machine availability | 2004-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737360 | 2004-08-11 | Paper |
| Scheduling malleable tasks on parallel processors to minimize the makespan | 2004-08-10 | Paper |
| Open shop scheduling problems with late work criteria. | 2004-01-26 | Paper |
| Optimal centralized algorithms for store-and-forward deadlock avoidance | 2003-10-16 | Paper |
| Complexity of DNA sequencing by hybridization. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418448 | 2003-08-10 | Paper |
| Scheduling multiprocessor tasks on parallel processors with limited availability. | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414481 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789912 | 2003-04-23 | Paper |
| The complexity of two group scheduling problems | 2003-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791892 | 2003-02-04 | Paper |
| Hybrid genetic algorithm for DNA sequencing with errors | 2002-12-15 | Paper |
| Review of properties of different precedence graphs for scheduling problems | 2002-11-17 | Paper |
| Scheduling multiprocessor tasks on two parallel processors | 2002-09-30 | Paper |
| The disjunctive graph machine representation of the job shop scheduling problem | 2002-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776552 | 2002-07-08 | Paper |
| Resource Constrained Chain Scheduling of UET Jobs on Two Machines | 2002-07-01 | Paper |
| Linear and quadratic algorithms for scheduling chains and opposite chains | 2002-06-16 | Paper |
| On the recognition of de Bruijn graphs and their induced subgraphs | 2002-05-15 | Paper |
| Two-machine flow shops with limited machine availability | 2002-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2735585 | 2001-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712359 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712360 | 2001-05-06 | Paper |
| Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability | 2000-11-22 | Paper |
| Tabu search for DNA sequencing with false negatives and false positives | 2000-09-14 | Paper |
| Scheduling preemptable tasks on parallel processors with limited availability | 2000-08-21 | Paper |
| On some properties of DNA graphs | 2000-06-29 | Paper |
| Scheduling a divisible task in a two-dimensional toroidal mesh | 2000-06-13 | Paper |
| A note on disjunctive graph representation | 2000-04-10 | Paper |
| Scheduling with resource management in manufacturing systems | 1999-11-08 | Paper |
| Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems | 1999-04-28 | Paper |
| Scheduling multiprocessor tasks with chain constraints | 1999-02-22 | Paper |
| The job shop scheduling problem: Conventional and new solution techniques | 1998-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4380372 | 1998-03-15 | Paper |
| Preemptive multiprocessor task scheduling with release times and time windows | 1998-01-28 | Paper |
| Distributed processing of divisible jobs with communication startup costs | 1997-08-11 | Paper |
| Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness | 1997-05-22 | Paper |
| Scheduling complete intrees on two uniform processors with communication delays | 1997-02-27 | Paper |
| Deadline scheduling of multiprocessor tasks | 1997-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5690637 | 1997-01-07 | Paper |
| A local search approach for two-dimensional irregular cutting | 1996-08-19 | Paper |
| Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors | 1996-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4843446 | 1996-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4843447 | 1996-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4843439 | 1995-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326789 | 1995-03-23 | Paper |
| Vehicle scheduling in two-cycle flexible manufacturing systems | 1995-01-11 | Paper |
| Scheduling preemptive multiprocessor tasks on dedicated processors | 1994-11-01 | Paper |
| Graph theoretical issues in computer networks | 1994-04-12 | Paper |
| Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors | 1994-04-05 | Paper |
| Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system | 1994-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279484 | 1994-02-17 | Paper |
| Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness | 1994-02-17 | Paper |
| Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource | 1993-08-31 | Paper |
| Using a tabu search approach for solving the two-dimensional irregular cutting problem | 1993-08-16 | Paper |
| Algorithms for minimizing maximum lateness with unit length tasks and resource constraints | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023677 | 1993-01-23 | Paper |
| Dynamic programming algorithm for a FMS scheduling problem | 1993-01-16 | Paper |
| Optimization aspects of deadlock prevention in packet-switching networks | 1993-01-16 | Paper |
| Scheduling multiprocessor tasks on three dedicated processors | 1993-01-16 | Paper |
| Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource | 1992-06-28 | Paper |
| Mathematical programming formulations for machine scheduling: A survey | 1991-01-01 | Paper |
| A preemptive open shop scheduling problem with one resource | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3354652 | 1990-01-01 | Paper |
| Scheduling independent two processor tasks on a uniform duo-processor system | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470245 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3494643 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470246 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818115 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818118 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751359 | 1987-01-01 | Paper |
| Time-Stamp Approach to Store-and-Forward Deadlock Prevention | 1987-01-01 | Paper |
| Minimizing mean weighted execution time loss on identical and uniform processors | 1987-01-01 | Paper |
| Minimizing mean flow time with parallel processors and resource constraints | 1987-01-01 | Paper |
| Scheduling Multiprocessor Tasks to Minimize Schedule Length | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804433 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3821925 | 1986-01-01 | Paper |
| Dynamic storage allocation with limited compaction - complexity and some practical implications | 1985-01-01 | Paper |
| Deadlock-Resistant Flow Control Procedures for Store-and-Forward Networks | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335508 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347607 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680271 | 1984-01-01 | Paper |
| Scheduling independent 2-processor tasks to minimize schedule length | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338316 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677168 | 1983-01-01 | Paper |
| Scheduling subject to resource constraints: Classification and complexity | 1983-01-01 | Paper |
| A linear time algorithm for restricted bin packing and scheduling problems | 1983-01-01 | Paper |
| Solving the resource constrained deadline scheduling problem via reduction to the network flow problem | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3883481 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3901303 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182233 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4191594 | 1979-01-01 | Paper |
| Deadline scheduling of tasks with ready times and resource constraints | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940840 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4174236 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186068 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131656 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145410 | 1977-01-01 | Paper |
| Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H] | 1977-01-01 | Paper |
| Simple algorithms for multiprocessor scheduling to meet deadlines | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4088559 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136574 | 1976-01-01 | Paper |
