>>Some Talks



    2025


  1. Online Algorithms: Worst-Case and Beyond
    4 Lectures at the Swiss Winter School on TCS 2025
    Lecture #1: Set Cover in the Worst-Case [
    pptx
    ]
    Lecture #2: Set Cover and Network Design in Stochastic Models [part 1
    pptx
    ] [part 2
    pptx
    ]
    Lecture #3: Resource Allocation/Packing [
    pptx
    ]
    Lecture #4: Searching/Chasing Problems [
    pptx
    ]
    (broad introduction to online algorithms, both classical and modern)


    2. 2024


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

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

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


    5. 2019


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


    6. 2018


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

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

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

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


    10. 2017


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

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

  12. Approximation Algorithms for Stochastic Optimization
    IPCO 2017
    [
    [lec1 (pptx)], [lec2 (pptx)], [lec3 (pdf)]
    ]
    (summer school page here)

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

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

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