| Publication | Date of Publication | Type |
|---|
FPT approximation for capacitated sum of radii
Journal of Computer and System Sciences | 2026-06-11 | Paper |
| A simple linear time (1+)-approximation algorithm for k-means clustering in any dimensions | 2026-05-29 | Paper |
| Fairness measures for resource allocation | 2026-05-08 | Paper |
| Traveling with a Pez dispenser (or, routing issues in MPLS) | 2026-05-08 | Paper |
| Sorting and selection with structured costs | 2026-05-08 | Paper |
Fully-dynamic load balancing
Mathematical Programming. Series A. Series B | 2026-05-08 | Paper |
| Online carpooling using expander decompositions | 2026-03-23 | Paper |
| On sampling based algorithms for k-means | 2026-03-23 | Paper |
| Random separating hyperplane theorem and learning polytopes | 2026-01-14 | Paper |
| FPT approximation for capacitated sum of radii | 2025-11-04 | Paper |
Clustering what matters in constrained settings (improved outlier to outlier-free reductions)
Algorithmica | 2025-08-29 | Paper |
| A hitting set relaxation for k-server and an extension to time-windows | 2025-08-13 | Paper |
| Constant factor approximation algorithm for weighted flow time on a single machine in pseudo-polynomial time | 2025-08-12 | Paper |
| Clustering what matters in constrained settings: improved outlier to outlier-free reductions | 2025-07-24 | Paper |
| Clustering with spectral norm and the k-means algorithm | 2025-04-29 | Paper |
| Fully-dynamic load balancing | 2025-02-07 | Paper |
| 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 |
| scientific article; zbMATH DE number 7788515 (Why is no real title available?) | 2024-01-15 | Paper |
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
SIAM Journal on Computing | 2023-12-19 | Paper |
Bag-Of-Tasks Scheduling on Related Machines
(available as arXiv preprint) | 2023-11-20 | Paper |
FPT Approximation for Constrained Metric k-Median/Means
(available as arXiv preprint) | 2023-11-13 | Paper |
Stochastic makespan minimization in structured set systems (extended abstract)
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Caching with time windows and delays
SIAM Journal on Computing | 2022-07-22 | Paper |
Non-Clairvoyant Precedence Constrained Scheduling.
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561535 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Stochastic makespan minimization in structured set systems
Mathematical Programming. Series A. Series B | 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
(available as arXiv preprint) | 2021-07-28 | Paper |
Approximate Clustering with Same-Cluster Queries
(available as arXiv preprint) | 2021-06-15 | Paper |
A local-search algorithm for Steiner forest
(available as arXiv preprint) | 2021-06-15 | Paper |
Stochastic load balancing on unrelated machines
Mathematics of Operations Research | 2021-06-03 | Paper |
Caching with time windows
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Constant factor approximation algorithm for weighted flow-time on a single machine in pseudopolynomial time
SIAM Journal on Computing | 2020-10-26 | Paper |
| Approximating airports and railways | 2020-08-05 | Paper |
| Battery scheduling problem | 2019-10-15 | Paper |
Elastic Caching
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Maintaining assignments online: matching, scheduling, and flows
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Online Steiner tree with deletions
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Constant factor approximation algorithm for the knapsack median problem | 2019-05-10 | Paper |
| Design and analysis of algorithms. A contemporary perspective | 2019-01-21 | Paper |
Sampling in space restricted settings
Algorithmica | 2018-05-18 | Paper |
| Stochastic load balancing on unrelated machines | 2018-03-15 | Paper |
Stochastic load balancing on unrelated machines
(available as arXiv preprint) | 2018-03-15 | Paper |
Faster algorithms for the constrained k-means problem
Theory of Computing Systems | 2018-03-01 | Paper |
Faster algorithms for the constrained \(k\)-means problem
(available as arXiv preprint) | 2018-01-24 | Paper |
Rejecting jobs to minimize load and maximum flow-time
Journal of Computer and System Sciences | 2017-10-11 | Paper |
New approximation schemes for unsplittable flow on a path
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Rejecting jobs to Minimize Load and Maximum Flow-time
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| The matroid median problem | 2017-09-29 | Paper |
| On LP-based approximability for strict CSPs | 2017-09-29 | Paper |
The heterogeneous capacitated \(k\)-center problem
(available as arXiv preprint) | 2017-08-31 | Paper |
Online and dynamic algorithms for set cover
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Minimizing weighted _p-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
SIAM Journal on Computing | 2016-01-07 | Paper |
Minimizing average flow-time under knapsack constraint
Theoretical Computer Science | 2015-12-11 | Paper |
Sampling in space restricted settings
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Greedy algorithms for Steiner forest
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Facility Location with Matroid or Knapsack Constraints
Mathematics of Operations Research | 2015-05-29 | Paper |
Provisioning a virtual private network: a network design problem for multicommodity flow
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
A constant-factor approximation for stochastic Steiner forest
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
Algorithmica | 2015-01-19 | Paper |
Minimizing average flow time on related machines
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Approximation algorithms for the partition vertex cover problem
Theoretical Computer Science | 2014-10-06 | Paper |
Connectivity and inference problems for temporal networks
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Minimizing average flow-time under knapsack constraint
Lecture Notes in Computer Science | 2014-09-26 | Paper |
The power of deferral: maintaining a constant-competitive Steiner tree online
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Approximation algorithms for the partition vertex cover problem
WALCOM: Algorithms and Computation | 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
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Resource allocation for covering time varying demands
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Scheduling Resources for Throughput Maximization
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Contact center scheduling with strict resource requirements
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Assigning papers to referees
Algorithmica | 2010-10-07 | Paper |
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Linear-time approximation schemes for clustering problems in any dimensions
Journal of the ACM | 2010-07-14 | Paper |
Scheduling with Outliers
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Better Algorithms for Minimizing Average Flow-Time on Related Machines
Automata, Languages and Programming | 2009-03-12 | Paper |
Stochastic Steiner Tree with Non-uniform Inflation
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Minimizing Total Flow-Time: The Unrelated Case
Algorithms and Computation | 2009-01-29 | Paper |
Approximation via cost sharing
Journal of the ACM | 2008-12-21 | Paper |
Order Scheduling Models: Hardness and Algorithms
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
The Priority k-Median Problem
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
| Fuzzy reliability analysis of the desirable movement of an electric robot using T_ (the weakest t-norm) on vague set arithmetic operations | 2007-11-29 | Paper |
Fairness Measures for Resource Allocation
SIAM Journal on Computing | 2007-06-26 | Paper |
Efficient load-balancing routing for wireless mesh networks
Computer Networks | 2007-06-08 | Paper |
Approximation algorithms for the unsplittable flow problem
Algorithmica | 2007-03-05 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
Building edge-failure resilient networks
Algorithmica | 2006-03-21 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
On a bidirected relaxation for the MULTIWAY CUT problem
Discrete Applied Mathematics | 2005-09-28 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
SIAM Journal on Computing | 2005-02-21 | Paper |
Primal-dual algorithms for connected facility location problems
Algorithmica | 2004-11-05 | Paper |
| scientific article; zbMATH DE number 2086939 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1947062 (Why is no real title available?) | 2003-07-07 | Paper |
| scientific article; zbMATH DE number 1947047 (Why is no real title available?) | 2003-07-07 | Paper |
Connectivity and inference problems for temporal networks
Journal of Computer and System Sciences | 2002-09-12 | Paper |
Wavelength conversion in optical networks
Journal of Algorithms | 2001-10-07 | Paper |
| scientific article; zbMATH DE number 1305449 (Why is no real title available?) | 2001-09-23 | Paper |
