{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:40:38Z","timestamp":1689504038135},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T00:00:00Z","timestamp":1409702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s00454-014-9623-4","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T15:07:39Z","timestamp":1409670459000},"page":"450-475","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting and Sampling Minimum Cuts in Genus $$g$$ g Graphs"],"prefix":"10.1007","volume":"52","author":[{"given":"Erin W.","family":"Chambers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Nayyeri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,3]]},"reference":[{"key":"9623_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/net.3230130210","volume":"13","author":"MO Ball","year":"1983","unstructured":"Ball, M.O., Provan, S.J.: Calculating bounds on reachability and connectedness in stochastic networks. Networks 13, 253\u2013278 (1983)","journal-title":"Networks"},{"key":"9623_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2011.05.017","volume":"417","author":"I Bez\u00e1kov\u00e1","year":"2012","unstructured":"Bez\u00e1kov\u00e1, I., Friedlander, A.J.: Counting and sampling minimum $$(s, t)$$ ( s , t ) -cuts in weighted planar graphs in polynomial time. Theoret. Comput. Sci. 417, 2\u201311 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"9623_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1502793.1502798","volume":"56","author":"G Borradaile","year":"2000","unstructured":"Borradaile, G., Klein, P.: An $$O(n\\log n)$$ O ( n log n ) algorithm for maximum $$st$$ s t -flow in a directed planar graph. J. ACM 56(2), 1\u201330 (2000)","journal-title":"J. ACM"},{"key":"9623_CR4","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Klein, P.: An $$O(n \\log n)$$ O ( n log n ) -time algorithm for maximum $$st$$ s t -flow in a directed planar graph. In: Proceedings of 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 524\u2013533 (2006)","DOI":"10.1145\/1109557.1109615"},{"key":"9623_CR5","unstructured":"Borradaile, G., Kenyon-Mathieu, C., Klein, P.N.: A polynomial-time approximation scheme for Steiner tree in planar graphs. In: Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1285\u20131294 (2007)"},{"key":"9623_CR6","doi-asserted-by":"crossref","unstructured":"Borradaile, G., Kenyon-Mathieu, C., Klein, P.N.: Steiner tree in planar graphs: an $$O(n \\log n)$$ O ( n log n ) approximation scheme with singly-exponential dependence on epsilon. In: Proceedings of the 10th Workshop on Algorithms and Data Structures, pp. 275\u2013286 (2007)","DOI":"10.1007\/978-3-540-73951-7_25"},{"key":"9623_CR7","unstructured":"Borradaile, G., Demaine, E.D., Tazari, S.: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. In: Proceedings of the 26th International Symposium on Theoretical Aspects Computer Science. Leibniz International Proceedings in Informatics, vol. 3, pp. 171\u2013182. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2009). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2009\/1835"},{"key":"9623_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/0-387-28831-7_5","volume-title":"Handbook of Mathematical Models in Computer Vision","author":"Y Boykov","year":"2006","unstructured":"Boykov, Y., Veksler, O.: Graph cuts in vision and graphics: theories and applications. In: Paragios, N., Chen, Y., Faugeras, O. (eds.) Handbook of Mathematical Models in Computer Vision, pp. 79\u201396. Springer, New York (2006)"},{"key":"9623_CR9","unstructured":"Cabello, S., Chambers, E.W.: Multiple source shortest paths in a genus $$g$$ g graph. In: Proceedings of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 89\u201397 (2007)"},{"key":"9623_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s00454-006-1292-5","volume":"37","author":"S Cabello","year":"2007","unstructured":"Cabello, S., Mohar, B.: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. Discrete Comput. Geom. 37, 213\u2013235 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9623_CR11","unstructured":"Chalermsook, P., Fakcharoenphol, J., Nanongkai, D.: A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. In: Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 828\u2013829 (2004)"},{"key":"9623_CR12","doi-asserted-by":"crossref","unstructured":"Chambers, E.W., Eppstein, D.: Flows in one-crossing-minor-free graphs. In: Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010). Lecture Notes in Computer Science, pp. 241\u2013252. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-17517-6_23"},{"key":"9623_CR13","doi-asserted-by":"crossref","unstructured":"Chambers, E.W., Colin de Verdi\u00e8re, \u00c9., Erickson, J., Lazarus, F., Whittlesey, K.: Splitting (complicated) surfaces is hard. Comput. Geom. Theory Appl. 41(1\u20132), 94\u2013110 (2008)","DOI":"10.1016\/j.comgeo.2007.10.010"},{"key":"9623_CR14","doi-asserted-by":"crossref","unstructured":"Chambers, E.W., Erickson, J., Nayyeri, A.: Minimum cuts and shortest homologous cycles. In: Proceedings of the 25th Annual Symposium on Computer Geometry, pp. 377\u2013385 (2009)","DOI":"10.1145\/1542362.1542426"},{"issue":"6","key":"9623_CR15","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1137\/090766863","volume":"41","author":"EW Chambers","year":"2012","unstructured":"Chambers, E.W., Erickson, J., Nayyeri, A.: Homology flows, cohomology cuts. SIAM J. Comput. 41(6), 1605\u20131634 (2012)","journal-title":"SIAM J. Comput."},{"key":"9623_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02061656","volume":"33","author":"CJ Colbourn","year":"1991","unstructured":"Colbourn, C.J.: Combinatorial aspects of network reliability. Ann. Oper. Res. 33, 1\u201315 (1991)","journal-title":"Ann. Oper. Res."},{"key":"9623_CR17","unstructured":"Colin de Verdi\u00e8re, \u00c9.: Topological algorithms for graphs on surfaces. Habilitation thesis (2012). http:\/\/www.di.ens.fr\/~colin\/textes\/12hdr.pdf"},{"key":"9623_CR18","unstructured":"Demaine, E.D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. In: Proceedings of the 18th Annual ACM-SIAM Symposium Discrete Algorithms, pp. 278\u2013287 (2007)"},{"key":"9623_CR19","volume-title":"Computational Topology. An Introduction","author":"H Edelsbrunner","year":"2010","unstructured":"Edelsbrunner, H., Harer, J.: Computational Topology. An Introduction. American Mathematical Society, Providence, RI (2010)"},{"issue":"3","key":"9623_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1\u201327 (1999)","journal-title":"J. Graph Algorithms Appl."},{"key":"9623_CR21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s004530010020","volume":"27","author":"D Eppstein","year":"2000","unstructured":"Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275\u2013291 (2000)","journal-title":"Algorithmica"},{"key":"9623_CR22","unstructured":"Eppstein, D.: Dynamic generators of topologically embedded graphs. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 599\u2013608 (2003)"},{"key":"9623_CR23","doi-asserted-by":"crossref","unstructured":"Erickson, J., Nayyeri, A.: Computing replacement paths in surface graphs. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1347\u20131354 (2011)","DOI":"10.1137\/1.9781611973082.103"},{"key":"9623_CR24","doi-asserted-by":"crossref","unstructured":"Erickson, J., Nayyeri, A.: Minimum cuts and shortest non-separating cycles via homology covers. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1166\u20131176 (2011)","DOI":"10.1137\/1.9781611973082.88"},{"key":"9623_CR25","doi-asserted-by":"crossref","unstructured":"Erickson, J., Fox, K., Nayyeri, A.: Global minimum cuts in surface embedded graphs. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1309\u20131318 (2012)","DOI":"10.1137\/1.9781611973099.103"},{"key":"9623_CR26","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, pp. 399\u2013404 (1956). First published as Research Memorandum RM-1400. The RAND Corporation, Santa Monica, CA, November 19, 1954"},{"key":"9623_CR27","doi-asserted-by":"crossref","unstructured":"Fox, K.: Shortest non-trivial cycles in directed and undirected surface graphs. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 352\u2013364 (2013)","DOI":"10.1137\/1.9781611973105.26"},{"issue":"6","key":"9623_CR28","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs with applications. SIAM J. Comput. 16(6), 1004\u20131004 (1987)","journal-title":"SIAM J. Comput."},{"key":"9623_CR29","doi-asserted-by":"crossref","unstructured":"Grohe, M.: Isomorphism testing for embeddable graphs through definability. In: Proceedings of the 32nd ACM Symposium on Theory of Computation, pp. 63\u201372 (2000)","DOI":"10.1145\/335305.335313"},{"issue":"3","key":"9623_CR30","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/jcss.1998.1592","volume":"57","author":"T Hagerup","year":"1998","unstructured":"Hagerup, T., Katajainen, J., Nishimura, N., Ragde, P.: Characterizing multiterminal flow networks and computing flows in networks of small treewidth. J. Comput. Syst. Sci. 57(3), 366\u2013375 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9623_CR31","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1137\/0214045","volume":"14","author":"R Hassin","year":"1985","unstructured":"Hassin, R., Johnson, D.B.: An $$O(n\\log ^2 n)$$ O ( n log 2 n ) algorithm for maximum flow in undirected planar networks. SIAM J. Comput. 14(3), 612\u2013624 (1985)","journal-title":"SIAM J. Comput."},{"key":"9623_CR32","unstructured":"Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)"},{"issue":"1","key":"9623_CR33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"MR Henzinger","year":"1997","unstructured":"Henzinger, M.R., Klein, P., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. Syst. Sci. 55(1), 3\u201323 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"9623_CR34","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear time algorithm for isomorphism of planar graphs (preliminary report). In: Proceedings of the 6th Annual ACM Symposium on Theory of Computation, pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"key":"9623_CR35","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0208012","volume":"8","author":"A Itai","year":"1979","unstructured":"Itai, A., Shiloach, Y.: Maximum flow in planar networks. SIAM J. Comput. 8, 135\u2013150 (1979)","journal-title":"SIAM J. Comput."},{"key":"9623_CR36","doi-asserted-by":"crossref","unstructured":"Italiano, G.F., Nussbaum, Y., Sankowski, P., Wulff-Nilsen, C.: Improved algorithms for min cut and max flow in undirected planar graphs. In: Proceedings of the 43rd Annuals of ACM Symposium on Theory of Computation, pp. 313\u2013322 (2011)","DOI":"10.1145\/1993636.1993679"},{"key":"9623_CR37","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Random generation of combinatiorial structures from a uniform distribution. In: Brauer, W. (ed.) Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 194, pp. 290\u2013299. Springer, Berlin (1985)","DOI":"10.1007\/BFb0015754"},{"key":"9623_CR38","doi-asserted-by":"crossref","unstructured":"Karger, D.R.: A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. In: Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, STOC\u201995, pp. 11\u201317. ACM, New York (1995)","DOI":"10.1145\/225058.225069"},{"key":"9623_CR39","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Mohar, B., Reed, B.: A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width. In: Proceedings of the 49th IEEE Symposium on Foundation of Computer Science, pp. 771\u2013780 (2008)","DOI":"10.1109\/FOCS.2008.53"},{"key":"9623_CR40","unstructured":"Klein, P.: Multiple-source shortest paths in planar graphs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 146\u2013155 (2005)"},{"key":"9623_CR41","unstructured":"Klein, P., Mozes, S., Weimann, O.: Shortest paths in directed planar graphs with negative lengths: a linear-space $$O(n\\log ^2 n)$$ O ( n log 2 n ) -time algorithm. ACM Trans. Algorithms 6(2), 1\u201318 (2010)"},{"key":"9623_CR42","doi-asserted-by":"crossref","unstructured":"Kutz, M.: Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. In: Proceedings of 22nd Annual Symposium on Computer Geometry, pp. 430\u2013438 (2006)","DOI":"10.1145\/1137856.1137919"},{"key":"9623_CR43","doi-asserted-by":"crossref","unstructured":"\u0141a\u0327cki, J., Sankowski, P.: Min-cuts and shortest cycles in planar graphs in $$O(n \\log \\log n)$$ O ( n log log n ) time. In: Proceedings of 19th Annual European Symposium on Algorithms. Lecture Notes Computer Science, no. 6942, pp. 155\u2013166. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-23719-5_14"},{"key":"9623_CR44","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"RJ Lipton","year":"1979","unstructured":"Lipton, R.J., Rose, D.J., Tarjan, R.E.: Generalized nested dissection. SIAM J. Numer. Anal. 16, 346\u2013358 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"9623_CR45","first-page":"315","volume":"40","author":"M Mare\u0161","year":"2004","unstructured":"Mare\u0161, M.: Two linear time algorithms for MST on minor closed graph classes. Arch. Math. 40(3), 315\u2013320 (2004)","journal-title":"Arch. Math."},{"key":"9623_CR46","doi-asserted-by":"crossref","unstructured":"Miller, G.L.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the 12th Annual ACM Symposiums on Theory Computation, pp. 225\u2013235 (1980)","DOI":"10.1145\/800141.804670"},{"key":"9623_CR47","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press, Baltimore, MD (2001)"},{"key":"9623_CR48","doi-asserted-by":"crossref","unstructured":"Mozes, S., Wulff-Nilsen, C.: Shortest paths in planar graphs with real lengths in $$O(n\\log ^2n\/\\log \\log n)$$ O ( n log 2 n \/ log log n ) time. In: Proceedings of the 18th Annuals of European Symposiums on Algorithms. Lecture Notes in Computer Science, no. 6347, pp. 206\u2013217. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15781-3_18"},{"key":"9623_CR49","volume-title":"Topology","author":"JR Munkres","year":"2000","unstructured":"Munkres, J.R.: Topology, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)","edition":"2"},{"key":"9623_CR50","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/24.106785","volume":"40","author":"H Nagamoch","year":"1991","unstructured":"Nagamoch, H., Sun, Z., Ibaraki, T.: Counting the number of minimum cuts in undirected multigraphs. IEEE Trans. Reliab. 40, 610\u2013614 (1991)","journal-title":"IEEE Trans. Reliab."},{"key":"9623_CR51","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Max flows in $$O(nm)$$ O ( n m ) time, or better. In: Proceedings of 45th Annual ACM Symposium on Theory of Computation, pp. 765\u2013774 (2013)","DOI":"10.1145\/2488608.2488705"},{"key":"9623_CR52","doi-asserted-by":"crossref","unstructured":"Patel, V.: Determining edge expansion and other connectivity measures of graphs of bounded genus. In: Proceedings of 18th Annual European Symposiums on Algorithms, ESA\u201910, pp. 561\u2013572. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15775-2_48"},{"key":"9623_CR53","unstructured":"Pe\u2019er, D.: On minimum spanning trees. Master\u2019s Thesis, Hebrew University (1998). http:\/\/www.math.ias.edu\/avi\/STUDENTS\/dpthesis.pdf"},{"key":"9623_CR54","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"SJ Provan","year":"1983","unstructured":"Provan, S.J., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12, 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"9623_CR55","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0212005","volume":"12","author":"J Reif","year":"1983","unstructured":"Reif, J.: Minimum $$s$$ s - $$t$$ t cut of a planar undirected network in $$O(n\\log ^2 n)$$ O ( n log 2 n ) time. SIAM J. Comput. 12, 71\u201381 (1983)","journal-title":"SIAM J. Comput."},{"key":"9623_CR56","unstructured":"Shamir, A.: A survey on mesh segmentation techniques. Comput. Graph. Forum 27(6), 1539\u20131556 (2008)"},{"key":"9623_CR57","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1016\/j.dam.2008.08.002","volume":"157","author":"S Tazari","year":"2009","unstructured":"Tazari, S., M\u00fcller-Hannemann, M.: Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. Discrete Appl. Math. 157, 673\u2013684 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9623_CR58","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1006\/jcss.1997.1538","volume":"55","author":"K Weihe","year":"1997","unstructured":"Weihe, K.: Maximum $$(s, t)$$ ( s , t ) -flows in planar networks in $$O(|V|\\log |V|)$$ O ( | V | log | V | ) -time. J. Comput. Syst. Sci. 55(3), 454\u2013476 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"9623_CR59","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1215\/S0012-7094-74-04141-6","volume":"41","author":"A White","year":"1974","unstructured":"White, A.: Orientable embeddings of Cayley graphs. Duke Math. J. 41, 353\u2013371 (1974)","journal-title":"Duke Math. J."},{"key":"9623_CR60","doi-asserted-by":"crossref","unstructured":"Wulff-Nilsen, C.: Solving the replacement paths problem for planar directed graphs in $$O(n \\log n)$$ O ( n log n ) time. In: Proceedings of 21st Annuals ACM-SIAM Symposiums on Discrete Algorithms, pp. 756\u2013765 (2010)","DOI":"10.1137\/1.9781611973075.62"},{"key":"9623_CR61","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546945","volume-title":"Topology for Computing","author":"A Zomorodian","year":"2005","unstructured":"Zomorodian, A.: Topology for Computing. Cambridge University Press, Cambridge (2005)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9623-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-014-9623-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9623-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T10:16:31Z","timestamp":1689502591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-014-9623-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,3]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9623"],"URL":"https:\/\/doi.org\/10.1007\/s00454-014-9623-4","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,3]]}}}