乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:14Z","timestamp":1725807854291},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_21","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"246-258","source":"Crossref","is-referenced-by-count":0,"title":["The Importance of Being Proper"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: On the complexity of some problems related to SEFE. CoRR abs\/1207.3934 (2013)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jda.2011.12.015","volume":"14","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph. J. of Discrete Algorithms\u00a014, 150\u2013172 (2012)","journal-title":"J. of Discrete Algorithms"},{"key":"21_CR3","unstructured":"Angelini, P., Da Lozzo, G.: Deepening the relationship between SEFE and C-planarity. CoRR abs\/1404.6175 (2014)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-04657-0_20","volume-title":"Algorithms and Computation","author":"P. Angelini","year":"2014","unstructured":"Angelini, P., Da Lozzo, G., Neuwirth, D.: On some $\\mathcal{NP}$ -complete SEFE problems. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol.\u00a08344, pp. 200\u2013212. Springer, Heidelberg (2014)"},{"key":"21_CR5","unstructured":"Blasi\u00fcs, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (2013)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-36763-2_4","volume-title":"Graph Drawing","author":"T. Bl\u00e4sius","year":"2013","unstructured":"Bl\u00e4sius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 31\u201342. Springer, Heidelberg (2013)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. In: Khanna, S. (ed.) SODA, pp. 1030\u20131043. SIAM (2013)","DOI":"10.1137\/1.9781611973105.74"},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-004-1144-8","volume":"44","author":"P. Eades","year":"2006","unstructured":"Eades, P., Feng, Q.W., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Algorithmica\u00a044(1), 1\u201332 (2006)","journal-title":"Algorithmica"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24618-3_18","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"M. Forster","year":"2004","unstructured":"Forster, M., Bachmaier, C.: Clustered level planarity. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol.\u00a02932, pp. 218\u2013228. Springer, Heidelberg (2004)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-37623-2_17","volume-title":"Graph Drawing","author":"M. J\u00fcnger","year":"1999","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 224\u2013237. Springer, Heidelberg (1999)"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J. Opatrny","year":"1979","unstructured":"Opatrny, J.: Total ordering problem. SIAM J. Comput.\u00a08(1), 111\u2013114 (1979)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"21_CR12","first-page":"367","volume":"17","author":"M. Schaefer","year":"2013","unstructured":"Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants. J. of Graph Alg. and Appl.\u00a017(4), 367\u2013440 (2013)","journal-title":"J. of Graph Alg. and Appl."},{"issue":"16-17","key":"21_CR13","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1016\/j.dam.2012.05.028","volume":"160","author":"A. Wotzlaw","year":"2012","unstructured":"Wotzlaw, A., Speckenmeyer, E., Porschen, S.: Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. Discrete Applied Mathematics\u00a0160(16-17), 2349\u20132363 (2012)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T00:04:32Z","timestamp":1566086672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_21"}},"subtitle":["(In Clustered-Level Planarity and T-Level Planarity)"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}