🔥The 9th Round of Easy Loan, Earn $40 Reward is in progress❗️ ⏰ Promotion Period: January 15th - Feburary 15th, 2025 👉 Register now and check more details at gate.io/campaigns/358

Thrilled to announce our 2-approximation algorithm for Prize-Collecting Steiner Forest settling an important network design open problem for almost 35 years. Kudos to my students for hard work. Hoping to showcase it at SODA24 with deserving recognition arxiv.org/abs/2309.05172…

I couldn't resist reposting this one. What a pretty puzzle!

Can't wait to generate videos of our first cat cuddling with me instead of running away.

Janani Sundaresan, from Waterloo's Cheriton School of Computer Science, kicking off this week's "Sublinear Graph Simplification" workshop at the Simons Institute for the Theory of Computing with an exciting new result on streaming and sketching graphs #SimonsLive

Soheil Behnezhad (Northeastern U.) starting the second day of the Sublinear Graph Simplification workshop at the Simons Institute for the Theory of Computing with a two-parter talk (joint with Alma Ghafari) on sparsifiers for maximum matchings! #SimonsLive

Alma Ghafari for the second part of the talk. #SimonsLive

Excited about arxiv.org/pdf/2410.05240 Vizing's Theorem '64: Any graph of max deg Delta admits a (Delta+1)-edge coloring. 60 years later we give a near-linear time algorithm for it! Joint with: Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharyya, Martín Costa, Tianyi Zhang

Excited to kick off the next round of our 'Graph Simplification' reading group next Friday (2/14), co-organized with Ronitt Rubinfeld and Madhu Sudan. Check out our amazing speaker lineup and join our mailing list at behnezhad.com/gs/