{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:04:24Z","timestamp":1725807864203},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-662-45803-7_31","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T11:12:53Z","timestamp":1417432373000},"page":"367-379","source":"Crossref","is-referenced-by-count":0,"title":["Drawing Graphs within Restricted Area"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"Aulbach","sequence":"first","affiliation":[]},{"given":"Martin","family":"Fink","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Schuhmann","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Java Universal Network\/Graph Framework (JUNG), \n                    \n                      http:\/\/www.jung.sourceforge.net"},{"key":"31_CR2","unstructured":"Aulbach, M., Fink, M., Schuhmann, J., Wolff, A.: Drawing graphs within restricted area. CoRR (2014), ArXiv e-print \n                    \n                      http:\/\/arxiv.org\/abs\/1409.0499"},{"issue":"1-2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0020-0190(00)00042-9","volume":"74","author":"F. Bertault","year":"2000","unstructured":"Bertault, F.: A force-directed algorithm that preserves edge crossing properties. Inf. Proc. Letters\u00a074(1-2), 7\u201313 (2000)","journal-title":"Inf. Proc. Letters"},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E.G. Coffman","year":"1972","unstructured":"Coffman, E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta Inform.\u00a01(3), 200\u2013213 (1972)","journal-title":"Acta Inform."},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.7155\/jgaa.00252","volume":"16","author":"G. Lozzo Da","year":"2012","unstructured":"Da Lozzo, G., Di Battista, G., Ingrassia, F.: Drawing graphs on a smartphone. J. Graph Algorithms Appl.\u00a016(1), 109\u2013126 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-642-36763-2_58","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2013","unstructured":"Duncan, C.A., Gutwenger, C., Nachmanson, L., Sander, G.: Graph drawing contest report. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 575\u2013579. Springer, Heidelberg (2013)"},{"issue":"6","key":"31_CR7","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/TVCG.2008.130","volume":"14","author":"T. Dwyer","year":"2008","unstructured":"Dwyer, T., Marriott, K., Schreiber, F., Stuckey, P., Woodward, M., Wybrow, M.: Exploration of networks using overview+detail with constraint-based cooperative layout. IEEE Trans. Vis. Comput. Graph.\u00a014(6), 1293\u20131300 (2008)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"issue":"5","key":"31_CR8","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 Trans. Vis. Comput. Graph.\u00a012(5), 821\u2013828 (2006)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-00219-9_22","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2009","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Topology preserving constrained graph layout. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 230\u2013241. Springer, Heidelberg (2009)"},{"issue":"11","key":"31_CR10","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper.\u00a021(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exper."},{"issue":"9","key":"31_CR11","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J.\u00a045(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"31_CR12","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(4), 289\u2013314 (1998)","journal-title":"Constraints"},{"issue":"1","key":"31_CR13","first-page":"68","volume":"30","author":"M. Hennecke","year":"2007","unstructured":"Hennecke, M.: Rechengraphen. Math. Didact.\u00a030(1), 68\u201396 (2007)","journal-title":"Math. Didact."},{"issue":"1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M. Patrignani","year":"2001","unstructured":"Patrignani, M.: On the complexity of orthogonal compaction. Comput. Geom. Theory Appl.\u00a019(1), 47\u201367 (2001)","journal-title":"Comput. Geom. Theory Appl."},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/BFb0021828","volume-title":"Graph Drawing","author":"G. Sander","year":"1996","unstructured":"Sander, G.: A fast heuristic for hierarchical Manhattan layout. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 447\u2013458. Springer, Heidelberg (1996)"},{"issue":"3","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1111\/j.1467-8659.2011.01956.x","volume":"30","author":"P. Simonetto","year":"2011","unstructured":"Simonetto, P., Archambault, D., Auber, D., Bourqui, R.: ImPrEd: An improved force-directed algorithm that prevents nodes from crossing edges. Comput. Graphics Forum\u00a030(3), 1071\u20131080 (2011)","journal-title":"Comput. Graphics Forum"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cyber.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst. Man Cyber."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45803-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:00:14Z","timestamp":1559077214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45803-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45803-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}