Burning Spiders. - Sandip Das 001; Subhadeep Ranjan Dev; Arpan Sadhukhan; Uma Kant Sahoo; Sagnik Sen 001 (CALDAM, 2018)

A Simple Construction to Prove Mycielski's Theorem. - Arpan Sadhukhan (Am. Math. Mon., 2019)

An Alternative Proof of Steinhaus's Theorem. - Arpan Sadhukhan (Am. Math. Mon., 2020)

A Combinatorial Proof of the Existence of Dense Subsets in ℝ without the "Steinhaus" like Property. - Arpan Sadhukhan (Am. Math. Mon., 2023)

On Stable Approximation Algorithms for Geometric Coverage Problems. - Mark de Berg; Arpan Sadhukhan (CoRR, 2024)

Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem. - Mark de Berg; Arpan Sadhukhan; Frits C. R. Spieksma (SIAM J. Discret. Math., 2024)

Shift graphs, chromatic number and acyclic one-path orientations. - Arpan Sadhukhan (Discret. Math., 2025)

Stable Approximation Algorithms for Dominating Set and Independent Set. - Mark de Berg; Arpan Sadhukhan; Frits C. R. Spieksma (SIAM J. Discret. Math., 2025)