Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets

Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh 0001. Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. In Stefan Szeider, Robert Ganian, Alexandra Silva 0001, editors, 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria. Volume 241 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

@inproceedings{AbhinavBBKNOS22,
  title = {Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets},
  author = {Ankit Abhinav and Susobhan Bandopadhyay and Aritra Banik and Yasuaki Kobayashi and Shunsuke Nagano and Yota Otachi and Saket Saurabh 0001},
  year = {2022},
  doi = {10.4230/LIPIcs.MFCS.2022.6},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.6},
  researchr = {https://researchr.org/publication/AbhinavBBKNOS22},
  cites = {0},
  citedby = {0},
  booktitle = {47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria},
  editor = {Stefan Szeider and Robert Ganian and Alexandra Silva 0001},
  volume = {241},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-256-3},
}