| Publication | Date of Publication | Type |
|---|
| Configuration balancing for stochastic requests | 2023-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075956 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168414 | 2023-08-08 | Paper |
| Submodular Optimization with Contention Resolution Extensions. | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875658 | 2023-02-03 | Paper |
| On the impossibility of decomposing binary matroids | 2022-10-17 | Paper |
| A competitive algorithm for throughput maximization on identical machines | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091246 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092350 | 2022-07-21 | Paper |
| On the Impossibility of Decomposing Binary Matroids | 2022-06-26 | Paper |
| A Scalable Approximation Algorithm for Weighted Longest Common Subsequence | 2022-03-31 | Paper |
| The efficiency-fairness balance of round robin scheduling | 2022-03-11 | Paper |
| The matroid cup game | 2021-12-13 | Paper |
| Corrigendum: Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling | 2021-09-14 | Paper |
| Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines | 2021-08-04 | Paper |
| The matroid intersection cover problem | 2021-04-07 | Paper |
| Online Scheduling via Learned Weights | 2021-02-02 | Paper |
| Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization | 2020-10-28 | Paper |
| Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling | 2020-09-01 | Paper |
| Fair Scheduling via Iterative Quasi-Uniform Sampling | 2020-08-03 | Paper |
| Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing | 2020-05-27 | Paper |
| Scheduling parallelizable jobs online to maximize throughput | 2020-02-12 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2020-01-21 | Paper |
| Non-clairvoyantly scheduling to minimize convex functions | 2019-08-20 | Paper |
| New Approximations for Reordering Buffer Management | 2019-06-20 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2019-06-20 | Paper |
| Energy Efficient Scheduling of Parallelizable Jobs | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743473 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743474 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633926 | 2019-05-06 | Paper |
| Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time | 2018-07-16 | Paper |
| Fair Scheduling via Iterative Quasi-Uniform Sampling | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636440 | 2018-04-19 | Paper |
| Energy efficient scheduling of parallelizable jobs | 2018-04-16 | Paper |
| Scheduling parallel jobs online with convex and concave parallelizability | 2018-04-12 | Paper |
| A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract] | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365024 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365025 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365026 | 2017-09-29 | Paper |
| Stochastic online scheduling on unrelated machines | 2017-08-31 | Paper |
| Breaking \(1-1/e\) barrier for non-preemptive throughput maximization | 2017-08-31 | Paper |
| Efficient massively parallel methods for dynamic programming | 2017-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955017 | 2017-01-24 | Paper |
| Scheduling Parallel Jobs Online with Convex and Concave Parallelizability | 2016-02-26 | Paper |
| On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs | 2015-10-27 | Paper |
| Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities | 2015-10-27 | Paper |
| Scheduling to minimize energy and flow time in broadcast scheduling | 2015-03-26 | Paper |
| An online scalable algorithm for average flow time in broadcast scheduling | 2014-09-09 | Paper |
| Online Scheduling with General Cost Functions | 2014-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417711 | 2014-05-22 | Paper |
| Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions | 2013-10-04 | Paper |
| Shortest-Elapsed-Time-First on a Multiprocessor | 2013-04-19 | Paper |
| The Complexity of Scheduling for p-Norms of Flow and Stretch | 2013-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2913807 | 2012-09-27 | Paper |
| New Models and Algorithms for Throughput Maximization in Broadcast Scheduling | 2011-02-15 | Paper |
| Longest Wait First for Broadcast Scheduling [Extended Abstract] | 2010-05-11 | Paper |
| Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling | 2009-10-29 | Paper |
