{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:55Z","timestamp":1725861535010},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_13","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"159-170","source":"Crossref","is-referenced-by-count":1,"title":["On the Hardness of Switching to a Small Number of Edges"],"prefix":"10.1007","author":[{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"first","affiliation":[]},{"given":"Eva","family":"Jel\u00ednkov\u00e1","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"TN Bui","year":"1987","unstructured":"Bui, T.N., Chaudhuri, S., Leighton, F.T., Sipser, M.: Graph bisection algorithms with good average case behavior. Combinatorica 7(2), 171\u2013191 (1987)","journal-title":"Combinatorica"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-540-46464-8_5","volume-title":"Theory and Application of Graph Transformations","author":"A Ehrenfeucht","year":"2000","unstructured":"Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Complexity issues in switching of graphs. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 59\u201370. Springer, Heidelberg (2000)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","unstructured":"Hage, J.: Structural Aspects of Switching Classes. Ph.D. thesis, Leiden Institute of Advanced Computer Science (2001)"},{"issue":"4","key":"13_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1002\/jgt.21745","volume":"75","author":"E Jel\u00ednkov\u00e1","year":"2014","unstructured":"Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J.: On switching to H-free graphs. J. Graph Theor. 75(4), 387\u2013405 (2014)","journal-title":"J. Graph Theor."},{"issue":"2","key":"13_CR6","first-page":"19","volume":"13","author":"E Jel\u00ednkov\u00e1","year":"2011","unstructured":"Jel\u00ednkov\u00e1, E., Such\u00fd, O., Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Parameterized problems related to Seidel\u2019s switching. Discrete Math. Theor. Comput. Sci. 13(2), 19\u201342 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"13_CR7","first-page":"51","volume":"56","author":"S Kozerenko","year":"2015","unstructured":"Kozerenko, S.: On graphs with maximum size in their switching classes. Comment. Math. Univ. Carol. 56(1), 51\u201361 (2015)","journal-title":"Comment. Math. Univ. Carol."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-540-39890-5_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Kratochv\u00edl","year":"2003","unstructured":"Kratochv\u00edl, J.: Complexity of hypergraph coloring and Seidel\u2019s switching. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 297\u2013308. Springer, Heidelberg (2003)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-319-19315-1_21","volume-title":"Combinatorial Algorithms","author":"N Lindzey","year":"2015","unstructured":"Lindzey, N.: Speeding up graph algorithms via switching classes. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 238\u2013249. Springer, Heidelberg (2015)"},{"issue":"1","key":"13_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00454-014-9584-7","volume":"52","author":"J Matou\u0161ek","year":"2014","unstructured":"Matou\u0161ek, J., Wagner, U.: On Gromov\u2019s method of selecting heavily covered points. Discrete Comput. Geom. 52(1), 1\u201333 (2014)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:44:12Z","timestamp":1498329852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}