{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:33:53Z","timestamp":1725561233263},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540208310"},{"type":"electronic","value":"9783540245957"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_47","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:46:01Z","timestamp":1280378761000},"page":"494-495","source":"Crossref","is-referenced-by-count":0,"title":["HexGraph: Applying Graph Drawing Algorithms to the Game of Hex"],"prefix":"10.1007","author":[{"given":"Colin","family":"Murray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Friedrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","volume-title":"Hex Strategy: Making the Right Connections","author":"C. Browne","year":"2000","unstructured":"Browne, C.: Hex Strategy: Making the Right Connections. A. K. Peters, Natick (2000)"},{"key":"47_CR2","unstructured":"van Rijswijck, J.: Search and evaluation in Hex. Tech report, University of Alberta"},{"key":"47_CR3","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proc. Lond. Math. Soc.\u00a010, 304\u2013320 (1960)","journal-title":"Proc. Lond. Math. Soc."},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math Soc.\u00a013, 743\u2013768 (1963)","journal-title":"Proc. London Math Soc."},{"issue":"1-2","key":"47_CR5","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. Information Processing Letters\u00a074(1-2), 7\u201313 (2000)","journal-title":"Information Processing Letters"},{"key":"47_CR6","unstructured":"Friedrich, C.: Animation in Relational Information Visualization. Phd thesis, University of Sydney (2002)"},{"key":"47_CR7","volume-title":"Mental Maps","author":"P. Gould","year":"1986","unstructured":"Gould, P., White, R.: Mental Maps. Allen and Unwin, Winchester (1986)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24595-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:21:22Z","timestamp":1552821682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}