Arpan Sadhukhan

activity

20192026

most citedAn Alternative Proof of Steinhaus Theorem

2 citations · 3 across the 10 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

cs.DS2024★ 1 cited

Stable Approximation Algorithms for Dominating Set and Independent Set

Mark de Berg, Arpan Sadhukhan, Frits Spieksma

We study the Dominating set problem and Independent Set Problem for dynamic graphs in the vertex-arrival model. We say that a dynamic algorithm for one of these problems is $k$ -sta…

cs.CG2024

On Stable Approximation Algorithms for Geometric Coverage Problems

Mark de Berg, Arpan Sadhukhan

Let $P$ be a set of points in the plane and let $m$ be an integer. The goal of Max Cover by Unit Disks problem is to place $m$ unit disks whose union covers the maximum number of p…

math.CO2024

A Simple Construction of Tournaments with Finite and Uncountable Dichromatic Number

Arpan Sadhukhan

The dichromatic number $χ (G)$ of a digraph $G$ is the minimum number of colors needed to color the vertices $V (G)$ in such a way that no monochromatic directed cy…