On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints

@article{susobhan2026,
  title        = {{On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints}},
  author       = {Susobhan Bandopadhyay et al.},
  journal      = {Information and Computation},
  year         = {2026},
  doi          = {https://doi.org/https://doi.org/10.1016/j.ic.2026.105432},
}

TY  - JOUR
TI  - On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
AU  - al., Susobhan Bandopadhyay et
JO  - Information and Computation
PY  - 2026
ER  -

Susobhan Bandopadhyay et al. (2026). On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints. *Information and Computation*. https://doi.org/https://doi.org/10.1016/j.ic.2026.105432

Susobhan Bandopadhyay et al.. "On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints." *Information and Computation* (2026). https://doi.org/https://doi.org/10.1016/j.ic.2026.105432.

On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
Susobhan Bandopadhyay et al. · Information and Computation · 2026
https://doi.org/https://doi.org/10.1016/j.ic.2026.105432