4 papers
The structure of -free tournaments
Seokbeom Kim, Taite LaGrange, Mathieu Rundström +2
We extend the list of tournaments for which the complete structural description for tournaments excluding as a subtournament is known. Specifically, let be a t…
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 -sta…
On Stable Approximation Algorithms for Geometric Coverage Problems
Mark de Berg, Arpan Sadhukhan
Let be a set of points in the plane and let be an integer. The goal of Max Cover by Unit Disks problem is to place unit disks whose union covers the maximum number of p…
An Alternative Proof of Steinhaus Theorem
Arpan Sadhukhan
In measure theory, Steinhaus theorem is a result that deals with a property of the difference between two sets of positive measure. We give a simple elementary proof of the result.