| dc.contributor.author |
Agrawal, Akanksha |
|
| dc.contributor.author |
Aravind, N.R. |
|
| dc.contributor.author |
Kalyanasundaram, Subrahmanyam |
|
| dc.contributor.author |
Kare, Anjeneya Swami |
|
| dc.contributor.author |
Lauri, Juho |
|
| dc.contributor.author |
Misra, Neeldhara |
|
| dc.contributor.author |
Reddy, I. Vinod |
|
| dc.date.accessioned |
2020-11-05T06:07:18Z |
|
| dc.date.available |
2020-11-05T06:07:18Z |
|
| dc.date.issued |
2020-10 |
|
| dc.identifier.citation |
Agrawal, Akanksha; Aravind, N.R.; Kalyanasundaram, Subrahmanyam; Kare, Anjeneya Swami; Lauri, Juho; Misra, Neeldhara and Reddy, I. Vinod, "Parameterized complexity of happy coloring problems", Theoretical Computer Science, DOI: 10.1016/j.tcs.2020.06.002, vol. 835, pp. 58-81, Oct. 2020. |
en_US |
| dc.identifier.issn |
0304-3975 |
|
| dc.identifier.uri |
https://doi.org/10.1016/j.tcs.2020.06.002 |
|
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/5834 |
|
| dc.description.statementofresponsibility |
by Akanksha Agrawal, N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, Juho Lauri, Neeldhara Misra and I. Vinod Reddy |
|
| dc.language.iso |
en_US |
en_US |
| dc.publisher |
Elsevier |
en_US |
| dc.subject |
Computational complexity |
en_US |
| dc.subject |
Happy coloring |
en_US |
| dc.subject |
Parameterized complexity |
en_US |
| dc.title |
Parameterized complexity of happy coloring problems |
en_US |
| dc.type |
Article |
en_US |
| dc.relation.journal |
Theoretical Computer Science |
|