{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T14:50:55Z","timestamp":1758120655459},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/date.2004.1268868","type":"proceedings-article","created":{"date-parts":[[2004,6,21]],"date-time":"2004-06-21T17:52:40Z","timestamp":1087840360000},"page":"324-329","source":"Crossref","is-referenced-by-count":10,"title":["Breaking instance-independent symmetries in exact graph coloring"],"prefix":"10.1109","author":[{"given":"A.","family":"Ramani","sequence":"first","affiliation":[]},{"given":"F.A.","family":"Aloul","sequence":"additional","affiliation":[]},{"given":"I.L.","family":"Markov","sequence":"additional","affiliation":[]},{"given":"K.A.","family":"Sakallah","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","article-title":"Supersymmetric modelling for local search","author":"prestwich","year":"2002","journal-title":"SymCon 02 21-28"},{"doi-asserted-by":"publisher","key":"15","DOI":"10.1109\/DAC.2001.156196"},{"year":"0","author":"trick","journal-title":"Network Resources for Coloring a Graph","key":"16"},{"year":"1990","author":"mckay","journal-title":"NAUTY User s Guide Version 1 5","key":"13"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1287\/ijoc.8.4.344"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/SFCS.1991.185341"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"12"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1145\/776038.776042"},{"key":"2","first-page":"450","article-title":"Generic ilp versus specialized 0-1 ilp: An update","author":"aloul","year":"2002","journal-title":"Proc Intl Conf on CAD"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/TCAD.2003.816218"},{"year":"0","author":"darga","journal-title":"SAUCY Graph Automorphism Tool","key":"10"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1016\/0096-0551(81)90048-5"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/DAC.2003.1219134"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1007\/3-540-49201-1_2"},{"key":"4","first-page":"1","article-title":"Symmetry-breaking for pseudo-boolean formulas","author":"aloul","year":"2003","journal-title":"Intl Workshop on Symmetry in Constraint Satisfaction Problems (SymCon)"},{"year":"0","author":"culberson","journal-title":"Graph Coloring Page","key":"9"},{"key":"8","first-page":"148","article-title":"Symmetry-breaking predicates for search problems","author":"crawford et al","year":"1996","journal-title":"in Proc Principles Knowl Represent Reason"}],"event":{"acronym":"DATE-04","name":". Design, Automation and Test in Europe Conference and Exhibition","location":"Paris, France"},"container-title":["Proceedings Design, Automation and Test in Europe Conference and Exhibition"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8959\/28390\/01268868.pdf?arnumber=1268868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T22:02:02Z","timestamp":1489442522000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1268868\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/date.2004.1268868","relation":{},"subject":[]}}