Aditi Dudeja

According to our database1, Aditi Dudeja authored at least 16 papers between 2015 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Frontier Space-Time Algorithms Using Only Full Memory.
CoRR, February, 2026

Distributed Stochastic Graph Algorithms.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2026

A Weighted-to-Unweighted Reduction for Matroid Intersection.
Proceedings of the Integer Programming and Combinatorial Optimization, 2026

The Careless Coupon Collector's Problem.
Proceedings of the 13th International Conference on Fun with Algorithms, 2026

2025
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Matching Composition and Efficient Weight Reduction in Dynamic Matching.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
A Note on Rounding Matchings in General Graphs.
CoRR, 2024

Decremental Matching in General Weighted Graphs.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022
Decremental Matching in General Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Ruling Sets in Random Order and Adversarial Streams.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

A framework for dynamic matching in weighted graphs.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

A Simple Semi-Streaming Algorithm for Global Minimum Cuts.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Incremental SCC Maintenance in Sparse Graphs.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020
Online Matching with Recourse: Random Edge Arrivals.
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.
SIAM J. Discret. Math., 2018

2015
Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015


  Loading...