Citations refer to the original publication, not to a Scieee localized version.
Cabello Justo, S. (2004). Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. https://idus.us.es/items/2f1ca0bc-56b3-4d02-b245-530964219670
Cabello Justo, Sergio. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. 2004. https://idus.us.es/items/2f1ca0bc-56b3-4d02-b245-530964219670.
Cabello Justo, Sergio. Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. 2004. https://idus.us.es/items/2f1ca0bc-56b3-4d02-b245-530964219670.
Cabello Justo, S. (2004) Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. Available at: https://idus.us.es/items/2f1ca0bc-56b3-4d02-b245-530964219670.
S. Cabello Justo, “Planar embeddability of the vertices of a graph using a fixed point set is NP-hard,” 2004. [Online]. Available: https://idus.us.es/items/2f1ca0bc-56b3-4d02-b245-530964219670
@misc{cabellojusto2004planar,
author = {Cabello Justo, Sergio},
title = {Planar embeddability of the vertices of a graph using a fixed point set is NP-hard},
year = {2004},
url = {https://idus.us.es/items/2f1ca0bc-56b3-4d02-b245-530964219670}
}
The source metadata has no journal, volume or pages. Add them from the original publication if your citation needs them.
