| Publication | Date of Publication | Type |
|---|
| Santa claus meets makespan and matroids: algorithms and reductions | 2024-11-28 | Paper |
Online cardinality constrained scheduling
Operations Research Letters | 2024-06-17 | Paper |
| Simpler constant factor approximation algorithms for weighted flow time -- now for any \(p\)-norm | 2024-05-29 | Paper |
| Load balancing: the long road from theory to practice | 2024-05-24 | Paper |
| On minimizing tardy processing time, Max-Min skewed convolution, and triangular structured ILPs | 2024-05-14 | Paper |
| Towards non-uniform \(k\)-center with constant types of radii | 2024-05-14 | Paper |
| A PTAS for minimizing weighted flow time on a single machine | 2024-05-08 | Paper |
| Better trees for Santa Claus | 2024-05-08 | Paper |
| Cardinality constrained scheduling in online models | 2024-04-23 | Paper |
On Integer Programming, Discrepancy, and Convolution
Mathematics of Operations Research | 2024-02-27 | Paper |
scientific article; zbMATH DE number 7788439 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Flow time scheduling and prefix Beck-Fiala
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Optimizing low dimensional functions over the integers
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Online bin covering with limited migration
Journal of Computer and System Sciences | 2023-03-10 | Paper |
Local search breaks 1.75 for graph balancing
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561568 (Why is no real title available?) | 2022-07-21 | Paper |
| On integer programming and convolution | 2022-07-18 | Paper |
Online Bin Covering with Limited Migration
(available as arXiv preprint) | 2022-05-11 | Paper |
Approximation results for makespan minimization with budgeted uncertainty
Theory of Computing Systems | 2021-09-28 | Paper |
Near-linear time algorithm for \(n\)-fold ILPs via color coding
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
A quasi-polynomial approximation for the restricted assignment problem
SIAM Journal on Computing | 2020-12-04 | Paper |
A note on the integrality gap of the configuration LP for restricted Santa Claus
Information Processing Letters | 2020-10-07 | Paper |
Approximation results for makespan minimization with budgeted uncertainty
Approximation and Online Algorithms | 2020-08-24 | Paper |
| Compact LP relaxations for allocation problems | 2019-10-25 | Paper |
On the configuration-LP of the restricted assignment problem
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A quasi-polynomial approximation for the restricted assignment problem
(available as arXiv preprint) | 2017-08-31 | Paper |
Structured instances of restricted assignment with two processing times
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
