{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:06Z","timestamp":1725502026052},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_23","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"219-230","source":"Crossref","is-referenced-by-count":2,"title":["Constrained Stress Majorization Using Diagonally Scaled Gradient Projection"],"prefix":"10.1007","author":[{"given":"Tim","family":"Dwyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"DAC 1965. Proceedings of the SHARE design automation project","author":"C.J. Fisk","year":"1965","unstructured":"Fisk, C.J., Isett, D.D.: ACCEL: automated circuit card etching layout. In: DAC 1965. Proceedings of the SHARE design automation project, pp. 9.1\u20139.31. ACM Press, New York (1965)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters\u00a031, 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-70904-6_3","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2007","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Integrating edge routing into force-directed layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 8\u201319. Springer, Heidelberg (2007)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1109\/TVCG.2006.156","volume":"12","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: An incremental procedure for separation constraint layout of graphs. IEEE Transactions on Visualization and Computer Graphics\u00a012, 821\u2013828 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"23_CR5","volume-title":"Modern Multidimensional Scaling: theory and applications","author":"I. Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.: Modern Multidimensional Scaling: theory and applications, 2nd edn. Springer, Heidelberg (2005)","edition":"2"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-31843-9_25","volume-title":"Graph Drawing","author":"E. Gansner","year":"2005","unstructured":"Gansner, E., Koren, Y., North, S.: Graph drawing by stress majorization. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 239\u2013250. Springer, Heidelberg (2005)"},{"key":"23_CR7","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (1999)"},{"key":"23_CR8","unstructured":"Dwyer, T., Marriott, K.: Constrained stress majorization using diagonally scaled gradient projection. Technical Report 217, Clayton School of IT, Monash University (2007)"},{"key":"23_CR9","first-page":"17","volume":"5","author":"P.E. os","year":"1960","unstructured":"os, P.E., R\u00e9nyi, A.: On random graphs. Publ. Math. Inst. Hungar. Acad. Sci.\u00a05, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Reka, A.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"}],"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-77537-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:50Z","timestamp":1619522150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_23","relation":{},"subject":[]}}