Susobhan Bandopadhyay

MaRDI QIDQ2056885zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints Information and Computation	2026-06-11	Paper
Tractability of packing vertex-disjoint a-paths under length constraints	2026-05-12	Paper
Parameterized complexity of shortest path with positive disjunctive constraints	2025-11-14	Paper
Parameterized complexity of non-separating and non-disconnecting paths and sets	2024-08-06	Paper
A step towards finding the analog of the Four-Color Theorem for (n,m)-graphs (available as arXiv preprint)	2024-01-01	Paper
Structural parameterizations of budgeted graph coloring Theoretical Computer Science	2023-04-20	Paper
Parameterized algorithms for finding highly connected solution Theoretical Computer Science	2022-12-21	Paper
Parameterized algorithms for finding highly connected solution Computer Science – Theory and Applications	2022-11-11	Paper
Structural parameterizations of budgeted graph coloring WALCOM: Algorithms and Computation	2022-07-13	Paper
Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids (available as arXiv preprint)	2021-12-08	Paper

Research outcomes over time

This page was built for person: Susobhan Bandopadhyay