| dc.contributor.author | Misra, Neeldhara | |
| dc.contributor.other | 6th International Conference on Algorithmic DecisionTheory (ADT 2019) | |
| dc.coverage.spatial | Durham, US | |
| dc.date.accessioned | 2019-11-01T12:49:18Z | |
| dc.date.available | 2019-11-01T12:49:18Z | |
| dc.date.issued | 2019-10-25 | |
| dc.identifier.citation | Misra, Neeldhara, "On the parameterized complexity of party nominations", in the 6th International Conference on Algorithmic DecisionTheory (ADT 2019), Durham, US, Oct. 25-27, 2019. | en_US |
| dc.identifier.uri | https://repository.iitgn.ac.in/handle/123456789/4917 | |
| dc.description.statementofresponsibility | by Neeldhara Misra | |
| dc.language.iso | en_US | en_US |
| dc.title | On the parameterized complexity of party nominations | en_US |
| dc.type | Article | en_US |
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||