{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:19:52Z","timestamp":1770290392540,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642215261","type":"print"},{"value":"9783642215278","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21527-8_34","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T11:01:16Z","timestamp":1315479676000},"page":"289-294","source":"Crossref","is-referenced-by-count":10,"title":["The Maximum Flow Problem with Conflict and Forcing Conditions"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Pferschy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Schauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-57182-5_21","volume-title":"Mathematical Foundations of Computer Science 1993","author":"H. Bodlaender","year":"1993","unstructured":"Bodlaender, H., Jansen, K.: On the complexity of scheduling incompatible jobs with unit-times. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 291\u2013300. Springer, Heidelberg (1993)"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.: Paths, trees and matchings under disjunctive constraints. Discrete Applied Mathematics (to appear, 2011)","DOI":"10.1016\/j.dam.2010.12.016"},{"key":"34_CR4","first-page":"422","volume-title":"SODA 1990: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D., Naor, D.: Efficient algorithms for generalized cut trees. In: SODA 1990: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 422\u2013433. SIAM, Philadelphia (1990)"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/A:1009871302966","volume":"3","author":"K. Jansen","year":"1999","unstructured":"Jansen, K.: An approximation scheme for bin packing with conflicts. Journal of Combinatorial Optimization\u00a03, 363\u2013377 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U. Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. Journal of Graph Algorithms and Applications\u00a013(2), 233\u2013249 (2009)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J.C. Picard","year":"1980","unstructured":"Picard, J.C., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Mathematical Programming Studies\u00a013, 8\u201316 (1980)","journal-title":"Mathematical Programming Studies"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T08:48:13Z","timestamp":1554194893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}