{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:31Z","timestamp":1740114451166,"version":"3.37.3"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:00:00Z","timestamp":1565913600000},"content-version":"vor","delay-in-days":1476,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"Max Planck Center for Visual Computing and Communication"},{"DOI":"10.13039\/501100001870","name":"FNP","doi-asserted-by":"publisher","award":["PLUS\/2010-1\/3"],"id":[{"id":"10.13039\/501100001870","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1016\/j.tcs.2015.04.037","type":"journal-article","created":{"date-parts":[[2015,6,6]],"date-time":"2015-06-06T11:17:20Z","timestamp":1433589440000},"page":"42-50","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The interval constrained 3-coloring problem"],"prefix":"10.1016","volume":"593","author":[{"given":"Jaroslaw","family":"Byrka","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Karrenbauer","sequence":"additional","affiliation":[]},{"given":"Laura","family":"Sanit\u00e0","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2015.04.037_br0010","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0021-9673(02)01357-2","article-title":"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","volume":"982","author":"Lam","year":"2002","journal-title":"J. Chromatogr. A"},{"key":"10.1016\/j.tcs.2015.04.037_br0020","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1186\/1471-2105-11-424","article-title":"Computing h\/d-exchange rates of single residues from data of proteolytic fragments","volume":"11","author":"Althaus","year":"2010","journal-title":"BMC Bioinformatics"},{"key":"10.1016\/j.tcs.2015.04.037_br0030","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2015.04.037_br0040","series-title":"Proceedings of the 23rd Annual ACM Symposium on Applied Computing","first-page":"1273","article-title":"Computing of H\/D-exchange speeds of single residues form data of peptic fragments","author":"Althaus","year":"2008"},{"key":"10.1016\/j.tcs.2015.04.037_br0050","series-title":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory","first-page":"210","article-title":"Approximating the interval constrained coloring problem","author":"Althaus","year":"2008"},{"key":"10.1016\/j.tcs.2015.04.037_br0060","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s00453-010-9406-0","article-title":"Approximation algorithms for the interval constrained coloring problem","volume":"61","author":"Althaus","year":"2011","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2015.04.037_br0070","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/1147954.1147956","article-title":"Dependent rounding and its applications to approximation algorithms","volume":"53","author":"Gandhi","year":"2006","journal-title":"J. ACM"},{"year":"2008","series-title":"Lagrangian relaxation \u2013 solving NP-hard problems in computational biology via combinatorial optimization","author":"Canzar","key":"10.1016\/j.tcs.2015.04.037_br0080"},{"key":"10.1016\/j.tcs.2015.04.037_br0090","series-title":"Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching","first-page":"207","article-title":"Deconstructing intractability \u2013 a case study for interval constrained coloring","volume":"vol. 5577","author":"Komusiewicz","year":"2009"},{"key":"10.1016\/j.tcs.2015.04.037_br0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2444016.2493372","article-title":"A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem","volume":"18","author":"Canzar","year":"2013","journal-title":"J. Exp. Algorithmics"},{"key":"10.1016\/j.tcs.2015.04.037_br0110","series-title":"Proceedings of the 9th Latin American Theoretical Informatics Symposium","article-title":"The interval constrained 3-coloring problem","author":"Byrka","year":"2010"},{"key":"10.1016\/j.tcs.2015.04.037_br0120","series-title":"Proceedings of ISAAC","first-page":"168","article-title":"On the approximability of the maximum interval constrained coloring problem","volume":"vol. 2","author":"Canzar","year":"2010"},{"key":"10.1016\/j.tcs.2015.04.037_br0130","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2015.04.037_br0140","doi-asserted-by":"crossref","DOI":"10.1145\/1236457.1236459","article-title":"The pcp theorem by gap amplification","volume":"54","author":"Dinur","year":"2007","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515004946?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515004946?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T19:35:49Z","timestamp":1569958549000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397515004946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":14,"alternative-id":["S0304397515004946"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2015.04.037","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2015,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The interval constrained 3-coloring problem","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2015.04.037","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}