Abhishek Dhawan

According to our database, Abhishek Dhawan authored at least 10 papers between 2004 and 2024.

Collaborative distances:

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

2024

Edge-Coloring Algorithms for Bounded Degree Multigraphs.

Abhishek Dhawan

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Colouring graphs with forbidden bipartite subgraphs.

James Anderson, Anton Bernshteyn, Abhishek Dhawan

Comb. Probab. Comput., January, 2023

Balanced independent sets and colorings of hypergraphs.

Abhishek Dhawan

CoRR, 2023

Multigraph edge-coloring with local list sizes.

Abhishek Dhawan

CoRR, 2023

Borel Vizing's Theorem for Graphs of Subexponential Growth.

Anton Bernshteyn, Abhishek Dhawan

CoRR, 2023

Detection of Dense Subhypergraphs by Low-Degree Polynomials.

Abhishek Dhawan, Cheng Mao, Alexander S. Wein

CoRR, 2023

Fast algorithms for Vizing's theorem on bounded degree graphs.

Anton Bernshteyn, Abhishek Dhawan

CoRR, 2023

Sharp analysis of EM for learning mixtures of pairwise differences.

Abhishek Dhawan, Cheng Mao, Ashwin Pananjady

Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2021

Coloring graphs with forbidden bipartite subgraphs.

James Anderson, Anton Bernshteyn, Abhishek Dhawan

CoRR, 2021

2004

Cluster-Based Multiple Task Allocation in Distributed Computing System.

Deo Prakash Vidyarthi, Anil Kumar Tripathi, Biplab Kumer Sarker, Abhishek Dhawan, Laurence Tianruo Yang

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004