{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:13:46Z","timestamp":1757621626079,"version":"3.44.0"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031925740"},{"type":"electronic","value":"9783031925757"}],"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-92575-7_25","type":"book-chapter","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T13:45:35Z","timestamp":1754919935000},"page":"181-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Covering of\u00a0Graphs of\u00a0Bounded Cycolomatic Number with\u00a0Preselected Paths"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2282-5914","authenticated-orcid":false,"given":"Christoph","family":"Geis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8726-9963","authenticated-orcid":false,"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972)","key":"25_CR1","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"7","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/390013.808479","volume":"5","author":"FE Allen","year":"1970","unstructured":"Allen, F.E.: Control flow analysis. SIGPLAN Not. 5(7), 1\u201319 (1970)","journal-title":"SIGPLAN Not."},{"doi-asserted-by":"crossref","unstructured":"McCabe, T.: A complexity measure. IEEE Trans. Softw. Eng. SE-2(4), 308\u2013320 (1976)","key":"25_CR3","DOI":"10.1109\/TSE.1976.233837"},{"doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, USA (1988)","key":"25_CR4","DOI":"10.1002\/9781118627372"},{"doi-asserted-by":"crossref","unstructured":"Jansen, B.: On structural parameterizations of hitting set: hitting paths in graphs using 2-sat. J. Graph Algorithms Appl. 21 (2015)","key":"25_CR5","DOI":"10.1007\/978-3-662-53174-7_33"},{"issue":"4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R Kannan","year":"1979","unstructured":"Kannan, R., Bachem, A.: Polynomial algorithms for computing the smith and hermite normal forms of an integer matrix. SIAM J. Comput. 8, 499\u2013507 (1979)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92575-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T15:24:12Z","timestamp":1757345052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92575-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031925740","9783031925757"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92575-7_25","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"12 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/or2024.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}