Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ankit Abhinav' in GoogleThis author has not been identified. Look up 'Susobhan Bandopadhyay' in GoogleThis author has not been identified. Look up 'Aritra Banik' in GoogleThis author has not been identified. Look up 'Yasuaki Kobayashi' in GoogleThis author has not been identified. Look up 'Shunsuke Nagano' in GoogleThis author has not been identified. Look up 'Yota Otachi' in GoogleThis author has not been identified. Look up 'Saket Saurabh 0001' in Google

runs on WebDSL