{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:35:15Z","timestamp":1743111315538,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030392185"},{"type":"electronic","value":"9783030392192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_32","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T19:09:24Z","timestamp":1579892964000},"page":"403-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Overlaying a Hypergraph with a Graph with Bounded Maximum Degree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3447-8112","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Havet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5589-1889","authenticated-orcid":false,"given":"Dorian","family":"Mazauric","sequence":"additional","affiliation":[]},{"given":"Viet-Ha","family":"Nguyen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6243-5910","authenticated-orcid":false,"given":"R\u00e9mi","family":"Watrigant","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1074\/mcp.M114.047779","volume":"14","author":"D Agarwal","year":"2015","unstructured":"Agarwal, D., Caillouet, C., Coudert, D., Cazals, F.: Unveiling contacts within macro-molecular assemblies by solving minimum weight connectivity inference problems. Mol. Cell. Proteomics 14, 2274\u20132284 (2015)","journal-title":"Mol. Cell. Proteomics"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-16108-7_12","volume-title":"Algorithmic Learning Theory","author":"D Angluin","year":"2010","unstructured":"Angluin, D., Aspnes, J., Reyzin, L.: Inferring social networks from outbreaks. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) ALT 2010. LNCS (LNAI), vol. 6331, pp. 104\u2013118. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16108-7_12"},{"key":"32_CR3","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J. A. Bondy","year":"2008","unstructured":"Bondy, A.J., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-19222-7_21","volume-title":"Combinatorial Algorithms","author":"U Brandes","year":"2011","unstructured":"Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Blocks of hypergraphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol. 6460, pp. 201\u2013211. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-19222-7_21"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1038\/nmeth.1814","volume":"9","author":"R Burnley","year":"2012","unstructured":"Burnley, R., Damoc, E., Denisov, E., Makarov, A., Heck, A.: High-sensitivity orbitrap mass analysis of intact macromolecular assemblies. Nat. Methods 9, 10 (2012)","journal-title":"Nat. Methods"},{"issue":"1","key":"32_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/140955057","volume":"29","author":"J Chen","year":"2015","unstructured":"Chen, J., Komusiewicz, C., Niedermeier, R., Sorge, M., Such\u00fd, O., Weller, M.: Polynomial-time data reduction for the subset interconnection design problem. SIAM J. Discret. Math. 29(1), 1\u201325 (2015)","journal-title":"SIAM J. Discret. Math."},{"doi-asserted-by":"crossref","unstructured":"Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: Constructing scalable overlays for pub-sub with many topics. In: PODC 2007, pp. 109\u2013118. ACM, New York (2007)","key":"32_CR7","DOI":"10.1145\/1281100.1281118"},{"key":"32_CR8","first-page":"133","volume":"52","author":"N Cohen","year":"2019","unstructured":"Cohen, N., Havet, F., Mazauric, D., Sau, I., Watrigant, R.: Complexity dichotomies for the minimum F-overlay problem. J. Discret. Algorithms 52, 133\u2013142 (2019)","journal-title":"J. Discret. Algorithms"},{"unstructured":"Conitzer, V., Derryberry, J., Sandholm, T.: Combinatorial auctions with structured item graphs. In: 16th Conference on Innovative Applications of Artificial Intelligence (AAAI 2004), pp. 212\u2013218 (2004)","key":"32_CR9"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01096768","volume":"6","author":"DZ Du","year":"1995","unstructured":"Du, D.Z., Kelley, D.F.: On complexity of subset interconnection designs. J. Global Optim. 6(2), 193\u2013205 (1995)","journal-title":"J. Global Optim."},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0401042","volume":"1","author":"D-Z Du","year":"1988","unstructured":"Du, D.-Z., Miller, Z.: Matroids and subset interconnection design. SIAM J. Discret. Math. 1(4), 416\u2013424 (1988)","journal-title":"SIAM J. Discret. Math."},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-85097-7_19","volume-title":"Combinatorial Optimization and Applications","author":"H Fan","year":"2008","unstructured":"Fan, H., Hundt, C., Wu, Y.-L., Ernst, J.: Algorithms and implementation for interconnection graph problem. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 201\u2013210. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85097-7_19"},{"unstructured":"Fan, H., Wu, Y.: Interconnection graph problem. In: Proceedings of the 2008 International Conference on Foundations of Computer Science, FCS 2008, pp. 51\u201355 (2008)","key":"32_CR13"},{"issue":"3","key":"32_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190110306","volume":"11","author":"DS Johnson","year":"1987","unstructured":"Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing venn diagrams. J. Graph Theory 11(3), 309\u2013325 (1987)","journal-title":"J. Graph Theory"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-32278-5_6","volume-title":"Graphs, Networks and Algorithms","author":"Dieter Jungnickel","year":"2013","unstructured":"Jungnickel, D.: Graphs, Networks and Algorithms. Algorithmsand Computation in Mathematics, vol. 5. Springer, Heidelberg (2013)"},{"key":"32_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Reducibility among Combinatorial Problems","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. Springer, New York (1972)"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jda.2015.05.011","volume":"34","author":"J K\u00f6bler","year":"2015","unstructured":"K\u00f6bler, J., Kuhnert, S., Watanabe, O.: Interval graph representation with given interval and intersection lengths. J. Discret. Algorithms 34, 108\u2013117 (2015)","journal-title":"J. Discret. Algorithms"},{"issue":"5","key":"32_CR18","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1109\/TNET.2011.2144999","volume":"19","author":"M Onus","year":"2011","unstructured":"Onus, M., Richa, A.W.: Minimum maximum-degree publish-subscribe overlay network design. IEEE\/ACM Trans. Networking 19(5), 1331\u20131343 (2011)","journal-title":"IEEE\/ACM Trans. Networking"},{"unstructured":"Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer-Verlag, Berlin (2003)","key":"32_CR19"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1146\/annurev.biochem.76.061005.090816","volume":"76","author":"M Sharon","year":"2007","unstructured":"Sharon, M., Robinson, C.V.: The role of mass spectrometry in structure elucidation of dynamic protein complexes. Annu. Rev. Biochem. 76(1), 167\u2013193 (2007). PMID: 17328674","journal-title":"Annu. Rev. Biochem."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:02:10Z","timestamp":1579910530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}