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]

Abstract

Abstract is missing.