Parameterized Complexity of d-Hitting Set with Quotas

Sushmita Gupta, Pallavi Jain 0001, Aditya Petety, Sagar Singh. Parameterized Complexity of d-Hitting Set with Quotas. In Tomás Bures, Riccardo Dondi, Johann Gamper, Giovanna Guerrini, Tomasz Jurdzinski, Claus Pahl, Florian Sikora, Prudence W. H. Wong, editors, SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings. Volume 12607 of Lecture Notes in Computer Science, pages 293-307, Springer, 2021. [doi]

@inproceedings{GuptaJPS21,
  title = {Parameterized Complexity of d-Hitting Set with Quotas},
  author = {Sushmita Gupta and Pallavi Jain 0001 and Aditya Petety and Sagar Singh},
  year = {2021},
  doi = {10.1007/978-3-030-67731-2_21},
  url = {https://doi.org/10.1007/978-3-030-67731-2_21},
  researchr = {https://researchr.org/publication/GuptaJPS21},
  cites = {0},
  citedby = {0},
  pages = {293-307},
  booktitle = {SOFSEM 2021: Theory and Practice of Computer Science - 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
  editor = {Tomás Bures and Riccardo Dondi and Johann Gamper and Giovanna Guerrini and Tomasz Jurdzinski and Claus Pahl and Florian Sikora and Prudence W. H. Wong},
  volume = {12607},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-67731-2},
}