>>Some Talks





    2024


  1. Beyond Worst-Case Analysis for Online Algorithms
    APPROX/RANDOM 2024 Invited Talk
    [ ]
    (algorithms for random-order set cover and online-with-a-sample load balancing)

  2. Graph Exploration with Predictions
    Talks at Columbia and TTIC
    [ ]
    ("Astar-like" algorithms for graph searching when given predictions for distance to target)

  3. The Price of Explainability in Clustering
    Talk at UC San Diego and Rutgers
    [ ]
    (We show near-optimal bounds on the gap between explainable and general k-medians and k-means)



  4. 2019


  5. Robust Algorithms for Bandits and Secretaries
    Northwestern Quarterly Workshop
    [
    ]
    (algorithms for bandits and secretaries that allow adversarial noise)



  6. 2018


  7. Projection-based Algorithms for K-server
    Simons Reunion Workshop
    [
    ]
    (Simons semester program on Bridging Continuous and Discrete Optimization)

  8. On some Stochastic Load Balancing Problems
    Workshop on Scheduling in Data Centers
    [
    pdf
    ]
    (TTIC Summer Workshop: Data Center Scheduling from Theory to Practice)

  9. Improved Algorithms for k-cut
    Flexible Network Design workshop
    Midwest Theory Day
    [ ]
    (talk on approximation and exact algorithms for k-cut)

  10. Approximation Algorithms for Uncertain Environments
    SODA 2018
    [ ]
    (invited talk; survey on approximation algorithms for stochastic problems)



  11. 2017


  12. Sampling Algorithms for Combinatorial Pure Exploration
    Workshop on Optimization, Statistics and Uncertainty
    [ ]
    (Simons Institute semester program on Bridging Continuous and Discrete Optimization)

  13. LPs and Convex Programming Relaxations and Rounding for Stochastic Problems
    Workshop on Discrete Optimization via Continuous Relaxation
    [ ]
    (Simons Institute semester program on Bridging Continuous and Discrete Optimization)

  14. Approximation Algorithms for Stochastic Optimization
    IPCO 2017
    [ ]
    (summer school page here)

  15. Online and Dynamic Algorithms for Set Cover
    STOC 2017
    [ ]

  16. A Little Change will do you Good
    Workshop on Algorithms and Optimization Under Uncertainty
    [ ]
    (survey talk on online optimization with recourse at Shonan)


Designed by Kanat Tangwongsan, mildly altered by AG.
Last updated: 2017-05-21.