{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:59Z","timestamp":1725600479079},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"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-22685-4_28","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"307-318","source":"Crossref","is-referenced-by-count":2,"title":["Bandwidth of Convex Bipartite Graphs and Related Graphs"],"prefix":"10.1007","author":[{"given":"Anish Man Singh","family":"Shrestha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Tayu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuichi","family":"Ueno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0602041","volume":"2","author":"S.F. Assmann","year":"1981","unstructured":"Assmann, S.F., Peck, G.W., Sys\u0142o, M.M., Zak, J.: The Bandwidth of Caterpillars with Hairs of Length 1 and 2. SIAM Journal on Algebraic and Discrete Methods\u00a02(4), 387\u2013393 (1981)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms. Journal of Computer and System Sciences\u00a013(3), 335\u2013379 (1976)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_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. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"issue":"1","key":"28_CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.21136\/CMJ.1970.100949","volume":"20","author":"V. Chv\u00e1tal","year":"1970","unstructured":"Chv\u00e1tal, V.: A Remark on a Problem of Harary. Czechoslovak Mathematical Journal\u00a020(1), 109\u2013111 (1970)","journal-title":"Czechoslovak Mathematical Journal"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jcss.2010.06.006","volume":"77","author":"C. Dubey","year":"2011","unstructured":"Dubey, C., Feige, U., Unger, W.: Hardness Results for Approximating the Bandwidth. J. Comput. Syst. Sci.\u00a077, 62\u201390 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.jda.2008.11.001","volume":"7","author":"P. Heggernes","year":"2009","unstructured":"Heggernes, P., Kratsch, D., Meister, D.: Bandwidth of Bipartite Permutation Graphs in Polynomial Time. J. of Discrete Algorithms\u00a07(4), 533\u2013544 (2009)","journal-title":"J. of Discrete Algorithms"},{"issue":"6","key":"28_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0020-0190(98)00173-2","volume":"68","author":"T. Kloks","year":"1998","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Bandwidth of Chain Graphs. Inf. Process. Lett.\u00a068(6), 313\u2013315 (1998)","journal-title":"Inf. Process. Lett."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jagm.1998.0997","volume":"32","author":"T. Kloks","year":"1999","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. Journal of Algorithms\u00a032, 41\u201357 (1999)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B. Monien","year":"1986","unstructured":"Monien, B.: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-complete. SIAM J. Algebraic Discrete Methods\u00a07(4), 505\u2013512 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.: The NP-Completeness of the Bandwidth Minimization Problem. Computing\u00a016, 263\u2013270 (1976)","journal-title":"Computing"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1016\/j.dam.2010.06.002","volume":"158","author":"A.M.S. Shrestha","year":"2010","unstructured":"Shrestha, A.M.S., Tayu, S., Ueno, S.: On Orthogonal Ray Graphs. Discrete Appl. Math.\u00a0158, 1650\u20131659 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"28_CR12","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."},{"issue":"2","key":"28_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/S0895480192232333","volume":"7","author":"A.P. Sprague","year":"1994","unstructured":"Sprague, A.P.: An O(n logn) Algorithm for Bandwidth of Interval Graphs. SIAM J. Discrete Math.\u00a07(2), 213\u2013220 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1007\/978-3-540-92182-0_72","volume-title":"Algorithms and Computation","author":"R. Uehara","year":"2008","unstructured":"Uehara, R.: Bandwidth of Bipartite Permutation Graphs. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 824\u2013835. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T03:49:11Z","timestamp":1638244151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}