{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:47Z","timestamp":1725571307107},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_15","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"168-179","source":"Crossref","is-referenced-by-count":0,"title":["On the Approximability of the Maximum Interval Constrained Coloring Problem"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Canzar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Elbassioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amr","family":"Elmasry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-69903-3_20","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"E. Althaus","year":"2008","unstructured":"Althaus, E., Canzar, S., Elbassioni, K.M., Karrenbauer, A., Mestre, J.: Approximating the interval constrained coloring problem. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 210\u2013221. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Althaus, E., Canzar, S., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-B\u00e4se, A., Zhang, H.: Computing h\/d-exchange speeds of single residues from data of peptic fragments. In: SAC, pp. 1273\u20131277 (2008)","key":"15_CR2","DOI":"10.1145\/1363686.1363981"},{"unstructured":"Byrka, J., Karrebauer, A., Sanit\u00e0, L.: Hardness of interval constrained coloring. In: Proceedings of the 9th Latin American Theoretical Informatics Symposium, pp. 583\u2013592 (2009)","key":"15_CR3"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. Dilworth","year":"1950","unstructured":"Dilworth, R.: A decomposition theorem for partially ordered sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Elbassioni, K.M., Raman, R., Ray, S., Sitters, R.: On the approximability of the maximum feasible subsystem problem with 0\/1-coefficients. In: SODA, pp. 1210\u20131219 (2009)","key":"15_CR5","DOI":"10.1137\/1.9781611973068.131"},{"unstructured":"Althaus, E., Canzar, S., Ehrler, C., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-B\u00e4se, A., Tipton, J., Zhang, H.: Discrete fitting of hydrogen-deuterium-exchange-data of overlapping fragments. In: Proceedings of the 4th International Conference on Bioinformatics & Computational Biology, pp. 23\u201330 (2009)","key":"15_CR6"},{"key":"15_CR7","first-page":"23","volume-title":"ALENEX","author":"S. Canzar","year":"2010","unstructured":"Canzar, S., Elbassioni, K., Mestre, J.: A polynomial delay algorithm for enumerating approximate solutions to the interval constraint coloring problem. In: ALENEX, pp. 23\u201333. SIAM, Philadelphia (2010)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-02441-2_19","volume-title":"Combinatorial Pattern Matching","author":"C. Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Deconstructing intractability: A case study for interval constrained coloring. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 207\u2013220. Springer, Heidelberg (2009)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10288-008-0077-5","volume":"6","author":"D. Werra de","year":"2008","unstructured":"de\u00a0Werra, D., Costa, M.C., Picouleau, C., Ries, B.: On the use of graphs in discrete tomography. 4OR 6 (2008) 101\u2013123","journal-title":"4OR"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/net.20218","volume":"51","author":"C. Bentz","year":"2008","unstructured":"Bentz, C., Costa, M.C., de Werra, D., Picouleau, C., Ries, B.: On a graph coloring problem arising from discrete tomography. Networks\u00a051, 256\u2013267 (2008)","journal-title":"Networks"},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0012-365X(89)90196-9","volume":"74","author":"M. Albertson","year":"1989","unstructured":"Albertson, M., Jamison, R., Hedetniemi, S., Locke, S.: The subchromatic number of a graph. Discrete Mathematics\u00a074, 33\u201349 (1989)","journal-title":"Discrete Mathematics"},{"key":"15_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Algorithms and Combinatorics, vol.\u00a024. Springer, New York (2003)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048, 798\u2013859 (2001)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T17:03:20Z","timestamp":1553274200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}