Postdoctoral Fellow
University of Salzburg
I am a postdoc in the Big Data Algorithms Group at the University of Salzburg. Before this, I was a PhD student in the Computer Science Department of Rutgers University. My research interests are in graph algorithms.
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs.
with Rashmika Goswami, Michael Saks.
In SODA 2025.
Full version: [arXiv].
Matching Composition and Efficient Weight Reduction in Dynamic
Matching.
with Aaron Bernstein, Jiale Chen, Zach Langley, Aaron Sidford, Ta-Wei Tu.
In SODA 2025.
Decremental Matching in General Weighted Graphs.
In ICALP 2024.
Full version: [arXiv].
Decremental Matching in General Graphs.
with Sepehr Assadi, Aaron Bernstein.
In ICALP 2022.
Full version: [pdf].
Slides: [pdf].
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].
Incremental SCC Maintenance in Sparse Graphs.
with Aaron Bernstein, Seth Pettie.
In ESA 2021.
Full version: [pdf].
Slides: [pdf].
Ruling Sets in Random Order and Adversarial Streams.
with Sepehr Assadi.
In DISC 2021.
Talk: [video].
Slides: [pdf].
A Simple Semi-Streaming Algorithm for Global Minimum Cuts.
with Sepehr Assadi.
In SOSA 2021.
Full version: [pdf].
Slides: [pdf].
Online Matching with Recourse: Random Edge Arrivals.
with Aaron Bernstein.
In FSTTCS 2020.
Full version: [pdf].
Talk: [video].
Slides: [pdf].
Exact and FPT Algorithms for Max-Conflict Free Colouring in Hypergraphs
with Pradeesha Ashok, Sudeshna Kolay.
In ISAAC 2015.
From Summer 2019 to Fall 2020, I was a co-organizer of the Theory of Computation Reading Seminar.