| Parallel Machine Scheduling to Minimize Energy Consumption. | 0 | 0.34 | 2020 |
| Non-clairvoyant Precedence Constrained Scheduling. | 0 | 0.34 | 2019 |
| Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time | 0 | 0.34 | 2018 |
| On Fair Division for Indivisible Items. | 0 | 0.34 | 2018 |
| On Fair Division of Indivisible Items. | 0 | 0.34 | 2018 |
| A 5-Approximation for Universal Facility Location. | 0 | 0.34 | 2018 |
| A Human Computer Interaction Solution for Radiology Reporting: Evaluation of the Factors of Variation. | 0 | 0.34 | 2016 |
| New approximation schemes for unsplittable flow on a path | 6 | 0.46 | 2015 |
| Stereoscopic Interpretation of Low-Dose Breast Tomosynthesis Projection Images. | 2 | 0.41 | 2014 |
| Minimizing maximum (weighted) flow-time on related and unrelated machines | 5 | 0.42 | 2013 |
| A 3-approximation algorithm for the facility location problem with uniform capacities. | 9 | 0.53 | 2013 |
| Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. | 3 | 0.40 | 2012 |
| A 5-approximation for capacitated facility location | 18 | 1.15 | 2012 |
| Resource augmentation for weighted flow-time explained by dual fitting | 33 | 1.07 | 2012 |
| A 4/3-approximation for TSP on cubic 3-edge-connected graphs | 4 | 0.54 | 2011 |
| A 3-approximation for facility location with uniform capacities | 16 | 0.99 | 2010 |
| Assigning Papers to Referees | 27 | 1.55 | 2010 |
| Minimizing Average Flow-Time | 1 | 0.35 | 2009 |
| A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation | 28 | 1.22 | 2009 |
| Stochastic analyses for online combinatorial optimization problems | 29 | 1.19 | 2008 |
| Minimizing Total Flow-Time: The Unrelated Case | 6 | 0.57 | 2008 |
| Order scheduling models: hardness and algorithms | 20 | 1.03 | 2007 |
| Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. | 319 | 17.30 | 2007 |
| Minimizing Average Flow-time: Upper and Lower Bounds | 28 | 1.32 | 2007 |
| Minimizing average flow time on related machines | 9 | 0.80 | 2006 |
| Better algorithms for minimizing average flow-time on related machines | 13 | 0.92 | 2006 |
| FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings | 27 | 1.86 | 2006 |
| Price of anarchy, locality gap, and a network service provider game | 13 | 0.68 | 2005 |
| Improved approximation for universal facility location | 15 | 0.78 | 2005 |
| Saving an epsilon: a 2-approximation for the k-MST problem in graphs | 62 | 2.85 | 2005 |
| Heuristic improvements for computing maximum multicommodity flow and minimum multicut | 2 | 0.45 | 2005 |
| Local Search Heuristics for k-Median and Facility Location Problems | 246 | 10.62 | 2004 |
| Fractional Covering with Upper Bounds on the Variables: Solving LPs with Negative Entries | 10 | 0.84 | 2004 |
| Multiway cuts in node weighted graphs | 51 | 2.09 | 2004 |
| Min-max tree covers of graphs | 48 | 2.28 | 2004 |
| A combinatorial algorithm for computing a maximum independent set in a t-perfect graph | 8 | 0.59 | 2003 |
| Bandwidth Maximization in Multicasting | 12 | 0.92 | 2003 |
| Covering Graphs Using Trees and Stars | 11 | 0.91 | 2003 |
| Distributed long-lived list colouring: how to dynamically allocate frequencies in cellular networks | 3 | 0.40 | 2002 |
| Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems | 8 | 0.74 | 2002 |
| On-Line End-to-End Congestion Control | 15 | 1.14 | 2002 |
| Local search heuristic for k-median and facility location problems | 178 | 13.40 | 2001 |
| On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem | 24 | 1.27 | 2001 |
| Minimizing stall time in single and parallel disk systems | 30 | 2.05 | 2000 |
| On the Single-Source Unsplittable Flow Problem | 77 | 5.23 | 1999 |
| A Randomized Algorithm for Flow Shop Scheduling | 0 | 0.34 | 1999 |
| Finding Separator Cuts in Planar Graphs within Twice the Optimal | 12 | 2.73 | 1999 |
| A polylogarithmic approximation algorithm for the group Steiner tree problem | 122 | 10.89 | 1998 |
| The p-neighbor k-center problem | 19 | 1.70 | 1998 |
| An O (log k)-Approximation Algorithm for the k Minimum Spanning Tree Problem in the Plane. | 0 | 0.34 | 1997 |
