{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:40:17Z","timestamp":1772829617404,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,6,26]],"date-time":"2012-06-26T00:00:00Z","timestamp":1340668800000},"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":[[2014,1]]},"DOI":"10.1007\/s00453-012-9670-2","type":"journal-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T02:22:56Z","timestamp":1340763776000},"page":"109-132","source":"Crossref","is-referenced-by-count":29,"title":["Contracting Graphs to Paths and Trees"],"prefix":"10.1007","volume":"68","author":[{"given":"Pinar","family":"Heggernes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pim","family":"van\u00a0\u2019t Hof","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"L\u00e9v\u00eaque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,26]]},"reference":[{"issue":"4","key":"9670_CR1","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"9670_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S. Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"issue":"2","key":"9670_CR3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(83)90012-0","volume":"26","author":"T. Asano","year":"1983","unstructured":"Asano, T., Hirata, T.: Edge-contraction problems. J. Comput. Syst. Sci. 26(2), 197\u2013208 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"9670_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/978-3-642-17493-3_6","volume-title":"5th International Symposium on Parameterized and Exact Computation, IPEC 2010","author":"D. Binkele-Raible","year":"2010","unstructured":"Binkele-Raible, D., Fernau, H.: Enumerate and measure: improving parameter budget management. In: Raman, V., Saurabh, S. (eds.) 5th International Symposium on Parameterized and Exact Computation, IPEC 2010. Lecture Notes in Computer Science, vol. 6478, pp. 38\u201349. Springer, Berlin (2010)"},{"issue":"1","key":"9670_CR5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1142\/S0129054194000049","volume":"5","author":"H.L. Bodlaender","year":"1994","unstructured":"Bodlaender, H.L.: On disjoint cycles. Int. J. Found. Comput. Sci. 5(1), 59\u201368 (1994)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"8","key":"9670_CR6","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"9670_CR7","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1109\/FOCS.2009.46","volume-title":"50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 629\u2013638. IEEE Computer Society, Washington (2009)"},{"issue":"35","key":"9670_CR8","doi-asserted-by":"crossref","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"H.L. Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9670_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/jgt.3190110111","volume":"11","author":"A.E. Brouwer","year":"1987","unstructured":"Brouwer, A.E., Veldman, H.J.: Contractibility and NP-completeness. J. Graph Theory 11(1), 71\u201379 (1987)","journal-title":"J. Graph Theory"},{"issue":"4","key":"9670_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"9670_CR11","series-title":"Lecture Notes in Computer Science","first-page":"93","volume-title":"12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010","author":"Y. Cao","year":"2010","unstructured":"Cao, Y., Chen, J., Liu, Y.: On feedback vertex set new measure and new structures. In: Kaplan, H. (ed.) 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010. Lecture Notes in Computer Science, vol. 6139, pp. 93\u2013104. Springer, Berlin (2010)"},{"issue":"7","key":"9670_CR12","doi-asserted-by":"crossref","first-page":"1188","DOI":"10.1016\/j.jcss.2008.05.002","volume":"74","author":"J. Chen","year":"2008","unstructured":"Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188\u20131198 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"9670_CR13","doi-asserted-by":"crossref","first-page":"2526","DOI":"10.1137\/080716475","volume":"38","author":"J. Chen","year":"2009","unstructured":"Chen, J., Kneis, J., Lu, S., Molle, D., Richter, S., Rossmanith, P., Sze, S.H., Zhang, F.: Randomized divide-and-conquer: improved path, matching, and packing algorithms. SIAM J. Comput. 38(6), 2526\u20132547 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9670_CR14","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"9670_CR15","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Deterministic parameterized connected vertex cover. In: Fomin, F. (ed.) 13th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012. Lecture Notes in Computer Science. Springer (to appear). arXiv:1202.6642 , February 2012","DOI":"10.1007\/978-3-642-31155-0_9"},{"key":"9670_CR16","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/FOCS.2011.23","volume-title":"52nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2011","author":"M. Cygan","year":"2011","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. In: Ostrovsky, R. (ed.) 52nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2011, pp. 150\u2013159. IEEE, New York (2011)"},{"issue":"3","key":"9670_CR17","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s00224-007-1345-z","volume":"41","author":"F.K.H.A. Dehne","year":"2007","unstructured":"Dehne, F.K.H.A., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An O(2 O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. Theory Comput. Syst. 41(3), 479\u2013492 (2007)","journal-title":"Theory Comput. Syst."},{"key":"9670_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/11672142_29","volume-title":"23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006","author":"J. D\u00edaz","year":"2006","unstructured":"D\u00edaz, J., Thilikos, D.M.: Fast FPT-algorithms for cleaning grids. In: Durand, B., Thomas, W. (eds.) 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006. Lecture Notes in Computer Science, vol. 3884, pp. 361\u2013371. Springer, Berlin (2006)"},{"key":"9670_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"36th International Colloquium on Automata, Languages and Programming, ICALP 2009","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S.E., Thomas, W. (eds.) 36th International Colloquium on Automata, Languages and Programming, ICALP 2009. Lecture Notes in Computer Science, vol. 5555, pp. 378\u2013389. Springer, Berlin (2009)"},{"key":"9670_CR20","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, R.: Parameterized Complexity. Monographs in Computer Science. Springer, Berlin (1999)"},{"key":"9670_CR21","series-title":"Texts in Theoretical Computer Science","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Berlin (2006)"},{"issue":"1","key":"9670_CR22","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"9670_CR23","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. 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)"},{"key":"9670_CR24","series-title":"Lecture Notes in Computer Science","first-page":"67","volume-title":"6th International Symposium on Parameterized and Exact Computation, IPEC 2011","author":"P.A. Golovach","year":"2011","unstructured":"Golovach, P.A., Kaminski, M., Paulusma, D., Thilikos, D.M.: Increasing the minimum degree of a graph by contractions. In: Marx, D., Rossmanith, P. (eds.) 6th International Symposium on Parameterized and Exact Computation, IPEC 2011. Lecture Notes in Computer Science, vol. 7112, pp. 67\u201379. Springer, Berlin (2011)"},{"issue":"8","key":"9670_CR25","doi-asserted-by":"crossref","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., Gramm, J., H\u00fcffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386\u20131396 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"9670_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-642-22953-4_21","volume-title":"18th International Symposium on Fundamentals of Computation Theory, FCT 2011","author":"P. Heggernes","year":"2011","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., Jansen, B.M.P., Kratsch, S., Villanger, Y.: Parameterized complexity of vertex deletion into perfect graph classes. In: Owe, O., Steffen, M., Telle, J.A. (eds.) 18th International Symposium on Fundamentals of Computation Theory, FCT 2011. Lecture Notes in Computer Science, vol. 6914, pp. 240\u2013251. Springer, Berlin (2011)"},{"key":"9670_CR27","series-title":"Lecture Notes in Computer Science","first-page":"55","volume-title":"6th International Symposium on Parameterized and Exact Computation, IPEC 2011","author":"P. Heggernes","year":"2011","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., L\u00e9v\u00eaque, B., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees. In: Marx, D., Rossmanith, P. (eds.) 6th International Symposium on Parameterized and Exact Computation, IPEC 2011. Lecture Notes in Computer Science, vol. 7112, pp. 55\u201366. Springer, Berlin (2011)"},{"key":"9670_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.endm.2011.05.016","volume":"37","author":"P. Heggernes","year":"2011","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., L\u00e9v\u00eaque, B., Paul, C.: Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discrete Math. 37, 87\u201392 (2011)","journal-title":"Electron. Notes Discrete Math."},{"key":"9670_CR29","series-title":"LIPIcs","first-page":"217","volume-title":"IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011","author":"P. Heggernes","year":"2011","unstructured":"Heggernes, P., van\u00a0\u2019t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges. In: Chakraborty, S., Kumar, A. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011. LIPIcs, vol. 13, pp. 217\u2013228. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Saarbr\u00fccken (2011)"},{"key":"9670_CR30","first-page":"365","volume-title":"21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010","author":"K. Kawarabayashi","year":"2010","unstructured":"Kawarabayashi, K., Reed, B.A.: An (almost) linear time algorithm for odd cycles transversal. In: Charikar, M. (ed.) 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 365\u2013378 (2010)"},{"key":"9670_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/978-3-642-23786-7_43","volume-title":"17th International Conference on Principles and Practice of Constraint Programming, CP 2011","author":"B. Martin","year":"2011","unstructured":"Martin, B., Paulusma, D.: The computational complexity of disconnected cut and 2k 2-partition. In: Lee, J.H.M. (ed.) 17th International Conference on Principles and Practice of Constraint Programming, CP 2011. Lecture Notes in Computer Science, vol. 6876, pp. 561\u2013575. Springer, Berlin (2011)"},{"issue":"4","key":"9670_CR32","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D. Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747\u2013768 (2010)","journal-title":"Algorithmica"},{"issue":"3\u20134","key":"9670_CR33","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1007\/s00453-010-9484-z","volume":"62","author":"D. Marx","year":"2012","unstructured":"Marx, D., Schlotter, I.: Obtaining a planar graph by vertex deletion. Algorithmica 62(3\u20134), 807\u2013822 (2012)","journal-title":"Algorithmica"},{"key":"9670_CR34","first-page":"182","volume-title":"36th Annual Symposium on Foundations of Computer Science, FOCS 1995","author":"M. Naor","year":"1995","unstructured":"Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, FOCS 1995, pp. 182\u2013191. IEEE Computer Society, Washington (1995)"},{"issue":"1","key":"9670_CR35","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109\u2013128 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9670_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-642-16926-7_19","volume-title":"36th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2010","author":"G. Philip","year":"2010","unstructured":"Philip, G., Raman, V., Villanger, Y.: A quartic kernel for pathwidth-one vertex deletion. In: Thilikos, D.M. (ed.) 36th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2010. Lecture Notes in Computer Science, vol. 6410, pp. 196\u2013207 (2010)"},{"key":"9670_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/978-3-642-22993-0_47","volume-title":"36th International Symposium on Mathematical Foundations of Computer Science 2011, MFCS 2011","author":"M. Pilipczuk","year":"2011","unstructured":"Pilipczuk, M.: Problems parameterized by treewidth tractable in single exponential time: A logical approach. In: Murlak, F., Sankowski, P. (eds.) 36th International Symposium on Mathematical Foundations of Computer Science 2011, MFCS 2011. Lecture Notes in Computer Science, vol. 6907, pp. 520\u2013531. Springer, Berlin (2011)"},{"key":"9670_CR38","doi-asserted-by":"crossref","unstructured":"Thomass\u00e9, S.: A 4k 2 kernel for feedback vertex set. ACM Trans. Algorithms 6(2) (2010)","DOI":"10.1145\/1721837.1721848"},{"key":"9670_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-642-16926-7_22","volume-title":"36th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2010","author":"R. Bevern van","year":"2010","unstructured":"van Bevern, R., Komusiewicz, C., Moser, H., Niedermeier, R.: Measuring indifference: unit interval vertex deletion. In: Thilikos, D.M. (ed.) 36th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2010. Lecture Notes in Computer Science, vol. 6410, pp. 232\u2013243. Springer, Berlin (2010)"},{"key":"9670_CR40","doi-asserted-by":"crossref","unstructured":"van\u00a0\u2019t Hof, P., Villanger, Y.: Proper interval vertex deletion. Algorithmica (to appear). http:\/\/dx.doi.org\/10.1007\/s00453-012-9661-3","DOI":"10.1007\/s00453-012-9661-3"},{"issue":"2","key":"9670_CR41","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(81)90039-1","volume":"3","author":"T. Watanabe","year":"1981","unstructured":"Watanabe, T., Ae, T., Nakamura, A.: On the removal of forbidden graphs by edge-deletion or by edge-contraction. Discrete Appl. Math. 3(2), 151\u2013153 (1981)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9670_CR42","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(83)90101-4","volume":"6","author":"T. Watanabe","year":"1983","unstructured":"Watanabe, T., Ae, T., Nakamura, A.: On the NP-hardness of edge-deletion and -contraction problems. Discrete Appl. Math. 6(1), 63\u201378 (1983)","journal-title":"Discrete Appl. Math."},{"key":"9670_CR43","first-page":"253","volume-title":"10th Annual ACM Symposium on Theory of Computing, STOC 1978","author":"M. Yannakakis","year":"1978","unstructured":"Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 253\u2013264. ACM, New York (1978)"},{"issue":"4","key":"9670_CR44","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1145\/322154.322157","volume":"26","author":"M. Yannakakis","year":"1979","unstructured":"Yannakakis, M.: The effect of a connectivity requirement on the complexity of maximum subgraph problems. J. ACM 26(4), 618\u2013630 (1979)","journal-title":"J. ACM"},{"issue":"2","key":"9670_CR45","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","volume":"10","author":"M. Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Edge-deletion problems. SIAM J. Comput. 10(2), 297\u2013309 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9670-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9670-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9670-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T04:49:48Z","timestamp":1561870188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9670-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,26]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9670"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9670-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,26]]}}}