Aditi Dudeja

According to our database, Aditi Dudeja authored at least 12 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2025

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs.

Aditi Dudeja, Rashmika Goswami, Michael Saks

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Matching Composition and Efficient Weight Reduction in Dynamic Matching.

Aaron Bernstein, Jiale Chen, Aditi Dudeja, Zachary Langley, Aaron Sidford, Ta-Wei Tu

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

A Note on Rounding Matchings in General Graphs.

Aditi Dudeja

CoRR, 2024

Decremental Matching in General Weighted Graphs.

Aditi Dudeja

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022

Decremental Matching in General Graphs.

Sepehr Assadi, Aaron Bernstein, Aditi Dudeja

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Ruling Sets in Random Order and Adversarial Streams.

Sepehr Assadi, Aditi Dudeja

Proceedings of the 35th International Symposium on Distributed Computing, 2021

A framework for dynamic matching in weighted graphs.

Aaron Bernstein, Aditi Dudeja, Zachary Langley

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A Simple Semi-Streaming Algorithm for Global Minimum Cuts.

Sepehr Assadi, Aditi Dudeja

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Incremental SCC Maintenance in Sparse Graphs.

Aaron Bernstein, Aditi Dudeja, Seth Pettie

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

Online Matching with Recourse: Random Edge Arrivals.

Aaron Bernstein, Aditi Dudeja

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2018

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.

Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay, Saket Saurabh

SIAM J. Discret. Math., 2018

2015

Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.

Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015