{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:43:33Z","timestamp":1725623013356},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"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-16926-7_5","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T02:48:26Z","timestamp":1289357306000},"page":"27-38","source":"Crossref","is-referenced-by-count":4,"title":["The Longest Path Problem is Polynomial on Cocomparability Graphs"],"prefix":"10.1007","author":[{"given":"Kyriaki","family":"Ioannidou","sequence":"first","affiliation":[]},{"given":"Stavros D.","family":"Nikolopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0020-0190(90)90064-5","volume":"35","author":"S.R. Arikati","year":"1990","unstructured":"Arikati, S.R., Pandu Rangan, C.: Linear algorithm for optimal path cover problem on interval graphs. Inform. Proc. Lett.\u00a035, 149\u2013153 (1990)","journal-title":"Inform. Proc. Lett."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Asdre, K., Nikolopoulos, S.D.: The 1-fixed-endpoint path cover problem is polynomial on interval graphs. Algorithmica, doi:10.1007\/s00453-009-9292-5","DOI":"10.1007\/s00453-009-9292-5"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0020-0190(83)90078-9","volume":"17","author":"A.A. Bertossi","year":"1983","unstructured":"Bertossi, A.A.: Finding Hamiltonian circuits in proper interval graphs. Inform. Proc. Lett.\u00a017, 97\u2013101 (1983)","journal-title":"Inform. Proc. Lett."},{"key":"5_CR4","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":"5_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0020-0190(01)00198-3","volume":"81","author":"R. Bulterman","year":"2002","unstructured":"Bulterman, R., van der Sommen, F., Zwaan, G., Verhoeff, T., van Gasteren, A., Feijen, W.: On computing a longest path in a tree. Inform. Proc. Lett.\u00a081, 93\u201396 (2002)","journal-title":"Inform. Proc. Lett."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1097-0037(199908)34:1<1::AID-NET1>3.0.CO;2-C","volume":"34","author":"M.S. Chang","year":"1999","unstructured":"Chang, M.S., Peng, S.L., Liaw, J.L.: Deferred-query: An efficient approach for some problems on interval graphs. Networks\u00a034, 1\u201310 (1999)","journal-title":"Networks"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(89)90059-8","volume":"32","author":"P. Damaschke","year":"1989","unstructured":"Damaschke, P.: The Hamiltonian circuit problem for circle graphs is NP-complete. Inform. Proc. Lett.\u00a032, 1\u20132 (1989)","journal-title":"Inform. Proc. Lett."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(93)90223-G","volume":"112","author":"P. Damaschke","year":"1993","unstructured":"Damaschke, P.: Paths in interval graphs and circular arc graphs. Discrete Math.\u00a0112, 49\u201364 (1993)","journal-title":"Discrete Math."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF00571188","volume":"8","author":"P. Damaschke","year":"1992","unstructured":"Damaschke, P., Deogun, J.S., Kratsch, D., Steiner, G.: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm. Order\u00a08, 383\u2013391 (1992)","journal-title":"Order"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1137\/S0097539791200375","volume":"23","author":"J.S. Deogun","year":"1994","unstructured":"Deogun, J.S., Steiner, G.: Polynomial algorithms for hamiltonian cycle in cocomparability graphs. SIAM J. Computing\u00a023, 520\u2013552 (1994)","journal-title":"SIAM J. Computing"},{"key":"5_CR11","first-page":"166","volume-title":"Proc. of the 16th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"T. Feder","year":"2005","unstructured":"Feder, T., Motwani, R.: Finding large cycles in Hamiltonian graphs. In: Proc. of the 16th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 166\u2013175. ACM, New York (2005)"},{"key":"5_CR12","first-page":"407","volume-title":"Proc. of the 36th Annual ACM Symp. on Theory of Computing (STOC)","author":"H.N. Gabow","year":"2004","unstructured":"Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. In: Proc. of the 36th Annual ACM Symp. on Theory of Computing (STOC), pp. 407\u2013416. ACM, New York (2004)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-540-92182-0_66","volume-title":"Algorithms and Computation","author":"H.N. Gabow","year":"2008","unstructured":"Gabow, H.N., Nie, S.: Finding long paths, cycles and circuits. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 752\u2013763. Springer, Heidelberg (2008)"},{"key":"5_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Computing\u00a05, 704\u2013714 (1976)","journal-title":"SIAM J. Computing"},{"key":"5_CR16","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":"5_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00337617","volume":"5","author":"M. Habib","year":"1988","unstructured":"Habib, M., M\u00f6rhing, R.H., Steiner, G.: Computing the bump number is easy. Order\u00a05, 107\u2013129 (1988)","journal-title":"Order"},{"key":"5_CR18","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 has a polynomial solution on interval graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 403\u2013414. Springer, Heidelberg (2009)"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1137\/0211056","volume":"11","author":"A. Itai","year":"1982","unstructured":"Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamiltonian paths in grid graphs. SIAM J. Computing\u00a011, 676\u2013686 (1982)","journal-title":"SIAM J. Computing"},{"key":"5_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719802","volume-title":"Topics in Intersection Graph Theory","author":"T.A. McKee","year":"1999","unstructured":"McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H. M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discrete Math.\u00a0156, 291\u2013298 (1996)","journal-title":"Discrete Math."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(89)90038-0","volume":"32","author":"G. Narasimhan","year":"1989","unstructured":"Narasimhan, G.: A note on the Hamiltonian circuit problem on directed path graphs. Inform. Proc. Lett.\u00a032, 167\u2013170 (1989)","journal-title":"Inform. Proc. Lett."},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1093\/ietisy\/e91-d.2.170","volume":"91-D","author":"Y. Takahara","year":"2008","unstructured":"Takahara, Y., Teramoto, S., Uehara, R.: Longest path problems on ptolemaic graphs. IEICE Trans. Inf. and Syst.\u00a091-D, 170\u2013177 (2008)","journal-title":"IEICE Trans. Inf. and Syst."},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-77891-2_3","volume-title":"WALCOM: Algorithms and Computation","author":"R. Uehara","year":"2008","unstructured":"Uehara, R.: Simple geometrical intersection graphs. In: Nakano, S.-i., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol.\u00a04921, pp. 25\u201333. Springer, Heidelberg (2008)"},{"key":"5_CR25","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)"},{"key":"5_CR26","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. Inform. Proc. Lett.\u00a0103, 71\u201377 (2007)","journal-title":"Inform. Proc. Lett."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2007.02.012","volume":"377","author":"Z. Zhang","year":"2007","unstructured":"Zhang, Z., Li, H.: Algorithms for long paths in graphs. Theoret. Comput. Sci.\u00a0377, 25\u201334 (2007)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:22:51Z","timestamp":1553214171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}