Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs. - Pradeesha Ashok; Aditi Dudeja; Sudeshna Kolay (ISAAC, 2015)

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs. - Pradeesha Ashok; Aditi Dudeja; Sudeshna Kolay; Saket Saurabh 001 (SIAM J. Discret. Math., 2018)

Online Matching with Recourse: Random Edge Arrivals. - Aaron Bernstein; Aditi Dudeja (FSTTCS, 2020)

Incremental SCC Maintenance in Sparse Graphs. - Aaron Bernstein; Aditi Dudeja; Seth Pettie (ESA, 2021)

A Simple Semi-Streaming Algorithm for Global Minimum Cuts. - Sepehr Assadi; Aditi Dudeja (SOSA, 2021)

A framework for dynamic matching in weighted graphs. - Aaron Bernstein; Aditi Dudeja; Zachary Langley (STOC, 2021)

Ruling Sets in Random Order and Adversarial Streams. - Sepehr Assadi; Aditi Dudeja (DISC, 2021)

Decremental Matching in General Graphs. - Sepehr Assadi; Aaron Bernstein; Aditi Dudeja (ICALP, 2022)

Decremental Matching in General Weighted Graphs. - Aditi Dudeja (ICALP, 2024)

A Note on Rounding Matchings in General Graphs. - Aditi Dudeja (CoRR, 2024)

Matching Composition and Efficient Weight Reduction in Dynamic Matching. - Aaron Bernstein; Jiale Chen 003; Aditi Dudeja; Zachary Langley; Aaron Sidford; Ta-Wei Tu (SODA, 2025)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs. - Aditi Dudeja; Rashmika Goswami; Michael Saks 001 (SODA, 2025)