Sandip Das

collaborators

Showing cs.DSShow all

3 papers · 1 filter

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.DS2026

Exact Algorithms for Resource Reallocation Under Budgetary Constraints

Arun Kumar Das, Sandip Das, Sweta Das +2

Efficient resource (re-)allocation is a critical challenge in optimizing productivity and sustainability within multi-party supply networks. In this work, we introduce the \textsc{…

Solving Vertex Integrity Faster than 2n

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

Exact Algorithms for Resource Reallocation Under Budgetary Constraints

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

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