Laštovička, P., & Legerský, J. (2024). Flexible realizations existence: NP-completeness on sparse graphs and algorithms.
Chicago Style (17th ed.) CitationLaštovička, Petr, and Jan Legerský. Flexible Realizations Existence: NP-completeness on Sparse Graphs and Algorithms. 2024.
MLA (9th ed.) CitationLaštovička, Petr, and Jan Legerský. Flexible Realizations Existence: NP-completeness on Sparse Graphs and Algorithms. 2024.
Warning: These citations may not always be 100% accurate.