{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:33:35Z","timestamp":1725561215542},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_16","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:46:01Z","timestamp":1280393161000},"page":"166-177","source":"Crossref","is-referenced-by-count":2,"title":["An Integer Programming Approach to Fuzzy Symmetry Detection"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Buchheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"ABACUS \u2013 A Branch-And-CUt System, \n                    \n                      http:\/\/www.informatik.uni-koeln.de\/abacus"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-36151-0_9","volume-title":"Graph Drawing","author":"D. Abelson","year":"2002","unstructured":"Abelson, D., Hong, S., Taylor, D.: A group-theoretic method for drawing graphs symmetrically. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 86\u201397. Springer, Heidelberg (2002)"},{"key":"16_CR3","unstructured":"Buchheim, C.: An Integer Programming Approach to Exact and Fuzzy Symmetry Detection. PhD thesis, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln (2003), Available at \n                    \n                      kups.ub.uni-koeln.de\/volltexte\/2003\/918"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-45848-4_15","volume-title":"Graph Drawing","author":"C. Buchheim","year":"2002","unstructured":"Buchheim, C., J\u00fcnger, M.: Detecting symmetries by branch & cut. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 178\u2013188. Springer, Heidelberg (2002)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-003-0409-3","volume":"98","author":"C. Buchheim","year":"2003","unstructured":"Buchheim, C., J\u00fcnger, M.: Detecting symmetries by branch&cut. Mathematical Programming, Series B\u00a098, 369\u2013384 (2003)","journal-title":"Mathematical Programming, Series B"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-44541-2_35","volume-title":"Graph Drawing","author":"H.-L. Chen","year":"2001","unstructured":"Chen, H.-L., Lu, H.-I., Yen, H.-C.: On maximum symmetric subgraphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 372\u2013383. Springer, Heidelberg (2001)"},{"key":"16_CR7","unstructured":"CPLEX 7.0, \n                    \n                      http:\/\/www.ilog.com\/products\/cplex"},{"issue":"2","key":"16_CR8","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 symmetry. Theoretical Computer Science\u00a0240(2), 379\u2013405 (2000)","journal-title":"Theoretical Computer Science"},{"key":"16_CR9","unstructured":"Hong, S., Eades, P.: Drawing planar graphs symmetrically II: Biconnected graphs. Technical Report CS-IVG-2001-01, University of Sydney (2001)"},{"key":"16_CR10","unstructured":"Hong, S., Eades, P.: Drawing planar graphs symmetrically III: Oneconnected graphs. Technical Report CS-IVG-2001-02, University of Sydney (2001)"},{"key":"16_CR11","unstructured":"Hong, S., Eades, P.: Drawing planar graphs symmetrically IV: Disconnected graphs. Technical Report CS-IVG-2001-03, University of Sydney (2001)"},{"key":"16_CR12","unstructured":"Hong, S., McKay, B., Eades, P.: Symmetric drawings of triconnected planar graphs. In: SODA 2002, pp. 356\u2013365 (2002)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0038465","volume-title":"Computing in the 90\u2019s","author":"J. Manning","year":"1991","unstructured":"Manning, J.: Computational complexity of geometric symmetry detection in graphs. In: Sherwani, N.A., Kapenga, J.A., de Doncker, E. (eds.) Great Lakes CS Conference 1989. LNCS, vol.\u00a0507, pp. 1\u20137. Springer, Heidelberg (1991)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing","author":"H. Purchase","year":"1997","unstructured":"Purchase, H.: Which aesthetic has the greatest effect on human understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 248\u2013261. Springer, Heidelberg (1997)"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:48:22Z","timestamp":1552837702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}