{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T06:37:53Z","timestamp":1723012673331},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,3,16]],"date-time":"2012-03-16T00:00:00Z","timestamp":1331856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00454-012-9413-9","type":"journal-article","created":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T13:49:54Z","timestamp":1331819394000},"page":"731-755","source":"Crossref","is-referenced-by-count":2,"title":["Linkless and Flat Embeddings in 3-Space"],"prefix":"10.1007","volume":"47","author":[{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Kreutzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,16]]},"reference":[{"issue":"2","key":"9413_CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"9413_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 153\u2013180 (1994)","journal-title":"J. ACM"},{"key":"9413_CR3","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-decomposition of small treewidth. SIAM J. Comput. 25, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"9413_CR4","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa, T.: A linear time algorithm for embedding planar graphs using PQ-trees. J. Comput. Syst. Sci. 30, 54\u201376 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"9413_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0095-8956(90)90093-F","volume":"50","author":"Y. Colin de\u00a0Verdi\u00e8re","year":"1990","unstructured":"Colin de\u00a0Verdi\u00e8re, Y.: Sur un nouvel invariant des graphes et un crit\u00e8re de\u00a0planarit\u00e9. J. Comb. Theory, Ser. B 50, 11\u201321 (1990)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jctb.1998.1834","volume":"74","author":"Y. Colin de\u00a0Verdi\u00e8re","year":"1998","unstructured":"Colin de\u00a0Verdi\u00e8re, Y.: Multiplicities of eigenvalues and tree-width of graphs. J. Comb. Theory, Ser. B 74, 121\u2013146 (1998)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR7","series-title":"Contemp. Math. Amer. Math. Soc.","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1090\/conm\/147\/01168","volume-title":"Graph Structure Theory","author":"Y. Colin de\u00a0Verdi\u00e8re","year":"1993","unstructured":"Colin de\u00a0Verdi\u00e8re, Y.: On a new graph invariant and a criterion of planarity. In: Robertson, N., Seymour, P. (eds.) Graph Structure Theory. Contemp. Math. Amer. Math. Soc., vol. 147, pp. 137\u2013147 (1993)"},{"key":"9413_CR8","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190070410","volume":"7","author":"J.H. Conway","year":"1983","unstructured":"Conway, J.H., Gordon, C.McA.: Knots and links in spatial graphs. J. Graph Theory 7, 445\u2013453 (1983)","journal-title":"J. Graph Theory"},{"key":"9413_CR9","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S.A. Cook","year":"1976","unstructured":"Cook, S.A., Reckhow, R.A.: Time bounded random access machines. J. Comput. Syst. Sci. 7, 354\u2013375 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"9413_CR10","first-page":"193","volume-title":"Handbook of Theoretical Computer Science","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp.\u00a0193\u2013242. Elsevier, Amsterdam (1990)"},{"key":"9413_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R. Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory, 4th edn. Springer, Berlin (2010)","edition":"4"},{"key":"9413_CR12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1006\/jctb.1998.1862","volume":"75","author":"R. Diestel","year":"1999","unstructured":"Diestel, R., Gorbunov, K.Yu., Jensen, T.R., Thomassen, C.: Highly connected sets and the excluded grid theorem. J. Comb. Theory, Ser. B 75, 61\u201373 (1999)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR13","first-page":"640","volume-title":"Proc. 36th Symposium on Foundations of Computer Science (FOCS\u201995)","author":"M. Grigni","year":"1995","unstructured":"Grigni, M., Koutsoupias, E., Papadimitriou, C.: An approximation scheme for planar graphs TSP. In: Proc. 36th Symposium on Foundations of Computer Science (FOCS\u201995), pp. 640\u2013646 (1995)"},{"key":"9413_CR14","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.: Efficient planarity testing. J. ACM 21, 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"9413_CR15","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.jctb.2008.10.002","volume":"99","author":"H. Holst van\u00a0der","year":"2009","unstructured":"van\u00a0der Holst, H.: A polynomial-time algorithm to find a linkless embedding of a graph. J. Comb. Theory, Ser. B 99, 512\u2013530 (2009)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.disc.2004.07.007","volume":"287","author":"K. Kawarabayashi","year":"2004","unstructured":"Kawarabayashi, K.: Rooted minor problems in highly connected graphs. Discrete Math. 287, 121\u2013123 (2004)","journal-title":"Discrete Math."},{"key":"9413_CR17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1810959.1810975","volume-title":"Symposium on Computational Geometry (SoCG)","author":"K. Kawarabayashi","year":"2010","unstructured":"Kawarabayashi, K., Kreutzer, S., Mohar, B.: Linkless and flat embeddings in 3-space and the unknot problem. In: Symposium on Computational Geometry (SoCG), pp. 97\u2013106 (2010)"},{"key":"9413_CR18","first-page":"471","volume-title":"Proc. 40th ACM Symposium on Theory of Computing (STOC\u201908)","author":"K. Kawarabayashi","year":"2008","unstructured":"Kawarabayashi, K., Mohar, B.: Graph and Map Isomorphism and all polyhedral embeddings in linear time. In: Proc. 40th ACM Symposium on Theory of Computing (STOC\u201908), pp. 471\u2013480 (2008)"},{"key":"9413_CR19","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1109\/FOCS.2008.53","volume-title":"Proc. 49th Annual Symposium on Foundations of Computer Science (FOCS\u201908)","author":"K. Kawarabayashi","year":"2008","unstructured":"Kawarabayashi, K., Mohar, B., Reed, B.: A simpler linear time algorithm for embedding graphs on a surface and for bounded tree-width graphs. In: Proc. 49th Annual Symposium on Foundations of Computer Science (FOCS\u201908), pp. 771\u2013780 (2008)"},{"issue":"2","key":"9413_CR20","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.jctb.2011.07.004","volume":"102","author":"K. Kawarabayashi","year":"2012","unstructured":"Kawarabayashi, K., Kobayashi, Y., Reed, B.: The disjoint paths problem in quadratic time. J. Comb. Theory, Ser. B 102(2), 424\u2013435 (2012)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR21","unstructured":"Kawarabayashi, K., Norine, S., Thomas, R., Wollan, P.: K 6 minors in large 6-connected graphs, submitted. Available at http:\/\/www.math.princeton.edu\/~snorin\/papers\/k6large.pdf"},{"key":"9413_CR22","first-page":"382","volume-title":"Proc. 39th ACM Symposium on Theory of Computing (STOC\u201907)","author":"K. Kawarabayashi","year":"2007","unstructured":"Kawarabayashi, K., Reed, B.: Computing crossing number in linear time. In: Proc. 39th ACM Symposium on Theory of Computing (STOC\u201907), pp. 382\u2013390 (2007)"},{"key":"9413_CR23","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/1806689.1806784","volume-title":"Proc. 42nd ACM Symposium on Theory of Computing (STOC\u201910)","author":"K. Kawarabayashi","year":"2010","unstructured":"Kawarabayashi, K., Wollan, P.: A shorter proof of the graph minor algorithm \u2013 the uniquely linkage theorem. In: Proc. 42nd ACM Symposium on Theory of Computing (STOC\u201910), pp. 687\u2013694 (2010). Full version available at http:\/\/research.nii.ac.jp\/~k_keniti\/uniquelink.pdf"},{"key":"9413_CR24","first-page":"146","volume-title":"Proc. 46th Symposium on Foundations of Computer Science (FOCS\u201905)","author":"P.N. Klein","year":"2005","unstructured":"Klein, P.N.: A linear time approximation scheme for TSP for planar weighted graphs. In: Proc. 46th Symposium on Foundations of Computer Science (FOCS\u201905), pp. 146\u2013155 (2005)"},{"key":"9413_CR25","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C. Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur le\u00a0probl\u00e8me des courbes gauches en topologie. Fundam. Math. 15, 271\u2013283 (1930)","journal-title":"Fundam. Math."},{"key":"9413_CR26","first-page":"525","volume-title":"Handbook of Theoretical Computer Science. Vol. A. Algorithms and Complexity","author":"J. Leeuwen van","year":"1990","unstructured":"van Leeuwen, J.: Graph algorithms. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Vol. A. Algorithms and Complexity, pp. 525\u2013631. Elsevier\/MIT Press, Amsterdam (1990)"},{"key":"9413_CR27","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R.J. Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9, 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"9413_CR28","unstructured":"Lov\u00e1sz, L.: Steinitz representations (2000). http:\/\/www.cs.elte.hu\/~lovasz\/klee.ppt"},{"key":"9413_CR29","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.5802\/aif.1703","volume":"49","author":"L. Lov\u00e1sz","year":"1999","unstructured":"Lov\u00e1sz, L., Schrijver, A.: On the null space of a Colin de Verdi\u00e8re matrix. Ann. Inst. Fourier (Grenoble) 49, 1017\u20131026 (1999)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"9413_CR30","doi-asserted-by":"crossref","first-page":"1275","DOI":"10.1090\/S0002-9939-98-04244-0","volume":"126","author":"L. Lov\u00e1sz","year":"1998","unstructured":"Lov\u00e1sz, L., Schrijver, A.: A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs. Proc. Am. Math. Soc. 126, 1275\u20131285 (1998)","journal-title":"Proc. Am. Math. Soc."},{"key":"9413_CR31","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C.L. Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. Lond. Math. Soc. 17, 369\u2013374 (1978)","journal-title":"J. Lond. Math. Soc."},{"key":"9413_CR32","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BF01350657","volume":"178","author":"W. Mader","year":"1968","unstructured":"Mader, W.: Homomorphies\u00e4tze f\u00fcr Graphen. Math. Ann. 178, 154\u2013168 (1968)","journal-title":"Math. Ann."},{"key":"9413_CR33","first-page":"392","volume-title":"Proc. 28th ACM Symposium on Theory of Computing (STOC\u201996)","author":"B. Mohar","year":"1996","unstructured":"Mohar, B.: Embedding graphs in an arbitrary surface in linear time. In: Proc. 28th ACM Symposium on Theory of Computing (STOC\u201996), pp. 392\u2013397 (1996)"},{"key":"9413_CR34","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1137\/S089548019529248X","volume":"12","author":"B. Mohar","year":"1999","unstructured":"Mohar, B.: A linear time algorithm for embedding graphs in an arbitrary surface. SIAM J. Discrete Math. 12, 6\u201326 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"9413_CR35","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 (2001)"},{"key":"9413_CR36","first-page":"398","volume-title":"Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS\u201988)","author":"R. Motwani","year":"1988","unstructured":"Motwani, R., Raghunathan, A., Saran, H.: Constructive results from graph minors: Linkless embeddings. In: Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS\u201988), pp. 398\u2013409 (1988)"},{"key":"9413_CR37","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1017\/CBO9780511662119.006","volume-title":"Surveys in Combinatorics, 1997 (London)","author":"B. Reed","year":"1997","unstructured":"Reed, B.: Tree width and tangles: a new connectivity measure and some applications. In: Surveys in Combinatorics, 1997 (London). London Math. Soc. Lecture Note Ser., vol. 241, pp. 87\u2013162. Cambridge Univ. Press, Cambridge (1997)"},{"key":"9413_CR38","doi-asserted-by":"crossref","unstructured":"Reed, B., Wood:, D.: A linear time algorithm to find a separator in a graph with an excluded minor. ACM Trans. Algorithms 5(4) (2009)","DOI":"10.1145\/1597036.1597043"},{"key":"9413_CR39","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B 41, 92\u2013114 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR40","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0095-8956(90)90063-6","volume":"49","author":"N. Robertson","year":"1990","unstructured":"Robertson, N., Seymour, P.D.: Graph Minors. IX. Disjoint crossed paths. J. Comb. Theory, Ser. B 49, 40\u201377 (1990)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR41","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory, Ser. B 63, 65\u2013110 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR42","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s Conjecture. J. Comb. Theory, Ser. B 92, 325\u2013357 (2004)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR43","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01202354","volume":"13","author":"N. Robertson","year":"1993","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Hadwiger\u2019s conjecture for K6-free graphs. Combinatorica 13, 279\u2013361 (1993)","journal-title":"Combinatorica"},{"key":"9413_CR44","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N. Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62, 323\u2013348 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR45","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1006\/jctb.1995.1030","volume":"64","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Kuratowski chains. J. Comb. Theory, Ser. B 64, 127\u2013154 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR46","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/jctb.1995.1031","volume":"64","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Petersen family minors. J. Comb. Theory, Ser. B 64, 155\u2013184 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR47","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/jctb.1995.1032","volume":"64","author":"N. Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Sachs\u2019 linkless embedding conjecture. J. Comb. Theory, Ser. B 64, 185\u2013227 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9413_CR48","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1090\/conm\/147\/01167","volume":"147","author":"N. Robertson","year":"1993","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: A survey of linkless embeddings. Contemp. Math. 147, 125\u2013136 (1993)","journal-title":"Contemp. Math."},{"key":"9413_CR49","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"P. Seymour","year":"1980","unstructured":"Seymour, P.: Disjoint paths in graphs. Discrete Math. 29, 293\u2013309 (1980)","journal-title":"Discrete Math."},{"key":"9413_CR50","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF01844848","volume":"16","author":"P.D. Seymour","year":"1996","unstructured":"Seymour, P.D.: Packing circuits in eulerian digraphs. Combinatorica 16, 223\u2013231 (1996)","journal-title":"Combinatorica"},{"key":"9413_CR51","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C. Thomassen","year":"1980","unstructured":"Thomassen, C.: 2-linked graphs. Eur. J. Comb. 1, 371\u2013378 (1980)","journal-title":"Eur. J. Comb."},{"key":"9413_CR52","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1145\/1634.322451","volume":"31","author":"S.G. Williamson","year":"1984","unstructured":"Williamson, S.G.: Depth-first search and Kuratowski subgraphs. J. ACM 31, 681\u2013693 (1984)","journal-title":"J. ACM"},{"key":"9413_CR53","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/BF02566522","volume":"67","author":"Y.-Q. Wu","year":"1992","unstructured":"Wu, Y.-Q.: On planarity of graphs in 3-manifolds. Comment. Math. Helv. 67, 635\u2013647 (1992)","journal-title":"Comment. Math. Helv."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9413-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9413-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9413-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,21]],"date-time":"2023-06-21T04:51:36Z","timestamp":1687323096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9413-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,16]]},"references-count":53,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9413"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9413-9","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,16]]}}}