{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T19:05:57Z","timestamp":1783191957424,"version":"3.54.6"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T00:00:00Z","timestamp":1448064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T00:00:00Z","timestamp":1448064000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA8651-14-2-0002"],"award-info":[{"award-number":["FA8651-14-2-0002"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-12-1-0103"],"award-info":[{"award-number":["FA9550-12-1-0103"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA8651-12-2-0011"],"award-info":[{"award-number":["FA8651-12-2-0011"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10589-015-9804-y","type":"journal-article","created":{"date-parts":[[2015,11,21]],"date-time":"2015-11-21T04:41:21Z","timestamp":1448080881000},"page":"177-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs"],"prefix":"10.1007","volume":"64","author":[{"given":"Alexander","family":"Veremyev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oleg A.","family":"Prokopyev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergiy","family":"Butenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eduardo L.","family":"Pasiliao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,11,21]]},"reference":[{"key":"9804_CR1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1090\/dimacs\/050\/06","volume-title":"External Memory Algorithms and Visualization","author":"J Abello","year":"1999","unstructured":"Abello, J., Pardalos, P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: Abello, J., Vitter, J. (eds.) External Memory Algorithms and Visualization, pp. 119\u2013130. American Mathematical Society, Boston (1999)"},{"key":"9804_CR2","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/3-540-45995-2_51","volume-title":"LATIN 2002: Theoretical Informatics","author":"J Abello","year":"2002","unstructured":"Abello, J., Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002: Theoretical Informatics, pp. 598\u2013612. Springer, London (2002)"},{"issue":"2","key":"9804_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"WP Adams","year":"2004","unstructured":"Adams, W.P., Forrester, R.J., Glover, F.W.: Comparisons and enhancement strategies for linearizing mixed 0\u20131 quadratic programs. Discret. Optim. 1(2), 99\u2013120 (2004)","journal-title":"Discret. Optim."},{"issue":"1\u20133","key":"9804_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0166-218X(01)00243-8","volume":"121","author":"Y Asahiro","year":"2002","unstructured":"Asahiro, Y., Hassin, R., Iwama, K.: Complexity of finding dense subgraphs. Discret. Appl. Math. 121(1\u20133), 15\u201326 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9804_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"GD Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinf. 4(1), 2 (2003)","journal-title":"BMC Bioinf."},{"issue":"1","key":"9804_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.: Clique relaxations in social network analysis: the maximum $$k$$-plex problem. Oper. Res. 59(1), 133\u2013142 (2011)","journal-title":"Oper. Res."},{"key":"9804_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., Trukhanov, S.: Novel approaches for analyzing biological networks. J. Comb. Optim. 10, 23\u201339 (2005)","journal-title":"J. Comb. Optim."},{"key":"9804_CR8","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Mrvar, A.: Pajek Datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/ (2006). Accessed 26 Oct 2015","DOI":"10.1177\/0894439307299587"},{"key":"9804_CR9","doi-asserted-by":"crossref","unstructured":"Bhattacharyya, M., Bandyopadhyay, S.: Mining the largest quasi-clique in human protein interactome. In: Proceedings of the 2009 International Conference on Adaptive and Intelligent Systems, ICAIS \u201909, pp. 194\u2013199. IEEE Computer Society, Washington, DC, USA (2009)","DOI":"10.1109\/ICAIS.2009.39"},{"issue":"11","key":"9804_CR10","doi-asserted-by":"publisher","first-page":"3171","DOI":"10.1016\/j.cor.2005.01.027","volume":"33","author":"V Boginski","year":"2006","unstructured":"Boginski, V., Butenko, S., Pardalos, P.: Mining market data: a network approach. Comput. Oper. Res. 33(11), 3171\u20133184 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9804_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.csda.2004.02.004","volume":"48","author":"V Boginski","year":"2005","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Statistical analysis of financial networks. Comput. Stat. Data Anal. 48(2), 431\u2013443 (2005)","journal-title":"Comput. Stat. Data Anal."},{"key":"9804_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization, vol. 4, pp. 1\u201374. Kluwer Academic Publishers, Boston (1999)"},{"issue":"9","key":"9804_CR13","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1093\/nar\/gkg340","volume":"31","author":"D Bu","year":"2003","unstructured":"Bu, D., Zhao, Y., Cai, L., Xue, H., Zhu, X., Lu, H., Zhang, J., Sun, S., Ling, L., Zhang, N., Li, G., Chen, R.: Topological structure analysis of the protein\u2013protein interaction network in budding yeast. Nucleic Acids Res. 31(9), 2443\u20132450 (2003)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"9804_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2005.05.026","volume":"173","author":"S Butenko","year":"2006","unstructured":"Butenko, S., Wilhelm, W.: Clique-detection models in computational biochemistry and genomics. Eur. J. Oper. Res. 173(1), 1\u201317 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9804_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1080\/15427951.2004.10129089","volume":"1","author":"F Chung","year":"2004","unstructured":"Chung, F., Lu, L., Vu, V.: The spectra of random graphs with given expected degrees. Internet Math. 1, 257\u2013275 (2004)","journal-title":"Internet Math."},{"issue":"3","key":"9804_CR16","doi-asserted-by":"publisher","first-page":"578","DOI":"10.2307\/2110462","volume":"22","author":"MA Crenson","year":"1978","unstructured":"Crenson, M.A.: Social networks and political processes in urban neighborhoods. Am. J. Polit. Sci. 22(3), 578\u2013594 (1978)","journal-title":"Am. J. Polit. Sci."},{"key":"9804_CR17","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1038\/nature07053","volume":"454","author":"S Davis","year":"2008","unstructured":"Davis, S., Trapman, P., Leirs, H., Begon, M., Heesterbeek, J.A.P.: The abundance threshold for plague as a critical percolation phenomenon. Nature 454, 634\u2013637 (2008)","journal-title":"Nature"},{"issue":"1","key":"9804_CR18","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"9804_CR19","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"9804_CR20","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman, New York (1979)"},{"issue":"4","key":"9804_CR21","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s00453-011-9487-4","volume":"61","author":"J Guo","year":"2011","unstructured":"Guo, J., Kanj, I.A., Komusiewicz, C., Uhlmann, J.: Editing graphs into disjoint unions of dense clusters. Algorithmica 61(4), 949\u2013970 (2011)","journal-title":"Algorithmica"},{"key":"9804_CR22","volume-title":"Inequalities","author":"GH Hardy","year":"1952","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge University Press, Cambridge (1952)"},{"issue":"6761 Suppl","key":"9804_CR23","doi-asserted-by":"publisher","first-page":"C47","DOI":"10.1038\/35011540","volume":"402","author":"LH Hartwell","year":"1999","unstructured":"Hartwell, L.H., Hopfield, J.J., Leibler, S., Murray, A.W.: From molecular to modular cell biology. Nature 402(6761 Suppl), C47\u2013C52 (1999)","journal-title":"Nature"},{"key":"9804_CR24","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-44849-7_25","volume-title":"Algorithms and Complexity","author":"K Holzapfel","year":"2003","unstructured":"Holzapfel, K., Kosub, S., Maa\u00df, M.G., T\u00e4ubig, H.: The complexity of detecting fixed-density clusters. Algorithms and Complexity, pp. 201\u2013212. Springer, Berlin (2003)"},{"issue":"suppl 1","key":"9804_CR25","doi-asserted-by":"publisher","first-page":"i213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H Hu","year":"2005","unstructured":"Hu, H., Yan, X., Huang, Y., Han, J., Zhou, X.J.: Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics 21(suppl 1), i213\u2013i221 (2005)","journal-title":"Bioinformatics"},{"issue":"14","key":"9804_CR26","doi-asserted-by":"publisher","first-page":"2956","DOI":"10.1016\/j.physa.2009.03.028","volume":"388","author":"W-Q Huang","year":"2009","unstructured":"Huang, W.-Q., Zhuang, X.-T., Yao, S.: A network analysis of the Chinese stock market. Phys. A: Stat. Mech. Appl. 388(14), 2956\u20132964 (2009)","journal-title":"Phys. A: Stat. Mech. Appl."},{"issue":"1","key":"9804_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0012-365X(76)90091-1","volume":"16","author":"T Ibaraki","year":"1976","unstructured":"Ibaraki, T.: Integer programming formulation of combinatorial optimization problems. Discret. Math. 16(1), 39\u201352 (1976)","journal-title":"Discret. Math."},{"issue":"2","key":"9804_CR28","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/S0895480195287541","volume":"11","author":"J Kleinberg","year":"1998","unstructured":"Kleinberg, J., Goemans, M.X.: The Lov\u00e1sz theta function and a semidefinite programming relaxation of vertex cover. SIAM J. Discret. Math. 11(2), 196\u2013204 (1998)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"9804_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25(1), 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9804_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02289146","volume":"14","author":"RD Luce","year":"1949","unstructured":"Luce, R.D., Perry, A.D.: A method of matrix analysis of group structure. Psychometrika 14(2), 95\u2013116 (1949)","journal-title":"Psychometrika"},{"key":"9804_CR31","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0304-3975(98)00091-7","volume":"210","author":"H Matsuda","year":"1999","unstructured":"Matsuda, H., Ishihara, T., Hashimoto, A.: Classifying molecular sequences using a linkage graph with their pairwise similarities. Theor. Comput. Sci. 210, 305\u2013325 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9804_CR32","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"issue":"1","key":"9804_CR33","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.: A fast algorithm for the maximum clique problem. Discret. Appl. Math. 120(1), 197\u2013207 (2002)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9804_CR34","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-012-1242-y","volume":"216","author":"FM Pajouh","year":"2014","unstructured":"Pajouh, F.M., Miao, Z., Balasundaram, B.: A branch-and-bound approach for maximum quasi-cliques. Ann. Oper. Re. 216(1), 145\u2013161 (2014)","journal-title":"Ann. Oper. Re."},{"issue":"3","key":"9804_CR35","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Global. Optim. 4(3), 301\u2013328 (1994)","journal-title":"J. Global. Optim."},{"issue":"1\u20132","key":"9804_CR36","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2012.07.019","volume":"161","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Veremyev, A., Butenko, S., Boginski, V.: On the maximum quasi-clique problem. Discret. Appl. Math. 161(1\u20132), 244\u2013257 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9804_CR37","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1), 9\u201318 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"5586","key":"9804_CR38","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1126\/science.1073374","volume":"297","author":"E Ravasz","year":"2002","unstructured":"Ravasz, E., Somera, A.L., Mongru, D.A., Oltvai, Z.N., Barab\u00e1si, A.L.: Hierarchical organization of modularity in metabolic networks. Science 297(5586), 1551\u20131555 (2002)","journal-title":"Science"},{"issue":"17","key":"9804_CR39","doi-asserted-by":"publisher","first-page":"3661","DOI":"10.1016\/j.physa.2010.04.001","volume":"389","author":"D Saban","year":"2010","unstructured":"Saban, D., Bonomo, F., Stier-Moses, N.E.: Analysis and models of bilateral investment treaties using a social networks approach. Phys. A: Stat. Mech. Appl. 389(17), 3661\u20133673 (2010)","journal-title":"Phys. A: Stat. Mech. Appl."},{"key":"9804_CR40","volume-title":"Social Network Analysis: A Handbook","author":"J Scott","year":"2000","unstructured":"Scott, J.: Social Network Analysis: A Handbook, 2nd edn. Sage Publications, London (2000)","edition":"2"},{"key":"9804_CR41","doi-asserted-by":"crossref","unstructured":"Sim, K., Li, J., Gopalkrishnan, V., Liu, G.: Mining maximal quasi-bicliques to co-cluster stocks and financial ratios for value investment. In: Proceedings of the Sixth International Conference on Data Mining, ICDM \u201906, pp. 1059\u20131063. IEEE Computer Society, Washington, DC, USA (2006)","DOI":"10.1109\/ICDM.2006.111"},{"issue":"21","key":"9804_CR42","doi-asserted-by":"publisher","first-page":"12123","DOI":"10.1073\/pnas.2032324100","volume":"100","author":"V Spirin","year":"2003","unstructured":"Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. 100(21), 12123\u201312128 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"9804_CR43","unstructured":"Trick, M.: COLOR02\/03\/04: Graph Coloring and Its Generalizations. http:\/\/mat.gsia.cmu.edu\/COLOR03\/ (2004). Accessed 26 Oct 2015"},{"issue":"1","key":"9804_CR44","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10589-013-9548-5","volume":"56","author":"S Trukhanov","year":"2013","unstructured":"Trukhanov, S., Balasubramaniam, C., Balasundaram, B., Butenko, S.: Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comput. Optim. Appl. 56(1), 113\u2013130 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9804_CR45","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-008-9238-3","volume":"56","author":"T Uno","year":"2010","unstructured":"Uno, T.: An efficient algorithm for solving pseudo clique enumeration problem. Algorithmica 56, 3\u201316 (2010)","journal-title":"Algorithmica"},{"issue":"12","key":"9804_CR46","doi-asserted-by":"publisher","first-page":"e51883","DOI":"10.1371\/journal.pone.0051883","volume":"7","author":"A Veremyev","year":"2012","unstructured":"Veremyev, A., Boginski, V., Krokhmal, P.A., Jeffcoat, D.E.: Dense percolation in large-scale mean-field random networks is provably \u201cexplosive\u201d. PLoS One 7(12), e51883 (2012)","journal-title":"PLoS One"},{"issue":"4","key":"9804_CR47","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11590-014-0782-2","volume":"9","author":"C Vogiatzis","year":"2014","unstructured":"Vogiatzis, C., Veremyev, A., Pasiliao, E.L., Pardalos, P.M.: An integer programming approach for finding the most and the least central cliques. Optim. Lett. 9(4), 615\u2013633 (2014)","journal-title":"Optim. Lett."},{"key":"9804_CR48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis. Cambridge University Press, New York (1994)"},{"key":"9804_CR49","unstructured":"FICO$$^{\\text{ TM }}$$ Xpress Optimization Suite 7.6. http:\/\/www.fico.com\/en\/Products\/DMTools\/Pages\/FICO-Xpress-Optimization-Suite.aspx (2014). Accessed 26 Oct 2015"},{"issue":"7","key":"9804_CR50","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1093\/bioinformatics\/btl014","volume":"22","author":"H Yu","year":"2006","unstructured":"Yu, H., Paccanaro, A., Trifonov, V., Gerstein, M.: Predicting interactions in protein networks by completing defective cliques. Bioinformatics 22(7), 823\u2013829 (2006)","journal-title":"Bioinformatics"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9804-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9804-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9804-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9804-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T16:05:54Z","timestamp":1718208354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9804-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,21]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9804"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9804-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,21]]},"assertion":[{"value":"23 December 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}