Ritam M. Mitra

activity

20232026

collaborators

4 papers

cs.DS2026

Solving Vertex Integrity Faster than $2^{n}$

Sandip Das, Sweta Das, Sk Samim Islam +3

Vertex Integrity is a classical graph parameter measuring the vulnerability of a network to vertex failures. We settle two fundamental questions concerning its exact exponential co…

cs.DS2026

Minimum eccentricity shortest paths of $K_{2, 3}$ -minor-free graphs

Dibyayan Chakraborty, Sandip Das, Sk Samim Islam +2

Given a simple, undirected, and unweighted graph $G$ , and an integer $R$ , the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether there exists…

cs.CG2024

Multipacking in Euclidean Metric Space

Arun Kumar Das, Sandip Das, Sk Samim Islam +2

Here we study the multipacking problems for geometric point sets with respect to their Euclidean distances. We consider a set of $n$ points $P$ and define $N_{s} [v]$ as the subset of…

math.CO2023

Burning a binary tree and its generalization

Sandip Das, Sk Samim Islam, Ritam M Mitra +1

Graph burning is a graph process that models the spread of social contagion. Initially, all the vertices of a graph $G$ are unburnt. At each step, an unburnt vertex is put on fire…

Solving Vertex Integrity Faster than 2n

Minimum eccentricity shortest paths of K2,3​-minor-free graphs

Multipacking in Euclidean Metric Space

Burning a binary tree and its generalization

Solving Vertex Integrity Faster than $2^{n}$

Minimum eccentricity shortest paths of $K_{2, 3}$ -minor-free graphs