| dc.contributor.author |
Misra, Neeldhara |
|
| dc.contributor.author |
Rathi, Piyush |
|
| dc.contributor.other |
International Computer Science Symposium in Russia (CSR-2019) |
|
| dc.coverage.spatial |
Novosibirsk, RU |
|
| dc.date.accessioned |
2019-07-16T09:58:28Z |
|
| dc.date.available |
2019-07-16T09:58:28Z |
|
| dc.date.issued |
2019-07-01 |
|
| dc.identifier.citation |
Misra, Neeldhara and Rathi, Piyush, �The parameterized complexity of dominating set and friends revisited for structured graphs�, in the International Computer Science Symposium in Russia (CSR-2019), Novosibirsk, RU, Jul. 1-5, 2019. |
en_US |
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/4622 |
|
| dc.description.statementofresponsibility |
by Neeldhara Misra and Piyush Rathi |
|
| dc.language.iso |
en |
en_US |
| dc.title |
The parameterized complexity of dominating set and friends revisited for structured graphs |
en_US |
| dc.type |
Article |
en_US |