| Planar embeddability of the vertices of a graph using a fixed point set is NP-hard Recent countries visiting this post |  |
 | 5 | United States |
 | 1 | Russian Federation |
| Planar embeddability of the vertices of a graph using a fixed point set is NP-hard Recent countries visiting this post | |
| 5 | United States |
| 1 | Russian Federation |