{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:11:34Z","timestamp":1775272294572,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046507","type":"print"},{"value":"9783030046514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_13","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T14:56:50Z","timestamp":1542293810000},"page":"183-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Graph Problems with Obligations"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Cornet","sequence":"first","affiliation":[]},{"given":"Christian","family":"Laforest","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"2012","unstructured":"Ausiello, G., et al.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-58412-1"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-30140-0_19","volume-title":"Algorithms \u2013 ESA 2004","author":"M Chleb\u00edk","year":"2004","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 192\u2013203. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_19"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Cornet, A., Laforest, C.: Total domination, connected vertex cover and Steiner tree with conflicts. Discret. Math. Theor. Comput. Sci. 19(3), Article 17 (2017)","DOI":"10.23638\/DMTCS-19-3-17"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.dam.2018.03.018","volume":"244","author":"A Cornet","year":"2018","unstructured":"Cornet, A., Laforest, C.: Domination problems with no conflicts. Discret. Appl. Math. 244, 327\u2013338 (2018)","journal-title":"Discret. Appl. Math."},{"key":"13_CR6","unstructured":"Delbot, F., Laforest, C., Phan, R.: Hardness results and approximation algorithms for discrete optimization problems with conditional and unconditional forbidden vertices. Research report hal-01257820, January 2016"},{"key":"13_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, 4th edn. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","edition":"4"},{"key":"13_CR8","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman, New York (1979)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-35843-2_23","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Laforest, C., Mom\u00e8ge, B.: An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 257\u2013267. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35843-2_23"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-38236-9_31","volume-title":"Theory and Applications of Models of Computation","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Laforest, C., Mom\u00e8ge, B.: Trees in graphs with conflict edges or forbidden transitions. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 343\u2013354. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38236-9_31"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-662-53174-7_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MM Kant\u00e9","year":"2016","unstructured":"Kant\u00e9, M.M., Moataz, F.Z., Mom\u00e8ge, B., Nisse, N.: Finding paths in grids with forbidden transitions. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 154\u2013168. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_12"},{"issue":"13","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2871","DOI":"10.1016\/j.dam.2009.03.018","volume":"157","author":"P Kolman","year":"2009","unstructured":"Kolman, P., Pangr\u00e1c, O.: On the complexity of paths avoiding forbidden pairs. Discret. Appl. Math. 157(13), 2871\u20132876 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"10","key":"13_CR13","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.dam.2012.12.022","volume":"161","author":"J Kov\u00e1\u010d","year":"2013","unstructured":"Kov\u00e1\u010d, J.: Complexity of the path avoiding forbidden pairs problem revisited. Discret. Appl. Math. 161(10), 1506\u20131512 (2013)","journal-title":"Discret. Appl. Math."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-319-19315-1_23","volume-title":"Combinatorial Algorithms","author":"C Laforest","year":"2015","unstructured":"Laforest, C., Mom\u00e8ge, B.: Some hamiltonian properties of one-conflict graphs. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 262\u2013273. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19315-1_23"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-662-46078-8_27","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"C Laforest","year":"2015","unstructured":"Laforest, C., Mom\u00e8ge, B.: Nash-Williams-type and Chv\u00e1tal-type conditions in one-conflict graphs. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.-J., Wattenhofer, R. (eds.) SOFSEM 2015. LNCS, vol. 8939, pp. 327\u2013338. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_27"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: STOC, pp. 475\u2013484. ACM (1997)","DOI":"10.1145\/258533.258641"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(96)00017-0","volume":"74","author":"H Yinnone","year":"1997","unstructured":"Yinnone, H.: On paths avoiding forbidden pairs of vertices in a graph. Discret. Appl. Math. 74(1), 85\u201392 (1997)","journal-title":"Discret. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:31:52Z","timestamp":1775269912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}