>> Publications


Home | Toggle Abstract

Peer-Reviewed Publications:

  1. Almost Tight Bounds for Differentially Private Densest Subgraph
    SODA '25
    (with Satyen Kale, Silvio Lattanzi, and Sergei Vassilvitskii)
  2. Binary Search with Distributional Predictions
    NeurIPS '24
    (with Sungjin Im, Thomas Lavastida, Benjamin Moseley, Aidin Niaparast, and Sergei Vassilvitskii)
  3. Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
    DISC '24
    (with Laxman Dhulipala, Jakub Lacki, and Slobodan Mitrovic)
  4. Degrees and Network Design: New Problems and Approximations
    APPROX '24
    (with Guy Kortsarz and Shi Li)
  5. Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
    INFOCOM '24
    (with Wenkai Dai, Klaus-Tycho Foerster, Long Luo, and Stefan Schmid)
  6. Controlling Tail Risk in Online Ski-Rental
    SODA '24
    (with Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii)
  7. Improved Approximations for Relative Survivable Network Design
    WAOA '23
    (with Ama Koranteng, Guy Kortsarz, and Zeev Nutov)
    Invited to special issue of Transactions on Computing Systems
  8. Epic Fail: Emulators can tolerate polynomially many edge faults for free
    ITCS '23
    (with Greg Bodwin and Yasamin Nazari)
  9. Algorithms with Prediction Portfolios
    NeurIPS '22
    (with Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii)
  10. Smoothed Analysis of Information Spreading in Dynamic Networks
    DISC '22
    (with Jeremy Fineman, Seth Gilbert, and Calvin Newport)
    Best Paper Award, Invited to Journal of the ACM
  11. Relative Survivable Network Design
    APPROX '22
    (with Ama Koranteng and Guy Kortsarz)
  12. Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
    AISTATS '22
    (with Amy Babay, Aravind Srinivasan, Leonidas Tsepenekas, and Anil Vullikanti)
  13. Fair Disaster Containment via Graph-Cut Problems
    AISTATS '22
    (with Aravind Srinivasan, Leonidas Tsepenekas, and Anil Vullikanti)
  14. Vertex Fault-Tolerant Emulators
    ITCS '22
    (with Greg Bodwin and Yasamin Nazari)
  15. Partially Optimal Edge Fault-Tolerant Spanners
    SODA '22
    (with Greg Bodwin and Caleb Robelle)
  16. Faster Matchings via Learned Duals
    NeurIPS '21
    (with Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii)
    Selected for Oral Presentation
  17. Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
    SODA '21
    (with Greg Bodwin and Caleb Robelle)
  18. Efficient and Simple Algorithms for Fault Tolerant Spanners
    PODC '20
    (with Caleb Robelle)
  19. Scheduling for Weighted Flow and Completion Times in Reconfigurable Networks
    INFOCOM '20
    (with Benjamin Moseley)
  20. Lasserre Integrality Gaps for Graph Spanners and Related Problems
    WAOA '20
    (with Yasamin Nazari and Zeyu Zhang)
  21. Massively Parallel Approximate Distance Sketches
    OPODIS '19
    (with Yasamin Nazari)
    Best Student Paper Award
  22. Reception Capacity: Definitions, Game Theory, and Hardness
    ALGOSENSORS '19
    (with Naomi Ephraim)
  23. The Capacity of Smartphone Peer-to-Peer Networks
    DISC '19
    (with Magnús Halldórsson, Calvin Newport, and Alex Weaver)
  24. Approximating the Norms of Graph Spanners
    APPROX '19
    (with Eden Chlamtáč and Thomas Robinson)
  25. Distributed Algorithms for Minimum Degree Spanning Trees
    PODC '19
    (with Magnús Halldórsson, Taisuke Izumi, and Calvin Newport)
  26. The Norms of Graph Spanners
    ICALP '19
    (with Eden Chlamtáč and Thomas Robinson)
  27. Policy Regret in Repeated Games
    NeurIPS '18
    (with Raman Arora, Teodor V. Marinov, and Mehryar Mohri)
  28. Large Low-Diameter Graphs are Good Expanders
    ESA '18, Journal of Combinatorial Theory (B)
    (with Michael Schapira and Gal Shahaf)
  29. Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
    SODA '18
    (with Greg Bodwin, Merav Parter, and Virginia Vassilevska Williams)
  30. Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
    FSTTCS '18
    (with Amy Babay and Zeyu Zhang)
  31. Distributed Distance-Bounded Network Design Through Distributed Convex Programming
    OPODIS '17
    (with Yasamin Nazari)
  32. Timely, Reliable, and Cost-Effective Internet Transport Service using Dissemination Graphs
    ICDCS '17
    (with Amy Babay, Emily Wagner, and Yair Amir)
    Best Paper Award
  33. Load Balancing with Bounded Convergence in Dynamic Networks
    INFOCOM '17
    (with Jeremy Fineman, Seth Gilbert, and Calvin Newport)
  34. Approximating Approximate Distance Oracles
    ITCS '17
    (with Zeyu Zhang)
  35. Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
    SODA '17
    (with Eden Chlamtáč and Yury Makarychev)
  36. Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
    SODA '17, ACM Transactions on Algorithms
    (with Eden Chlamtáč, Guy Kortsarz, and Bundit Laekhanukit)
  37. Xpander: Towards Optimal-Performance Datacenters
    CoNext '16
    (with Asaf Valadarsky, Gal Shahaf, and Michael Schapira)
  38. The Densest k-Subhypergraph Problem
    APPROX '16, SIAM Journal on Discrete Mathematics
    (with Eden Chlamtáč, Christian Konrad, Guy Kortsarz, and George Rabanca)
  39. Computing Approximate PSD Factorizations
    APPROX '16
    (with Amitabh Basu and Xin Li)
  40. Approximating Low-Stretch Spanners
    SODA '16
    (with Zeyu Zhang)
  41. Smoothed Analysis of Dynamic Networks
    DISC '15, Distributed Computing
    (with Jeremy Fineman, Seth Gilbert, and Calvin Newport)
    Invited to special issue of Distributed Computing
  42. Explicit Expanding Expanders
    ESA '15, Algorithmica
    (with Michael Schapira and Asaf Valadarsky)
    Invited to special issue of Algorithmica
  43. Towards Resistance Sparsifiers
    RANDOM '15
    (with Robert Krauthgamer and Tal Wagner)
  44. Lowest Degree k-Spanner: Approximation and Hardness
    APPROX '14, Theory of Computing
    (with Eden Chlamtáč)
    Invited to special issue of Theory of Computing
  45. Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights
    APPROX '14, ACM Transactions on Algorithms
    (with Guy Kortsarz and Zeev Nutov)
  46. Braess's Paradox in Wireless Networks: The Danger of Improved Technology
    DISC '13
    (with Merav Parter)
  47. Packing Interdiction and Partial Covering Problems
    IPCO '13
    (with Anupam Gupta)
  48. Matroid Secretary for Regular and Decomposable Matroids
    SODA '13, SIAM Journal on Computing
    (with Guy Kortsarz)
  49. Everywhere-Sparse Spanners via Dense Subgraphs
    FOCS '12
    (with Eden Chlamtáč and Robert Krauthgamer)
  50. IBGP and Constrained Connectivity
    APPROX '12
    (with Gordon Wilfong)
  51. Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
    ICALP '12, ACM Transactions on Algorithms
    (with Guy Kortsarz and Ran Raz)
  52. Efficient Computation of Distance Sketches in Distributed Networks
    SPAA '12, Distributed Computing
    (with Atish Das Sarma and Gopal Pandurangan)
  53. Fault-Tolerant Spanners: Better and Simpler
    PODC '11
    |
    (with Robert Krauthgamer)
  54. Directed Spanners via Flow-Based Linear Programs
    STOC '11
    |
    (with Robert Krauthgamer)
  55. Distributed Algorithms for Approximating Wireless Network Capacity
    INFOCOM '10
    |
  56. Graphical Representations of Clutters
    Ars Combinatoria (2010)
    |
    (with Jonah Gold, Thomas Sharkey, and Lorenzo Traldi)
  57. Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory
    INFOCOM '09
    |
    (with Matthew Andrews)
  58. Secretary Problems: Weights and Discounts
    SODA '09
    |
    (with Moshe Babaioff, Anupam Gupta, Nicole Immorlica, and Kunal Talwar)
  59. Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
    DISC '08
    |
  60. Compact Routing with Slack
    PODC '07
    |
  61. Spanners with Slack
    ESA '06
    |
    (with T-H. Hubert Chan and Anupam Gupta)
  62. Full rank tilings of finite abelian groups
    SIAM Journal on Discrete Mathematics (2006)
    |
  63. Enumeration of Balanced Tournament Designs on 10 points
    Journal of Combinatorial Mathematics and Combinatorial Computing (2005)
    |
    (with Jeffrey Dinitz)

Surveys:

  1. Recent Advances on the Matroid Secretary Problem
    SIGACT News (2013)

Manuscripts:

  1. Light Edge Fault Tolerant Graph Spanners
    (with Greg Bodwin, Ama Koranteng, and Lily Wang)
  2. Approximation Algorithms for Optimal Hopsets
    (with Ama Koranteng and Yasamin Nazari)
  3. Differentially Private Matchings
    (with George Z Li, Quanquan C Liu, and Felix Zhou)
  4. Noise is All You Need: Private Second-Order Convergence of Noisy SGD
    (with Dmitrii Avdiukhin, Chenglin Fan, and Grigory Yaroslavtsev)
  5. Differentially Private Multiway and k-Cut
    (with Rishi Chandra, Chenglin Fan, and Zongrui Zou)

Just for fun:

  1. Highly efficient and effective removal of fat from fried chicken via centrifugation
    Annals of Improbable Research (2013)
    (with Lucas Carey and Desiree Tillo)
  2. An Incentive-Compatible Mechanism for all Settings: Chuck Norris
    SIGBOVIK '08
  3. Slacking with Slack
    SIGBOVIK '08