{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:07:56Z","timestamp":1725552476419},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121999"},{"type":"electronic","value":"9783642122002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12200-2_51","type":"book-chapter","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T13:53:05Z","timestamp":1271857985000},"page":"591-602","source":"Crossref","is-referenced-by-count":1,"title":["The Interval Constrained 3-Coloring Problem"],"prefix":"10.1007","author":[{"given":"Jaroslaw","family":"Byrka","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Karrenbauer","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"51_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0021-9673(02)01357-2","volume":"982","author":"T. Lam","year":"2002","unstructured":"Lam, T., Lanman, J., Emmett, M., Hendrickson, C., Marshall, A.G., Prevelige, P.: Mapping of protein:protein contact surfaces by hydrogen\/deuterium exchange, followed by on-line high-performance liquid chromatography-electrospray ionization fourier-transform ion-cyclotron-resonance mass analysis. Journal of Chromatography A\u00a0982(1), 85\u201395 (2002)","journal-title":"Journal of Chromatography A"},{"issue":"4","key":"51_CR2","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Althaus, E., Canzar, S., Emmett, M.R., Karrenbauer, A., Marshall, A.G., Meyer-Baese, A., Zhang, H.: Computing of H\/D-Exchange Speeds of Single Residues form Data of Peptic Fragments. In: Proceedings of the 23rd Annual ACM Symposium on Applied Computing 2008, pp. 1273\u20131277 (2008)","key":"51_CR3","DOI":"10.1145\/1363686.1363981"},{"key":"51_CR4","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., 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)"},{"issue":"3","key":"51_CR5","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM\u00a053(3), 324\u2013360 (2006)","journal-title":"J. ACM"},{"unstructured":"Canzar, S.: Lagrangian Relaxation - Solving NP-hard problems in Computational Biology via Combinatorial Optimization. PhD thesis, Universit\u00e4t des Saarlandes (2008)","key":"51_CR6"},{"key":"51_CR7","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)"},{"issue":"3","key":"51_CR8","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci.\u00a043(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"51_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I. Dinur","year":"2007","unstructured":"Dinur, I.: The pcp theorem by gap amplification. J. ACM\u00a054(3), 12 (2007)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","LATIN 2010: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12200-2_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:38Z","timestamp":1619784338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12200-2_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121999","9783642122002"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12200-2_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}