| Fast algorithms for Vizing's theorem on bounded degree graphs A Bernshteyn, A Dhawan arXiv preprint arXiv:2303.05408, 2023 | 16 | 2023 |
| Colouring graphs with forbidden bipartite subgraphs J Anderson, A Bernshteyn, A Dhawan Combinatorics, Probability and Computing 32 (1), 45-67, 2023 | 13 | 2023 |
| Detection of dense subhypergraphs by low-degree polynomials A Dhawan, C Mao, AS Wein arXiv preprint arXiv:2304.08135, 2023 | 9 | 2023 |
| Borel Vizing's Theorem for Graphs of Subexponential Growth A Bernshteyn, A Dhawan arXiv preprint arXiv:2307.00095, 2023 | 6 | 2023 |
| Coloring graphs with forbidden almost bipartite subgraphs J Anderson, A Bernshteyn, A Dhawan arXiv preprint arXiv:2203.07222, 2022 | 6 | 2022 |
| Edge-Coloring Algorithms for Bounded Degree Multigraphs A Dhawan Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 5 | 2024 |
| Coloring locally sparse graphs J Anderson, A Dhawan, A Kuchukova arXiv preprint arXiv:2402.19271, 2024 | 4 | 2024 |
| List colorings of -partite -graphs A Dhawan arXiv preprint arXiv:2311.03111, 2023 | 3 | 2023 |
| A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time A Dhawan arXiv preprint arXiv:2407.16585, 2024 | 2 | 2024 |
| Balanced independent sets and colorings of hypergraphs A Dhawan arXiv preprint arXiv:2311.01940, 2023 | 2 | 2023 |
| Palette Sparsification for Graphs with Sparse Neighborhoods A Dhawan arXiv preprint arXiv:2408.08256, 2024 | 1 | 2024 |
| Bounds for the independence and chromatic numbers of locally sparse graphs A Dhawan arXiv preprint arXiv:2403.03054, 2024 | 1 | 2024 |
| Multigraph edge-coloring with local list sizes A Dhawan arXiv preprint arXiv:2307.12094, 2023 | 1 | 2023 |
| Sharp analysis of EM for learning mixtures of pairwise differences A Dhawan, C Mao, A Pananjady The Thirty Sixth Annual Conference on Learning Theory, 4384-4428, 2023 | 1 | 2023 |
| Fast and Simple -Edge-Coloring of Dense Graphs A Dhawan arXiv preprint arXiv:2408.16692, 2024 | | 2024 |
| A linear-time algorithm for -edge-coloring A Bernshteyn, A Dhawan arXiv preprint arXiv:2407.04887, 2024 | | 2024 |
| The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs A Dhawan, Y Wang arXiv preprint arXiv:2404.03842, 2024 | | 2024 |
Anton BernshteynUniversity of California, Los Angeles在 math.ucla.edu 的电子邮件经过验证
