{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:50:18Z","timestamp":1770994218167,"version":"3.50.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030392185","type":"print"},{"value":"9783030392192","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_34","type":"book-chapter","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:09:24Z","timestamp":1579910964000},"page":"427-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Parameterized Complexity of Spanning Trees with Small Vertex\u00a0Covers"],"prefix":"10.1007","author":[{"given":"Chamanvir","family":"Kaur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,24]]},"reference":[{"issue":"3","key":"34_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s11276-005-5275-x","volume":"12","author":"E Althaus","year":"2006","unstructured":"Althaus, E., C\u0103linescu, G., Mandoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wireless Netw. 12(3), 287\u2013299 (2006)","journal-title":"Wireless Netw."},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-662-48971-0_32","volume-title":"Algorithms and Computation","author":"E Angel","year":"2015","unstructured":"Angel, E., Bampis, E., Chau, V., Kononov, A.: Min-power covering problems. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 367\u2013377. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48971-0_32"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-662-53536-3_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Angel","year":"2016","unstructured":"Angel, E., Bampis, E., Escoffier, B., Lampis, M.: Parameterized power vertex cover. In: Heggernes, P. (ed.) WG 2016. LNCS, vol. 9941, pp. 97\u2013108. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53536-3_9"},{"issue":"6","key":"34_CR4","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1016\/j.disc.2011.11.043","volume":"312","author":"PS Bonsma","year":"2012","unstructured":"Bonsma, P.S., Zickfeld, F.: Improved bounds for spanning trees with many leaves. Discrete Math. 312(6), 1178\u20131194 (2012)","journal-title":"Discrete Math."},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-030-04693-4_9","volume-title":"Approximation and Online Algorithms","author":"G Calinescu","year":"2018","unstructured":"Calinescu, G., Kortsarz, G., Nutov, Z.: Improved approximation algorithms for minimum power covering problems. In: Epstein, L., Erlebach, T. (eds.) WAOA 2018. LNCS, vol. 11312, pp. 134\u2013148. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-04693-4_9"},{"key":"34_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"34_CR7","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-48749-6_6","volume-title":"Combinatorial Optimization and Applications","author":"T Fukunaga","year":"2016","unstructured":"Fukunaga, T., Maehara, T.: Computing a tree having a small vertex cover. In: Chan, T.-H.H., Li, M., Wang, L. (eds.) COCOA 2016. LNCS, vol. 10043, pp. 77\u201391. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-48749-6_6"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-33090-2_46","volume-title":"Algorithms \u2013 ESA 2012","author":"F Grandoni","year":"2012","unstructured":"Grandoni, F.: On min-power steiner tree. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 527\u2013538. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-33090-2_46"},{"issue":"5","key":"34_CR10","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/0220060","volume":"20","author":"J Ho","year":"1991","unstructured":"Ho, J., Lee, D.T., Chang, C., Wong, C.K.: Minimum diameter spanning trees and related problems. SIAM J. Comput. 20(5), 987\u2013997 (1991)","journal-title":"SIAM J. Comput."},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-319-77404-6_45","volume-title":"LATIN 2018: Theoretical Informatics","author":"J Iglesias","year":"2018","unstructured":"Iglesias, J., Rajaraman, R., Ravi, R., Sundaram, R.: Plane gossip: approximating rumor spread in planar graphs. LATIN 2018. LNCS, vol. 10807, pp. 611\u2013624. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77404-6_45"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/BFb0045375"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:15:49Z","timestamp":1579911349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}