Abhishek Dhawan

According to our database, Abhishek Dhawan authored at least 27 papers between 2004 and 2026.

Collaborative distances:

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

2026

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs.

Abhishek Dhawan, Nhi U. Dinh, Eren C. Kizildag, Neeladri Maitra, Bayram A. Sahin

CoRR, May, 2026

Fractional coloring via entropy.

Abhishek Dhawan

CoRR, March, 2026

The strong chromatic index of K_t,t-free graphs.

Richard Bi, Peter Bradshaw, Abhishek Dhawan, Jingwei Xu

CoRR, March, 2026

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs.

Abhishek Dhawan, Yuzhou Wang

SIAM J. Discret. Math., 2026

A simple algorithm for near-Vizing edge-coloring in near-linear time.

Abhishek Dhawan

Inf. Process. Lett., 2026

Coloring Locally Sparse Graphs.

James Anderson, Abhishek Dhawan, Aiya Kuchukova

Electron. J. Comb., 2026

2025

Independent sets and colorings of K_t,t,t-free graphs.

Abhishek Dhawan, Oliver Janzer, Abhishek Methuku

CoRR, November, 2025

Sharp Online Hardness for Large Balanced Independent Sets.

Abhishek Dhawan, Eren C. Kizildag, Neeladri Maitra

CoRR, August, 2025

Toward Vu's conjecture.

Peter Bradshaw, Abhishek Dhawan, Abhishek Methuku, Michael C. Wigal

CoRR, August, 2025

Balanced colorings of Erdős-Rényi hypergraphs.

Abhishek Dhawan, Yuzhou Wang

CoRR, April, 2025

Fast and simple (1 + ε)Δ-edge-coloring of dense graphs.

Abhishek Dhawan

Theor. Comput. Sci., 2025

Coloring Graphs With Forbidden Almost Bipartite Subgraphs.

James Anderson, Anton Bernshteyn, Abhishek Dhawan

Random Struct. Algorithms, 2025

Balanced Independent Sets and Colorings of Hypergraphs.

Abhishek Dhawan

J. Graph Theory, 2025

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

Anton Bernshteyn, Abhishek Dhawan

J. Comb. Theory B, 2025

Multigraph edge-coloring with local list sizes.

Abhishek Dhawan

Discret. Math., 2025

List Colorings of $k$-Partite $k$-Graphs.

Abhishek Dhawan

Electron. J. Comb., 2025

2024

On Extremal, Algorithmic, and Inferential Problems in Graph Theory.

Abhishek Dhawan

PhD thesis, 2024

Fast and Simple (1+ε)Δ-Edge-Coloring of Dense Graphs.

Abhishek Dhawan

CoRR, 2024

Palette Sparsification for Graphs with Sparse Neighborhoods.

Abhishek Dhawan

CoRR, 2024

A linear-time algorithm for (1+ε)Δ-edge-coloring.

Anton Bernshteyn, Abhishek Dhawan

CoRR, 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

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

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