Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs

Petr A. Golovach, Fahad Panolan, Ashutosh Rai 0001, Saket Saurabh 0001. Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs. In Alexander S. Kulikov, Sofya Raskhodnikova, editors, Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings. Volume 13296 of Lecture Notes in Computer Science, pages 152-169, Springer, 2022. [doi]

@inproceedings{GolovachPRS22,
  title = {Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs},
  author = {Petr A. Golovach and Fahad Panolan and Ashutosh Rai 0001 and Saket Saurabh 0001},
  year = {2022},
  doi = {10.1007/978-3-031-09574-0_10},
  url = {https://doi.org/10.1007/978-3-031-09574-0_10},
  researchr = {https://researchr.org/publication/GolovachPRS22},
  cites = {0},
  citedby = {0},
  pages = {152-169},
  booktitle = {Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 - July 1, 2022, Proceedings},
  editor = {Alexander S. Kulikov and Sofya Raskhodnikova},
  volume = {13296},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-031-09574-0},
}