About Me

I am a tenure-track Assistant Professor at the School of Data Science, CUHK-Shenzhen. Prior to this, I was a postdoc in the Big Data Algorithms Group at the University of Salzburg. I obtained my PhD from the Computer Science Department of Rutgers University. My research interests are in graph algorithms.

Publications

1. Frontier Space-time Algorithms Using Only Full Memory. with Petr Chmel, Michal Koucký, Ian Mertz, and Ninad Rajgopal
   Full version: [arXiv].
   

2. A Weighted-to-Unweighted Reduction for Matroid Intersection.
   with Mara Grilnberger
   In IPCO 2026
   Full version: [arXiv].
   

3. The Careless Coupon Collector Problem.
   with Emilio Cruciani
   In FUN 2026
   Full version: [arXiv].
   

4. Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs.
   with Rashmika Goswami, Michael Saks.
   In SODA 2025.
   Full version: [arXiv].
   

5. Matching Composition and Efficient Weight Reduction in Dynamic Matching.
   with Aaron Bernstein, Jiale Chen, Zach Langley, Aaron Sidford, Ta-Wei Tu.
   In SODA 2025.

6. Decremental Matching in General Weighted Graphs.
   In ICALP 2024.
   Full version: [arXiv].

7. Decremental Matching in General Graphs.
   with Sepehr Assadi, Aaron Bernstein.
   In ICALP 2022.
   Full version: [pdf].
   Slides: [pdf].

8. A Framework for Dynamic Matching in Weighted Graphs.
   with Aaron Bernstein, Zach Langley.
   In STOC 2021.
   Full version: [pdf].
   Talk (by Zach): [video].
   Poster: [pdf].
   

9. Incremental SCC Maintenance in Sparse Graphs.
   with Aaron Bernstein, Seth Pettie.
   In ESA 2021.
   Full version: [pdf].
   Slides: [pdf].

10. Ruling Sets in Random Order and Adversarial Streams.
    with Sepehr Assadi.
    In DISC 2021.
    Talk: [video].
    Slides: [pdf].

11. A Simple Semi-Streaming Algorithm for Global Minimum Cuts.
    with Sepehr Assadi.
    In SOSA 2021.
    Full version: [pdf].
    Slides: [pdf].

12. Online Matching with Recourse: Random Edge Arrivals.
    with Aaron Bernstein.
    In FSTTCS 2020.
    Full version: [pdf].
    Talk: [video].
    Slides: [pdf].
    

13. Exact and FPT Algorithms for Max-Conflict Free Colouring in Hypergraphs
    with Pradeesha Ashok, Sudeshna Kolay.
    In ISAAC 2015.

Talks

• Dynamic Matching in Weighted Graphs
  Rising Star Talk at 5th TCS Women Meeting, STOC 2022
  

Teaching

At Rutgers:

• TA for CS 206: Introduction to Discrete Structures II, Summer 2021 and Summer 2022
• TA for CS 205: Introduction to Discrete Structures I, Summer 2020
• TA for CS 344: Algorithms, Fall 2019

At Salzburg:

• Co-Instructor for Introduction to Big Data Algorithms, Summer 2024

Miscellaneous

From Summer 2019 to Fall 2020, I was a co-organizer of the Theory of Computation Reading Seminar.