{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:19:22Z","timestamp":1775081962115,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540314257","type":"print"},{"value":"9783540316671","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_15","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"153-164","source":"Crossref","is-referenced-by-count":63,"title":["Fast Node Overlap Removal"],"prefix":"10.1007","author":[{"given":"Tim","family":"Dwyer","sequence":"first","affiliation":[]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G.D. Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/1556262.1556288","volume-title":"Proceedings of the Working Conference on Advanced Visual Interfaces (AVI 2002)","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Drawing graphs with non-uniform vertices. In: Proceedings of the Working Conference on Advanced Visual Interfaces (AVI 2002), pp. 157\u2013166. ACM Press, New York (2002)"},{"key":"15_CR3","unstructured":"Friedrich, C., Schreiber, F.: Flexible layering in hierarchical drawings with nodes of arbitrary size. In: Proceedings of the 27th conference on Australasian computer science (ACSC 2004), vol.\u00a026, pp. 369\u2013376. Australian Computer Society (2004)"},{"key":"15_CR4","unstructured":"Marriott, K., Moulder, P., Hope, L., Twardy, C.: Layout of bayesian networks. In: Twenty-Eighth Australasian Computer Science Conference (ACSC 2005). CRPIT, vol.\u00a038, pp. 97\u2013106. Australian Computer Society (2005)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., Sugiyama, K.: Layout adjustment and the mental map. Journal of Visual Languages and Computing\u00a06, 183\u2013210 (1995)","journal-title":"Journal of Visual Languages and Computing"},{"key":"15_CR6","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, 143\u2013171 (2003)","journal-title":"Constraints"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-37623-2_14","volume-title":"Graph Drawing","author":"K. Hayashi","year":"1999","unstructured":"Hayashi, K., Inoue, M., Masuzawa, T., Fujiwara, H.: A layout adjustment problem for disjoint rectangles preserving orthogonal order. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 183\u2013197. Springer, Heidelberg (1999)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(01)00194-6","volume":"81","author":"W. Lai","year":"2002","unstructured":"Lai, W., Eades, P.: Removing edge-node intersections in drawings of graphs. Inf. Process. Lett.\u00a081, 105\u2013110 (2002)","journal-title":"Inf. Process. Lett."},{"key":"15_CR9","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)"},{"key":"15_CR10","unstructured":"Lyons, K.A.: Cluster busting in anchored graph drawing. In: CASCON 11992: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research, pp. 327\u2013337. IBM Press (1992)"},{"key":"15_CR11","unstructured":"Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: Proceedings of the Asia-Pacific Symposium on Information Visualisation (APVIS 2005). CRPIT, vol.\u00a045, pp. 131\u2013140. Australian Computer Society (2005)"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry, pp. 359\u2013365. Springer, Heidelberg (1985)"},{"key":"15_CR13","unstructured":"Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. Technical Report 2005\/173, Monash University, School of Computer Science and Software Engineering (2005), Available from: \n                    \n                      www.csse.monash.edu.au\/~tdwyer"},{"key":"15_CR14","volume-title":"Data Structures and Algorithm Analysis in Java","author":"M.A. Weiss","year":"1999","unstructured":"Weiss, M.A.: Data Structures and Algorithm Analysis in Java. Addison-Wesley Longman, Amsterdam (1999)"},{"key":"15_CR15","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. John Wiley & Sons, Inc., Chichester (1987)"},{"key":"15_CR16","unstructured":"ApS, M.: (Mosek optimisation toolkit v3.2), \n                    \n                      http:\/\/www.mosek.com"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:12:10Z","timestamp":1619493130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11618058_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}