乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:41:04Z","timestamp":1725838864441},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_36","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"433-446","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Recognizing Weighted Disk Contact Graphs"],"prefix":"10.1007","author":[{"given":"Boris","family":"Klemz","sequence":"first","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Prutkin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-662-45803-7_11","volume-title":"Graph Drawing","author":"MJ Alam","year":"2014","unstructured":"Alam, M.J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Pupyrev, S.: Balanced circle packings for planar graphs. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 125\u2013136. Springer, Heidelberg (2014)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Bowen, C., Durocher, S., L\u00f6ffler, M., Rounds, A., Schulz, A., T\u00f3th, C.D.: Realization of simply connected polygonal linkages and recognition of unit disk contact trees. In: Di Giacomo, E., Lubiw, A. (eds.) Graph Drawing (GD\u201915). LNCS, vol. 9411, pp. 447\u2013459. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-27261-0_37"},{"issue":"1\u20132","key":"36_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognitionis\u00a0\n \n \n \n $${\\sf NP}$$\n -hard. Comput. Geom. 9(1\u20132), 3\u201324 (1998)","journal-title":"Comput. Geom."},{"issue":"1\u20133","key":"36_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"issue":"3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0925-7721(02)00099-8","volume":"25","author":"CR Collins","year":"2003","unstructured":"Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom. 25(3), 233\u2013256 (2003)","journal-title":"Comput. Geom."},{"key":"36_CR6","unstructured":"Di Giacomo, E., Didimo, W., Hong, S.H., Kaufmann, M., Kobourov, S., Liotta, G., Misue, K., Symvonis, A., Yen, H.C.: Low ply graph drawing. In: IISA 2015. IEEE (to appear, 2015)"},{"key":"36_CR7","unstructured":"Dorling, D.: Area cartograms: Their use and creation. In: Concepts and techniques in modern geography. University of East Anglia: Environmental Publications (1996)"},{"key":"36_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of $${ NP}$$ -Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of \n \n \n \n $${ NP}$$\n -Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"12","key":"36_CR9","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"W Hale","year":"1980","unstructured":"Hale, W.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"issue":"2","key":"36_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1559\/15230406382146","volume":"38","author":"R Inoue","year":"2011","unstructured":"Inoue, R.: A new construction method for circle cartograms. Cartography Geogr. Inf. Sci. 38(2), 146\u2013152 (2011)","journal-title":"Cartography Geogr. Inf. Sci."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Klemz, B., N\u00f6llenburg, M., Prutkin, R.: Recognizing weighted disk contact graphs, September 2015. CoRR \n arXiv:1509.0072","DOI":"10.1007\/978-3-319-27261-0_36"},{"issue":"3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discrete Math. 5(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"36_CR13","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. In: Ber. S\u00e4chs. Akad. Wiss. Leipzig, Math.-Phys. Klasse, vol. 88, pp. 141\u2013164 (1936)"},{"issue":"2","key":"36_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0012-365X(93)90340-Y","volume":"117","author":"B Mohar","year":"1993","unstructured":"Mohar, B.: A polynomial time circle packing algorithm. Discrete Math. 117(1), 257\u2013263 (1993)","journal-title":"Discrete Math."},{"key":"36_CR16","unstructured":"Robert, J.M., Toussaint, G.: Computational geometry and facility location. In: Operations Research and Management Science, pp. 11\u201315 (1990)"},{"issue":"11","key":"36_CR17","first-page":"1376","volume":"50","author":"K Stephenson","year":"2003","unstructured":"Stephenson, K.: Circle packing: a mathematical tale. Not. AMS 50(11), 1376\u20131388 (2003)","journal-title":"Not. AMS"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipsoids). In: Maurer, H. (ed.) New Results and New Trends in Computer Science. LNCS, vol. 555, pp. 359\u2013370. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T00:13:02Z","timestamp":1569283982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}