{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T14:05:20Z","timestamp":1784383520632,"version":"3.55.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031987397","type":"print"},{"value":"9783031987403","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_25","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:29Z","timestamp":1752796109000},"page":"349-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Algorithms for\u00a0Power Edge Set and\u00a0Zero Forcing Set"],"prefix":"10.1007","author":[{"given":"Sriram","family":"Bhyravarapu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lawqueen","family":"Kanesh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madhumita","family":"Kundu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Brueni, D.J., Heath, L.S.: The pmu placement problem. SIAM J. Disc. Math. 19(3), 744\u2013761 (2005). https:\/\/doi.org\/10.1137\/S0895480103432556","DOI":"10.1137\/S0895480103432556"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-25005-8_11","volume-title":"Combinatorial Algorithms","author":"P Cazals","year":"2019","unstructured":"Cazals, P., Darties, B., Chateau, A., Giroudeau, R., Weller, M.: Power edge set and zero forcing set remain difficult in cubic graphs. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 122\u2013135. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_11"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90043-H","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol.\u00a05. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Darties, B., Champseix, N., Chateau, A., Giroudeau, R., Weller, M.: Complexity and lowers bounds for power edge set problem. J. Disc. Algor. 52-53, 70\u201391 (2018). https:\/\/doi.org\/10.1016\/j.jda.2018.11.006. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1570866718301667","DOI":"10.1016\/j.jda.2018.11.006"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Group, A.M.R.S.G.W., et\u00a0al.: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628\u20131648 (2008)","DOI":"10.1016\/j.laa.2007.10.009"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00453-007-9147-x","volume":"52","author":"J Guo","year":"2008","unstructured":"Guo, J., Niedermeier, R., Raible, D.: Improved algorithms and complexity results for power domination in graphs. Algorithmica 52(2), 177\u2013202 (2008). https:\/\/doi.org\/10.1007\/s00453-007-9147-x","journal-title":"Algorithmica"},{"key":"25_CR8","unstructured":"Harris, D.G., Narayanaswamy, N.S.: A faster algorithm for vertex cover parameterized by solution size (2024)"},{"issue":"4","key":"25_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Disc. Math. 15(4), 519\u2013529 (2002). https:\/\/doi.org\/10.1137\/S0895480100375831","journal-title":"SIAM J. Disc. Math."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012)","DOI":"10.1007\/s00453-011-9554-x"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Micali, S., Vazirani, V.V.: An o(sqrt($$\\vert $$v$$\\vert $$) $$\\vert $$e$$\\vert $$) algorithm for finding maximum matching in general graphs. In: 21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, USA, 13\u201315 October 1980, pp. 17\u201327. IEEE Computer Society (1980). https:\/\/doi.org\/10.1109\/SFCS.1980.12","DOI":"10.1109\/SFCS.1980.12"},{"issue":"3","key":"25_CR12","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s10878-017-0241-y","volume":"35","author":"S Toubaline","year":"2017","unstructured":"Toubaline, S., D\u2019Ambrosio, C., Liberti, L., Poirion, P.-L., Schieber, B., Shachnai, H.: Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3), 895\u2013905 (2017). https:\/\/doi.org\/10.1007\/s10878-017-0241-y","journal-title":"J. Comb. Optim."},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-26626-8_27","volume-title":"Combinatorial Optimization and Applications","author":"S Toubaline","year":"2015","unstructured":"Toubaline, S., Poirion, P.-L., D\u2019Ambrosio, C., Liberti, L.: Observing the state of a smart grid using bilevel programming. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 364\u2013376. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_27"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98740-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T13:58:10Z","timestamp":1784383090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozeman, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}