, Conjecture 1. If (? ? k)-F-Overlay is N P-complete

;. Furthermore and M. That, ? ? k)-F-Overlay is N P-complete and (? ? k)-F-Overlay is polynomial-time solvable, it is natural to consider the parameterized complexity of Max (? ? k)-F-Overlay when parameterized by |E(H)| ? s, because (? ? k)F-Overlay is the case s = 0. Finally

D. Agarwal, C. Caillouet, D. Coudert, and F. Cazals, Unveiling Contacts within Macromolecular assemblies by solving Minimum Weight Connectivity Inference Problems, Molecular and Cellular Proteomics, vol.14, pp.2274-2284, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01078378

D. Angluin, J. Aspnes, and L. Reyzin, Inferring social networks from outbreaks, ALT '10, pp.104-118, 2010.

A. J. Bondy and U. S. Murty, Graph theory, volume 244 of Graduate Texts in Mathematics, 2008.

U. Brandes, S. Cornelsen, B. Pampel, and A. Sallaberry, Blocks of hypergraphs-applied to hypergraphs and outerplanarity, IWOCA '10, pp.201-211, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00539143

R. Burnley, E. Damoc, E. Denisov, A. Makarov, and A. Heck, High-sensitivity orbitrap mass analysis of intact macromolecular assemblies, Nature methods, vol.9, 2012.

J. Chen, C. Komusiewicz, R. Niedermeier, M. Sorge, O. Suchý et al., Polynomialtime data reduction for the subset interconnection design problem, SIAM J. Discrete Math, vol.29, issue.1, pp.1-25, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01349211

G. Chockler, R. Melamed, Y. Tock, and R. Vitenberg, Constructing scalable overlays for pub-sub with many topics, PODC '07, pp.109-118, 2007.
DOI : 10.1145/1281100.1281118

N. Cohen, F. Havet, D. Mazauric, I. Sau, and R. Watrigant, Complexity dichotomies for the minimum F-overlay problem, Journal of Discrete Algorithms, vol.52, pp.133-142, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01571229

V. Conitzer, J. Derryberry, and T. Sandholm, Combinatorial auctions with structured item graphs, 16th Conference on Innovative Applications of Artificial Intelligence (AAAI 2004), pp.212-218, 2004.

D. Z. Du and D. F. Kelley, On complexity of subset interconnection designs, Journal of Global Optimization, vol.6, issue.2, pp.193-205, 1995.

D. Du and Z. Miller, Matroids and subset interconnection design, SIAM Journal on Discrete Mathematics, vol.1, issue.4, pp.416-424, 1988.
DOI : 10.1137/0401042

H. Fan, C. Hundt, Y. Wu, and J. Ernst, Algorithms and implementation for interconnection graph problem, Combinatorial Optimization and Applications, pp.201-210, 2008.
DOI : 10.1007/978-3-540-85097-7_19

H. Fan and Y. Wu, Interconnection graph problem, Proceedings of the 2008 International Conference on Foundations of Computer Science, FCS 2008, pp.51-55, 2008.
DOI : 10.1007/978-3-540-85097-7_19

D. S. Johnson and H. O. Pollak, Hypergraph planarity and the complexity of drawing venn diagrams, Journal of Graph Theory, vol.11, issue.3, pp.309-325, 1987.

D. , Graphs, Networks and Algorithms, vol.5, 2013.

R. M. Karp, Reducibility among Combinatorial Problems, 1972.
DOI : 10.1007/978-1-4684-2001-2_9

B. Klemz, T. Mchedlidze, and M. Nöllenburg, Minimum tree supports for hypergraphs and low-concurrency euler diagrams, pp.265-276, 2014.
DOI : 10.1007/978-3-319-08404-6_23

J. Köbler, S. Kuhnert, and O. Watanabe, Interval graph representation with given interval and intersection lengths, J. Discrete Algorithms, vol.34, pp.108-117, 2015.

M. Onus and A. W. Richa, Minimum maximum-degree publish-subscribe overlay network design, IEEE/ACM Trans. Netw, vol.19, issue.5, pp.1331-1343, 2011.
DOI : 10.1109/infcom.2009.5061998
URL : http://repository.bilkent.edu.tr/bitstream/11693/28338/1/Minimum%20maximum-degree%20publish-subscribe%20overlay%20network%20design.pdf

A. Schrijver, Combinatorial optimization. Polyhedra and efficiency, Algorithms and Combinatorics, vol.24, 2003.

M. Sharon and C. V. Robinson, The role of mass spectrometry in structure elucidation of dynamic protein complexes, Annual Review of Biochemistry, vol.76, issue.1, p.17328674, 2007.