ℓ)-well-coveredness: Algorithms and complexity

Luérbio Faria, Uéverton S. Souza. ℓ)-well-coveredness: Algorithms and complexity. Theoretical Computer Science, 932:56-68, 2022. [doi]

@article{FariaS22,
  title = {ℓ)-well-coveredness: Algorithms and complexity},
  author = {Luérbio Faria and Uéverton S. Souza},
  year = {2022},
  doi = {10.1016/j.tcs.2022.08.006},
  url = {https://doi.org/10.1016/j.tcs.2022.08.006},
  researchr = {https://researchr.org/publication/FariaS22},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {932},
  pages = {56-68},
}