Arpan Sadhukhan

According to our database, Arpan Sadhukhan authored at least 8 papers between 2018 and 2025.

Collaborative distances:

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

2025

Shift graphs, chromatic number and acyclic one-path orientations.

Arpan Sadhukhan

Discret. Math., 2025

2024

On Stable Approximation Algorithms for Geometric Coverage Problems.

Mark de Berg, Arpan Sadhukhan

CoRR, 2024

2023

A Combinatorial Proof of the Existence of Dense Subsets in ℝ without the "Steinhaus" like Property.

Arpan Sadhukhan

Am. Math. Mon., February, 2023

Stable Approximation Algorithms for Dominating Set and Independent Set.

Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma

Proceedings of the Approximation, 2023

2022

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem.

Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

2020

An Alternative Proof of Steinhaus's Theorem.

Arpan Sadhukhan

Am. Math. Mon., 2020

2019

A Simple Construction to Prove Mycielski's Theorem.

Arpan Sadhukhan

Am. Math. Mon., 2019

2018

Burning Spiders.

Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018