Talks and Slides

Paths and Intersections: Exact Emulators for Planar Graphs

Nanjing University, Nov 2025

University of Science and Technology of China, Nov 2025

Shanghai University of Finance and Economics, Nov 2025

Shanghai Jiaotong University, Nov 2025

Beijing University, Nov 2025

Lower Bounds on Tree Covers

UMN Combinatorics Seminar, Oct 2025

Combinatorics Seminar at Carleton University, online, Oct 2025

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances

Symposium on Discrete Algorithms (SODA 2025), Jan 2025

On (1+ε)-Approximate Flow Sparsifiers

Symposium on Discrete Algorithms (SODA 2024), Jan 2024

Junior Theorists Workshop 2023 at Northwestern University, Nov 2023

Student Theory Seminar at Yale, Nov 2023

Algorithm and Theory Seminar at Boston University, Oct 2023

Theory Seminar at Boston College, Oct 2023

Theory Seminar at Brown, Oct 2023 [video link]

Theory Seminar at Weizmann Institute of Science, Oct 2023

Computer Science Theory Seminar at UIC, Oct 2023

Theory Seminar at UIUC, Oct 2023

Algorithm Seminar at Duke, Oct 2023

JHU Theory Seminar, Oct 2023

CATS Seminar at University of Maryland, Oct 2023

Theory Lunch at Columbia University, Sep 2023

NYU Theory Seminar, Sep 2023

Almost Optimal Sublinear Additive Spanners

Sublinear Graph Simplification Workshop at Simons Institute, July 2024

UMich CS Theory Seminar, Apr 2023

A New Conjecture on Hardness of Low-Degree 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems

Innovations in Theoretical Computer Science (ITCS 2023), MIT, Jan 2023 [video link]

Query Complexity of the Metric Steiner Tree Problem

Sublinear Algorithms Workshop, MIT, Aug 2022 [video link]

Workshop on Local Algorithms (WOLA 2022), online, Jun 2022

Near-Linear ε-Emulators for Planar Graphs

28th Atlanta Lecture Series, Georgia Tech, Mar 2024

Rutgers/DIMACS Theory of Computing Seminar, Sep 2022

ACM Symposium on Theory of Computing (STOC 2022), online, Jun 2022 [video link]

The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

Symposium on Discrete Algorithms (SODA 2021), online, Jan 2021 [video link]

A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs

CS Theory Seminar at UPenn, Mar 2023

CS Theory Lunch at Princeton, Feb 2023

CSDM Seminar II at IAS, Jan 2023

CS Theory Seminar at Northeastern University, online, Jan 2023

Crossing Number Workshop, online, July 2022

ACM Symposium on Theory of Computing (STOC 2022), online, Jun 2022 [video link]

Theory Seminar at Northwestern University, Apr 2022

Theory Lunch at CMU, online, Feb 2022 [video link]

Algorithm & Complexity Seminar at MIT, online, Jan 2022

Rutgers/DIMACS Theory of Computing Seminar, online, Nov 2021

Symposium on Foundations of Computer Science (FOCS 2020), online, Oct 2020 [video link]

Towards Tight(er) Bounds for the Excluded Grid Theorem

Virtual Discrete Math Colloquium at IBS Discrete Mathematics Group of Institute for Basic Science, online, Sep 2020.

Seminar at Center on Frontiers of Computing Studies of Peking University, Sep 2019.

Foundations of Computer Science Seminar at the Weizmann Institute of Science, Apr 2019.

Theory Lunch in Computer Science Department of Technion - Israel Institute of Technology, Mar 2019.

Algorithm Seminar in School of Computer Science of Tel Aviv University, Mar 2019.

Symposium on Discrete Algorithms (SODA 2019), San Diego, Jan 2019.

On Packing Low-Diameter Spanning Trees

International Colloquium on Automata, Languages and Programming (ICALP 2020), online, Jun 2020 [video link].

Seminar at Institute for Theoretical Computer Science of Shanghai University of Finance and Economics, Sep 2019.

Microsoft Research Asia, Sep 2019.

On the Inequalities of Projected Volumes and the Constructible Region

The Chinese University of Hong Kong, Jan 2016.