{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:03:28Z","timestamp":1648555408563},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T00:00:00Z","timestamp":1337817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00236-012-0160-4","type":"journal-article","created":{"date-parts":[[2012,5,23]],"date-time":"2012-05-23T14:21:38Z","timestamp":1337782898000},"page":"295-312","source":"Crossref","is-referenced-by-count":2,"title":["An algorithmic study of switch graphs"],"prefix":"10.1007","volume":"49","author":[{"given":"Bastian","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,24]]},"reference":[{"key":"160_CR1","first-page":"93","volume-title":"New Constructions in Cellular Automata, Volume 226","author":"M. Cook","year":"2003","unstructured":"Cook M.: In: Moore, C., Griffeath, D. (eds) New Constructions in Cellular Automata, Volume 226, pp. 93\u2013118. Oxford University Press, Oxford (2003)"},{"key":"160_CR2","doi-asserted-by":"crossref","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. J. Comb. Theory Ser. B 45, 185\u2013198 (1988)","journal-title":"J. Comb. Theory Ser. B"},{"key":"160_CR3","doi-asserted-by":"crossref","unstructured":"de Berg, M., Khosravi, A.: Optimal binary space partitions in the plane. In: Proceeding of 16th International Computing and Combinatorics Conference (COCOON\u20192010), vol. 6196 of LNCS, pp. 216\u2013225. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14031-0_25"},{"key":"160_CR4","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Proceedings of the Calgary International Conference on Combinatorial Structures and Their Applications, pp. 69\u201387. Calgary (1969)"},{"key":"160_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"issue":"5","key":"160_CR6","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1142\/S0129054109006930","volume":"20","author":"J. Groote","year":"2009","unstructured":"Groote J., Ploeger B.: Switching graphs. Int. J. Found. Comput. Sci. 20(5), 869\u2013886 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"160_CR7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"160_CR8","doi-asserted-by":"crossref","unstructured":"Huckenbeck, U.: On paths in networks with valves. In: Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS\u201993), vol. 665 of LNCS, pp. 90\u201399 (1993)","DOI":"10.1007\/3-540-56503-5_12"},{"issue":"1","key":"160_CR9","first-page":"19","volume":"2","author":"U. Huckenbeck","year":"1997","unstructured":"Huckenbeck U.: On valve adjustments that interrupt all s-t-paths in a digraph. J. Autom. Lang. Comb. 2(1), 19\u201345 (1997)","journal-title":"J. Autom. Lang. Comb."},{"key":"160_CR10","doi-asserted-by":"crossref","unstructured":"Katz, B., Rutter, I., Woeginger, G.: An algorithmic study of switch graphs. In: Proceeding of 35th International Workshop Graph-Theoretical Concepts in Computer Science (WG\u201909), pp. 226\u2013237, LNCS. Springer, Berlin","DOI":"10.1007\/978-3-642-11409-0_20"},{"key":"160_CR11","volume-title":"Combinatorial Optimization, Theory and Algorithms","author":"B. Korte","year":"2008","unstructured":"Korte B., Vygen J.: Combinatorial Optimization, Theory and Algorithms. Springer, New York (2008)","edition":"4"},{"key":"160_CR12","doi-asserted-by":"crossref","unstructured":"Meinel, C.: Switching graphs and their complexity. In: Proceedings of the 14th Conference on Mathematical Foundations of Computer Science (MFCS\u20191989), vol. 379 of LNCS, pp. 350\u2013359. Springer, Berlin (1989)","DOI":"10.1007\/3-540-51486-4_82"},{"issue":"4","key":"160_CR13","doi-asserted-by":"crossref","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. Inf. Process. Lett. 8(4), 199\u2013201 (1979)","journal-title":"Inf. Process. Lett."},{"key":"160_CR14","doi-asserted-by":"crossref","unstructured":"Reinhardt, K.: The simple reachability problem in switch graphs. In: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM\u20192009), vol. 5404 of LNCS, pp. 461\u2013472. Springer, Berlin (2009)","DOI":"10.1007\/978-3-540-95891-8_42"},{"key":"160_CR15","doi-asserted-by":"crossref","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. J. Comp. Biol. 15, 514\u2013533 (2005)","journal-title":"J. Comp. Biol."},{"key":"160_CR16","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan R.E.: Data Structures and Network Algorithms. SIAM, Philadelphia (1983)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0160-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-012-0160-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-012-0160-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T01:39:49Z","timestamp":1561772389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-012-0160-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,24]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["160"],"URL":"https:\/\/doi.org\/10.1007\/s00236-012-0160-4","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,24]]}}}