Rounding Dynamic Matchings Against an Adaptive Adversary

Explore the intricacies of dynamic matchings against adaptive adversaries in this 25-minute conference talk. Delve into how dynamic algorithms can accelerate static algorithms and examine the current state-of-the-art for dynamic matching. Learn about a novel framework that combines sparsifiers, fractional matching, and edge coloring techniques to tackle this challenging problem. Follow the roadmap from the introduction of adaptive adversaries to the final conclusion, gaining insights into the speaker's research results and their implications for the field of algorithmic graph theory.

Adaptive Adversaries
Dynamic algorithms can speed up static algorithms
State of the art for dynamic matching
Our results
Our Framework / Roadmap
Sparsifiers
Fractional Matching
Edge Coloring
Putting it all together
Conclusion