Cluster-Based Multiple Task Allocation in Distributed Computing System. - Deo Prakash Vidyarthi; Anil Kumar Tripathi; Biplab Kumer Sarker; Abhishek Dhawan; Laurence Tianruo Yang (IPDPS, 2004)

Coloring graphs with forbidden bipartite subgraphs. - James Anderson; Anton Bernshteyn; Abhishek Dhawan (CoRR, 2021)

Sharp analysis of EM for learning mixtures of pairwise differences. - Abhishek Dhawan; Cheng Mao; Ashwin Pananjady (COLT, 2023)

Detection of Dense Subhypergraphs by Low-Degree Polynomials. - Abhishek Dhawan; Cheng Mao; Alexander S. Wein (CoRR, 2023)

Borel Vizing's Theorem for Graphs of Subexponential Growth. - Anton Bernshteyn; Abhishek Dhawan (CoRR, 2023)

Balanced independent sets and colorings of hypergraphs. - Abhishek Dhawan (CoRR, 2023)

Colouring graphs with forbidden bipartite subgraphs. - James Anderson; Anton Bernshteyn; Abhishek Dhawan (Comb. Probab. Comput., 2023)

Edge-Coloring Algorithms for Bounded Degree Multigraphs. - Abhishek Dhawan (SODA, 2024)

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs. - Abhishek Dhawan; Yuzhou Wang (CoRR, 2024)

A linear-time algorithm for (1+ε)Δ-edge-coloring. - Anton Bernshteyn; Abhishek Dhawan (CoRR, 2024)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time. - Abhishek Dhawan (CoRR, 2024)

Palette Sparsification for Graphs with Sparse Neighborhoods. - Abhishek Dhawan (CoRR, 2024)

Fast and Simple (1+ε)Δ-Edge-Coloring of Dense Graphs. - Abhishek Dhawan (CoRR, 2024)

On Extremal, Algorithmic, and Inferential Problems in Graph Theory. - Abhishek Dhawan (2024)

List Colorings of $k$-Partite $k$-Graphs. - Abhishek Dhawan (Electron. J. Comb., 2025)

Multigraph edge-coloring with local list sizes. - Abhishek Dhawan (Discret. Math., 2025)

Fast algorithms for Vizing's theorem on bounded degree graphs. - Anton Bernshteyn; Abhishek Dhawan (J. Comb. Theory B, 2025)

Coloring Graphs With Forbidden Almost Bipartite Subgraphs. - James Anderson; Anton Bernshteyn; Abhishek Dhawan (Random Struct. Algorithms, 2025)

Fast and simple (1 + ε)Δ-edge-coloring of dense graphs. - Abhishek Dhawan (Theor. Comput. Sci., 2025)

Balanced colorings of Erdős-Rényi hypergraphs. - Abhishek Dhawan; Yuzhou Wang (CoRR, 2025)