{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:14:48Z","timestamp":1764785688611,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031834370"},{"type":"electronic","value":"9783031834387"}],"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-83438-7_16","type":"book-chapter","created":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:50Z","timestamp":1738706210000},"page":"185-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms and\u00a0Hardness Results for\u00a0the\u00a0(3,\u00a01)-Cover Problem"],"prefix":"10.1007","author":[{"given":"Amirali","family":"Madani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Babak","family":"Miraftab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodhayan","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,5]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. American Elsevier Publishing Co., Inc., New York (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.7155\/jgaa.00527","volume":"24","author":"P Burkhardt","year":"2020","unstructured":"Burkhardt, P., Faber, V., Harris, D.G.: Bounds and algorithms for graph trusses. J. Graph Algorithms Appl. 24(3), 191\u2013214 (2020)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1137\/19M1286712","volume":"34","author":"D Chakraborti","year":"2020","unstructured":"Chakraborti, D., Loh, P.S.: Extremal graphs with local covering conditions. SIAM J. Discret. Math. 34(2), 1354\u20131374 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"16_CR4","unstructured":"Chakraborti, D., Madani, A., Maheshwari, A., Miraftab, B.: Sparse graphs with local covering conditions on edges. arXiv preprint arXiv:2409.11216 (2024)"},{"key":"16_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"16_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/J.COSREV.2023.100556","volume":"48","author":"C Crespelle","year":"2023","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48, 100556 (2023). https:\/\/doi.org\/10.1016\/J.COSREV.2023.100556","journal-title":"Comput. Sci. Rev."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Analytical approach to parallel repetition. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 624\u2013633 (2014)","DOI":"10.1145\/2591796.2591884"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/J.IC.2017.04.013","volume":"256","author":"PA Golovach","year":"2017","unstructured":"Golovach, P.A.: Editing to a connected graph of given degrees. Inf. Comput. 256, 131\u2013147 (2017). https:\/\/doi.org\/10.1016\/J.IC.2017.04.013","journal-title":"Inf. Comput."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.JCSS.2018.03.001","volume":"97","author":"P Goyal","year":"2018","unstructured":"Goyal, P., Misra, P., Panolan, F., Philip, G., Saurabh, S.: Finding even subgraphs even faster. J. Comput. Syst. Sci. 97, 1\u201313 (2018). https:\/\/doi.org\/10.1016\/J.JCSS.2018.03.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jcss.2011.02.001","volume":"78","author":"L Mathieson","year":"2012","unstructured":"Mathieson, L., Szeider, S.: Editing graphs to satisfy degree constraints: a parameterized approach. J. Comput. Syst. Sci. 78(1), 179\u2013191 (2012)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83438-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T21:56:52Z","timestamp":1738706212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83438-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031834370","9783031834387"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83438-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 February 2025","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":"Coimbatore","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam-2025-website.vercel.app\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}