{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:36Z","timestamp":1770972396726,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T00:00:00Z","timestamp":1587427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T00:00:00Z","timestamp":1587427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 106-2221-E-019-014"],"award-info":[{"award-number":["MOST 106-2221-E-019-014"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 107-2221-E-019-016"],"award-info":[{"award-number":["MOST 107-2221-E-019-016"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00453-020-00705-7","type":"journal-article","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T05:03:13Z","timestamp":1587445393000},"page":"2809-2840","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Paired-Domination Problem on Distance-Hereditary Graphs"],"prefix":"10.1007","volume":"82","author":[{"given":"Ching-Chi","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keng-Chu","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chan-Hung","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,21]]},"reference":[{"issue":"8","key":"705_CR1","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1016\/j.disc.2015.03.014","volume":"338","author":"JD Alvarado","year":"2015","unstructured":"Alvarado, J.D., Dantas, S., Rautenbach, D.: Perfectly relating the domination, total domination, and paired domination numbers of a graph. Discrete Math. 338(8), 1424\u20131431 (2015)","journal-title":"Discrete Math."},{"issue":"1","key":"705_CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial $$k$$-trees. Discrete Appl. Math. 23(1), 11\u201324 (1989)","journal-title":"Discrete Appl. Math."},{"key":"705_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Berlin (1999)"},{"issue":"2","key":"705_CR4","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H-J Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Combin. Theory Ser. B 41(2), 182\u2013208 (1986)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"705_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"key":"705_CR6","unstructured":"Beyer, T., Proskurowski, A., Hedetniemi, S., Mitchell, S.: Independent domination in trees. In: Proceedings of SEICCGTC\u201977, pp. 321\u2013328. Utilitas Math., Winnipeg, Man. (1977)"},{"issue":"1","key":"705_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"key":"705_CR8","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the restriction of some NP-complete graph problems to permutation graphs. In: the Proceedings of FCT\u201985, Volume 199 of LNCS, pp. 53\u201362. Springer, Berlin (1985)","DOI":"10.1007\/BFb0028791"},{"issue":"4","key":"705_CR9","doi-asserted-by":"crossref","first-page":"2288","DOI":"10.1137\/15M1039821","volume":"30","author":"A Brandst\u00e4dt","year":"2016","unstructured":"Brandst\u00e4dt, A., Mosca, R.: Weighted efficient domination for $$P_5$$-free and $$P_6$$-free graphs. SIAM J. Discrete Math. 30(4), 2288\u20132303 (2016)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"705_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","volume":"22","author":"GJ Chang","year":"1988","unstructured":"Chang, G.J.: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Appl. Math. 22(1), 21\u201334 (1988)","journal-title":"Discrete Appl. Math."},{"key":"705_CR11","doi-asserted-by":"crossref","unstructured":"Chang, G.J.: Algorithmic aspects of domination in graphs. In: Handbook of Combinatorial Optimization, Vol. 3, pp. 339\u2013405. Kluwer Acad. Publ., Boston, MA (1998)","DOI":"10.1007\/978-1-4613-0303-9_28"},{"issue":"6","key":"705_CR12","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1137\/S0097539792238431","volume":"27","author":"M-S Chang","year":"1998","unstructured":"Chang, M.-S.: Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27(6), 1671\u20131694 (1998)","journal-title":"SIAM J. Comput."},{"key":"705_CR13","doi-asserted-by":"crossref","unstructured":"Chang, M.-S., Hsieh, S.-Y., Chen, G.-H.: Dynamic programming on distance-hereditary graphs. In: the Proceedings of ISAAC\u201997, Volume 1350 of LNCS, pp. 344\u2013353. Springer, Berlin (1997)","DOI":"10.1007\/3-540-63890-3_37"},{"issue":"1\u20132","key":"705_CR14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(00)00330-9","volume":"116","author":"M-S Chang","year":"2002","unstructured":"Chang, M.-S., Wu, S.-C., Chang, G.J., Yeh, H.-G.: Domination in distance-hereditary graphs. Discrete Appl. Math. 116(1\u20132), 103\u2013113 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"705_CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0166-218X(98)00145-0","volume":"102","author":"HS Chao","year":"2000","unstructured":"Chao, H.S., Hsu, F.R., Lee, R.C.T.: An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discrete Appl. Math. 102(3), 159\u2013173 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"47\u201349","key":"705_CR16","doi-asserted-by":"crossref","first-page":"5063","DOI":"10.1016\/j.tcs.2009.08.004","volume":"410","author":"L Chen","year":"2009","unstructured":"Chen, L., Lu, C., Zeng, Z.: Hardness results and approximation algorithms for (weighted) paired-domination graphs. Theor. Comput. Sci. 410(47\u201349), 5063\u20135071 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"705_CR17","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.ipl.2009.09.014","volume":"110","author":"L Chen","year":"2009","unstructured":"Chen, L., Lu, C., Zeng, Z.: A linear-time algorithm for paired-domination problem in strongly chordal graphs. Inf. Process. Lett. 110(1), 20\u201323 (2009)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"705_CR18","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10878-008-9177-6","volume":"19","author":"L Chen","year":"2010","unstructured":"Chen, L., Lu, C., Zeng, Z.: Labelling algorithms for paired-domination problems in block and interval graphs. J. Comb. Optim. 19(4), 457\u2013470 (2010)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"705_CR19","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.dam.2008.02.015","volume":"157","author":"TCE Cheng","year":"2009","unstructured":"Cheng, T.C.E., Kang, L., Shan, E.: A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discrete Appl. Math. 157(2), 262\u2013271 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"705_CR20","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"E Cockayne","year":"1975","unstructured":"Cockayne, E., Goodman, S., Hedetniemi, S.: A linear algorithm for the domination number of a tree. Inf. Process. Lett. 4(2), 41\u201344 (1975)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"705_CR21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(90)90359-P","volume":"86","author":"CJ Colbourn","year":"1990","unstructured":"Colbourn, C.J., Stewart, L.K.: Permutation graphs: connected domination and Steiner trees. Discrete Math. 86(1\u20133), 179\u2013189 (1990)","journal-title":"Discrete Math."},{"key":"705_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discrete Appl. Math. 9, 27\u201339 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"705_CR23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(90)90357-N","volume":"86","author":"DG Corneil","year":"1990","unstructured":"Corneil, D.G., Stewart, L.K.: Dominating sets in perfect graphs. Discrete Math. 86(1\u20133), 145\u2013164 (1990)","journal-title":"Discrete Math."},{"issue":"3","key":"705_CR24","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0217032","volume":"17","author":"A D\u2019Atri","year":"1988","unstructured":"D\u2019Atri, A., Moscarini, M.: Distance-hereditary graphs, Steiner trees, and connected domination. SIAM J. Comput. 17(3), 521\u2013538 (1988)","journal-title":"SIAM J. Comput."},{"key":"705_CR25","first-page":"101","volume":"94","author":"WJ Desormeaux","year":"2014","unstructured":"Desormeaux, W.J., Henning, M.A.: Paired domination in graphs: a survey and recent results. Util. Math. 94, 101\u2013166 (2014)","journal-title":"Util. Math."},{"issue":"4","key":"705_CR26","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","volume":"1","author":"M Farber","year":"1982","unstructured":"Farber, M.: Independent domination in chordal graphs. Oper. Res. Lett. 1(4), 134\u2013138 (1982)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"705_CR27","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M Farber","year":"1984","unstructured":"Farber, M.: Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl. Math. 7(2), 115\u2013130 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"705_CR28","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(85)90001-X","volume":"6","author":"M Farber","year":"1985","unstructured":"Farber, M., Keil, J.M.: Domination in permutation graphs. J. Algorithms 6(3), 309\u2013321 (1985)","journal-title":"J. Algorithms"},{"issue":"3","key":"705_CR29","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1007\/s00453-016-0184-1","volume":"78","author":"F Foucaud","year":"2017","unstructured":"Foucaud, F., Mertzios, G.B., Naserasr, R., Parreau, A., Valicov, P.: Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. Algorithmica 78(3), 914\u2013944 (2017)","journal-title":"Algorithmica"},{"key":"705_CR30","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 & Co., New York (1979)"},{"issue":"3","key":"705_CR31","doi-asserted-by":"crossref","first-page":"1685","DOI":"10.1137\/15M1039468","volume":"30","author":"AC Giannopoulou","year":"2016","unstructured":"Giannopoulou, A.C., Mertzios, G.B.: New geometric representations and domination problems on tolerance and multitolerance graphs. SIAM J. Discrete Math. 30(3), 1685\u20131725 (2016)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20132","key":"705_CR32","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"PL Hammer","year":"1990","unstructured":"Hammer, P.L., Maffray, F.: Completely separable graphs. Discrete Appl. Math. 27(1\u20132), 85\u201399 (1990)","journal-title":"Discrete Appl. Math."},{"key":"705_CR33","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"key":"705_CR34","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"issue":"3","key":"705_CR35","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<199::AID-NET4>3.0.CO;2-F","volume":"32","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Slater, P.J.: Paired-domination in graphs. Networks 32(3), 199\u2013206 (1998)","journal-title":"Networks"},{"issue":"1\u20133","key":"705_CR36","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0012-365X(90)90365-O","volume":"86","author":"ST Hedetniemi","year":"1990","unstructured":"Hedetniemi, S.T., Laskar, R.C.: Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Math. 86(1\u20133), 257\u2013277 (1990)","journal-title":"Discrete Math."},{"key":"705_CR37","volume-title":"Topics on Domination","author":"ST Hedetniemi","year":"1991","unstructured":"Hedetniemi, S.T., Laskar, R.C.: Topics on Domination. North-Holland Publishing, Amsterdam (1991)"},{"key":"705_CR38","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.tcs.2019.10.045","volume":"804","author":"MA Henning","year":"2020","unstructured":"Henning, M.A., Pradhan, D.: Algorithmic aspects of upper paired-domination in graphs. Theor. Comput. Sci. 804, 98\u2013114 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"705_CR39","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"DS Hochbaum","year":"1996","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing, New Orleans (1996)"},{"issue":"112","key":"705_CR40","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E Howorka","year":"1977","unstructured":"Howorka, E.: A characterization of distance-hereditary graphs. Q. J. Math. Oxford Ser. (2) 28(112), 417\u2013420 (1977)","journal-title":"Q. J. Math. Oxford Ser. (2)"},{"issue":"4","key":"705_CR41","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/S0895480101389880","volume":"15","author":"S-Y Hsieh","year":"2002","unstructured":"Hsieh, S.-Y., Ho, C.-W., Hsu, T.-S., Ko, M.-T., Chen, G.-H.: Characterization of efficiently parallel solvable problems on distance-hereditary graphs. SIAM J. Discrete Math. 15(4), 488\u2013518 (2002)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"705_CR42","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"WL Hsu","year":"1991","unstructured":"Hsu, W.L., Tsai, K.-H.: Linear time algorithms on circular-arc graphs. Inf. Process. Lett. 40(3), 123\u2013129 (1991)","journal-title":"Inf. Process. Lett."},{"key":"705_CR43","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1007\/978-1-4419-7997-1_81","volume-title":"Handbook of Combinatorial Optimization","author":"L Kang","year":"2013","unstructured":"Kang, L.: Variations of dominating set problem. In: Pardalos, P., Du, D.Z., Graham, R. (eds.) Handbook of Combinatorial Optimization, 2nd edn, pp. 3363\u20133394. Springer, Berlin (2013)","edition":"2"},{"issue":"1","key":"705_CR44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-013-9844-6","volume":"72","author":"M-J Kao","year":"2015","unstructured":"Kao, M.-J., Chen, H.-L., Lee, D.T.: Capacitated domination: problem complexity and approximation algorithms. Algorithmica 72(1), 1\u201343 (2015)","journal-title":"Algorithmica"},{"issue":"4","key":"705_CR45","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(86)90022-0","volume":"22","author":"JM Keil","year":"1986","unstructured":"Keil, J.M.: Total domination in interval graphs. Inf. Process. Lett. 22(4), 171\u2013174 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"705_CR46","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(93)90178-Q","volume":"42","author":"JM Keil","year":"1993","unstructured":"Keil, J.M.: The complexity of domination problems in circle graphs. Discrete Appl. Math. 42(1), 51\u201363 (1993)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"705_CR47","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ejc.2011.10.011","volume":"34","author":"E Lappas","year":"2013","unstructured":"Lappas, E., Nikolopoulos, S.D., Palios, L.: An $$O(n)$$-time algorithm for the paired domination problem on permutation graphs. Eur. J. Combin. 34(3), 593\u2013608 (2013)","journal-title":"Eur. J. Combin."},{"key":"705_CR48","unstructured":"Laskar, R., Pfaff, J.: Domination and irredundance in split graphs. Technical Report 430, Clemson University, Dept. Math. Sciences (1983)"},{"issue":"3","key":"705_CR49","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0605040","volume":"5","author":"R Laskar","year":"1984","unstructured":"Laskar, R., Pfaff, J., Hedetniemi, S.M., Hedetniemi, S.T.: On the algorithmic complexity of total domination. SIAM J. Algebr. Discrete Methods 5(3), 420\u2013425 (1984)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"705_CR50","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.tcs.2015.05.002","volume":"591","author":"C-C Lin","year":"2015","unstructured":"Lin, C.-C., Tu, H.-L.: A linear-time algorithm for paired-domination on circular-arc graphs. Theor. Comput. Sci. 591, 99\u2013105 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"705_CR51","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.dam.2018.09.005","volume":"257","author":"C Lu","year":"2019","unstructured":"Lu, C., Wang, B., Wang, K., Wu, Y.: Paired-domination in claw-free graphs with minimum degree at least three. Discrete Appl. Math. 257, 250\u2013259 (2019)","journal-title":"Discrete Appl. Math."},{"key":"705_CR52","unstructured":"Pfaff, J., Laskar, R., Hedetniemi, S.T.: NP-completeness of total and connected domination and irredundance for bipartite graphs. Technical Report 428, Clemson University, Dept. Math. Sciences (1983)"},{"issue":"1","key":"705_CR53","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1021338214295","volume":"25","author":"H Qiao","year":"2003","unstructured":"Qiao, H., Kang, L., Cardei, M., Du, D.-Z.: Paired-domination of trees. J. Global Optim. 25(1), 43\u201354 (2003)","journal-title":"J. Global Optim."},{"issue":"1","key":"705_CR54","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","volume":"15","author":"K White","year":"1985","unstructured":"White, K., Farber, M., Pulleyblank, W.: Steiner trees, connected domination and strongly chordal graphs. Networks 15(1), 109\u2013124 (1985)","journal-title":"Networks"},{"issue":"1\u20133","key":"705_CR55","first-page":"245","volume":"87","author":"H-G Yeh","year":"1998","unstructured":"Yeh, H.-G., Chang, G.J.: Weighted connected domination and Steiner trees in distance-hereditary graphs. Discrete Appl. Math. 87(1\u20133), 245\u2013253 (1998)","journal-title":"Discrete Appl. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00705-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00705-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00705-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T00:46:20Z","timestamp":1618965980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00705-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,21]]},"references-count":55,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["705"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00705-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,21]]},"assertion":[{"value":"16 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}