{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:23Z","timestamp":1725489023188},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_15","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:47:53Z","timestamp":1186829273000},"page":"178-188","source":"Crossref","is-referenced-by-count":3,"title":["Detecting Symmetries by Branch &amp; Cut"],"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","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"15_CR1","unstructured":"O. Bastert. New ideas for canonically computing graph algebras. Technical Report TUM-M9803, Technische Universit\u00e4t M\u00fcnchen, Fakult\u00e4t f\u00fcr Mathematik, 1998."},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(99)00239-X","volume":"240","author":"P. Eades","year":"2000","unstructured":"P. Eades and X. Lin. Spring algorithms and symmetry. Theoretical Computer Science, 240(2):379\u2013405, 2000.","journal-title":"Theoretical Computer Science"},{"key":"15_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-46648-7_29","volume-title":"Graph Drawing\u2019 99","author":"H. Fraysseix de","year":"1999","unstructured":"H. de Fraysseix. An heuristic for graph symmetry detection. In J. Kratochv\u00edl, editor, Graph Drawing\u2019 99, volume 1731 of Lecture Notes in Computer Science, pages 276\u2013285. Springer-Verlag, 1999."},{"key":"15_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49381-6_30","volume-title":"Algorithms and computation","author":"S.-H. Hong","year":"1998","unstructured":"S.-H. Hong, P. Eades, and S.-H. Lee. Finding planar geometric automorphisms in planar graphs. In K.-Y. Chwa et al., editors, Algorithms and computation. 9th international symposium, ISAAC\u2019 98, volume 1533 of Lecture Notes in Computer Science, pages 277\u2013286. Springer-Verlag, 1998."},{"issue":"11","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M. J\u00fcnger","year":"2000","unstructured":"M. J\u00fcnger and S. Thienel. The ABACUS system for branch-and-cut-and-pricealgorithms in integer programming and combinatorial optimization. Software \u2014 Practice & Experience, 30(11):1325\u20131352, 2000.","journal-title":"Software \u2014 Practice & Experience"},{"key":"15_CR6","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Computational complexity of geometric symmetry detection in graphs","author":"J. Manning","year":"1991","unstructured":"J. Manning. Computational complexity of geometric symmetry detection in graphs. In Great Lakes Computer Science Conference, volume 507 of Lecture Notes in Computer Science, pages 1\u20137. Springer-Verlag, 1990."},{"key":"15_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Graph Drawing\u2019 97","author":"H. Purchase","year":"1997","unstructured":"H. Purchase. Which aesthetic has the greatest effect on human understanding? In Giuseppe Di Battista, editor, Graph Drawing\u2019 97, volume 1353 of Lecture Notes in Computer Science, pages 248\u2013261. Springer-Verlag, 1997."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R. C. Read","year":"1977","unstructured":"R. C. Read and D. G. Corneil. The graph isomorphism disease. Journal of Graph Theory, 1:339\u2013363, 1977.","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T07:10:12Z","timestamp":1550733012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}