Abhishek Dhawan

activity

20232026

most citedPalette Sparsification for Graphs with Sparse Neighborhoods

1 citations · 3 across the 19 of their papers we have counts for

collaborators

Showing cs.DSShow all

6 papers · 1 filter

cs.DS2026

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

Abhishek Dhawan, Nhi U. Dinh, Eren C. Kızıldağ +2

We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within e…

cs.DS2025

Sharp Online Hardness for Large Balanced Independent Sets

Abhishek Dhawan, Eren C. Kızıldağ, Neeladri Maitra

We study the algorithmic problem of finding large $γ$ -balanced independent sets in dense random bipartite graphs; an independent set is $γ$ -balanced if a $γ$ proportion of its vert…

cs.DS2024

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

Abhishek Dhawan

Let $ε \in (0, 1)$ and $n, Δ \in N$ be such that $Δ = Ω (max {\frac{l o g n}{ε}, (\frac{1}{ε} lo g \frac{1}{ε})^{2}})$ . Given an $n$ -vertex $m$ -edge…

cs.DS2024★ 1 cited

Palette Sparsification for Graphs with Sparse Neighborhoods

Abhishek Dhawan

A seminal palette sparsification result of Assadi, Chen, and Khanna states that in every $n$ -vertex graph of maximum degree $Δ$ , sampling $Θ (lo g n)$ colors per vertex from $\{1, \…

cs.DS2024

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time

Abhishek Dhawan

We present a simple $(1 + ε) Δ$ -edge-coloring algorithm for graphs of maximum degree $Δ = Ω (lo g n / ε)$ with running time $O (m lo g^{3} n / ε^{3})$ …

cs.DS2024

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

Anton Bernshteyn, Abhishek Dhawan

We present a randomized algorithm that, given a constant $ε > 0$ , outputs a proper $(1 + ε) Δ$ -edge-coloring of an $m$ -edge simple graph $G$ of maximum degree $Δ \geq 1/ ε$ in $O (m)$ tim…

Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

Sharp Online Hardness for Large Balanced Independent Sets

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

Palette Sparsification for Graphs with Sparse Neighborhoods

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time

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

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

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