| Publication | Date of Publication | Type |
|---|
| Look before, before you leap: online vector load balancing with few reassignments | 2024-09-25 | Paper |
| Online discrepancy with recourse for vectors and graphs | 2024-07-19 | Paper |
| Cluster before you hallucinate: node-capacitated network design and energy efficient routing | 2024-06-05 | Paper |
| Online unrelated-machine load balancing and generalized flow with recourse | 2024-05-08 | Paper |
| The Non-Uniform k -Center Problem | 2023-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875489 | 2023-02-03 | Paper |
| Online Discrepancy with Recourse for Vectors and Graphs | 2021-11-11 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2020-01-21 | Paper |
| Elastic Caching | 2019-10-15 | Paper |
| Constant approximation for k-median and k-means with outliers via iterative rounding | 2019-08-22 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2019-06-20 | Paper |
| Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach | 2019-06-20 | Paper |
| Minimum Makespan Scheduling with Low Rank Processing Times | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743432 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743496 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743473 | 2019-05-10 | Paper |
| Inapproximability of the Multilevel Uncapacitated Facility Location Problem | 2018-11-05 | Paper |
| Better Scalable Algorithms for Broadcast Scheduling | 2018-10-30 | Paper |
| Online Buy-at-Bulk Network Design | 2018-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598206 | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368726 | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365103 | 2017-09-29 | Paper |
| A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs | 2017-08-31 | Paper |
| The heterogeneous capacitated \(k\)-center problem | 2017-08-31 | Paper |
| Online and dynamic algorithms for set cover | 2017-08-17 | Paper |
| Relax, No Need to Round | 2017-05-19 | Paper |
| Spectral embedding of \(k\)-cliques, graph partitioning and \(k\)-means | 2016-04-15 | Paper |
| Cluster before you hallucinate | 2015-06-26 | Paper |
| Facility Location with Matroid or Knapsack Constraints | 2015-05-29 | Paper |
| Running Errands in Time: Approximation Algorithms for Stochastic Orienteering | 2015-04-01 | Paper |
| Online and stochastic survivable network design | 2015-02-04 | Paper |
| Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits | 2014-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417729 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417728 | 2014-05-22 | Paper |
| Unconditional differentially private mechanisms for linear queries | 2014-05-13 | Paper |
| Capacitated Network Design on Undirected Graphs | 2013-10-04 | Paper |
| Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling | 2013-09-13 | Paper |
| Multicast routing for energy minimization using speed scaling | 2013-04-19 | Paper |
| Online and Stochastic Survivable Network Design | 2013-03-19 | Paper |
| On capacitated set cover problems | 2011-08-17 | Paper |
| Scalably Scheduling Power-Heterogeneous Processors | 2010-09-07 | Paper |
| Better Scalable Algorithms for Broadcast Scheduling | 2010-09-07 | Paper |
| Scheduling with Outliers | 2009-10-28 | Paper |
