Allan Scott
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| \(k\)-attribute-anonymity is hard even for \(k=2\) Information Processing Letters | 2014-12-09 | Paper |
| Minesweeper may not be NP-complete but is hard nonetheless The Mathematical Intelligencer | 2012-01-29 | Paper |
| Parameterized pursuit-evasion games Theoretical Computer Science | 2010-11-11 | Paper |
| Parameterized Chess Parameterized and Exact Computation | 2008-06-05 | Paper |
| Politician’s Firefighting Algorithms and Computation | 2008-04-24 | Paper |
Research outcomes over time
This page was built for person: Allan Scott
