| Publication | Date of Publication | Type |
|---|
On minimizing generalized makespan on unrelated machines
| 2025-01-14 | Paper |
On min sum vertex cover and generalized min sum set cover
SIAM Journal on Computing | 2025-01-14 | Paper |
A unified approach to discrepancy minimization
| 2024-08-22 | Paper |
Learning-augmented weighted paging
| 2024-07-19 | Paper |
Influence in completely bounded block-multilinear forms and classical simulation of quantum algorithms
| 2024-07-05 | Paper |
Smoothed analysis of the Komlós conjecture
| 2024-06-24 | Paper |
scientific article; zbMATH DE number 7829245 (Why is no real title available?)
| 2024-04-09 | Paper |
Discrepancy theory and related algorithms
International Congress of Mathematicians | 2024-03-22 | Paper |
scientific article; zbMATH DE number 7788507 (Why is no real title available?)
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788517 (Why is no real title available?)
| 2024-01-15 | Paper |
The power of two choices in graphical allocation
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Flow time scheduling and prefix Beck-Fiala
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
k-forrelation optimally separates Quantum and classical query complexity
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Competitive Algorithms for Generalized k -Server in Uniform Metrics
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Some remarks on hypergraph matching and the Füredi–Kahn–Seymour conjecture
Random Structures \& Algorithms | 2023-10-17 | Paper |
A nearly tight lower bound for the \(d\)-dimensional cow-path problem
Information Processing Letters | 2023-06-05 | Paper |
Contention resolution, matrix scaling and fair allocation
| 2022-10-19 | Paper |
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank
| 2022-08-23 | Paper |
scientific article; zbMATH DE number 7561425 (Why is no real title available?)
| 2022-07-21 | Paper |
Smoothed Analysis of the Koml\'os Conjecture
| 2022-04-25 | Paper |
Influence in Completely Bounded Block-multilinear Forms and Classical Simulation of Quantum Algorithms
| 2022-02-28 | Paper |
Lift-and-round to improve weighted completion time on unrelated machines
SIAM Journal on Computing | 2021-06-29 | Paper |
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Online vector balancing and geometric discrepancy
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
On-line balancing of random inputs
Random Structures \& Algorithms | 2021-01-05 | Paper |
On the discrepancy of random low degree set systems
Random Structures \& Algorithms | 2020-11-30 | Paper |
New developments in iterated rounding (invited talk)
| 2020-07-19 | Paper |
Nested convex bodies are chaseable
Algorithmica | 2020-04-14 | Paper |
Achievable performance of blind policies in heavy traffic
Mathematics of Operations Research | 2020-03-12 | Paper |
The Gram-Schmidt walk: a cure for the Banaszczyk blues
Theory of Computing | 2020-02-12 | Paper |
On a generalization of iterated and randomized rounding
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Potential-function proofs for gradient methods
Theory of Computing | 2019-12-05 | Paper |
The \((h,k)\)-server problem on bounded depth trees
ACM Transactions on Algorithms | 2019-11-25 | Paper |
On the discrepancy of random low degree set systems
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
New tools and connections for exponential-time approximation
Algorithmica | 2019-09-10 | Paper |
The Gram-Schmidt walk: a cure for the Banaszczyk blues
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Improved approximation algorithm for two-dimensional bin packing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
On the number of matroids
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
An algorithm for Komlós conjecture matching Banaszczyk's bound
SIAM Journal on Computing | 2019-05-07 | Paper |
scientific article; zbMATH DE number 7051295 (Why is no real title available?)
| 2019-05-06 | Paper |
Speed scaling with an arbitrary power function
| 2019-05-06 | Paper |
scientific article; zbMATH DE number 7051239 (Why is no real title available?)
| 2019-05-06 | Paper |
Minimizing weighted flow time
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Better scalable algorithms for broadcast scheduling
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
SIAM Journal on Computing | 2018-10-11 | Paper |
A polylogarithmic-competitive algorithm for the \(k\)-server problem
Journal of the ACM | 2018-08-02 | Paper |
LP-based robust algorithms for noisy minor-free and bounded treewidth graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The (h, k)-Server Problem on Bounded Depth Trees
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved Approximation for Vector Bin Packing
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the Lovász Theta Function for Independent Sets in Sparse Graphs
SIAM Journal on Computing | 2018-07-04 | Paper |
Tight bounds for double coverage against weak adversaries
Theory of Computing Systems | 2018-04-12 | Paper |
Nested convex bodies are chaseable
| 2018-03-15 | Paper |
Competitive algorithms for generalized \(k\)-server in uniform metrics
| 2018-03-15 | Paper |
Approximation-friendly discrepancy rounding
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Tight approximation bounds for dominating set on graphs of bounded arboricity
Information Processing Letters | 2017-11-03 | Paper |
Approximating independent sets in sparse graphs
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Lift-and-round to improve weighted completion time on unrelated machines
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
The local-global conjecture for scheduling with non-linear cost
Journal of Scheduling | 2017-09-01 | Paper |
A 2-competitive algorithm for online convex optimization with switching costs
| 2017-08-31 | Paper |
Minimizing Maximum Flow-time on Related Machines
| 2017-08-31 | Paper |
Faster space-efficient algorithms for subset sum and \(k\)-sum
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Algorithmic discrepancy beyond partial coloring
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Weighted geometric set multi-cover via quasi-uniform sampling
| 2017-03-30 | Paper |
Approximating vector scheduling: almost matching upper and lower bounds
Algorithmica | 2016-12-21 | Paper |
Minimizing maximum flow-time on related machines
Theory of Computing | 2016-11-01 | Paper |
On the number of matroids
Combinatorica | 2016-09-09 | Paper |
Approximation-friendly discrepancy rounding
Lecture Notes in Computer Science | 2016-08-10 | Paper |
Tight Bounds for Double Coverage Against Weak Adversaries
Approximation and Online Algorithms | 2016-02-26 | Paper |
On the adaptivity gap of stochastic orienteering
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
On the Lovász theta function for independent sets in sparse graphs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Minimizing flow-time on unrelated machines
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
A logarithmic approximation for unsplittable flow on line graphs
ACM Transactions on Algorithms | 2015-08-14 | Paper |
On minimizing the total flow time on multiple machines
| 2015-08-03 | Paper |
New approximability and inapproximability results for 2-dimensional bin packing
| 2015-08-03 | Paper |
Algorithmic aspects of combinatorial discrepancy
A Panorama of Discrepancy Theory | 2015-07-24 | Paper |
Minimum congestion mapping in a cloud
SIAM Journal on Computing | 2015-06-24 | Paper |
Deterministic discrepancy minimization
Algorithmica | 2015-03-23 | Paper |
The geometry of scheduling
SIAM Journal on Computing | 2015-02-09 | Paper |
Speed scaling for weighted flow time
| 2014-12-18 | Paper |
Harmonic algorithm for \(3\)-dimensional strip packing problem
| 2014-12-18 | Paper |
Dynamic pricing for impatient bidders
| 2014-12-18 | Paper |
Speed scaling with an arbitrary power function
ACM Transactions on Algorithms | 2014-12-05 | Paper |
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
Algorithmica | 2014-12-02 | Paper |
The Santa Claus problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Dynamic pricing for impatient bidders
ACM Transactions on Algorithms | 2014-11-18 | Paper |
An entropy argument for counting matroids
Journal of Combinatorial Theory. Series B | 2014-10-22 | Paper |
Approximating the average response time in broadcast scheduling
| 2014-10-13 | Paper |
Job shop scheduling with unit processing times
| 2014-10-13 | Paper |
Solving packing integer programs via randomized rounding with alterations
Theory of Computing | 2014-10-06 | Paper |
Min-max Graph Partitioning and Small Set Expansion
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Min-Max Graph Partitioning and Small Set Expansion
SIAM Journal on Computing | 2014-07-30 | Paper |
Regularity Lemmas and Combinatorial Algorithms
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Optimal Long Code Test with One Free Bit
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
On the adaptivity gap of stochastic orienteering
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
A constant factor approximation algorithm for generalized MIN-sum set cover
| 2014-05-22 | Paper |
Towards the randomized \(k\)-server conjecture, a primal-dual approach
| 2014-05-22 | Paper |
Tight time-space tradeoff for mutual exclusion
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Approximating Real-Time Scheduling on Identical Machines
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Approximating vector scheduling: almost matching upper and lower bounds
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
A primal-dual randomized algorithm for weighted paging
Journal of the ACM | 2014-02-17 | Paper |
On generalizations of network design problems with degree bounds
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
A harmonic algorithm for the 3D strip packing problem
SIAM Journal on Computing | 2013-07-24 | Paper |
Multicast routing for energy minimization using speed scaling
Lecture Notes in Computer Science | 2013-04-19 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings
Algorithmica | 2012-12-06 | Paper |
Regularity lemmas and combinatorial algorithms
Theory of Computing | 2012-09-27 | Paper |
Improved bounds for speed scaling in devices obeying the cube-root rule
Theory of Computing | 2012-09-27 | Paper |
Weighted geometric set multi-cover via quasi-uniform sampling
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Randomized competitive algorithms for generalized caching
SIAM Journal on Computing | 2012-08-10 | Paper |
On the number of matroids
| 2012-06-27 | Paper |
Deterministic discrepancy minimization
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On capacitated set cover problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Average rate speed scaling
Algorithmica | 2011-07-01 | Paper |
Shape rectangularization problems in intensity-modulated radiation therapy
Algorithmica | 2011-05-10 | Paper |
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing | 2011-04-04 | Paper |
Competitive algorithms for due date scheduling
Algorithmica | 2011-03-30 | Paper |
Metrical task systems and the \(k\)-server problem on HSTs
Automata, Languages and Programming | 2010-09-07 | Paper |
Better Scalable Algorithms for Broadcast Scheduling
Automata, Languages and Programming | 2010-09-07 | Paper |
Inapproximability of hypergraph vertex cover and applications to scheduling problems
Automata, Languages and Programming | 2010-09-07 | Paper |
Speed scaling for weighted flow time
SIAM Journal on Computing | 2010-09-06 | Paper |
A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
SIAM Journal on Computing | 2010-09-06 | Paper |
Additive guarantees for degree-bounded directed network design
SIAM Journal on Computing | 2010-09-06 | Paper |
When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Server scheduling in the L p norm
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Improved approximation algorithms for broadcast scheduling
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
On generalizations of network design problems with degree bounds
Lecture Notes in Computer Science | 2010-06-22 | Paper |
On \(k\)-column sparse packing programs
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Scheduling for flow-time with admission control
Lecture Notes in Computer Science | 2010-03-03 | Paper |
On the longest common rigid subsequence problem
Algorithmica | 2010-02-23 | Paper |
A structural lemma in 2-dimensional packing, and its implications on approximability
Algorithms and Computation | 2009-12-17 | Paper |
Speed scaling with a solar cell
Theoretical Computer Science | 2009-11-04 | Paper |
Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs
| 2009-10-12 | Paper |
Improved Approximation Algorithms for Broadcast Scheduling
SIAM Journal on Computing | 2009-06-22 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Robust reductions from ranking to classification
Machine Learning | 2009-03-31 | Paper |
scientific article; zbMATH DE number 5485591 (Why is no real title available?)
| 2009-01-05 | Paper |
scientific article; zbMATH DE number 5485535 (Why is no real title available?)
| 2009-01-05 | Paper |
Speed scaling to manage energy and temperature
Journal of the ACM | 2008-12-21 | Paper |
An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Scheduling for Speed Bounded Processors
Automata, Languages and Programming | 2008-08-28 | Paper |
Speed Scaling with a Solar Cell
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research | 2008-05-27 | Paper |
Job Shop Scheduling with Unit Processing Times
Mathematics of Operations Research | 2008-05-27 | Paper |
Minimizing Makespan in No-Wait Job Shops
Mathematics of Operations Research | 2008-05-27 | Paper |
Average Rate Speed Scaling
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Two-dimensional bin packing with one-dimensional resource augmentation
Discrete Optimization | 2008-01-18 | Paper |
Robust Reductions from Ranking to Classification
Learning Theory | 2008-01-03 | Paper |
Competitive Algorithms for Due Date Scheduling
Automata, Languages and Programming | 2007-11-28 | Paper |
Minimizing Setup and Beam-On Times in Radiation Therapy
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Finding submasses in weighted strings with fast Fourier transform
Discrete Applied Mathematics | 2007-04-18 | Paper |
Handling load with less stress
Queueing Systems | 2006-11-17 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
On the average sojourn time under \(M/M/1/\)SRPT
Operations Research Letters | 2005-08-25 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Minimizing flow time on a constant number of machines with preemption
Operations Research Letters | 2005-06-01 | Paper |
Correlation clustering
Machine Learning | 2005-01-19 | Paper |
Non-clairvoyant scheduling for minimizing mean slowdown
Algorithmica | 2004-11-05 | Paper |
scientific article; zbMATH DE number 2080856 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2079378 (Why is no real title available?)
| 2004-07-28 | Paper |
A note on comparing response times in the \(M/GI/1/FB\) and \(M/GI/1/PS\) queues
Operations Research Letters | 2004-07-01 | Paper |
Analysis of the M/G/1 processor-sharing queue with bulk arrivals
Operations Research Letters | 2003-08-13 | Paper |
scientific article; zbMATH DE number 1962819 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1522934 (Why is no real title available?)
| 2001-10-30 | Paper |
