Aditi Dudeja

19 papers A* 5A 2B 1Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Weighted-to-Unweighted Reduction for Matroid Intersection.
CoRR
Aditi Dudeja, Mara Grilnberger
2026 J jnl
Frontier Space-Time Algorithms Using Only Full Memory.
CoRR
Petr Chmel, Aditi Dudeja, Michal Koucký, Ian Mertz, Ninad Rajgopal
2026 J jnl
The Careless Coupon Collector's Problem.
CoRR
Emilio Cruciani, Aditi Dudeja
2025 A* conf
Matching Composition and Efficient Weight Reduction in Dynamic Matching.
SODA
Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu
2025 A* conf
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs.
SODA
Aditi Dudeja, Rashmika Goswami, Michael Saks
2024 J jnl
A Note on Rounding Matchings in General Graphs.
CoRR
Aditi Dudeja
2024 A* conf
Decremental Matching in General Weighted Graphs.
ICALP
Aditi Dudeja
2024 J jnl
Matching Composition and Efficient Weight Reduction in Dynamic Matching.
CoRR
Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu
2024 J jnl
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs.
CoRR
Aditi Dudeja, Rashmika Goswami, Michael Saks
2023 J jnl
Decremental Matching in General Weighted Graphs.
CoRR
Aditi Dudeja
2022 A* conf
Decremental Matching in General Graphs.
ICALP
Sepehr Assadi, Aaron Bernstein, Aditi Dudeja
2022 J jnl
Decremental Matching in General Graphs.
CoRR
Sepehr Assadi, Aaron Bernstein, Aditi Dudeja
2021 — conf
A Simple Semi-Streaming Algorithm for Global Minimum Cuts.
SOSA
Sepehr Assadi, Aditi Dudeja
2021 A* conf
A framework for dynamic matching in weighted graphs.
STOC
Aaron Bernstein, Aditi Dudeja, Zachary Langley
2021 A conf
Incremental SCC Maintenance in Sparse Graphs.
ESA
Aaron Bernstein, Aditi Dudeja, Seth Pettie
2021 A conf
Ruling Sets in Random Order and Adversarial Streams.
DISC
Sepehr Assadi, Aditi Dudeja
2020 — conf
Online Matching with Recourse: Random Edge Arrivals.
FSTTCS
Aaron Bernstein, Aditi Dudeja
2018 J jnl
Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.
SIAM J. Discret. Math.
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh
2015 B conf
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.
ISAAC
Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay