Anthony Mansfield
From MaRDI portal
Person:1170030
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 |
|---|---|---|
| Determining the thickness of graphs is NP-hard Mathematical Proceedings of the Cambridge Philosophical Society | 1983-01-01 | Paper |
| On the computational complexity of a merge recognition problem Discrete Applied Mathematics | 1983-01-01 | Paper |
| THE RELATIONSHIP BETWEEN THE COMPUTATIONAL COMPLEXITIES OF THE LEGITIMATE DECK AND ISOMORPHISM PROBLEMS The Quarterly Journal of Mathematics | 1982-01-01 | Paper |
| An algorithm for a merge recognition problem Discrete Applied Mathematics | 1982-01-01 | Paper |
| On the Computational Complexity of a Rigidity Problem IMA Journal of Applied Mathematics | 1981-01-01 | Paper |
Research outcomes over time
This page was built for person: Anthony Mansfield
