{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:31Z","timestamp":1725516631459},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_2","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T03:18:26Z","timestamp":1219115906000},"page":"13-22","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Graph Editing with Chosen Vertex Degrees"],"prefix":"10.1007","author":[{"given":"Luke","family":"Mathieson","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jagm.2001.1196","volume":"42","author":"R. Bar-Yehuda","year":"2002","unstructured":"Bar-Yehuda, R., Rawitz, D.: Approximating element-weighted vertex deletion problems for the complete k-partite property. Journal of Algorithms\u00a042(1), 20\u201340 (2002)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(02)00413-4","volume":"131","author":"H. Bodlaender","year":"2003","unstructured":"Bodlaender, H., Tan, R., van Leeuwen, J.: Finding a \u2206-regular supergraph of minimum order. Discrete Applied Mathematics\u00a0131(1), 3\u20139 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"2_CR3","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. Information Processing Letters\u00a058(4), 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0166-218X(90)90129-Z","volume":"27","author":"F. Cheah","year":"1990","unstructured":"Cheah, F., Corneil, D.G.: The complexity of regular subgraph recognition. Discrete Applied Mathematics\u00a027, 59\u201368 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1002\/jgt.3190030408","volume":"3","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V., Fleischner, H., Sheehan, J., Thomassen, C.: Three-regular subgraphs of four regular graphs. Journal of Graph Theory\u00a03, 371\u2013386 (1979)","journal-title":"Journal of Graph Theory"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11847250_2","volume-title":"Parameterized and Exact Computation","author":"F. Dehne","year":"2006","unstructured":"Dehne, F., Langston, M., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: Implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 13\u201324. Springer, Heidelberg (2006)"},{"key":"2_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths trees and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/1064009.1064021","volume-title":"6th ACM Conference on Electronic Commerce (EC-2005)","author":"E. Elkind","year":"2005","unstructured":"Elkind, E.: True costs of cheap labor are hard to measure: Edge deletion and VCG payments in graphs. In: Riedl, J., Kearns, M.J., Reiter, M.K. (eds.) 6th ACM Conference on Electronic Commerce (EC-2005), pp. 108\u2013116. ACM, New York (2005)"},{"key":"2_CR10","unstructured":"Estivill-Castro, V., Fellows, M., Langston, M., Rosamond, F.: FPT is P-TIME extremal structure I. In: Algorithms and Complexity in Durham 2005 (ACiD 2005), Texts in Algorithmics, pp. 1\u201341. College Publications (2005)"},{"key":"2_CR11","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/504794.504798","volume":"48","author":"M. Frick","year":"2001","unstructured":"Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM\u00a048, 1184\u20131206 (2001)","journal-title":"Journal of the ACM"},{"key":"2_CR13","series-title":"Annals of Discrete Mathematics","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol.\u00a029. North-Holland Publishing Co., Amsterdam (1986)"},{"key":"2_CR14","unstructured":"Mathieson, L., Szeider, S.: The parameterized complexity of regular subgraph problems and generalizations. In: Harland, J., Manyem, P. (eds.) Fourteenth Computing: The Australasian Theory Symposium (CATS 2008). CRPIT, vol.\u00a077, pp. 79\u201386. ACS (2008)"},{"key":"2_CR15","unstructured":"Moser, H., Thilikos, D.: Parameterized complexity of finding regular induced subgraphs. In: Algorithms and Complexity in Durham 2006 (ACiD 2006), Texts in Algorithmics, pp. 107\u2013118. College Publications (2006)"},{"key":"2_CR16","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(84)90113-4","volume":"49","author":"J. Plesn\u00edk","year":"1984","unstructured":"Plesn\u00edk, J.: A note on the complexity of finding regular subgraphs. Discrete Mathematics\u00a049, 161\u2013167 (1984)","journal-title":"Discrete Mathematics"},{"issue":"1\u20133","key":"2_CR18","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0012-365X(94)90277-1","volume":"126","author":"I.A. Stewart","year":"1994","unstructured":"Stewart, I.A.: Deciding whether a planar graph has a cubic subgraph is NP-complete. Discrete Mathematics\u00a0126(1\u20133), 349\u2013357 (1994)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(95)00061-U","volume":"68","author":"I.A. Stewart","year":"1996","unstructured":"Stewart, I.A.: Finding regular subgraphs in both arbitrary and planar graph. Discrete Applied Mathematics\u00a068(3), 223\u2013235 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"1\u20133","key":"2_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0012-365X(95)00324-P","volume":"163","author":"I.A. Stewart","year":"1997","unstructured":"Stewart, I.A.: On locating cubic subgraphs in bounded-degree connected bipartite graphs. Discrete Mathematics\u00a0163(1\u20133), 319\u2013324 (1997)","journal-title":"Discrete Mathematics"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ipl.2007.09.009","volume":"106","author":"I.A. Stewart","year":"2008","unstructured":"Stewart, I.A.: On the fixed-parameter tractability of parameterized model-checking problems. Information Processing Letters\u00a0106, 33\u201336 (2008)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:40:59Z","timestamp":1619509259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}