| Publication | Date of Publication | Type |
|---|
| Efficient algorithms and hardness results for the weighted \(k\)-server problem | 2025-01-14 | Paper |
| Poly-logarithmic competitiveness for the \(k\)-taxi problem | 2024-11-28 | Paper |
| Online discrepancy with recourse for vectors and graphs | 2024-07-19 | Paper |
| Multiplicative rank-1 approximation using length-squared sampling | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147435 | 2024-01-15 | Paper |
| Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time | 2023-12-19 | Paper |
| Bag-Of-Tasks Scheduling on Related Machines | 2023-11-20 | Paper |
| FPT Approximation for Constrained Metric k-Median/Means | 2023-11-13 | Paper |
| Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) | 2022-10-14 | Paper |
| Caching with Time Windows and Delays | 2022-07-22 | Paper |
| Non-Clairvoyant Precedence Constrained Scheduling. | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091192 | 2022-07-21 | Paper |
| Stochastic makespan minimization in structured set systems | 2022-03-22 | Paper |
| Online Discrepancy with Recourse for Vectors and Graphs | 2021-11-11 | Paper |
| Fully-Dynamic Bin Packing with Little Repacking | 2021-07-28 | Paper |
| Non-Preemptive Flow-Time Minimization via Rejections | 2021-07-28 | Paper |
| Approximate Clustering with Same-Cluster Queries | 2021-06-15 | Paper |
| A Local-Search Algorithm for Steiner Forest | 2021-06-15 | Paper |
| Stochastic Load Balancing on Unrelated Machines | 2021-06-03 | Paper |
| Caching with time windows | 2021-01-19 | Paper |
| Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time | 2020-10-26 | Paper |
| Approximating Airports and Railways | 2020-08-05 | Paper |
| Battery scheduling problem | 2019-10-15 | Paper |
| Elastic Caching | 2019-10-15 | Paper |
| Maintaining Assignments Online: Matching, Scheduling, and Flows | 2019-06-20 | Paper |
| Online Steiner Tree with Deletions | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743439 | 2019-05-10 | Paper |
| Design and Analysis of Algorithms | 2019-01-21 | Paper |
| Sampling in space restricted settings | 2018-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607971 | 2018-03-15 | Paper |
| Faster algorithms for the constrained \(k\)-means problem | 2018-03-01 | Paper |
| Faster Algorithms for the Constrained k-Means Problem | 2018-01-24 | Paper |
| Rejecting jobs to minimize load and maximum flow-time | 2017-10-11 | Paper |
| New Approximation Schemes for Unsplittable Flow on a Path | 2017-10-05 | Paper |
| Rejecting jobs to Minimize Load and Maximum Flow-time | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365103 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365139 | 2017-09-29 | Paper |
| The heterogeneous capacitated \(k\)-center problem | 2017-08-31 | Paper |
| Online and dynamic algorithms for set cover | 2017-08-17 | Paper |
| Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. | 2017-07-13 | Paper |
| Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees | 2017-01-26 | Paper |
| Efficient on-line algorithm for maintaining k-cover of sparse bit-strings. | 2017-01-26 | Paper |
| The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online | 2016-01-07 | Paper |
| Minimizing average flow-time under knapsack constraint | 2015-12-11 | Paper |
| Sampling in space restricted settings | 2015-10-29 | Paper |
| Greedy Algorithms for Steiner Forest | 2015-08-21 | Paper |
| Facility Location with Matroid or Knapsack Constraints | 2015-05-29 | Paper |
| Provisioning a virtual private network | 2015-02-27 | Paper |
| A constant-factor approximation for stochastic Steiner forest | 2015-02-04 | Paper |
| A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation | 2015-02-04 | Paper |
| A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems | 2015-01-19 | Paper |
| Minimizing average flow time on related machines | 2014-11-25 | Paper |
| Approximation algorithms for the partition vertex cover problem | 2014-10-06 | Paper |
| Connectivity and inference problems for temporal networks | 2014-09-26 | Paper |
| Minimizing Average Flow-Time under Knapsack Constraint | 2014-09-26 | Paper |
| The power of deferral | 2014-08-07 | Paper |
| Approximation Algorithms for the Partition Vertex Cover Problem | 2013-04-12 | Paper |
| All-Norms and All-L_p-Norms Approximation Algorithms | 2012-10-19 | Paper |
| A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems | 2012-09-25 | Paper |
| Resource Allocation for Covering Time Varying Demands | 2011-09-16 | Paper |
| Scheduling Resources for Throughput Maximization | 2011-08-17 | Paper |
| Contact Center Scheduling with Strict Resource Requirements | 2011-06-24 | Paper |
| Assigning papers to referees | 2010-10-07 | Paper |
| Simpler and better approximation algorithms for network design | 2010-08-16 | Paper |
| Multi-processor scheduling to minimize flow time with ε resource augmentation | 2010-08-15 | Paper |
| Linear-time approximation schemes for clustering problems in any dimensions | 2010-07-14 | Paper |
| Scheduling with Outliers | 2009-10-28 | Paper |
| Better Algorithms for Minimizing Average Flow-Time on Related Machines | 2009-03-12 | Paper |
| Stochastic Steiner Tree with Non-uniform Inflation | 2009-02-17 | Paper |
| Minimizing Total Flow-Time: The Unrelated Case | 2009-01-29 | Paper |
| Approximation via cost sharing | 2008-12-21 | Paper |
| Order Scheduling Models: Hardness and Algorithms | 2008-04-24 | Paper |
| The Priority k-Median Problem | 2008-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5429080 | 2007-11-29 | Paper |
| Fairness Measures for Resource Allocation | 2007-06-26 | Paper |
| Efficient load-balancing routing for wireless mesh networks | 2007-06-08 | Paper |
| Approximation algorithms for the unsplittable flow problem | 2007-03-05 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Building edge-failure resilient networks | 2006-03-21 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| On a bidirected relaxation for the MULTIWAY CUT problem | 2005-09-28 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Traveling with a Pez Dispenser (or, Routing Issues in MPLS) | 2005-02-21 | Paper |
| Primal-dual algorithms for connected facility location problems | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737544 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411292 | 2003-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411277 | 2003-07-07 | Paper |
| Connectivity and inference problems for temporal networks | 2002-09-12 | Paper |
| Wavelength conversion in optical networks | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252334 | 2001-09-23 | Paper |
