{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:23:57Z","timestamp":1725524637180},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_28","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"296-301","source":"Crossref","is-referenced-by-count":4,"title":["Removing Node Overlaps Using Multi-sphere Scheme"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Imamichi","sequence":"first","affiliation":[]},{"given":"Yohei","family":"Arahori","sequence":"additional","affiliation":[]},{"given":"Jaeseong","family":"Gim","sequence":"additional","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"28_CR1","first-page":"227","volume":"7","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Guibas, L.J., Har-Peled, S., Rabinovitch, A., Sharir, M.: Penetration depth of two convex polytopes in 3D. Nordic Journal of Computing\u00a07(3), 227\u2013240 (2000)","journal-title":"Nordic Journal of Computing"},{"key":"28_CR2","unstructured":"Agrawala, M.: Visualizing Route Maps. Ph.D. thesis, Stanford University (2002)"},{"key":"28_CR3","unstructured":"Ahmed, A., Dwyer, T., Hong, S.H., Murray, C., Song, L., Wu, Y.X.: Visualisation and analysis of large and complex scale-free networks. In: EUROVIS 2005: Eurographics \/ IEEE VGTC Symposium on Visualization, pp. 239\u2013246 (2005)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11618058_15","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 153\u2013164. Springer, Heidelberg (2006)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Graph Drawing","author":"E.R. Gansner","year":"1999","unstructured":"Gansner, E.R., North, S.C.: Improved force-directed layouts. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 364\u2013373. Springer, Heidelberg (1999)"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/scj.1104","volume":"33","author":"K. Hayashi","year":"2002","unstructured":"Hayashi, K., Inoue, M., Masuzawa, T., Fujiwara, H.: A layout adjustment problem for disjoint rectangles preserving orthogonal order. Systems and Computers in Japan\u00a033(2), 31\u201342 (2002)","journal-title":"Systems and Computers in Japan"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Imamichi, T., Arahori, Y., Gim, J., Hong, S.H., Nagamochi, H.: Removing overlaps in label layouts using multi-sphere scheme. Tech. Rep. 2008-006, Dept. of Applied Mathematics and Physics, Kyoto University (2008)","DOI":"10.1007\/978-3-642-00219-9_28"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-74446-7_19","volume-title":"Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics","author":"T. Imamichi","year":"2007","unstructured":"Imamichi, T., Nagamochi, H.: A multi-sphere scheme for 2D and 3D packing problems. In: St\u00fctzle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2007. LNCS, vol.\u00a04638, pp. 207\u2013211. Springer, Heidelberg (2007)"},{"key":"28_CR9","unstructured":"Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: APVis 2005. CRPIT, vol.\u00a045, pp. 131\u2013140 (2005)"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D.C. Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Mathematical Programming\u00a045(3), 503\u2013528 (1989)","journal-title":"Mathematical Programming"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00004","volume":"2","author":"K.A. Lyons","year":"1998","unstructured":"Lyons, K.A., Meijer, H., Rappaport, D.: Algorithms for cluster busting in anchored graph drawing. Journal of Graph Algorithms and Applications\u00a02(1), 1\u201324 (1998)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"2","key":"28_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1022371615202","volume":"8","author":"K. Marriott","year":"2003","unstructured":"Marriott, K., Stuckey, P., Tam, V., He, W.: Removing node overlapping in graph layout using constrained optimization. Constraints\u00a08(2), 143\u2013171 (2003)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T16:06:46Z","timestamp":1558109206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}