| A framework for dynamic matching in weighted graphs A Bernstein, A Dudeja, Z Langley Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 30 | 2021 |
| A simple semi-streaming algorithm for global minimum cuts S Assadi, A Dudeja Symposium on Simplicity in Algorithms (SOSA), 172-180, 2021 | 14 | 2021 |
| Exact and FPT algorithms for max-conflict free coloring in hypergraphs P Ashok, A Dudeja, S Kolay International Symposium on Algorithms and Computation, 271-282, 2015 | 13 | 2015 |
| Decremental matching in general graphs S Assadi, A Bernstein, A Dudeja arXiv preprint arXiv:2207.00927, 2022 | 9 | 2022 |
| Ruling Sets in Random Order and Adversarial Streams S Assadi, A Dudeja 35th International Symposium on Distributed Computing,{DISC} 2021, October 4 …, 2021 | 6 | 2021 |
| Incremental scc maintenance in sparse graphs A Bernstein, A Dudeja, S Pettie 29th Annual European Symposium on Algorithms (ESA 2021), 2021 | 5 | 2021 |
| Online matching with recourse: random edge arrivals A Bernstein, A Dudeja 40th IARCS Annual Conference on Foundations of Software Technology and …, 2020 | 4 | 2020 |
| Decremental Matching in General Weighted Graphs A Dudeja arXiv preprint arXiv:2312.08996, 2023 | 1 | 2023 |
| Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs P Ashok, A Dudeja, S Kolay, S Saurabh SIAM Journal on Discrete Mathematics 32 (2), 1189-1208, 2018 | 1 | 2018 |
| A Note on Rounding Matchings in General Graphs A Dudeja arXiv preprint arXiv:2402.03068, 2024 | | 2024 |
| Matchings in Evolving Graphs A Dudeja Rutgers The State University of New Jersey, School of Graduate Studies, 2023 | | 2023 |
| External Reviewers FOCS 2022 A Bernstein, A Potechin, A Schild, A Sidford, A Jain, A Karczmarz, ... | | |
Aaron BernsteinProfessor of Computer Science, Rutgers Universityrutgers.edu의 이메일 확인됨
