| Publication | Date of Publication | Type |
|---|
| Elastic-degenerate string matching with 1 error or mismatch | 2024-11-12 | Paper |
| Reconstructing phylogenetic networks via Cherry picking and machine learning | 2024-08-13 | Paper |
| Total completion time scheduling under scenarios | 2024-07-19 | Paper |
| Making de Bruijn graphs Eulerian | 2024-05-06 | Paper |
| Complexity of inventory routing problems when routing is easy | 2023-11-13 | Paper |
| Elastic-degenerate string matching with 1 error | 2023-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098779 | 2023-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098790 | 2023-06-14 | Paper |
| A duality based 2-approximation algorithm for maximum agreement forest | 2023-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874433 | 2023-02-07 | Paper |
| Competitive algorithms for the on-line traveling salesman | 2022-12-16 | Paper |
| Serving requests with on-line routing | 2022-12-09 | Paper |
| Approximation algorithms for replenishment problems with fixed turnover times | 2022-08-18 | Paper |
| Tight Bounds for Online TSP on the Line | 2022-02-08 | Paper |
| Optimal algorithms for scheduling under time-of-use tariffs | 2021-11-09 | Paper |
| Local improvement algorithms for a path packing problem: a performance analysis based on linear programming | 2021-04-07 | Paper |
| Minimizing bed occupancy variance by scheduling patients under uncertainty | 2020-05-27 | Paper |
| Approximation algorithms for replenishment problems with fixed turnover times | 2020-02-12 | Paper |
| Fixed-order scheduling on parallel machines | 2020-02-06 | Paper |
| The Itinerant List Update problem | 2019-01-15 | Paper |
| On unrooted and root-uncertain variants of several well-known phylogenetic network problems | 2019-01-11 | Paper |
| Tight Bounds for Online TSP on the Line | 2018-07-16 | Paper |
| Minimizing worst-case and average-case makespan over scenarios | 2018-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351897 | 2017-08-31 | Paper |
| Scheduling Real-Time Mixed-Criticality Jobs | 2017-07-12 | Paper |
| Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems | 2016-03-24 | Paper |
| Strong LP formulations for scheduling splittable jobs on unrelated machines | 2015-12-09 | Paper |
| Erratum to: ``Computational complexity of stochastic programming problems | 2015-10-19 | Paper |
| Optimal Algorithms and a PTAS for Cost-Aware Scheduling | 2015-09-16 | Paper |
| Split scheduling with uniform setup times | 2015-04-24 | Paper |
| Latency-constrained aggregation in sensor networks | 2014-11-18 | Paper |
| A simple randomised algorithm for convex optimisation | 2014-10-17 | Paper |
| Scheduling over Scenarios on Two Machines | 2014-09-26 | Paper |
| Minimizing flow time in the wireless gathering problem | 2014-09-09 | Paper |
| Approximation Algorithms for Nonbinary Agreement Forests | 2014-06-19 | Paper |
| The traveling salesman problem on cubic and subcubic graphs | 2014-06-02 | Paper |
| Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines | 2014-06-02 | Paper |
| Polynomial time vertex enumeration of convex polytopes of bounded branch-width | 2014-04-22 | Paper |
| A short note on exponential-time algorithms for hybridization number | 2013-12-04 | Paper |
| Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set | 2013-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910712 | 2013-03-19 | Paper |
| Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets | 2012-10-11 | Paper |
| Universal Sequencing on an Unreliable Machine | 2012-09-12 | Paper |
| Computer-Aided Complexity Classification of Dial-a-Ride Problems | 2012-06-08 | Paper |
| The Online TSP Against Fair Adversaries | 2012-05-30 | Paper |
| Mixed-Criticality Scheduling of Sporadic Task Systems | 2011-09-16 | Paper |
| TSP on Cubic and Subcubic Graphs | 2011-06-24 | Paper |
| The distributed wireless gathering problem | 2011-02-21 | Paper |
| Scheduling Real-Time Mixed-Criticality Jobs | 2010-09-03 | Paper |
| Universal Sequencing on a Single Machine | 2010-06-22 | Paper |
| Data Gathering in Wireless Networks | 2010-02-09 | Paper |
| Online \(k\)-server routing problems | 2009-09-02 | Paper |
| Data aggregation in sensor networks: Balancing communication and delay costs | 2009-03-30 | Paper |
| Random walks on the vertices of transportation polytopes with constant number of sources | 2009-03-04 | Paper |
| The generalized two-server problem | 2008-12-21 | Paper |
| An approximation algorithm for the wireless gathering problem | 2008-11-27 | Paper |
| Bincoloring | 2008-11-18 | Paper |
| Prefix Reversals on Binary and Ternary Strings | 2008-08-13 | Paper |
| The Distributed Wireless Gathering Problem | 2008-07-10 | Paper |
| Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks | 2008-05-22 | Paper |
| Latency Constrained Aggregation in Sensor Networks | 2008-03-11 | Paper |
| Stochastic facility location with general long-run costs and convex short-run costs | 2008-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5446940 | 2008-03-06 | Paper |
| Online k-Server Routing Problems | 2008-02-21 | Paper |
| On-line multi-threaded scheduling | 2007-12-20 | Paper |
| Prefix Reversals on Binary and Ternary Strings | 2007-11-29 | Paper |
| Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs | 2007-11-15 | Paper |
| An Approximation Algorithm for the Wireless Gathering Problem | 2007-09-07 | Paper |
| Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks | 2007-08-30 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| A linear bound on the diameter of the transportation polytope | 2007-01-08 | Paper |
| Location of slaughterhouses under economies of scale | 2006-10-27 | Paper |
| Simple integer recourse models: convexity and convex approximations | 2006-09-12 | Paper |
| Computational complexity of stochastic programming problems | 2006-06-14 | Paper |
| A linear programming formulation of Mader's edge-disjoint paths problem | 2006-01-10 | Paper |
| The stochastic single resource service-provision problem | 2005-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828941 | 2004-11-29 | Paper |
| On-line dial-a-ride problems under a restricted information model | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471315 | 2004-07-28 | Paper |
| Approximation algorithms for the test cover problem | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449208 | 2004-02-08 | Paper |
| News from the online traveling repairman. | 2003-08-17 | Paper |
| Approximation algorithms and relaxations for a service provision problem on a telecommunication network | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411361 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411400 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411288 | 2003-07-07 | Paper |
| A class of on-line scheduling algorithms to minimize total completion time | 2003-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796167 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779167 | 2002-11-25 | Paper |
| Randomized algorithms for on-line scheduling problems: How low can't you go? | 2002-08-28 | Paper |
| On-line single-server dial-a-ride problems | 2002-03-03 | Paper |
| Algorithms for the on-line travelling salesman | 2002-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728897 | 2001-11-06 | Paper |
| Multiprocessor Scheduling with Rejection | 2000-03-19 | Paper |
| Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions | 1999-06-03 | Paper |
| Two‐stage stochastic integer programming: a survey | 1999-01-04 | Paper |
| Modelling aspects of distributed processing in telecommunication networks | 1998-11-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398366 | 1998-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343700 | 1998-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4346793 | 1998-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875173 | 1996-09-15 | Paper |
| An algorithm for the construction of convex hulls in simple integer recourse programming | 1996-07-31 | Paper |
| On the convex hull of the simple integer recourse objective function | 1995-08-27 | Paper |
| A class of generalized greedy algorithms for the multi-knapsack problem | 1993-06-29 | Paper |
| A fast randomized algorithm for partitioning a graph into paths of fixed length | 1993-06-29 | Paper |
| Probabilistic analysis of the minimum weighted flowtime scheduling problem | 1993-01-16 | Paper |
| On rates of convergence and asymptotic normality in the multiknapsack problem | 1992-06-27 | Paper |
| A probabilistic analysis of the multiknapsack value function | 1990-01-01 | Paper |
| On the relation between complexity and uncertainty | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470253 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3799801 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3818133 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832320 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789326 | 1987-01-01 | Paper |
| STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824091 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824110 | 1984-01-01 | Paper |
| Hierarchical vehicle routing problems | 1984-01-01 | Paper |
| A stochastic method for global optimization | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3908777 | 1980-01-01 | Paper |
