{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:48Z","timestamp":1725512028448},"publisher-location":"Berlin, Heidelberg","reference-count":2,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-70904-6_45","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T15:44:43Z","timestamp":1179416683000},"page":"448-452","source":"Crossref","is-referenced-by-count":2,"title":["Graph-Drawing Contest Report"],"prefix":"10.1007","author":[{"given":"Christian A.","family":"Duncan","sequence":"first","affiliation":[]},{"given":"Gunnar","family":"Klau","sequence":"additional","affiliation":[]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Sander","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70904-6_37","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"2007","unstructured":"Gansner, E.R., Koren, Y.: Improved circular layouts. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, Springer, Heidelberg (2007)"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11618058_19","volume-title":"Graph Drawing","author":"M. Geyer","year":"2006","unstructured":"Geyer, M., Kaufmann, M., Vrto, I.: Two trees which are self-intersecting when drawn simultaneously. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 201\u2013210. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:24:58Z","timestamp":1558272298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709039","9783540709046"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}