{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:02:33Z","timestamp":1709812953429},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,5,12]],"date-time":"2011-05-12T00:00:00Z","timestamp":1305158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10878-011-9401-7","type":"journal-article","created":{"date-parts":[[2011,5,11]],"date-time":"2011-05-11T12:24:32Z","timestamp":1305116672000},"page":"459-467","source":"Crossref","is-referenced-by-count":2,"title":["On the complexity of path problems in properly colored directed graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Donatella","family":"Granata","sequence":"first","affiliation":[]},{"given":"Behnam","family":"Behdani","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,12]]},"reference":[{"key":"9401_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-68279-0_8","volume-title":"50 years of integer programming 1958\u20132008","author":"RM Karp","year":"2010","unstructured":"Karp RM (2010) Reducibility among combinatorial problems. In: 50 years of integer programming 1958\u20132008. Springer, Berlin, pp 219\u2013241"},{"key":"9401_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1137\/0222015","volume":"22","author":"J Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl J, Savick\u00fd P, Tuza Z (1993) One more occurrence of variables makes satisfiability jump from trivial to NP-complete. SIAM J Comput 22:203\u2013210","journal-title":"SIAM J Comput"},{"key":"9401_CR3","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/PL00007256","volume":"17","author":"H Li","year":"2001","unstructured":"Li H (2001) A generalization of the Gallai\u2013Roy theorem. Graphs Comb 17:681\u2013685","journal-title":"Graphs Comb"},{"key":"9401_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou CH (1977) The Euclidean traveling salesman problem is NP-complete. Theor Comput Sci 4:237\u2013244","journal-title":"Theor Comput Sci"},{"key":"9401_CR5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0893-9659(04)90003-1","volume":"17","author":"PM Pardalos","year":"2004","unstructured":"Pardalos PM, Migdalas A (2004) A note on the complexity of longest path problems related to graph coloring. Appl Math Lett 17:13\u201315","journal-title":"Appl Math Lett"},{"key":"9401_CR6","first-page":"331","volume-title":"Handbook of combinatorial optimization","author":"PM Pardalos","year":"1998","unstructured":"Pardalos PM, Mavridou T, Xue J (1998) The graph coloring problem: a bibliographic survey. In: Handbook of combinatorial optimization, vol\u00a02. Kluwer Academic, Dordrecht, pp 331\u2013395"},{"key":"9401_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10288-004-0043-9","volume":"3","author":"D Werra","year":"2005","unstructured":"Werra D, Hansen P (2005) Variations on the Roy-Gallai theorem. 4OR 3:243\u2013251","journal-title":"4OR"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9401-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9401-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9401-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9401-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,12]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9401"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9401-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,12]]}}}