{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:13:39Z","timestamp":1725578019845},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"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-19094-0_20","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T01:21:40Z","timestamp":1297300900000},"page":"191-201","source":"Crossref","is-referenced-by-count":3,"title":["A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs"],"prefix":"10.1007","author":[{"given":"Esha","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00217-6","volume":"103","author":"N. Abbas","year":"2000","unstructured":"Abbas, N., Stewart, L.K.: Biconvex graphs: ordering and algorithms. Discrete Applied Mathematics\u00a0103(1-3), 1\u201319 (2000)","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(90)90064-5","volume":"35","author":"S. Rao Arikati","year":"1990","unstructured":"Rao Arikati, S., Pandu Rangan, C.: Linear algorithm for optimal path cover problem on interval graphs. Inf. Process. Lett.\u00a035(3), 149\u2013153 (1990)","journal-title":"Inf. Process. Lett."},{"key":"20_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM, Philadelphia (1999)"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","first-page":"27","volume-title":"Graph Theoretic Concepts in Computer Science","author":"S. Nikolopoulos","year":"2010","unstructured":"Nikolopoulos, S., Ioannidou, K.: The longest path problem is polynomial on cocomparability graphs. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 27\u201338. Springer, Heidelberg (2010)"},{"key":"20_CR5","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co., Amsterdam (2004)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-03816-7_35","volume-title":"Mathematical Foundations of Computer Science 2009","author":"K. Ioannidou","year":"2009","unstructured":"Ioannidou, K., Mertzios, G.B., Nikolopoulos, S.D.: The longest path problem is polynomial on interval graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 403\u2013414. Springer, Heidelberg (2009)"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J. Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math.\u00a018(3), 279\u2013292 (1987)","journal-title":"Discrete Appl. Math."},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-30551-4_74","volume-title":"Algorithms and Computation","author":"R. Uehara","year":"2004","unstructured":"Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 871\u2013883. Springer, Heidelberg (2004)"},{"issue":"5","key":"20_CR9","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1142\/S0129054107005054","volume":"18","author":"R. Uehara","year":"2007","unstructured":"Uehara, R., Uno, Y.: On computing longest paths in small graph classes. Int. J. Found. Comput. Sci.\u00a018(5), 911\u2013930 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ipl.2007.02.010","volume":"103","author":"R. Uehara","year":"2007","unstructured":"Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett.\u00a0103(2), 71\u201377 (2007)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T04:15:24Z","timestamp":1553400924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}