Conference Papers
2026
- k-Clustering via Iterative Randomized Rounding
- On Tight FPT Time Approximation Algorithms for k-Clustering Problems
- New Convex Programming Technique for Nash Social Welfare and Scheduling
- Static to Dynamic Correlation Clustering
- Randomized Rounding over Dynamic Programs
- Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
2025
- Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
- Learning-Augmented Streaming Algorithms for Correlation Clustering
- Logarithmic Approximations for Fair k-Set Selection
- Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering
- Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
- Solving the Correlation Cluster LP in Sublinear Time
- Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
2024
- Degrees and Network Design: New Problems and Approximations
- A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
- Polylogarithmic Approximation for Robust s-t Path
- Online Load and Graph Balancing for Random Order Inputs
- Understanding the Cluster Linear Program for Correlation Clustering
2023
- Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering
- Nearly-Linear Time LP Solvers and Rounding Algorithms for Scheduling Problems
- Online Unrelated-Machine Load Balancing and Generalized Flow with Recourse
- Improved Approximations for Unrelated Machine Scheduling
2022
2021
2020
- Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard Thresholding
- On the Facility Location Problem in Online and Dynamic Models
- On Approximating Degree-Bounded Network Design Problems
- Estimating Stochastic Linear Combination of Non-linear Regressions
- Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints
2019
- Differentially Private Facility Location Revisited
- O(log2k/loglog k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm
- Automating CSI Measurement with UAVs: from Problem Formulation to Energy-Optimal Solution
- Topology Dependent Bounds for (Some) FAQs
- Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time
- On Facility Location with General Lower Bounds
- A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
2018
- Distributed k-Clustering for Data with Heavy Noise
- Approximation Algorithms for Stochastic Clustering
- Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models
- Approximating Global Optimum for Probabilistic Truth Discovery
- Constant Approximation for k-Median and k-Means with Outliers via Iterative Rounding
2017
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
- Breaking 1-1/e Barrier for Non-preemptive Throughput Maximization
- Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
- Tight Network Topology Dependent Bounds on Rounds of Communication
2016
- Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions
- Constant Approximation for Capacitated k-Median with (1+ε)-Capacity Violation
- Improved Approximation for Node-Disjoint Paths in Planar Graphs
- Approximating Capacitated k-Median with (1+ε)k Open Facilities
2015
2014
2013
2012
Journal Papers
2026
2025
2020
- On the Hardness of Approximating the k-Way Hypergraph Cut Problem
- Breaking 1-1/e Barrier for Non-preemptive Throughput Maximization
- Approximating global optimum for probabilistic truth discovery
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations
- Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities