{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:43Z","timestamp":1725495883228},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540654735"},{"type":"electronic","value":"9783540376231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-37623-2_34","type":"book-chapter","created":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T12:45:17Z","timestamp":1195476317000},"page":"423-435","source":"Crossref","is-referenced-by-count":3,"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":"Petra","family":"Mutzel","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":[[1999,1,15]]},"reference":[{"key":"34_CR1","first-page":"1033","volume":"18","author":"A. T. Balaban","year":"1973","unstructured":"A. T. Balaban. Trivalent graphs of girth nine and eleven and relationships between cages. Rev. Roum. Math. Pures Appl., 18:1033\u20131043, 1973.","journal-title":"Rev. Roum. Math. Pures Appl."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"A. T. Balaban. Solved and unsolved problems in chemical graph theory. In J. Gimbel, J. Kennedy, and L. Quintas, editors, Quo Vadis, Graph Theory (Annals of Discrete Mathematics, Vol. 55), pages 109\u2013126. 1993.","DOI":"10.1016\/S0167-5060(08)70380-7"},{"key":"34_CR3","unstructured":"T. Biedl, J. Marks, K. Ryall, and S. Whitesides. Graph multidrawing: Finding nice drawings without defining nice. In this volume."},{"key":"34_CR4","doi-asserted-by":"crossref","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\u2019 94), pages 143\u2013146, Berlin, October 1994. Springer.","DOI":"10.1007\/3-540-58950-3_365"},{"key":"34_CR5","doi-asserted-by":"crossref","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\u2019 95), pages 224\u2013233, Berlin, September 1995. Springer.","DOI":"10.1007\/3-540-58950-3_365"},{"key":"34_CR6","doi-asserted-by":"crossref","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\u2019 96), pages 129\u2013138, Berlin, September 1996. Springer.","DOI":"10.1007\/BFb0021806"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"P. Eades, J. Marks, and S. North. Graph-drawing contest report. In G. DiBattista, editor, Lecture Notes in Computer Science: 1353 (Proceedings of the Symposium on Graph Drawing GD\u2019 97), pages 438\u2013445, Berlin, September 1997. Springer.","DOI":"10.1007\/3-540-63938-1_88"},{"key":"34_CR8","unstructured":"http:\/\/gd98.cs.mcgill.ca\/contest\/ ."},{"key":"34_CR9","unstructured":"http:\/\/www-pr.informatik.uni-tuebingen.de\/Gravis\/Gravis.html ."},{"key":"34_CR10","unstructured":"http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/pajek\/ ."},{"key":"34_CR11","unstructured":"http:\/\/www.merl.com\/people\/pasztor\/graphContest ."},{"key":"34_CR12","unstructured":"M. Wissen. Automatisches Zeichnen von Zustandsdiagrammen. Master\u2019s thesis, Diplomarbeit, Fachbereich Informatik, Universit\u00e4t des Saarlandes, 1998."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37623-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T19:20:24Z","timestamp":1556997624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37623-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654735","9783540376231"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-37623-2_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}