{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:07:32Z","timestamp":1648883252730},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,10,6]],"date-time":"2007-10-06T00:00:00Z","timestamp":1191628800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s00453-007-9050-5","type":"journal-article","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T15:22:29Z","timestamp":1191597749000},"page":"448-465","source":"Crossref","is-referenced-by-count":0,"title":["Testing Planarity of Geometric Automorphisms in\u00a0Linear Time"],"prefix":"10.1007","volume":"52","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,6]]},"reference":[{"key":"9050_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-36151-0_9","volume-title":"Graph Drawing 2002","author":"D. Abelson","year":"2002","unstructured":"Abelson, D., Hong, S., Taylor, D.: A group-theoretic method for drawing graphs symmetrically. In: Kobourov, S.G., Goodrich, M.T. (eds.) Graph Drawing 2002. Lecture Notes in Computer Science, vol. 2528, pp. 86\u201397. Springer, New York (2002)"},{"key":"9050_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., Lueker, G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"9050_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/3-540-36136-7_49","volume-title":"ISAAC 2002","author":"C. Buchheim","year":"2002","unstructured":"Buchheim, C., Hong, S.: Crossing minimization for symmetries. In: Bose, P., Morin, P. (eds.) ISAAC 2002. Lecture Notes in Computer Science, vol. 2518, pp. 563\u2013574. Springer, New York (2002)"},{"issue":"3","key":"9050_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s00224-005-1142-5","volume":"38","author":"C. Buchheim","year":"2005","unstructured":"Buchheim, C., Hong, S.: Crossing minimization for symmetries. Theory Comput. Syst. 38(3), 293\u2013311 (2005)","journal-title":"Theory Comput. Syst."},{"key":"9050_CR5","series-title":"Lecture Notes in Computer Science","first-page":"178","volume-title":"Graph Drawing 2001","author":"C. Buchheim","year":"2001","unstructured":"Buchheim, C., J\u00fcnger, M.: Detecting symmetries by branch & cut. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) Graph Drawing 2001. Lecture Notes in Computer Science, vol. 2265, pp. 178\u2013188. Springer, New York (2001)"},{"key":"9050_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/978-3-540-24595-7_16","volume-title":"Graph Drawing 2003","author":"C. Buchheim","year":"2004","unstructured":"Buchheim, C., J\u00fcnger, M.: An integer programming approach to fuzzy symmetry detection. In: Liotta, G. (ed.) Graph Drawing 2003. Lecture Notes in Computer Science, vol. 2912, pp. 166\u2013177. Springer, New York (2004)"},{"key":"9050_CR7","first-page":"19","volume":"27","author":"H. Carr","year":"1999","unstructured":"Carr, H., Kocay, W.: An algorithm for drawing a graph symmetrically. Bull. ICA 27, 19\u201325 (1999)","journal-title":"Bull. ICA"},{"key":"9050_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-44541-2_35","volume-title":"Graph Drawing 2000","author":"H. Chen","year":"2001","unstructured":"Chen, H., Lu, H., Yen, H.: On maximum symmetric subgraphs. In: Marks, J. (ed.) Graph Drawing 2000. Lecture Notes in Computer Science, vol. 1984, pp. 372\u2013383. Springer, New York (2001)"},{"key":"9050_CR9","unstructured":"Chuang, M., Yen, H.: On nearly symmetric drawings of graphs. In: IV 2002, pp. 489\u2013494 (2002)"},{"key":"9050_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-46648-7_29","volume-title":"Graph Drawing 1999","author":"H. Fraysseix de","year":"1999","unstructured":"de Fraysseix, H.: An heuristic for graph symmetry detection. In: Kratochv\u00edl, J. (ed.) Graph Drawing 1999. Lecture Notes in Computer Science, vol. 1731, pp. 276\u2013285. Springer, New York (1999)"},{"issue":"5","key":"9050_CR11","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9050_CR12","doi-asserted-by":"crossref","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 symmetry. Theor. Comput. Sci. 240(2), 379\u2013405 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9050_CR13","first-page":"229","volume":"11","author":"I. F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight lines representations of planar graphs. Acta Sci. Math. 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math."},{"key":"9050_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing 2000","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR trees. In: Marks, J. (ed.) Graph Drawing 2000. Lecture Notes in Computer Science, vol. 1984, pp. 77\u201390. Springer, New York (2001)"},{"key":"9050_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/978-3-540-24587-2_42","volume-title":"ISAAC 2003","author":"S. Hong","year":"2003","unstructured":"Hong, S., Eades, P.: Symmetric layout of disconnected graphs. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. Lecture Notes in Computer Science, vol. 2906, pp. 405\u2013414. Springer, New York (2003)"},{"issue":"2","key":"9050_CR16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s00453-004-1132-z","volume":"42","author":"S. Hong","year":"2005","unstructured":"Hong, S., Eades, P.: Drawing planar graphs symmetrically II: biconnected planar graphs. Algorithmica 42(2), 159\u2013197 (2005)","journal-title":"Algorithmica"},{"issue":"1","key":"9050_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00453-005-1149-y","volume":"44","author":"S. Hong","year":"2006","unstructured":"Hong, S., Eades, P.: Drawing planar graphs symmetrically, III: oneconnected planar graphs. Algorithmica 44(1), 67\u2013100 (2006)","journal-title":"Algorithmica"},{"key":"9050_CR18","unstructured":"Hong, S., McKay, B., Eades, P.: Symmetric drawings of triconnected planar graphs. In: SODA 2002, pp. 356\u2013365 (2002)"},{"key":"9050_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Dividing a graph into triconnected components. SIAM J. Comput. 2, 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"9050_CR20","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21, 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"9050_CR21","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., North, S.C., Sandberg, J.S.: A method for drawing graphs. In: ACM Symposium on Computational Geometry, pp. 153\u2013160 (1985)","DOI":"10.1145\/323233.323254"},{"key":"9050_CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02075357","volume":"192","author":"P. Mani","year":"1971","unstructured":"Mani, P.: Automorphismen von polyedrischen Graphen. Math. Ann. 192, 279\u2013303 (1971)","journal-title":"Math. Ann."},{"key":"9050_CR23","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Great Lakes Computer Science Conference","author":"J. Manning","year":"1989","unstructured":"Manning, J.: Computational complexity of geometric symmetry detection in graphs. In: Great Lakes Computer Science Conference. Lecture Notes in Computer Science, vol. 507, pp. 1\u20137. Springer, New York (1989)"},{"key":"9050_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing \u201997","author":"H. Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: Di Battista, G. (ed.) Graph Drawing \u201997. Lecture Notes in Computer Science, vol. 1353, pp. 248\u2013261. Springer, New York (1997)"},{"key":"9050_CR25","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"9050_CR26","series-title":"Encyclopedia of Mathematics and Its Applications","volume-title":"Graph Theory","author":"W. Tutte","year":"1984","unstructured":"Tutte, W.: Graph Theory. Encyclopedia of Mathematics and Its Applications, vol. 21. Addison-Wesley, Reading (1984)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9050-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9050-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9050-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:00Z","timestamp":1559137500000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9050-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,6]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9050"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9050-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,6]]}}}