{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:48:30Z","timestamp":1774417710874,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T00:00:00Z","timestamp":1550102400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization","award":["NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization"],"award-info":[{"award-number":["NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673058"],"award-info":[{"award-number":["61673058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012659","name":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61621063"],"award-info":[{"award-number":["61621063"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Projects of Major International (Regional) Joint Research Program NSFC","award":["61720106011"],"award-info":[{"award-number":["61720106011"]}]},{"name":"National Outstanding Youth Talents Support Program","award":["61822304"],"award-info":[{"award-number":["61822304"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00500-019-03824-8","type":"journal-article","created":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T16:05:36Z","timestamp":1550160336000},"page":"12729-12744","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The bi-objective critical node detection problem with minimum pairwise connectivity and cost: theory and algorithms"],"prefix":"10.1007","volume":"23","author":[{"given":"Juan","family":"Li","sequence":"first","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Xin","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"issue":"16\u201317","key":"3824_CR1","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1016\/j.dam.2013.03.021","volume":"161","author":"B Addis","year":"2013","unstructured":"Addis B, Di Summa M, Grosso A (2013) Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Appl Math 161(16\u201317):2349\u20132360","journal-title":"Discrete Appl Math"},{"issue":"1","key":"3824_CR2","first-page":"1","volume":"238","author":"B Addis","year":"2016","unstructured":"Addis B, Aringhieri R, Grosso A, Hosteins P (2016) Hybrid constructive heuristics for the critical node problem. Ann Oper Res 238(1):1\u201313","journal-title":"Ann Oper Res"},{"key":"3824_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.endm.2014.11.006","volume":"47","author":"R Aringhieri","year":"2015","unstructured":"Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2015) VNS solutions for the critical node problem. Electron Notes Discrete Math 47:37\u201344","journal-title":"Electron Notes Discrete Math"},{"key":"3824_CR4","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.engappai.2016.06.010","volume":"55","author":"R Aringhieri","year":"2016","unstructured":"Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2016a) A general evolutionary framework for different classes of critical node problems. Eng Appl Artif Intell 55:128\u2013145","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"3824_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.21671","volume":"67","author":"R Aringhieri","year":"2016","unstructured":"Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2016b) Local search metaheuristics for the critical node problem. Networks 67(3):209\u2013221","journal-title":"Networks"},{"key":"3824_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.dam.2017.12.035","volume":"253","author":"R Aringhieri","year":"2019","unstructured":"Aringhieri R, Grosso A, Hosteins P, Scatamacchia R (2019) Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem. Discrete Appl Math 253:103\u2013121","journal-title":"Discrete Appl Math"},{"key":"3824_CR7","unstructured":"Arulselvan A, Commander CW, Pardalos PM, Shylo O (2007) Managing network risk via critical node identification. Risk management in telecommunication networks, Springer"},{"issue":"7","key":"3824_CR8","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan A, Commander CW, Elefteriadou L, Pardalos PM (2009) Detecting critical nodes in sparse graphs. Comput Oper Res 36(7):2193\u20132200","journal-title":"Comput Oper Res"},{"key":"3824_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0534-5_4","volume-title":"Cardinality-constrained critical node detection problem","author":"A Arulselvan","year":"2011","unstructured":"Arulselvan A, Commander CW, Shylo O, Pardalos PM (2011) Cardinality-constrained critical node detection problem. Springer, New York"},{"key":"3824_CR10","unstructured":"Aspnes J, Chang K, Yampolskiy A (2005) Inoculation strategies for victims of viruses and the sum-of-squares partition problem. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms, pp 43\u201352"},{"key":"3824_CR11","doi-asserted-by":"crossref","unstructured":"Atputharajah A, Saha TK (2009) Power system blackouts\u2014literature review. In: Proceedings of the international conference on industrial and information systems, pp 460\u2013465","DOI":"10.1109\/ICIINFS.2009.5429818"},{"issue":"3","key":"3824_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-005-0574-7","volume":"103","author":"E Balas","year":"2005","unstructured":"Balas E, Souza CCd (2005) The vertex separator problem: a polyhedral investigation. Math Program 103(3):583\u2013608","journal-title":"Math Program"},{"issue":"1","key":"3824_CR13","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/s10878-014-9753-x","volume":"29","author":"W Ben-Ameur","year":"2015","unstructured":"Ben-Ameur W, Mohamed-Sidi M-A, Neto J (2015) The $$k$$ k -separator problem: polyhedra, complexity and approximation results. J Comb Optim 29(1):276\u2013307","journal-title":"J Comb Optim"},{"issue":"1","key":"3824_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10588-006-7084-x","volume":"12","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP (2006) Identifying sets of key players in a social network. Comput Math Organ Theory 12(1):21\u201334","journal-title":"Comput Math Organ Theory"},{"key":"3824_CR15","unstructured":"Chen P-A, David M, Kempe D (2010) Better vaccination strategies for better people. In: Proceedings of the ACM conference on electronic commerce, pp 179\u2013188"},{"issue":"5","key":"3824_CR16","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TEVC.2017.2683489","volume":"21","author":"J Chen","year":"2017","unstructured":"Chen J, Li J, Xin B (2017) DMOEA- $$\\varepsilon $$ \u03b5 C: decomposition-based multi-objective evolutionary algorithm with the $$\\varepsilon $$ \u03b5 -constraint framework. IEEE Trans Evolut Comput 21(5):714\u2013730","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"3824_CR17","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolut Comput"},{"issue":"12","key":"3824_CR18","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1016\/j.cor.2011.02.016","volume":"38","author":"M Summa Di","year":"2011","unstructured":"Di Summa M, Grosso A, Locatelli M (2011) Complexity of the critical node problem over trees. Comput Oper Res 38(12):1766\u20131774","journal-title":"Comput Oper Res"},{"issue":"3","key":"3824_CR19","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10589-012-9458-y","volume":"53","author":"M Summa Di","year":"2012","unstructured":"Di Summa M, Grosso A, Locatelli M (2012) Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput Optim Appl 53(3):649\u2013680","journal-title":"Comput Optim Appl"},{"key":"3824_CR20","unstructured":"Dinh TN, Thai MT (2013) Precise structural vulnerability assessment via mathematical programming. In: Proceedings of the military communications conference, pp 1351\u20131356"},{"key":"3824_CR21","doi-asserted-by":"crossref","unstructured":"Dinh TN, Xuan Y, Thai MT, Park EK, Znati T (2010) On approximation of new optimization methods for assessing network vulnerability. In: Proceedings of the conference on information communications, pp 2678\u20132686","DOI":"10.1109\/INFCOM.2010.5462098"},{"key":"3824_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17458-2_15","volume-title":"Robust optimization of graph partitioning and critical node detection in analyzing networks","author":"N Fan","year":"2010","unstructured":"Fan N, Pardalos PM (2010) Robust optimization of graph partitioning and critical node detection in analyzing networks. Springer, Berlin"},{"issue":"99","key":"3824_CR23","first-page":"1","volume":"PP","author":"L Faramondi","year":"2018","unstructured":"Faramondi L, Oliva G, Panzieri S, Pascucci F, Schlueter M, Munetomo M, Setola R (2018) Network structural vulnerability: a multiobjective attacker perspective. IEEE Trans Syst Man Cybern Syst PP(99):1\u201314","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"11","key":"3824_CR24","doi-asserted-by":"publisher","first-page":"2689","DOI":"10.1016\/j.cor.2013.04.016","volume":"40","author":"D Granata","year":"2013","unstructured":"Granata D, Steeger G, Rebennack S (2013) Network interdiction via a critical disruption path: branch-and-price algorithms. Comput Oper Res 40(11):2689\u20132702","journal-title":"Comput Oper Res"},{"issue":"7","key":"3824_CR25","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/j.tra.2005.11.003","volume":"40","author":"E Jenelius","year":"2006","unstructured":"Jenelius E, Petersen T, Mattsson L-G (2006) Importance and exposure in road network vulnerability analysis. Transp Res Part A Policy Pract 40(7):537\u2013560","journal-title":"Transp Res Part A Policy Pract"},{"key":"3824_CR26","unstructured":"Kempe D, Kleinberg J, Tardos E (2010) Maximizing the spread of influence in a social network. Progressive research, pp 137\u2013146"},{"key":"3824_CR27","doi-asserted-by":"crossref","unstructured":"Kuhlman CJ, Kumar VSA, Marathe MV, Ravi SS, Rosenkrantz DJ (2010) Finding critical nodes for inhibiting diffusion of complex contagions in social networks. In: Proceedings of the European conference on machine learning and knowledge discovery in databases, pp 111\u2013127","DOI":"10.1007\/978-3-642-15883-4_8"},{"key":"3824_CR28","doi-asserted-by":"crossref","unstructured":"Kumar VSA, Rajaraman R, Sun Z, Sundaram R (2010) Existence theorems and approximation algorithms for generalized network security games. In: Proceedings of the IEEE international conference on distributed computing systems, pp 348\u2013357","DOI":"10.1109\/ICDCS.2010.70"},{"key":"3824_CR29","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.dam.2015.01.043","volume":"210","author":"M Lalou","year":"2016","unstructured":"Lalou M, Tahraoui MA, Kheddouci H (2016) Component-cardinality-constrained critical node problem in graphs. Discrete Appl Math 210:150\u2013163","journal-title":"Discrete Appl Math"},{"key":"3824_CR30","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cosrev.2018.02.002","volume":"28","author":"M Lalou","year":"2018","unstructured":"Lalou M, Tahraoui MA, Kheddouci H (2018) The critical node detection problem in networks: a survey. Comput Sci Rev 28:92\u2013117","journal-title":"Comput Sci Rev"},{"key":"3824_CR31","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Vanbriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"3824_CR32","doi-asserted-by":"publisher","first-page":"3317","DOI":"10.1109\/TPWRS.2016.2631891","volume":"32","author":"G Liang","year":"2017","unstructured":"Liang G, Weller SR, Zhao J, Luo F, Dong ZY (2017) The 2015 Ukraine blackout: implications for false data injection attacks. IEEE Trans Power Syst 32:3317\u20133318","journal-title":"IEEE Trans Power Syst"},{"key":"3824_CR33","volume-title":"Nonlinear multiobjective optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen K (1999) Nonlinear multiobjective optimization. Kluwer Academic Publishers, Boston"},{"key":"3824_CR34","unstructured":"Papadimitriou CH, Yannakakis M (2000) On the approximability of trade-offs and optimal access of web sources. In: Proceedings of the symposium on foundations of computer science, pp 86\u201392"},{"key":"3824_CR35","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.cor.2018.04.012","volume":"97","author":"K Pavlikov","year":"2018","unstructured":"Pavlikov K (2018) Improved formulations for minimum connectivity network interdiction problems. Comput Oper Res 97:48\u201357","journal-title":"Comput Oper Res"},{"issue":"2","key":"3824_CR36","first-page":"157","volume":"44","author":"D Purevsuren","year":"2017","unstructured":"Purevsuren D, Cui G, Qu M, Win NNH (2017) hybridization of GRASP with exterior path relinking for identifying critical nodes in graphs. Int J Comput Sci 44(2):157\u2013165","journal-title":"Int J Comput Sci"},{"issue":"2","key":"3824_CR37","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/EVCO_a_00109","volume":"22","author":"Y Qi","year":"2014","unstructured":"Qi Y, Ma X, Liu F (2014) MOEA\/D with adaptive weight adjustment. Evolut Comput 22(2):231\u2013264","journal-title":"Evolut Comput"},{"issue":"2","key":"3824_CR38","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TPWRS.2004.825888","volume":"19","author":"J Salmeron","year":"2015","unstructured":"Salmeron J, Wood K, Baldick R (2015) Analysis of electric grid security under terrorist threat. IEEE Trans Power Syst 19(2):905\u2013912","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"3824_CR39","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.20464","volume":"60","author":"S Shen","year":"2012","unstructured":"Shen S, Smith JC (2012) Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs. Networks 60(2):103\u2013119","journal-title":"Networks"},{"issue":"3","key":"3824_CR40","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TNET.2012.2215882","volume":"21","author":"Y Shen","year":"2013","unstructured":"Shen Y, Nguyen NP, Xuan Y, Thai MT (2013a) On the discovery of critical links and nodes for assessing network vulnerability. IEEE\/ACM Trans Netw 21(3):963\u2013973","journal-title":"IEEE\/ACM Trans Netw"},{"key":"3824_CR41","doi-asserted-by":"crossref","unstructured":"Shen Y, Dinh TN, Thai MT (2013b) Adaptive algorithms for detecting critical links and nodes in dynamic networks. In: Proceedings of the IEEE military communications conference, pp 1\u20136","DOI":"10.1109\/MILCOM.2012.6415629"},{"key":"3824_CR42","unstructured":"Spears WM, Jong KAD (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the 4th international conference on genetic algorithms, pp 230\u2013236"},{"key":"3824_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-2107-8_10","volume-title":"Studying connectivity properties in human protein\u2013protein interaction network in cancer pathway","author":"V Tomaino","year":"2012","unstructured":"Tomaino V, Arulselvan A, Veltri P, Pardalos PM (2012) Studying connectivity properties in human protein\u2013protein interaction network in cancer pathway. Springer, New York"},{"issue":"11","key":"3824_CR44","doi-asserted-by":"publisher","first-page":"2763","DOI":"10.1016\/j.cor.2012.02.008","volume":"39","author":"M Ventresca","year":"2012","unstructured":"Ventresca M (2012) Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem. Comput Oper Res 39(11):2763\u20132775","journal-title":"Comput Oper Res"},{"issue":"7","key":"3824_CR45","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2014.02.003","volume":"48","author":"M Ventresca","year":"2014","unstructured":"Ventresca M, Aleman D (2014) A randomized algorithm with local search for containment of pandemic disease spread. Comput Oper Res 48(7):11\u201319","journal-title":"Comput Oper Res"},{"issue":"1","key":"3824_CR46","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s40649-015-0010-y","volume":"2","author":"M Ventresca","year":"2015","unstructured":"Ventresca M, Aleman D (2015) Efficiently identifying critical nodes in large complex networks. Comput Soc Netw 2(1):6","journal-title":"Comput Soc Netw"},{"issue":"3","key":"3824_CR47","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/j.ejor.2017.08.053","volume":"265","author":"M Ventresca","year":"2018","unstructured":"Ventresca M, Harrison KR, Ombuki-Berman BM (2018) The bi-objective critical node detection problem. Eur J Oper Res 265(3):895\u2013908","journal-title":"Eur J Oper Res"},{"issue":"1","key":"3824_CR48","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10878-014-9730-4","volume":"28","author":"A Veremyev","year":"2014","unstructured":"Veremyev A, Prokopyev OA, Pasiliao EL (2014a) An integer programming framework for critical elements detection in graphs. J Comb Optim 28(1):233\u2013273","journal-title":"J Comb Optim"},{"issue":"4","key":"3824_CR49","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1007\/s11590-013-0666-x","volume":"8","author":"A Veremyev","year":"2014","unstructured":"Veremyev A, Boginski V, Pasiliao EL (2014b) Exact identification of critical nodes in sparse networks via new compact formulations. Optim Lett 8(4):1245\u20131259","journal-title":"Optim Lett"},{"key":"3824_CR50","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1002\/net.21834","volume":"73","author":"JL Walteros","year":"2019","unstructured":"Walteros JL, Veremyev A, Pardalos PM, Pasiliao EL (2019) Detecting critical node structures on graphs: a mathematical programming approach. Networks 73:48\u201388","journal-title":"Networks"},{"key":"3824_CR51","series-title":"Springer optimization and its applications","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-1-4614-4109-0_2","volume-title":"Applications of mathematics and informatics in military science","author":"JL Walteros","year":"2012","unstructured":"Walteros JL, Pardalos PM (2012) Selected topics in critical element detection. In: Daras N (ed) Applications of mathematics and informatics in military science, vol 71. Springer optimization and its applications. Springer, New York, pp 9\u201326"},{"issue":"6","key":"3824_CR52","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evolut Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evolut Comput"},{"key":"3824_CR53","doi-asserted-by":"crossref","unstructured":"Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA\/D on CEC09 unconstrained MOP test instances. Technical Report CES-491, The School of Computer Science and Electronic Engineering, University of Essex","DOI":"10.1109\/CEC.2009.4982949"},{"issue":"5","key":"3824_CR54","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1080\/10020070612330019","volume":"16","author":"T Zhou","year":"2006","unstructured":"Zhou T, Fu Z, Wang B (2006) Epidemic dynamics on complex networks. Prog Nat Sci Mater Int 16(5):452\u2013457","journal-title":"Prog Nat Sci Mater Int"},{"key":"3824_CR55","unstructured":"Zhou A, Zhang Q, Jin Y, Tsang E, Okabe T (2005) A model-based evolutionary algorithm for bi-objective optimization. In: Proceedings of the IEEE congress on evolutionary computation, pp 2568\u20132575"},{"issue":"4","key":"3824_CR56","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithm: a comparative case study and strength pareto approach. IEEE Trans Evolut Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evolut Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-03824-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03824-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-03824-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T20:14:54Z","timestamp":1606508094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-03824-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,14]]},"references-count":56,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3824"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-03824-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,14]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}