Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Sadhukhan, Arpan
add a person with the name Sadhukhan, Arpan
 

Other publications of authors with the same name

A Simple Construction to Prove Mycielski's Theorem.. The American Mathematical Monthly, 126 (2): 112 (2019)Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem., , and . CoRR, (2021)Stable Approximation Algorithms for Dominating Set and Independent Set., , and . APPROX/RANDOM, volume 275 of LIPIcs, page 27:1-27:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem., , and . SWAT, volume 227 of LIPIcs, page 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Burning Spiders., , , , and . CALDAM, volume 10743 of Lecture Notes in Computer Science, page 155-163. Springer, (2018)Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem., , and . SIAM J. Discret. Math., 38 (1): 790-827 (March 2024)An Alternative Proof of Steinhaus's Theorem.. The American Mathematical Monthly, 127 (4): 330 (2020)A Combinatorial Proof of the Existence of Dense Subsets in ℝ without the "Steinhaus" like Property.. Am. Math. Mon., 130 (2): 175 (February 2023)