Lawqueen Kanesh, Jayakrishnan Madathil, Sanjukta Roy, Abhishek Sahu, Saket Saurabh 0001. Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems. In Petra Berenbrink, Benjamin Monmege, editors, 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference). Volume 219 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{KaneshMRS022, title = {Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems}, author = {Lawqueen Kanesh and Jayakrishnan Madathil and Sanjukta Roy and Abhishek Sahu and Saket Saurabh 0001}, year = {2022}, doi = {10.4230/LIPIcs.STACS.2022.39}, url = {https://doi.org/10.4230/LIPIcs.STACS.2022.39}, researchr = {https://researchr.org/publication/KaneshMRS022}, cites = {0}, citedby = {0}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, editor = {Petra Berenbrink and Benjamin Monmege}, volume = {219}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-222-8}, }