| Publication | Date of Publication | Type |
|---|
| Learning-augmented online TSP on rings, trees, flowers and (almost) everywhere else | 2025-01-06 | Paper |
| Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament | 2024-07-05 | Paper |
| On the parallel complexity of the alternating Hamiltonian cycle problem | 2024-07-05 | Paper |
| Online TSP with known locations | 2024-01-16 | Paper |
| NC algorithms for antidirected hamiltonian paths and cycles in tournaments | 2024-01-05 | Paper |
| Online 2-stage stable matching | 2023-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075894 | 2023-09-20 | Paper |
| Canadian traveller problem with predictions | 2023-07-25 | Paper |
| Target-based computer-assisted orchestration: complexity and approximation algorithms | 2022-09-29 | Paper |
| Online learning for min-max discrete problems | 2022-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092381 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075745 | 2022-05-11 | Paper |
| Multistage knapsack | 2022-03-29 | Paper |
| LP-based algorithms for multistage minimization problems | 2022-03-22 | Paper |
| A simple rounding scheme for multistage optimization | 2022-02-21 | Paper |
| Calibrations scheduling with arbitrary lengths and activation length | 2022-01-14 | Paper |
| Scheduling independent multiprocessor tasks | 2021-12-20 | Paper |
| Online multistage subset maximization problems | 2021-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5116470 | 2020-08-25 | Paper |
| Correction to: approximation and online algorithms | 2020-08-24 | 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 |
| Energy-efficient scheduling and routing via randomized rounding | 2018-11-07 | Paper |
| Throughput maximization for speed scaling with agreeable deadlines | 2018-02-28 | Paper |
| Non-preemptive throughput maximization for speed-scaling with power-down | 2018-01-11 | Paper |
| Scheduling on power-heterogeneous processors | 2017-11-16 | Paper |
| Optimal schedules for d-D grid graphs with communication delays | 2017-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965471 | 2017-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963934 | 2017-02-21 | 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 |
| Scheduling on Power-Heterogeneous Processors | 2016-05-03 | Paper |
| Throughput maximization in multiprocessor speed-scaling | 2016-05-02 | Paper |
| Speed scaling for maximum lateness | 2016-03-09 | Paper |
| Min-Power Covering Problems | 2016-01-11 | Paper |
| Speed-scaling with no preemptions | 2015-09-11 | Paper |
| Throughput Maximization in Multiprocessor Speed-Scaling | 2015-09-11 | Paper |
| Green scheduling, flows and matchings | 2015-05-18 | Paper |
| From preemptive to non-preemptive speed-scaling scheduling | 2014-12-05 | Paper |
| Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines | 2014-08-26 | Paper |
| On multiprocessor temperature-aware scheduling problems | 2014-08-18 | Paper |
| Optimal data placement on networks with a constant number of clients | 2014-06-06 | Paper |
| Bounded max-colorings of graphs | 2014-04-28 | Paper |
| Clustering on k-Edge-Colored Graphs | 2013-09-20 | Paper |
| From preemptive to non-preemptive speed-scaling scheduling | 2013-06-11 | Paper |
| Throughput maximization for speed-scaling with agreeable deadlines | 2013-05-28 | Paper |
| Green scheduling, flows and matchings | 2013-03-21 | Paper |
| Speed scaling on parallel processors with migration | 2012-11-14 | Paper |
| Speed scaling for maximum lateness | 2012-09-25 | Paper |
| On multiprocessor temperature-aware scheduling problems | 2012-07-16 | 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 |
| Bounded Max-colorings of Graphs | 2010-12-09 | 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 |
| Bicriteria scheduling for contiguous and non contiguous parallel tasks | 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 |
| Scheduling trees with large communication delays on two identical processors | 2007-12-20 | Paper |
| A note on scheduling to meet two min-sum objectives | 2007-08-27 | Paper |
| Bicriteria approximation algorithms for scheduling problems with communications delays | 2007-05-15 | 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 |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| Scheduling in switching networks with set-up delays | 2005-05-17 | 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 |
| Scheduling tasks with small communication delays for clusters of processors | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472467 | 2004-08-04 | Paper |
| On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427860 | 2003-09-14 | Paper |
| An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. | 2003-08-17 | Paper |
| A PTAS for the average weighted completion time problem on unrelated machines. | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796176 | 2003-03-02 | Paper |
| An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications | 2003-01-21 | Paper |
| On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications | 2002-09-30 | Paper |
| Scheduling independent multiprocessor tasks | 2002-03-07 | Paper |
| Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases | 2001-04-26 | Paper |
| On the complexity of scheduling with large communication delays | 2000-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501554 | 2000-09-04 | Paper |
| The complexity of short schedules for uet bipartite graphs | 2000-08-24 | Paper |
| On the parallel complexity of the alternating Hamiltonian cycle problem | 2000-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945672 | 2000-03-23 | Paper |
| A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems | 1999-04-28 | Paper |
| Minimizing the overhead for some tree-scheduling problems | 1999-02-22 | Paper |
| Minimizing the schedule length for a parallel 3D-grid precedence graph | 1999-02-22 | Paper |
| Scheduling UET-UCT series-parallel graphs on two processors | 1997-09-10 | Paper |
| Some models for scheduling parallel programs with communication delays | 1997-05-22 | Paper |
| Optimal parallel execution of complete binary trees and grids into most popular interconnection networks | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892336 | 1997-01-28 | Paper |
| Impact of communications of the complexity of the parallel Gaussian elimination | 1991-01-01 | Paper |
