17 citations · 51 across the 19 of their papers we have counts for
21 papers
Discrete-Time Quantum Random Walk for Epidemiological Modeling
Sayan Manna, Nikhil Kowshik, Sudebkumar Prasant Pal
We introduce a discrete-time quantum random walk (QRW) framework for spatial epidemic modelling on a two-dimensional square lattice and compare its dynamics to classical random-wal…
Quantum Approximate and Quantum Walk Optimization Approaches to Set Balancing
Nikhil Kowshik, Sayan Manna, Sudebkumar Prasant Pal
We explore the application of variational quantum algorithms to the NP-hard set balancing problem, a critical challenge in clinical trial design and experimental scheduling. The pr…
Forbidden induced subgraphs in iterative higher order line graphs
Aryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal
Let be a simple finite connected graph. The line graph of graph is the graph whose vertices are the edges of , where when $e \cap f \neq \emptyse…
Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards
Pritam Bhattacharya, Subir Kumar Ghosh, Sudebkumar Pal
The art gallery problem enquires about the least number of guards sufficient to ensure that an art gallery, represented by a simple polygon , is fully guarded. Most standard ver…
System of unbiased representatives for a collection of bicolorings
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra +1
Let denote a set of bicolorings of , where each bicoloring is a mapping of the points in to . For each , let $Y_B=(B(1),\ldot…
Induced bisecting families for hypergraphs
Niranjan Balachandran, Rogers Mathew, Tapas Kumar Mishra +1
Two -dimensional vectors and , , are said to be \emph{trivially orthogonal} if in every coordinate , at least one of or is…