{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:55:46Z","timestamp":1768280146188,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,1,23]],"date-time":"2014-01-23T00:00:00Z","timestamp":1390435200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00453-014-9871-y","type":"journal-article","created":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T22:17:37Z","timestamp":1390429057000},"page":"758-777","source":"Crossref","is-referenced-by-count":11,"title":["k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth"],"prefix":"10.1007","volume":"72","author":[{"given":"A.","family":"Kosowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Suchan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,23]]},"reference":[{"key":"9871_CR1","series-title":"PODC \u201906","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/1146381.1146411","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Gavoille, C.: Object location using path separators. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201906, pp. 188\u2013197. ACM, New York (2006)"},{"key":"9871_CR2","series-title":"SPAA \u201905","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/1073970.1073978","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201905, pp. 49\u201355. ACM, New York (2005)"},{"key":"9871_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/11561927_32","volume-title":"Distributed Computing","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Compact routing for graphs excluding a fixed minor. In: Distributed Computing. Lecture Notes in Computer Science, vol. 3724, pp. 442\u2013456. Springer, Berlin (2005)"},{"key":"9871_CR4","first-page":"75","volume-title":"26th IEEE International Conference on Distributed Computing Systems, 2006. ICDCS 2006","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th IEEE International Conference on Distributed Computing Systems, 2006. ICDCS 2006, p. 75 (2006)"},{"key":"9871_CR5","series-title":"SPAA \u201906","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/1148109.1148143","volume-title":"Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: lower bounds. In: Proceedings of the Eighteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA \u201906, pp. 207\u2013216. ACM, New York (2006)"},{"issue":"3","key":"9871_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/1367064.1367077","volume":"4","author":"I. Abraham","year":"2008","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. ACM Trans. Algorithms 4(3), 37\u201313712 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"9871_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(84)90073-8","volume":"8","author":"M. Aigner","year":"1984","unstructured":"Aigner, M., Fromme, M.: A game of cops and robbers. Discrete Appl. Math. 8(1), 1\u201312 (1984)","journal-title":"Discrete Appl. Math."},{"key":"9871_CR8","unstructured":"Aksoy, A.G., Jin, S.: The apple doesn\u2019t fall far from the (metric) tree: the equivalence of definitions (2013). arXiv:1306.6092"},{"issue":"1","key":"9871_CR9","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0095-8956(86)90026-2","volume":"41","author":"T. Andreae","year":"1986","unstructured":"Andreae, T.: On a pursuit game played on graphs for which a minor is excluded. J. Comb. Theory, Ser. B 41(1), 37\u201347 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"9871_CR10","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discrete Methods 8(2), 277\u2013284 (1987). http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0608024","journal-title":"SIAM J. Algebr. Discrete Methods"},{"issue":"2","key":"9871_CR11","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/S0895480100380902","volume":"16","author":"H. Bandelt","year":"2003","unstructured":"Bandelt, H., Chepoi, V.: 1-hyperbolic graphs. SIAM J. Discrete Math. 16(2), 323\u2013334 (2003). http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895480100380902","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"9871_CR12","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"9871_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1\u20132), 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9871_CR14","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"issue":"2","key":"9871_CR15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","volume":"6","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L., M\u00f6hring, R.: The pathwidth and treewidth of cographs. SIAM J. Discrete Math. 6(2), 181\u2013188 (1993). http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0406014","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"9871_CR16","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0166-218X(97)00031-0","volume":"79","author":"H.L. Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Treewidth for graphs with small chordality. Discrete Appl. Math. 79(1\u20133), 45\u201361 (1997)","journal-title":"Discrete Appl. Math."},{"key":"9871_CR17","doi-asserted-by":"crossref","DOI":"10.1090\/stml\/061","volume-title":"The Game of Cops and Robber on Graphs","author":"A. Bonato","year":"2011","unstructured":"Bonato, A., Nowakovski, R.: The Game of Cops and Robber on Graphs. American Math. Soc., Providence (2011)"},{"key":"9871_CR18","first-page":"239","volume-title":"Proceedings 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006","author":"L. Cai","year":"2006","unstructured":"Cai, L., Chan, S.M., Chan, S.O.: Random separation: a new method for solving fixed-cardinality optimization problems. In: Proceedings 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006, pp. 239\u2013250. Springer, Berlin (2006)"},{"issue":"1","key":"9871_CR19","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/100784035","volume":"25","author":"J. Chalopin","year":"2011","unstructured":"Chalopin, J., Chepoi, V., Nisse, N., Vax\u00e8s, Y.: Cop and robber games when the robber can hide and ride. SIAM J. Discrete Math. 25(1), 333\u2013359 (2011). http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/100784035","journal-title":"SIAM J. Discrete Math."},{"key":"9871_CR20","first-page":"250","volume-title":"Twenty-Second Annual IEEE Conference on Computational Complexity, 2007, CCC \u201907","author":"Y. Chen","year":"2007","unstructured":"Chen, Y., Flum, J.: On parameterized path and chordless path problems. In: Twenty-Second Annual IEEE Conference on Computational Complexity, 2007, CCC \u201907, pp. 250\u2013263 (2007)"},{"key":"9871_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/978-3-642-04355-0_41","volume-title":"Distributed Computing","author":"W. Chen","year":"2009","unstructured":"Chen, W., Sommer, C., Teng, S.-H., Wang, Y.: Compact routing in power-law graphs. In: Distributed Computing. Lecture Notes in Computer Science, vol. 5805, pp. 379\u2013391. Springer, Berlin (2009)"},{"key":"9871_CR22","series-title":"SCG \u201908","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/1377676.1377687","volume-title":"Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry","author":"V. Chepoi","year":"2008","unstructured":"Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vax\u00e8s, Y.: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. In: Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, SCG \u201908, pp. 59\u201368. ACM, New York (2008)"},{"issue":"3\u20134","key":"9871_CR23","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1007\/s00453-010-9478-x","volume":"62","author":"V. Chepoi","year":"2012","unstructured":"Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vax\u00e8s, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica 62(3\u20134), 713\u2013732 (2012)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"9871_CR24","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.disc.2004.11.016","volume":"299","author":"N.E. Clarke","year":"2005","unstructured":"Clarke, N.E., Nowakowski, R.J.: Tandem-win graphs. Discrete Math. 299(1\u20133), 56\u201364 (2005)","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"9871_CR25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(93)90064-Z","volume":"109","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theor. Comput. Sci. 109(1\u20132), 49\u201382 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"9871_CR26","first-page":"25","volume-title":"10th IEEE International Symposium on Network Computing and Applications (NCA)","author":"F. Montgolfier de","year":"2011","unstructured":"de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the Internet. In: 10th IEEE International Symposium on Network Computing and Applications (NCA), pp. 25\u201332 (2011)"},{"issue":"2","key":"9871_CR27","doi-asserted-by":"crossref","first-page":"277","DOI":"10.7155\/jgaa.00109","volume":"9","author":"Y. Dourisboure","year":"2005","unstructured":"Dourisboure, Y.: Compact routing schemes for generalised chordal graphs. J. Graph Algorithms Appl. 9(2), 277\u2013297 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"16","key":"9871_CR28","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1016\/j.disc.2005.12.060","volume":"307","author":"Y. Dourisboure","year":"2007","unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decompositions with bags of small diameter. Discrete Math. 307(16), 2008\u20132029 (2007)","journal-title":"Discrete Math."},{"key":"9871_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 2076, pp. 757\u2013772. Springer, Berlin (2001)"},{"issue":"3","key":"9871_CR30","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0166-218X(87)90033-3","volume":"17","author":"P. Frankl","year":"1987","unstructured":"Frankl, P.: Cops and robbers in graphs with large Girth and Cayley graphs. Discrete Appl. Math. 17(3), 301\u2013305 (1987)","journal-title":"Discrete Appl. Math."},{"key":"9871_CR31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4613-9586-7_3","volume":"8","author":"M. Gromov","year":"1987","unstructured":"Gromov, M.: Hyperbolic groups. Essays Group Theory 8, 75\u2013263 (1987)","journal-title":"Essays Group Theory"},{"issue":"6","key":"9871_CR32","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"issue":"2","key":"9871_CR33","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/jagm.1995.1037","volume":"19","author":"T. Kloks","year":"1995","unstructured":"Kloks, T., Kratsch, D.: Treewidth of chordal bipartite graphs. J. Algorithms 19(2), 266\u2013281 (1995)","journal-title":"J. Algorithms"},{"key":"9871_CR34","series-title":"SODA \u201909","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1137\/1.9781611973068.124","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Y. Kobayashi","year":"2009","unstructured":"Kobayashi, Y., Kawarabayashi, K.-i.: Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201909, pp. 1146\u20131155 (2009)"},{"key":"9871_CR35","series-title":"PODC \u201906","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1145\/1146381.1146412","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing","author":"G. Konjevod","year":"2006","unstructured":"Konjevod, G., Richa, A.W., Xia, D.: Optimal-stretch name-independent compact routing in doubling metrics. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201906, pp. 198\u2013207. ACM, New York (2006)"},{"key":"9871_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/978-3-642-31585-5_54","volume-title":"Automata, Languages, and Programming","author":"A. Kosowski","year":"2012","unstructured":"Kosowski, A., Li, B., Nisse, N., Suchan, K.: k-chordal graphs: from cops and robber to compact routing via treewidth. In: Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 7392, pp. 610\u2013622. Springer, Berlin (2012)"},{"issue":"2","key":"9871_CR37","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1639562.1639568","volume":"37","author":"D. Krioukov","year":"2009","unstructured":"Krioukov, D., Papadopoulos, F., Bogu\u00f1\u00e1, M., Vahdat, A.: Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces. ACM SIGMETRICS Perform. Eval. Rev. 37(2), 15\u201317 (2009)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"issue":"7","key":"9871_CR38","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.dam.2009.10.007","volume":"158","author":"D. Lokshtanov","year":"2010","unstructured":"Lokshtanov, D.: On the complexity of computing treelength. Discrete Appl. Math. 158(7), 820\u2013827 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9871_CR39","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1002\/jgt.20642","volume":"71","author":"L. Lu","year":"2012","unstructured":"Lu, L., Peng, X.: On Meyniel\u2019s conjecture of the cop number. J. Graph Theory 71(2), 192\u2013205 (2012)","journal-title":"J. Graph Theory"},{"key":"9871_CR40","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tcs.2012.01.006","volume":"444","author":"N. Nisse","year":"2012","unstructured":"Nisse, N., Rapaport, I., Suchan, K.: Distributed computing of efficient routing schemes in generalized chordal graphs. Theor. Comput. Sci. 444, 17\u201327 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"9871_CR41","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R. Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Math. 43(2\u20133), 235\u2013239 (1983)","journal-title":"Discrete Math."},{"issue":"2","key":"9871_CR42","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T. Opsahl","year":"2009","unstructured":"Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Soc. Netw. 31(2), 155\u2013163 (2009)","journal-title":"Soc. Netw."},{"issue":"1","key":"9871_CR43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0095-8956(85)90093-0","volume":"38","author":"A. Quilliot","year":"1985","unstructured":"Quilliot, A.: A short note about pursuit games played on a graph with a given genus. J. Comb. Theory, Ser. B 38(1), 89\u201392 (1985)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"9871_CR44","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N. Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory, Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9871_CR45","series-title":"Trends in Mathematics","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/978-1-4612-1370-3_14","volume-title":"Categorical Perspectives","author":"B.S.W. Schr\u00f6der","year":"2001","unstructured":"Schr\u00f6der, B.S.W.: The copnumber of a graph is bounded by $\\lfloor\\frac{3}{2} \\mathit{genus}({G})\\rfloor+ 3$ . In: Categorical Perspectives. Trends in Mathematics, pp. 243\u2013263. Birkh\u00e4user, Boston (2001)"},{"issue":"3","key":"9871_CR46","doi-asserted-by":"crossref","first-page":"1438","DOI":"10.1137\/100812963","volume":"25","author":"A. Scott","year":"2011","unstructured":"Scott, A., Sudakov, B.: A bound for the cops and robbers problem. SIAM J. Discrete Math. 25(3), 1438\u20131442 (2011). http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/100812963","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"9871_CR47","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0895480191193789","volume":"7","author":"R. Sundaram","year":"1994","unstructured":"Sundaram, R., Singh, K., Rangan, C.: Treewidth of circular-arc graphs. SIAM J. Discrete Math. 7(4), 647\u2013655 (1994). http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895480191193789","journal-title":"SIAM J. Discrete Math."},{"key":"9871_CR48","unstructured":"Uehara, R.: Tractable and intractable problems on generalized chordal graphs. Technical Report COMP98-83, IEICE (1999)"},{"issue":"6684","key":"9871_CR49","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.: Collective dynamics of \u2019small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"9871_CR50","doi-asserted-by":"crossref","unstructured":"Wu, Y., Zhang, C.: Hyperbolicity and chordality of a graph. Electron. J. Comb. 18(1) (2011)","DOI":"10.37236\/530"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9871-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9871-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9871-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T08:49:23Z","timestamp":1648111763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9871-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,23]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9871"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9871-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,23]]}}}