Abhishek Dhawan

32 papers A* 2A 1Journal 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
Coloring Locally Sparse Graphs.
Electron. J. Comb.
James Anderson, Abhishek Dhawan, Aiya Kuchukova
2026 J jnl
Fractional coloring via entropy.
CoRR
Abhishek Dhawan
2026 J jnl
The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs.
SIAM J. Discret. Math.
Abhishek Dhawan, Yuzhou Wang
2026 J jnl
The strong chromatic index of K
CoRR
Richard Bi, Peter Bradshaw, Abhishek Dhawan, Jingwei Xu
2025 J jnl
Balanced Independent Sets and Colorings of Hypergraphs.
J. Graph Theory
Abhishek Dhawan
2025 J jnl
Balanced colorings of Erdős-Rényi hypergraphs.
CoRR
Abhishek Dhawan, Yuzhou Wang
2025 J jnl
Coloring Graphs With Forbidden Almost Bipartite Subgraphs.
Random Struct. Algorithms
James Anderson, Anton Bernshteyn, Abhishek Dhawan
2025 J jnl
Fast algorithms for Vizing's theorem on bounded degree graphs.
J. Comb. Theory B
Anton Bernshteyn, Abhishek Dhawan
2025 J jnl
Fast and simple (1 + ε)Δ-edge-coloring of dense graphs.
Theor. Comput. Sci.
Abhishek Dhawan
2025 J jnl
Independent sets and colorings of K
CoRR
Abhishek Dhawan, Oliver Janzer, Abhishek Methuku
2025 J jnl
List Colorings of $k$-Partite $k$-Graphs.
Electron. J. Comb.
Abhishek Dhawan
2025 J jnl
Multigraph edge-coloring with local list sizes.
Discret. Math.
Abhishek Dhawan
2025 J jnl
Sharp Online Hardness for Large Balanced Independent Sets.
CoRR
Abhishek Dhawan, Eren C. Kizildag, Neeladri Maitra
2025 J jnl
Toward Vu's conjecture.
CoRR
Peter Bradshaw, Abhishek Dhawan, Abhishek Methuku, Michael C. Wigal
2024 J jnl
A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time.
CoRR
Abhishek Dhawan
2024 J jnl
A linear-time algorithm for (1+ε)Δ-edge-coloring.
CoRR
Anton Bernshteyn, Abhishek Dhawan
2024 A* conf
Edge-Coloring Algorithms for Bounded Degree Multigraphs.
SODA
Abhishek Dhawan
2024 J jnl
Fast and Simple (1+ε)Δ-Edge-Coloring of Dense Graphs.
CoRR
Abhishek Dhawan
2024 — —
On Extremal, Algorithmic, and Inferential Problems in Graph Theory.
Abhishek Dhawan
2024 J jnl
Palette Sparsification for Graphs with Sparse Neighborhoods.
CoRR
Abhishek Dhawan
2024 J jnl
The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs.
CoRR
Abhishek Dhawan, Yuzhou Wang
2023 J jnl
Balanced independent sets and colorings of hypergraphs.
CoRR
Abhishek Dhawan
2023 J jnl
Borel Vizing's Theorem for Graphs of Subexponential Growth.
CoRR
Anton Bernshteyn, Abhishek Dhawan
2023 J jnl
Colouring graphs with forbidden bipartite subgraphs.
Comb. Probab. Comput.
James Anderson, Anton Bernshteyn, Abhishek Dhawan
2023 J jnl
Detection of Dense Subhypergraphs by Low-Degree Polynomials.
CoRR
Abhishek Dhawan, Cheng Mao, Alexander S. Wein
2023 J jnl
Edge-Coloring Algorithms for Bounded Degree Multigraphs.
CoRR
Abhishek Dhawan
2023 J jnl
Fast algorithms for Vizing's theorem on bounded degree graphs.
CoRR
Anton Bernshteyn, Abhishek Dhawan
2023 J jnl
Multigraph edge-coloring with local list sizes.
CoRR
Abhishek Dhawan
2023 A* conf
Sharp analysis of EM for learning mixtures of pairwise differences.
COLT
Abhishek Dhawan, Cheng Mao, Ashwin Pananjady
2023 J jnl
Sharp analysis of EM for learning mixtures of pairwise differences.
CoRR
Abhishek Dhawan, Cheng Mao, Ashwin Pananjady
2021 J jnl
Coloring graphs with forbidden bipartite subgraphs.
CoRR
James Anderson, Anton Bernshteyn, Abhishek Dhawan
2004 A conf
Cluster-Based Multiple Task Allocation in Distributed Computing System.
IPDPS
Deo Prakash Vidyarthi, Anil Kumar Tripathi, Biplab Kumer Sarker, Abhishek Dhawan, Laurence Tianruo Yang