{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:13:02Z","timestamp":1725495182304},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001584"},{"type":"electronic","value":"9783540361510"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_17","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T12:14:14Z","timestamp":1195215254000},"page":"174-186","source":"Crossref","is-referenced-by-count":0,"title":["Compact Encodings of Planar Orthogonal Drawings"],"prefix":"10.1007","author":[{"given":"Amrita","family":"Chanda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashim","family":"Garg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"R. C. Chuang, A. Garg, X. He, M. Y. Kao, and H. Lu. Compact encoding of planar graphs via canonical ordering and multiple parenthesis. In Proc. International Colloqium on Automata, Languages and Programming (ICALP), pp. 118\u2013129, 1998.","DOI":"10.1007\/BFb0055046"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41\u201351, 1990.","journal-title":"Combinatorica"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1006\/jvlc.1995.1016","volume":"6","author":"G. Battista Di","year":"1995","unstructured":"G. Di Battista, G. Liotta, and F. Vargiu. Diagram Server. J. Visual Lang. Comput., 6(3):275\u2013298, 1995.","journal-title":"J. Visual Lang. Comput."},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Battista Di","year":"1998","unstructured":"G. Di Battista, G. Liotta, and F. Vargiu. Spirality and optimal orthogonal drawings. SIAM J. Comput., 27(6):1764\u20131811, 1998.","journal-title":"SIAM J. Comput."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Xin He, M.-Y. Kao, and H. Lu. A fast general methodology for informationtheoretically optimal encodings of graphs. SIAM J. Comput., 30(3):838\u2013846, 2000.","DOI":"10.1137\/S0097539799359117"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33thA nnu. IEEE Sympos. Found. Comput. Sci., pages 101\u2013110, 1992.","DOI":"10.1109\/SFCS.1992.267814"},{"issue":"3","key":"17_CR7","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 J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"issue":"9","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230\u20131234, 1989.","journal-title":"IEEE Trans. Circuits Syst."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.4153\/CJM-1962-002-9","volume":"14","author":"W. T. Tutte","year":"1962","unstructured":"W. T. Tutte. A census of planar triangulation. Canad. J. Math., 14:21\u201338, 1962. awings.","journal-title":"Canad. J. Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:31:52Z","timestamp":1556969512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}