{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:35Z","timestamp":1725560195062},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145995"},{"type":"electronic","value":"9783642146008"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14600-8_20","type":"book-chapter","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T10:51:07Z","timestamp":1280141467000},"page":"212-219","source":"Crossref","is-referenced-by-count":1,"title":["Hi-tree Layout Using Quadratic Programming"],"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"}]},{"given":"Peter","family":"Sbarski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"20_CR1","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(5), 821\u2013828 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1109\/TVCG.2006.67","volume":"12","author":"T. Dwyer","year":"2006","unstructured":"Dwyer, T., Koren, Y., Marriott, K.: Drawing directed graphs using quadratic programming. IEEE Transactions on Visualization and Computer Graphics\u00a012(4), 536\u2013548 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1009771921595","volume":"3","author":"W. He","year":"1998","unstructured":"He, W., Marriott, K.: Constrained graph layout. Constraints\u00a03, 289\u2013314 (1998)","journal-title":"Constraints"},{"key":"20_CR4","unstructured":"Bohanec, M.: DEXiTree: A program for pretty drawing of trees. In: Proc. Information Society IS 2007, pp. 8\u201311 (2007)"},{"key":"20_CR5","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":"20_CR6","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":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591962","volume":"26","author":"D. Goldfarb","year":"1983","unstructured":"Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Mathematical Programming\u00a026, 1\u201333 (1983)","journal-title":"Mathematical Programming"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Marriott, K., Sbarski, P., Gelder, T., Prager, D., Bulka, A.: Hi-Trees and Their Layout. IEEE Transactions on Visualization and Computer Graphics (to appear)","DOI":"10.1109\/TVCG.2010.45"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Sbarski, P., Gelder, T., Marriott, K., Prager, D., Bulka, A.: Visualizing Argument Structure. In: Proceedings of the 4th International Symposium on Advances in Visual Computing, pp. 129\u2013138 (2008)","DOI":"10.1007\/978-3-540-89639-5_13"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Walker I, J.Q.: A node-positioning algorithm for general trees. Softw. Pract. Exper.\u00a020(7), 685\u2013705 (1990)","DOI":"10.1002\/spe.4380200705"},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E.M. Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawings of trees. IEEE Transactions on Software Engineering\u00a07(2), 223\u2013228 (1981)","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Diagrammatic Representation and Inference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14600-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T13:03:15Z","timestamp":1559307795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14600-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145995","9783642146008"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14600-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}