{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:12Z","timestamp":1725558852081},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_31","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T20:54:14Z","timestamp":1278363254000},"page":"307-317","source":"Crossref","is-referenced-by-count":1,"title":["A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs"],"prefix":"10.1007","author":[{"given":"Seok-Hee","family":"Hong","sequence":"first","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Babai, L.: Automorphism Groups, Isomorphism, and Reconstruction. In: Graham, Groetschel, Lovasz (eds.) Handbook of CombinatoricsCh. 27, vol.\u00a02. Elsevier Science, Amsterdam (1995)"},{"issue":"5","key":"31_CR2","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-Line Planarity Testing. SIAM Journal on Computing\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(99)00239-X","volume":"240","author":"P. Eades","year":"2000","unstructured":"Eades, P., Lin, X.: Spring Algorithms and Symmetries. Theoretical Computer Science\u00a0240, 379\u2013405 (2000)","journal-title":"Theoretical Computer Science"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Hong, S., Eades, P., Lee, S.: An Algorithm for Finding Geometric Automorphisms in Planar Graphs, Algorithms and Computation. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, pp. 277\u2013286. Springer, Heidelberg (1998)","DOI":"10.1007\/3-540-49381-6_30"},{"issue":"3-4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0925-7721(00)00020-1","volume":"17","author":"S. Hong","year":"2000","unstructured":"Hong, S., Eades, P., Lee, S.: Drawing Series Parallel Digraphs Symmetrically. Computational Geometry: Theory and Applicatons\u00a017(3-4), 165\u2013188 (2000)","journal-title":"Computational Geometry: Theory and Applicatons"},{"key":"31_CR6","unstructured":"Hong, S., McKay, B., Eades, P.: Symmetric Drawings of Triconnected Planar Graphs. In: Proc. of SODA 2002, pp. 356\u2013365 (2002)"},{"key":"31_CR7","unstructured":"Hong, S., Eades, P.: Drawing Planar Graphs Symmetrically II: Biconnected Graphs, Technical Report CS-IVG-2001-01, Basser Department of Computer Science, The University of Sydney (2001) (Submitted)"},{"key":"31_CR8","unstructured":"Hong, S., Eades, P.: Drawing Planar Graphs Symmetrically III: One-connected Graphs, Technical Report CS-IVG-2001-02, Basser Department of Computer Science, The University of Sydney (2001) (Submitted)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-24587-2_42","volume-title":"Algorithms and Computation","author":"S. Hong","year":"2003","unstructured":"Hong, S., Eades, P.: Symmetric Layout of Disconnected Graphs, Algorithms and Computation. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 405\u2013414. Springer, Heidelberg (2003)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Wong, J.K.: Linear Time Algorithm for Isomorphism of Planar Graphs. In: Proc. of the Sixth Annual ACM Symposium on Theory of Computing, pp. 172\u2013184 (1974)","DOI":"10.1145\/800119.803896"},{"key":"31_CR11","unstructured":"Manning, J.: Geometric Symmetry in Graphs, Ph.D. Thesis, Purdue Univ. (1990)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:28:17Z","timestamp":1605760097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}