{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:17Z","timestamp":1725533897291},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_4","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"18-31","source":"Crossref","is-referenced-by-count":1,"title":["Finding Lean Induced Cycles in Binary Hypercubes"],"prefix":"10.1007","author":[{"given":"Yury","family":"Chebiryak","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Wahl","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Kroening","sequence":"additional","affiliation":[]},{"given":"Leopold","family":"Haller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:FORM.0000004786.30007.f8","volume":"24","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Iyer, S.P., Nyl\u00e9n, A.: SAT-solving the coverability problem for Petri nets. Formal Methods in System Design\u00a024(1), 25\u201343 (2004)","journal-title":"Formal Methods in System Design"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Chebiryak, Y., Kroening, D.: An efficient SAT encoding of circuit codes. In: Procs. IEEE International Symposium on Information Theory and its Applications, Auckland, New Zealand, December 2008, pp. 1235\u20131238 (2008)","DOI":"10.1109\/ISITA.2008.4895595"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.3233\/SAT190038","volume":"4","author":"Y. Chebiryak","year":"2008","unstructured":"Chebiryak, Y., Kroening, D.: Towards a classification of Hamiltonian cycles in the 6-cube. Journal on Satisfiability, Boolean Modeling and Computation (JSAT)\u00a04, 57\u201374 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation (JSAT)"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TCBB.2007.70254","volume":"5","author":"H. Jong de","year":"2008","unstructured":"de Jong, H., Page, M.: Search for steady states of piecewise-linear differential equation models of genetic regulatory networks. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a05(2), 208\u2013222 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"4_CR5","first-page":"389","volume-title":"SNPD-SAWN 2006: Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing","author":"P.A. Diaz-Gomez","year":"2006","unstructured":"Diaz-Gomez, P.A., Hougen, D.F.: Genetic algorithms for hunting snakes in hypercubes: Fitness function analysis and open questions. In: SNPD-SAWN 2006: Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing, Washington, DC, USA, pp. 389\u2013394. IEEE Computer Society, Los Alamitos (2006)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24605-3_1","volume-title":"Theory and Applications of Satisfiability Testing","author":"M.R. Dransfield","year":"2004","unstructured":"Dransfield, M.R., Marek, V.W., Truszczynski, M.: Satisfiability and computing van der Waerden numbers. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 1\u201313. Springer, Heidelberg (2004)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1063\/1.1336498","volume":"11","author":"R. Edwards","year":"2001","unstructured":"Edwards, R.: Symbolic dynamics and computation in model gene networks. Chaos\u00a011(1), 160\u2013169 (2001)","journal-title":"Chaos"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Glass, L.: Combinatorial aspects of dynamics in biological systems. In: Landman, U. (ed.) Statistical mechanics and statistical methods in theory and applications, pp. 585\u2013611. Plenum Press (1977)","DOI":"10.1007\/978-1-4613-4166-6_25"},{"key":"4_CR11","series-title":"fascicle 2: Generating All Tuples and Permutations","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"2005","unstructured":"Knuth, D.E.: The Art of Computer Programming. fascicle 2: Generating All Tuples and Permutations, vol.\u00a04. Addison-Wesley Professional, Reading (2005)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/11499107_11","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Kouril","year":"2005","unstructured":"Kouril, M., Franco, J.V.: Resolution tunnels for improved SAT solver performance. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 143\u2013157. Springer, Heidelberg (2005)"},{"issue":"1","key":"4_CR13","first-page":"55","volume":"155","author":"X. Liu","year":"2004","unstructured":"Liu, X., Schrack, G.F.: A heuristic approach for constructing symmetric Gray codes. Appl. Math. Comput.\u00a0155(1), 55\u201363 (2004)","journal-title":"Appl. Math. Comput."},{"key":"4_CR14","first-page":"187","volume":"79","author":"M. Livingston","year":"1990","unstructured":"Livingston, M., Stout, Q.: Perfect dominating sets. Congressus Numerantium\u00a079, 187\u2013203 (1990)","journal-title":"Congressus Numerantium"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Na\u2019aman Kam, D., Kugler, H., Rami Marelly, A., Hubbard, J., Stern, M.: Formal modelling of C. elegans development. A scenario-based approach. Modelling in Molecular Biology, 151\u2013174 (2004)","DOI":"10.1007\/978-3-642-18734-6_8"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-72788-0_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"K. Pipatsrisawat","year":"2007","unstructured":"Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 294\u2013299. Springer, Heidelberg (2007)"},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C. Savage","year":"1997","unstructured":"Savage, C.: A survey of combinatorial Gray codes. SIAM Review\u00a039(4), 605\u2013629 (1997)","journal-title":"SIAM Review"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/11832225_19","volume-title":"Mathematical Software - ICMS 2006","author":"L. Schewe","year":"2006","unstructured":"Schewe, L.: Generation of oriented matroids using satisfiability solvers. In: Iglesias, A., Takayama, N. (eds.) ICMS 2006. LNCS, vol.\u00a04151, pp. 216\u2013218. Springer, Heidelberg (2006)"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1109\/PGEC.1966.264382","volume":"EC-15","author":"R.C. Singleton","year":"1966","unstructured":"Singleton, R.C.: Generalized snake-in-the-box codes. IEEE Transactions on Electronic Computers\u00a0EC-15(4), 596\u2013602 (1966)","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Zinovik, I., Chebiryak, Y., Kroening, D.: Cyclic attractors in Glass models for gene regulatory networks. IEEE Trans. Inf. Theory: Special Issue on Molecular Biology and Neuroscience (December 2009) (accepted)","DOI":"10.1109\/TIT.2009.2037078"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-73433-8_11","volume-title":"Algebraic Biology","author":"I. Zinovik","year":"2007","unstructured":"Zinovik, I., Kroening, D., Chebiryak, Y.: An algebraic algorithm for the identification of Glass networks with periodic orbits along cyclic attractors. In: Anai, H., Horimoto, K., Kutsia, T. (eds.) Ab 2007. LNCS, vol.\u00a04545, pp. 140\u2013154. Springer, Heidelberg (2007)"},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1109\/TIT.2008.917695","volume":"54","author":"I. Zinovik","year":"2008","unstructured":"Zinovik, I., Kroening, D., Chebiryak, Y.: Computing binary combinatorial Gray codes via exhaustive search with SAT-solvers. IEEE Transactions on Information Theory\u00a054(4), 1819\u20131823 (2008)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T20:10:15Z","timestamp":1685045415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}