Ulam Spiral (Source: Wikipedia)
Embedded Files
My research interests lie broadly in Graph Theory and Discrete Mathematics. Particularly, I am interested in Graph coloring problems. My PhD research is mostly focused on online and approximation algorithms. I am also interested in Analysis and Number theory and may pursue them at some point. You can check my Google Scholar for a list of publications.
Publications:
Shift Graphs, Chromatic Number and Acyclic One-Path Orientations, Discrete Mathematics
Stable approximation algorithms for dominating set and independent set (with Mark de Berg and Frits Spieksma), SIAM Journal on Discrete Mathematics, APPROX 2023.
Stable approximation algorithms for the dynamic broadcast range-assignment problem (with Mark de Berg and Frits Spieksma), SIAM Journal on Discrete Mathematics, SWAT 2022.
Burning Spiders (with Sandip Das, Subhadeep Ranjan Dev, Uma Kant Sahoo, Sagnik Sen), CALDAM 2018.
Submitted:
Stable Approximation Algorithms for Geometric Covering Problems (with Mark de Berg).
A Simple Construction of Tournaments with Finite and Uncountable Dichromatic Number.
Ongoing work and other publications:
A Note on Coloring Directed Graphs. (with Sophie Spirkl), In progress.
Structure of P_2-free Tournaments (with Seokbeom Kim, Taite LaGrange, Mathieu Rundström, Sophie Spirkl), In progress.
A Combinatorial Proof of the Existence of Dense Subsets in R without the “Steinhaus” like Property, American Mathematical Monthly.
An Alternative Proof of Steinhaus’s Theorem, American Mathematical Monthly.
Partitioning the Natural Numbers to Prove the Infinitude of Primes, The College Mathematics Journal.
Page updated
Google Sites
Report abuse