{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:24:03Z","timestamp":1725470643438},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540390985"},{"type":"electronic","value":"9783540391012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11847250_19","type":"book-chapter","created":{"date-parts":[[2006,9,13]],"date-time":"2006-09-13T15:43:02Z","timestamp":1158162182000},"page":"203-214","source":"Crossref","is-referenced-by-count":7,"title":["Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual"],"prefix":"10.1007","author":[{"given":"Jiong","family":"Guo","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Wernicke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J. Alber","year":"2004","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for Dominating Set. Journal of the ACM\u00a051, 363\u2013384 (2004)","journal-title":"Journal of the ACM"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012, 308\u2013340 (1991)","journal-title":"Journal of Algorithms"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/1097-0037(200012)36:4<203::AID-NET1>3.0.CO;2-U","volume":"36","author":"R. Bhatia","year":"2000","unstructured":"Bhatia, R., Khuller, S., Pless, R., Sussmann, Y.: The full degree spanning tree problem. Networks\u00a036, 203\u2013209 (2000)","journal-title":"Networks"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M","volume":"35","author":"H.J. Broersma","year":"2000","unstructured":"Broersma, H.J., Huck, A., Kloks, T., Koppius, O., Kratsch, D., M\u00fcller, H., Tuinstra, H.: Degree-preserving trees. Networks\u00a035, 26\u201339 (2000)","journal-title":"Networks"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-31856-9_22","volume-title":"STACS 2005","author":"J. Chen","year":"2005","unstructured":"Chen, J., Fernau, H., Kanj, I.A., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 269\u2013280. Springer, Heidelberg (2005)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F.K.H.A. Dehne","year":"2006","unstructured":"Dehne, F.K.H.A., Fellows, M.R., Fernau, H., Prieto, E., Rosamond, F.A.: Nonblocker: Parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 237\u2013245. Springer, Heidelberg (2006)"},{"key":"19_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, Berlin (1999)"},{"key":"19_CR8","unstructured":"Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-time extremal structure I. In: Proc. 1st ACiD, pp. 1\u201341 (2005)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-44450-5_19","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"M.R. Fellows","year":"2000","unstructured":"Fellows, M.R., McCartin, C., Rosamond, F.A., Stege, U.: Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 240\u2013251. Springer, Heidelberg (2000)"},{"key":"19_CR10","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-27836-8_50","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2004","unstructured":"Fomin, F.V., Thilikos, D.M.: Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 581\u2013592. Springer, Heidelberg (2004)"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/S0097539799363359","volume":"32","author":"S. Khuller","year":"2003","unstructured":"Khuller, S., Bhatia, R., Pless, R.: On local search and placement of meters in networks. SIAM Journal on Computing\u00a032(2), 470\u2013487 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"19_CR13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/TCS.1987.1086107","volume":"34","author":"M. Lewinter","year":"1987","unstructured":"Lewinter, M.: Interpolation theorem for the number of degree-preserving vertices of spanning trees. IEEE Transactions on Circuits Systems I: Fundamental Theory and Applications\u00a034(2), 205 (1987)","journal-title":"IEEE Transactions on Circuits Systems I: Fundamental Theory and Applications"},{"key":"19_CR14","doi-asserted-by":"publisher","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":"19_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1061\/(ASCE)0733-9496(1989)115:2(243)","volume":"115","author":"L.E. Ormsbee","year":"1989","unstructured":"Ormsbee, L.E.: Implicit network calibration. Journal of Water Resources Planning Management\u00a0115, 243\u2013257 (1989)","journal-title":"Journal of Water Resources Planning Management"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1061\/(ASCE)0733-9496(1986)112:2(166)","volume":"112","author":"L.E. Ormsbee","year":"1986","unstructured":"Ormsbee, L.E., Wood, D.J.: Explicit pipe network calibration. Journal of Water Resources Planning Management\u00a0112, 116\u2013182 (1986)","journal-title":"Journal of Water Resources Planning Management"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P.D. Seymour","year":"1994","unstructured":"Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11847250_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:18:41Z","timestamp":1619507921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11847250_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540390985","9783540391012"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11847250_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}