P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, Algorithms and Complexity, pp.288-298, 1997.
DOI : 10.1007/3-540-62592-5_80

J. Boissonnat, C. S. Karthik, and S. Tavenas, Building Efficient and Compact Data Structures for Simplicial Complexes, Algorithmica, vol.92, issue.1
DOI : 10.1007/s00453-016-0207-y

URL : https://hal.archives-ouvertes.fr/hal-01145407

J. Boissonnat and C. Maria, The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes, Algorithmica, vol.132, issue.23, pp.406-427, 2014.
DOI : 10.1007/s00453-014-9887-3

URL : https://hal.archives-ouvertes.fr/hal-01108416

M. R. Garey and D. S. Johnson, The Rectilinear Steiner Tree Problem is $NP$-Complete, SIAM Journal on Applied Mathematics, vol.32, issue.4, pp.826-834, 1977.
DOI : 10.1137/0132071

M. R. Garey and D. S. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness, 1990.

M. R. Garey, D. S. Johnson, and L. Stockmeyer, Some simplified NP-complete problems, Proceedings of the sixth annual ACM symposium on Theory of computing , STOC '74, pp.47-63, 1974.
DOI : 10.1145/800119.803884

D. S. Hochbaum, Efficient bounds for the stable set, vertex cover and set packing problems, Discrete Applied Mathematics, vol.6, issue.3, pp.243-254, 1983.
DOI : 10.1016/0166-218X(83)90080-X

V. Th and . Paschos, Combinatorial Optimization and Theoretical Computer Science - Interfaces and Perspectives: 30th Anniversary of the LAMSADE, 2008.