Go to the corresponding LIPIcs Volume Portal 
Abhinav, Ankit ; Bandopadhyay, Susobhan ; Banik, Aritra ; Kobayashi, Yasuaki ; Nagano, Shunsuke ; Otachi, Yota ; Saurabh, Saket
pdfformat: 

@InProceedings{abhinav_et_al:LIPIcs.MFCS.2022.6, author = {Abhinav, Ankit and Bandopadhyay, Susobhan and Banik, Aritra and Kobayashi, Yasuaki and Nagano, Shunsuke and Otachi, Yota and Saurabh, Saket}, title = {{Parameterized Complexity of NonSeparating and NonDisconnecting Paths and Sets}}, booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)}, pages = {6:16:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772563}, ISSN = {18688969}, year = {2022}, volume = {241}, editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16804}, URN = {urn:nbn:de:0030drops168041}, doi = {10.4230/LIPIcs.MFCS.2022.6}, annote = {Keywords: Nonseparating path, Parameterized complexity} }
Keywords:  Nonseparating path, Parameterized complexity  
Collection:  47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)  
Issue Date:  2022  
Date of publication:  22.08.2022 