| Publication | Date of Publication | Type |
|---|
| A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width | 2022-12-09 | Paper |
| Calibrations scheduling with arbitrary lengths and activation length | 2022-01-14 | Paper |
| Approximating \(k\)-forest with resource augmentation: a primal-dual approach | 2019-08-09 | Paper |
| Speed scaling on parallel processors with migration | 2019-06-25 | Paper |
| On the Complexity of Minimizing the Total Calibration Cost | 2019-04-26 | Paper |
| Parameterized power vertex cover | 2018-12-10 | Paper |
| Approximating \(k\)-forest with resource augmentation: a primal-dual approach | 2018-03-26 | Paper |
| Throughput maximization for speed scaling with agreeable deadlines | 2018-02-28 | Paper |
| FPT approximation algorithm for scheduling with memory constraints | 2018-01-11 | Paper |
| Non-preemptive throughput maximization for speed-scaling with power-down | 2018-01-11 | Paper |
| Throughput maximization in the speed-scaling setting | 2017-03-03 | Paper |
| Parameterized power vertex cover | 2016-12-22 | Paper |
| Clustering on \(k\)-edge-colored graphs | 2016-11-02 | Paper |
| Truthfulness for the sum of weighted completion times | 2016-09-02 | Paper |
| Throughput maximization in multiprocessor speed-scaling | 2016-05-02 | Paper |
| Min-Power Covering Problems | 2016-01-11 | Paper |
| Throughput Maximization in Multiprocessor Speed-Scaling | 2015-09-11 | Paper |
| Improved local search for universal facility location | 2015-07-10 | Paper |
| Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines | 2014-08-26 | Paper |
| Optimal data placement on networks with a constant number of clients | 2014-06-06 | Paper |
| Analysis and comparison of three algorithms for the vertex cover problem on large graphs with low memory capacities | 2013-12-11 | Paper |
| Clustering on k-Edge-Colored Graphs | 2013-09-20 | Paper |
| Improved local search for universal facility location | 2013-06-11 | Paper |
| Throughput maximization for speed-scaling with agreeable deadlines | 2013-05-28 | Paper |
| A new lower bound on the independence number of graphs | 2013-04-18 | Paper |
| Speed scaling on parallel processors with migration | 2012-11-14 | Paper |
| Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines | 2012-06-29 | Paper |
| Randomized truthful algorithms for scheduling selfish tasks on parallel machines | 2012-03-13 | Paper |
| Local search: complexity and approximation | 2010-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059324 | 2010-12-08 | Paper |
| Randomized truthful algorithms for scheduling selfish tasks on parallel machines | 2010-04-27 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Fair cost-sharing methods for the minimum spanning tree game | 2010-01-29 | Paper |
| Approximation results for a bicriteria job scheduling problem on a single machine without preemption | 2009-12-04 | Paper |
| On truthfulness and approximation for scheduling selfish tasks | 2009-12-02 | Paper |
| On the minimum hitting set of bundles problem | 2009-11-04 | Paper |
| The impact of local policies on the quality of packet routing in paths, trees, and rings | 2009-08-28 | Paper |
| How good are SPT schedules for fair optimality criteria | 2008-09-03 | Paper |
| On the Minimum Hitting Set of Bundles Problem | 2008-07-10 | Paper |
| An exponential (matching based) neighborhood for the vehicle routing problem | 2008-05-13 | Paper |
| A Survey of Approximation Results for Local Search Algorithms | 2008-03-14 | Paper |
| A note on scheduling to meet two min-sum objectives | 2007-08-27 | Paper |
| Truthful algorithms for scheduling selfish tasks on parallel machines | 2007-01-09 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Approximation algorithms for the bi-criteria weighted MAX-CUT problem | 2006-08-14 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem | 2005-02-09 | Paper |
| Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817407 | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4813032 | 2004-08-12 | Paper |
| On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796176 | 2003-03-02 | Paper |
| On the classification of NP-complete problems in terms of their correlation coefficient | 2002-07-03 | Paper |
| On the landscape ruggedness of the quadratic assignment problem | 2001-08-20 | Paper |
| Autocorrelation coefficient for the graph bipartitioning problem | 1998-08-13 | Paper |
| On the quality of local search for the quadratic assignment problem | 1998-06-02 | Paper |
