{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:54Z","timestamp":1725637434866},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25870-1_13","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:32:45Z","timestamp":1322641965000},"page":"131-142","source":"Crossref","is-referenced-by-count":5,"title":["Parameterized Complexity of Eulerian Deletion Problems"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D\u00e1niel","family":"Marx","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ildik\u00f3","family":"Schlotter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF01585705","volume":"53","author":"R.K. Ahuja","year":"1992","unstructured":"Ahuja, R.K., Goldberg, A.V., Orlin, J.B., Tarjan, R.E.: Finding minimum-cost flows by double scaling. Math. Program.\u00a053, 243\u2013266 (1992)","journal-title":"Math. Program."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Shapira, A., Sudakov, B.: Additive approximation for edge-deletion problems. In: FOCS, pp. 419\u2013428 (2005)","DOI":"10.1109\/SFCS.2005.11"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Moser, H., Niedermeier, R.: Approximation and tidying\u2014a problem kernel for s-plex cluster vertex deletion. Algorithmica (February 2011)","DOI":"10.1007\/s00453-011-9492-7"},{"key":"13_CR5","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: A new technique for kernelization lower bounds. CoRR abs\/1011.4224 (2010)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1016\/j.dam.2006.03.031","volume":"154","author":"P. Burzyn","year":"2006","unstructured":"Burzyn, P., Bonomo, F., Dur\u00e1n, G.: NP-completeness results for edge modification problems. Discrete Appl. Math.\u00a0154, 1824\u20131844 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.01.002","volume":"198","author":"J. Cai","year":"2005","unstructured":"Cai, J., Chakaravarthy, V.T., Hemaspaandra, L.A., Ogihara, M.: Competing provers yield improved Karp-Lipton collapse results. Inf. Comput.\u00a0198(1), 1\u201323 (2005)","journal-title":"Inf. Comput."},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-13073-1_9","volume-title":"Algorithms and Complexity","author":"L. Cai","year":"2010","unstructured":"Cai, L., Yang, B.: Parameterized Complexity of Even\/Odd Subgraph Problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol.\u00a06078, pp. 85\u201396. Springer, Heidelberg (2010)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-17493-3_9","volume-title":"Parameterized and Exact Computation","author":"K. Cechl\u00e1rov\u00e1","year":"2010","unstructured":"Cechl\u00e1rov\u00e1, K., Schlotter, I.: Computing the Deficiency of Housing Markets with Duplicate Houses. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol.\u00a06478, pp. 72\u201383. Springer, Heidelberg (2010)"},{"issue":"5","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411511","volume":"55","author":"J. Chen","year":"2008","unstructured":"Chen, J., Liu, Y., Lu, S., O\u2019Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM\u00a055(5), 1\u201319 (2008)","journal-title":"J. ACM"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/11672142_29","volume-title":"STACS 2006","author":"J. D\u00edaz","year":"2006","unstructured":"D\u00edaz, J., Thilikos, D.M.: Fast FPT-Algorithms for Cleaning Grids. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 361\u2013371. Springer, Heidelberg (2006)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-16926-7_11","volume-title":"Graph Theoretic Concepts in Computer Science","author":"F. Dorn","year":"2010","unstructured":"Dorn, F., Moser, H., Niedermeier, R., Weller, M.: Efficient Algorithms for Eulerian Extension. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 100\u2013111. Springer, Heidelberg (2010)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.: Matching, Euler tours and the Chinese postman problem. Math. Program.\u00a05, 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. on Computing\u00a05, 704\u2013714 (1976)","journal-title":"SIAM J. on Computing"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/978-3-540-77120-3_79","volume-title":"Algorithms and Computation","author":"J. Guo","year":"2007","unstructured":"Guo, J.: Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 915\u2013926. Springer, Heidelberg (2007)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S. Khot","year":"2002","unstructured":"Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci.\u00a0289, 997\u20131008 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"13","key":"13_CR18","doi-asserted-by":"publisher","first-page":"2871","DOI":"10.1016\/j.dam.2009.03.018","volume":"157","author":"P. Kolman","year":"2009","unstructured":"Kolman, P., Pangr\u00e1c, O.: On the complexity of paths avoiding forbidden pairs. Discrete Applied Mathematics\u00a0157(13), 2871\u20132876 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-11269-0_22","volume-title":"Parameterized and Exact Computation","author":"S. Kratsch","year":"2009","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two Edge Modification Problems Without Polynomial Kernels. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 264\u2013275. Springer, Heidelberg (2009)"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J.M. Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci.\u00a020(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-79723-4_14","volume-title":"Parameterized and Exact Computation","author":"D. Lokshtanov","year":"2008","unstructured":"Lokshtanov, D.: Wheel-Free Deletion is W[2]-Hard. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol.\u00a05018, pp. 141\u2013147. Springer, Heidelberg (2008)"},{"issue":"4","key":"13_CR22","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D. Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica\u00a057(4), 747\u2013768 (2010)","journal-title":"Algorithmica"},{"key":"13_CR23","unstructured":"Mathieson, L., Szeider, S.: The parameterized complexity of regular subgraph problems and generalizations. In: CATS, pp. 79\u201386 (2008)"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.jda.2008.09.005","volume":"7","author":"H. Moser","year":"2009","unstructured":"Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. Journal of Discrete Algorithms\u00a07, 181\u2013190 (2009)","journal-title":"Journal of Discrete Algorithms"},{"key":"13_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00391-7","volume":"113","author":"A. Natanzon","year":"2001","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math.\u00a0113, 109\u2013128 (2001)","journal-title":"Discrete Appl. Math."},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-16926-7_19","volume-title":"Graph Theoretic Concepts in Computer Science","author":"G. Philip","year":"2010","unstructured":"Philip, G., Raman, V., Villanger, Y.: A Quartic Kernel for Pathwidth-one Vertex Deletion. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 196\u2013207. Springer, Heidelberg (2010)"},{"issue":"4","key":"13_CR27","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","volume":"8","author":"J. Plesn\u00edk","year":"1979","unstructured":"Plesn\u00edk, J.: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Inf. Process. Lett.\u00a08(4), 199\u2013201 (1979)","journal-title":"Inf. Process. Lett."},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.tcs.2005.10.010","volume":"351","author":"V. Raman","year":"2006","unstructured":"Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci.\u00a0351, 446\u2013458 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ipl.2007.05.005","volume":"104","author":"V. Raman","year":"2007","unstructured":"Raman, V., Sikdar, S.: Parameterized complexity of the induced subgraph problem in directed graphs. Inf. Process. Lett.\u00a0104, 79\u201385 (2007)","journal-title":"Inf. Process. Lett."},{"key":"13_CR30","unstructured":"Sorge, M.: On making directed graphs Eulerian. CoRR abs\/1101.4283 (2011)"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","volume":"26","author":"C.K. Yap","year":"1983","unstructured":"Yap, C.K.: Some consequences of non-uniform conditions on uniform classes. Theor. Comput. Sci.\u00a026, 287\u2013300 (1983)","journal-title":"Theor. Comput. Sci."}],"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-25870-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:04:52Z","timestamp":1560989092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}