| Publication | Date of Publication | Type |
|---|
| On the hardness of scheduling with non-uniform communication delays | 2024-07-19 | Paper |
| scientific article; zbMATH DE number 7788514 (Why is no real title available?) | 2024-01-15 | Paper |
| On the Facility Location Problem in Online and Dynamic Models. | 2023-10-31 | Paper |
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Flow-time optimization for concurrent open-shop and precedence constrained scheduling models
(available as arXiv preprint) | 2021-08-04 | Paper |
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Differentially Private Release of Synthetic Graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Prior-free multi-unit auctions with ordered bidders
Theoretical Computer Science | 2020-11-06 | Paper |
Deterministically maintaining a \((2 + \epsilon)\)-approximate minimum vertex cover in \(O(1/\epsilon^2)\) amortized update time
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A polynomial time constant approximation for minimizing total weighted flow-time
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Lift and project algorithms for precedence constrained scheduling to minimize completion time
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Non-clairvoyantly scheduling to minimize convex functions
Algorithmica | 2019-08-20 | Paper |
Tight bounds for online vector scheduling
SIAM Journal on Computing | 2019-02-08 | Paper |
Competitive algorithms from competitive equilibria, non-clairvoyant scheduling under polyhedral constraints
Journal of the ACM | 2018-08-02 | Paper |
| scientific article; zbMATH DE number 6861895 (Why is no real title available?) | 2018-04-19 | Paper |
| Competitive analysis of constrained queueing systems | 2017-12-19 | Paper |
Robust price of anarchy bounds via LP and Fenchel duality
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Minimum Birkhoff-von Neumann decomposition | 2017-08-31 | Paper |
Coordination mechanisms from (almost) all scheduling policies
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Minimizing flow-time on unrelated machines
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Coordination mechanisms for selfish routing over time on a tree
Automata, Languages, and Programming | 2014-07-01 | Paper |
Online non-clairvoyant scheduling to simultaneously minimize all convex functions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Algorithms for cost-aware scheduling
Approximation and Online Algorithms | 2013-09-13 | Paper |
