External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Petr A. Golovach

This author has not been identified. Look up 'Petr A. Golovach' in Google

Fahad Panolan

This author has not been identified. Look up 'Fahad Panolan' in Google

Ashutosh Rai 0001

This author has not been identified. Look up 'Ashutosh Rai 0001' in Google

Saket Saurabh 0001

This author has not been identified. Look up 'Saket Saurabh 0001' in Google
runs on