Arpan Sadhukhan

12 papers A 1Journal 9Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Shift graphs, chromatic number and acyclic one-path orientations. Discret. Math. Arpan Sadhukhan
2025	J	`jnl`	Stable Approximation Algorithms for Dominating Set and Independent Set. SIAM J. Discret. Math. Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2024	J	`jnl`	On Stable Approximation Algorithms for Geometric Coverage Problems. CoRR Mark de Berg, Arpan Sadhukhan
2024	J	`jnl`	Stable Approximation Algorithms for Dominating Set and Independent Set. CoRR Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2024	J	`jnl`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SIAM J. Discret. Math. Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2023	J	`jnl`	A Combinatorial Proof of the Existence of Dense Subsets in ℝ without the "Steinhaus" like Property. Am. Math. Mon. Arpan Sadhukhan
2023	A	`conf`	Stable Approximation Algorithms for Dominating Set and Independent Set. APPROX/RANDOM Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2022	—	`conf`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. SWAT Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2021	J	`jnl`	Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. CoRR Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma
2020	J	`jnl`	An Alternative Proof of Steinhaus's Theorem. Am. Math. Mon. Arpan Sadhukhan
2019	J	`jnl`	A Simple Construction to Prove Mycielski's Theorem. Am. Math. Mon. Arpan Sadhukhan
2018	—	`conf`	Burning Spiders. CALDAM Sandip Das, Subhadeep Ranjan Dev, Arpan Sadhukhan, Uma Kant Sahoo, Sagnik Sen