{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:32:08Z","timestamp":1743057128544,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112683"},{"type":"electronic","value":"9783642112690"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-11269-0_23","type":"book-chapter","created":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T08:36:15Z","timestamp":1259656575000},"page":"276-287","source":"Crossref","is-referenced-by-count":1,"title":["On the Directed Degree-Preserving Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somnath","family":"Sikdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","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":"23_CR2","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2000","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, Heidelberg (2000)"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/S0097539799363359","volume":"32","author":"R. Bhatia","year":"2003","unstructured":"Bhatia, R., Khuller, S., 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"},{"key":"23_CR4","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":"23_CR5","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., Koppios, O., Kratsch, D., M\u00fcller, H., Tuinstra, H.: Degree-Preserving Forests. Networks\u00a035, 26\u201339 (2000)","journal-title":"Networks"},{"key":"23_CR6","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":"23_CR7","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-79228-4_42","volume-title":"Theory and Applications of Models of Computation","author":"S. Gaspers","year":"2008","unstructured":"Gaspers, S., Saurabh, S., Stepanov, A.A.: Moderately Exponential-Time Algorithm for Full-Degree Spanning Tree. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 478\u2013489. Springer, Heidelberg (2008)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/11847250_15","volume-title":"Parameterized and Exact Computation","author":"J. K\u00e1ra","year":"2006","unstructured":"K\u00e1ra, J., Kratochv\u00edl, J.: Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 166\u2013174. Springer, Heidelberg (2006)"},{"key":"23_CR10","unstructured":"Lokshtanov, D., Raman, V., Saurabh, S., Sikdar, S.: On the Directed Degree-Preserving Spanning Tree Problem. Tech. Report"},{"key":"23_CR11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"An Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: An Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"23_CR12","unstructured":"Pothof, I.W.M., Schut, J.: Graph-Theoretic Approach to Identifiability in a Water Distribution Network. Memorandum 1283, Universiteit Twente, Twente, The Netherlands (1995)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11269-0_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T21:33:44Z","timestamp":1675719224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11269-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642112683","9783642112690"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11269-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}