{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:46:13Z","timestamp":1725795973313},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084039"},{"type":"electronic","value":"9783319084046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08404-6_28","type":"book-chapter","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T23:55:08Z","timestamp":1403654108000},"page":"319-330","source":"Crossref","is-referenced-by-count":9,"title":["Linear Time LexDFS on Cocomparability Graphs."],"prefix":"10.1007","author":[{"given":"Ekkehard","family":"K\u00f6hler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lalla","family":"Mouatadid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0012-365X(96)00070-2","volume":"171","author":"A. Brandst\u00e4dt","year":"1997","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Nicolai, F.: LexBFS-orderings and powers of chordal graphs. Discrete Mathematics\u00a0171(1), 27\u201342 (1997)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/11083856X","volume":"42","author":"D.G. Corneil","year":"2013","unstructured":"Corneil, D.G., Dalton, B., Habib, M.: LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs. SIAM Journal on Computing\u00a042(3), 792\u2013807 (2013)","journal-title":"SIAM Journal on Computing"},{"key":"28_CR3","unstructured":"Corneil, D.G., Dusart, J., Habib, M., K\u00f6hler, E.: On the power of graph searching for cocomparability graphs (in preparation)"},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/050623498","volume":"22","author":"D.G. Corneil","year":"2008","unstructured":"Corneil, D.G., Krueger, R.M.: A unified view of graph searching. SIAM Journal on Discrete Mathematics\u00a022(4), 1259\u20131276 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"4","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/S0895480100373455","volume":"23","author":"D.G. Corneil","year":"2009","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM Journal on Discrete Mathematics\u00a023(4), 1905\u20131953 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, vol.\u00a057. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: LexBFS and partition refinement, with applications to transitive orientation and consecutive ones testing. Theoretical Computer Science 234 (2000)","DOI":"10.1016\/S0304-3975(97)00241-7"},{"issue":"02","key":"28_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. International Journal of Foundations of Computer Science\u00a010(02), 147\u2013170 (1999)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"28_CR9","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"D. Kratsch","year":"1993","unstructured":"Kratsch, D., Stewart, L.: Domination on cocomparability graphs. SIAM Journal on Discrete Mathematics\u00a06(3), 400\u2013417 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201(1), 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"28_CR11","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1137\/100793529","volume":"26","author":"G.B. Mertzios","year":"2012","unstructured":"Mertzios, G.B., Corneil, D.G.: A simple polynomial algorithm for the longest path problem on cocomparability graphs. SIAM Journal on Discrete Mathematics\u00a026(3), 940\u2013963 (2012)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"28_CR12","unstructured":"Spinrad, J.P.: Efficient implementation of lexicographic depth first search (submitted)"},{"key":"28_CR13","unstructured":"K\u00f6hler, E., Mouatadid, L.: Linear time lexdfs on cocomparability graphs. available on arXiv at \n                  \n                    http:\/\/arxiv.org\/pdf\/1404.5996v1.pdf"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08404-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:09:52Z","timestamp":1558915792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08404-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084039","9783319084046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08404-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}