{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:33Z","timestamp":1725890073029},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_88","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T11:35:47Z","timestamp":1153222547000},"page":"438-445","source":"Crossref","is-referenced-by-count":5,"title":["Graph-drawing contest report"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Marks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"North","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"44_CR1","volume-title":"Cluster Analysis for Applications","author":"M. Anderberg","year":"1973","unstructured":"M. Anderberg. Cluster Analysis for Applications. Academic Press, New York, 1973."},{"key":"44_CR2","first-page":"143","volume-title":"Lecture Notes in Computer Science: 894 (Proceedings of the DIMACS International Workshop on Graph Drawing '94)","author":"P. Eades","year":"1994","unstructured":"P. Eades and J. Marks. Graph-drawing contest report. In R. Tamassia and I. G. Tollis, editors, Lecture Notes in Computer Science: 894 (Proceedings of the DIMACS International Workshop on Graph Drawing '94), pages 143\u2013146, Berlin Heidelberg, October 1994. Springer-Verlag."},{"key":"44_CR3","first-page":"224","volume-title":"Lecture Notes in Computer Science. 1027 (Proceedings of the Symposium on Graph Drawing GD '95)","author":"P. Eades","year":"1995","unstructured":"P. Eades and J. Marks. Graph-drawing contest report. In F. J. Brandenburg, editor, Lecture Notes in Computer Science. 1027 (Proceedings of the Symposium on Graph Drawing GD '95), pages 224\u2013233, Berlin Heidelberg, September 1995. Springer-Verlag."},{"key":"44_CR4","first-page":"129","volume-title":"Lecture Notes in Computer Science: 1190 (Proceedings of the Symposium on Graph Drawing GD '96)","author":"P. Eades","year":"1996","unstructured":"P. Eades, J. Marks, and S. North. Graph-drawing contest report.In S. North, editor, Lecture Notes in Computer Science: 1190 (Proceedings of the Symposium on Graph Drawing GD '96), pages 129\u2013138, Berlin Heidelberg, September 1996. Springer-Verlag."},{"key":"44_CR5","first-page":"254","volume-title":"Lecture Notes in Computer Science. 1027 (Proceedings of the Symposium on Graph Drawing GD '95)","author":"U. F\u00f6\u00dfmeler","year":"1995","unstructured":"U. F\u00f6\u00dfmeler and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Lecture Notes in Computer Science. 1027 (Proceedings of the Symposium on Graph Drawing GD '95), pages 254\u2013266, Berlin Heidelberg, September 1995. Springer-Verlag."},{"key":"44_CR6","first-page":"388","volume-title":"Lecture Notes in Computer Science: 894 (Proceedings of the DIMACS International Workshop on Graph Drawing '94)","author":"A. Frick","year":"1994","unstructured":"A. Frick, H. Mehldau, and A. Ludwig. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I. G. Tollis, editors, Lecture Notes in Computer Science: 894 (Proceedings of the DIMACS International Workshop on Graph Drawing '94), pages 388\u2013403, Berlin Heidelberg, October 1994. Springer-Verlag."},{"key":"44_CR7","unstructured":"M. J\u00fcnger and P. Mutzel. Solving the maximum weight planar subgraph problem by branch and cut. In G. Rinaldi and L. Wolsey, editors, Proceedings of the Third Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 479\u2013492, 1993."},{"issue":"3","key":"44_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421\u2013444, 1987.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T15:57:34Z","timestamp":1549209454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}