{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:00:33Z","timestamp":1742929233433,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031086229"},{"type":"electronic","value":"9783031086236"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08623-6_15","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:24Z","timestamp":1661756784000},"page":"95-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Knapsack Problem with\u00a0Special Neighbor Constraints on\u00a0Directed Co-graphs"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Goebbels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Gurski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Komander","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-25011-8_6","volume-title":"Combinatorial Algorithms","author":"G Borradaile","year":"2011","unstructured":"Borradaile, G., Heeringa, B., Wilfong, G.: The 1-neighbour knapsack problem. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol. 7056, pp. 71\u201384. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25011-8_6"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jda.2012.04.011","volume":"16","author":"G Borradaile","year":"2012","unstructured":"Borradaile, G., Heeringa, B., Wilfong, G.: The knapsack problem with neighbour constraints. J. Discrete Algorithms 16, 224\u2013235 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"1\u20133","key":"15_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1016\/j.dam.2006.03.005","volume":"154","author":"C Crespelle","year":"2006","unstructured":"Crespelle, C., Paul, C.: Fully dynamic recognition algorithm and certificate for directed cographs. Discrete Appl. Math. 154(12), 1722\u20131741 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00186-021-00767-5","volume":"95","author":"S Goebbels","year":"2021","unstructured":"Goebbels, S., Gurski, F., Komander, D.: The knapsack problem with special neighbor constraints. Math. Meth. Oper. Res. 95(1), 1\u201334 (2021). https:\/\/doi.org\/10.1007\/s00186-021-00767-5","journal-title":"Math. Meth. Oper. Res."},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s10878-018-0262-1","volume":"36","author":"L Gourv\u00e8s","year":"2018","unstructured":"Gourv\u00e8s, L., Monnot, J., Tlilane, L.: Subset sum problems with digraph constraints. J. Comb. Optim. 36(3), 937\u2013964 (2018). https:\/\/doi.org\/10.1007\/s10878-018-0262-1","journal-title":"J. Comb. Optim."},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s00186-020-00718-6","volume":"92","author":"F Gurski","year":"2020","unstructured":"Gurski, F., Komander, D., Rehs, C.: Solutions for subset sum problems with special digraph constraints. Math. Meth. Oper. Res. 92(2), 401\u2013433 (2020). https:\/\/doi.org\/10.1007\/s00186-020-00718-6","journal-title":"Math. Meth. Oper. Res."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R., Lawler, E.: The recognition of series-parallel digraphs. SIAM J. Comput. 11, 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08623-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:07:38Z","timestamp":1661756858000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08623-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086229","9783031086236"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08623-6_15","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.or2021.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}