| dc.contributor.author |
Bil, Davide |
|
| dc.contributor.author |
Gual, Luciano |
|
| dc.contributor.author |
Leucci, Stefano |
|
| dc.contributor.author |
Misra, Neeldhara |
|
| dc.contributor.other |
9th International Conference on Fun with Algorithms (FUN 2018) |
|
| dc.coverage.spatial |
Le Nereidi Hotel, La Maddalena, IT |
|
| dc.date.accessioned |
2018-06-13T12:51:59Z |
|
| dc.date.available |
2018-06-13T12:51:59Z |
|
| dc.date.issued |
2018-06-13 |
|
| dc.identifier.citation |
Bil, Davide; Gual, Luciano; Leucci, Stefano and Misra, Neeldhara, "On the complexity of two dots for narrow boards and few colors", in the 9th International Conference on Fun with Algorithms (FUN 2018), Le Nereidi Hotel, La Maddalena, IT, Jun. 13-15, 2018. |
en_US |
| dc.identifier.uri |
https://repository.iitgn.ac.in/handle/123456789/3740 |
|
| dc.description.statementofresponsibility |
by Davide Bil, Luciano Gual, Stefano Leucci and Neeldhara Misra |
|
| dc.language.iso |
en |
en_US |
| dc.title |
On the complexity of two dots for narrow boards and few colors |
en_US |
| dc.type |
Article |
en_US |