Ulam Spiral (Source: Wikipedia)
Embedded Files
My primary research interests lie broadly in Discrete Mathematics, with a particular focus on (di)graph coloring problems. During my PhD, my research was mainly centered on dynamic approximation algorithms.
More generally, I am interested in any kind of beautiful mathematics. Some profile links: Arxiv ; Google Scholar.
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.
Stable approximation algorithms for the dynamic broadcast range-assignment problem (with Mark de Berg and Frits Spieksma), SIAM Journal on Discrete Mathematics.
Burning Spiders (with Sandip Das, Subhadeep Ranjan Dev, Uma Kant Sahoo, Sagnik Sen), CALDAM 2018.
Submitted/Preprints:
A proof of Seymour's second neighborhood conjecture for oriented graphs with minimum out-degree equal to 7. (with R. B. Sandeep and Sagnik Sen)
The structure of ∆(1,2,2)-free tournaments. (with Seokbeom Kim, Taite LaGrange, Mathieu Rundström, Sophie Spirkl).
Stable Approximation Algorithms for Geometric Covering Problems (with Mark de Berg).
A Simple Construction of Tournaments with Finite and Uncountable Dichromatic Number.
Exact-Distance Domination in Grid Graphs (With Sandip Das and Sweta Das)
Other publications:
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