Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs

Jana Novotná 0001, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica, 83(8):2634-2650, 2021. [doi]

@article{NovotnaOPRLW21,
  title = {Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs},
  author = {Jana Novotná 0001 and Karolina Okrasa and Michal Pilipczuk and Pawel Rzazewski and Erik Jan van Leeuwen and Bartosz Walczak},
  year = {2021},
  doi = {10.1007/s00453-020-00745-z},
  url = {https://doi.org/10.1007/s00453-020-00745-z},
  researchr = {https://researchr.org/publication/NovotnaOPRLW21},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {83},
  number = {8},
  pages = {2634-2650},
}