{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:39Z","timestamp":1725579039183},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"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-19222-7_5","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"38-42","source":"Crossref","is-referenced-by-count":6,"title":["Thread Graphs, Linear Rank-Width and Their Algorithmic Applications"],"prefix":"10.1007","author":[{"given":"Robert","family":"Ganian","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P. Chinn","year":"1982","unstructured":"Chinn, P., Chv\u00e1talov\u00e1, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices\u2014a survey. J. Graph Theory\u00a06, 223\u2013254 (1982)","journal-title":"J. Graph Theory"},{"key":"5_CR2","unstructured":"Ganian, R.: Thread graphs, linear rank-width and their algorithmic applications (manuscript), \n                  \n                    http:\/\/is.muni.cz\/www\/99352\/threadgraphs.pdf"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-10217-2_27","volume-title":"Combinatorial Algorithms","author":"R. Ganian","year":"2009","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: Better polynomial algorithms on graphs of bounded rank-width. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 266\u2013277. Springer, Heidelberg (2009)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On parse trees and Myhill\u2013Nerode\u2013type tools for handling graphs of bounded rank-width. Discrete Appl. Math. (2009) (to appear)","DOI":"10.1016\/j.dam.2009.10.018"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jagm.2000.1118","volume":"40","author":"A. Gupta","year":"2001","unstructured":"Gupta, A.: Improved bandwidth approximation for trees and chordal graphs. J. Algorithms\u00a040(1), 24\u201336 (2001)","journal-title":"J. Algorithms"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-02270-8_20","volume-title":"Frontiers in Algorithmics","author":"R. Mihai","year":"2009","unstructured":"Mihai, R., Todinca, I.: Pathwidth is np-hard for weighted trees. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 181\u2013195. Springer, Heidelberg (2009)"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TCBB.2008.121","volume":"6","author":"Q. Zhu","year":"2009","unstructured":"Zhu, Q., Adam, Z., Choi, V., Sankoff, D.: Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a06(2), 213\u2013220 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:12:09Z","timestamp":1558437129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}