José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López, Nestaly Marín, Miguel-Angel Pérez-Cutiño, Pablo Pérez-Lantero. The Euclidean k-matching problem is NP-hard. // Computational Geometry. – 2026. – DOI: 10.1016/j.comgeo.2026.102267. – URL: https://doi.org/10.1016/j.comgeo.2026.102267
José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López, Nestaly Marín, Miguel-Angel Pérez-Cutiño, & Pablo Pérez-Lantero (2026). The Euclidean k-matching problem is NP-hard. Computational Geometry. https://doi.org/10.1016/j.comgeo.2026.102267
José-Miguel Díaz-Báñez, et al. “The Euclidean k-matching problem is NP-hard.” Computational Geometry, 2026. doi:10.1016/j.comgeo.2026.102267.
@article{DazBez2026,
title = {The Euclidean k-matching problem is NP-hard},
author = {Díaz-Báñez, José-Miguel and Fabila-Monroy, Ruy and Higes-López, José-Manuel and Marín, Nestaly and Pérez-Cutiño, Miguel-Angel and Pérez-Lantero, Pablo},
journal = {Computational Geometry},
year = {2026},
doi = {10.1016/j.comgeo.2026.102267},
url = {https://doi.org/10.1016/j.comgeo.2026.102267}
}