On the Parameterized Complexity of Deletion to ℋ-Free Strong Components

Rian Neogi, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma. On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. In Javier Esparza, Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. Volume 170 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{NeogiR0S20,
  title = {On the Parameterized Complexity of Deletion to ℋ-Free Strong Components},
  author = {Rian Neogi and M. S. Ramanujan and Saket Saurabh 0001 and Roohani Sharma},
  year = {2020},
  doi = {10.4230/LIPIcs.MFCS.2020.75},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.75},
  researchr = {https://researchr.org/publication/NeogiR0S20},
  cites = {0},
  citedby = {0},
  booktitle = {45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic},
  editor = {Javier Esparza and Daniel Král'},
  volume = {170},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-159-7},
}