Fixed-Parameter Tractability of (n-k) List Coloring

Aritra Banik, Ashwin Jacob, Vijay Kumar Paliwal, Venkatesh Raman 0001. Fixed-Parameter Tractability of (n-k) List Coloring. In Charles J. Colbourn, Roberto Grossi, Nadia Pisanti, editors, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Volume 11638 of Lecture Notes in Computer Science, pages 61-69, Springer, 2019. [doi]

@inproceedings{BanikJP019,
  title = {Fixed-Parameter Tractability of (n-k) List Coloring},
  author = {Aritra Banik and Ashwin Jacob and Vijay Kumar Paliwal and Venkatesh Raman 0001},
  year = {2019},
  doi = {10.1007/978-3-030-25005-8_6},
  url = {https://doi.org/10.1007/978-3-030-25005-8_6},
  researchr = {https://researchr.org/publication/BanikJP019},
  cites = {0},
  citedby = {0},
  pages = {61-69},
  booktitle = {Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings},
  editor = {Charles J. Colbourn and Roberto Grossi and Nadia Pisanti},
  volume = {11638},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-25005-8},
}