{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:05Z","timestamp":1725541805469},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_20","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T08:12:27Z","timestamp":1259827947000},"page":"226-237","source":"Crossref","is-referenced-by-count":3,"title":["An Algorithmic Study of Switch Graphs"],"prefix":"10.1007","author":[{"given":"Bastian","family":"Katz","sequence":"first","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"93","volume-title":"New Constructions in Cellular Automata","author":"M. Cook","year":"2003","unstructured":"Cook, M.: Still Life Theory. In: New Constructions in Cellular Automata, vol.\u00a0226, pp. 93\u2013118. Oxford University Press, Oxford (2003)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0095-8956(88)90068-8","volume":"45","author":"G. Cornu\u00e9jols","year":"1988","unstructured":"Cornu\u00e9jols, G.: General factors of graphs. Journal of Combinatorial Theory, Series B\u00a045, 185\u2013198 (1988)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"20_CR3","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions (Manuscript) (2008)"},{"key":"20_CR4","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications, Calgary, pp. 69\u201387 (1969)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Ploeger, B.: Switching graphs. In: Proceedings of the 2nd Workshop on Reachability Problems (RP 2008). ENTCS, pp. 119\u2013135 (2008)","DOI":"10.1016\/j.entcs.2008.12.035"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-51486-4_82","volume-title":"Mathematical Foundations of Computer Science 1989","author":"C. Meinel","year":"1989","unstructured":"Meinel, C.: Switching graphs and their complexity. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 350\u2013359. Springer, Heidelberg (1989)"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","volume":"8","author":"J. Ples\u0144ik","year":"1979","unstructured":"Ples\u0144ik, J.: The NP-completeness of the Hamiltonian Cycle Problem in planar digraphs with degree bound two. Information Processing Letters\u00a08(4), 199\u2013201 (1979)","journal-title":"Information Processing Letters"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-540-95891-8_42","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"K. Reinhardt","year":"2009","unstructured":"Reinhardt, K.: The simple reachability problem in switch graphs. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 461\u2013472. Springer, Heidelberg (2009)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1089\/cmb.2005.12.514","volume":"15","author":"R. Sharan","year":"2005","unstructured":"Sharan, R., Gramm, J., Yakhini, Z., Ben-Dor, A.: Multiplexing schemes for generic SNP genotyping assays. Journal of Comp. Biology\u00a015, 514\u2013533 (2005)","journal-title":"Journal of Comp. Biology"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:52:01Z","timestamp":1619769121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}