{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:47Z","timestamp":1725637427691},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"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-25870-1_25","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T08:32:45Z","timestamp":1322641965000},"page":"271-282","source":"Crossref","is-referenced-by-count":1,"title":["Approximability of the Path-Distance-Width for AT-free Graphs"],"prefix":"10.1007","author":[{"given":"Yota","family":"Otachi","sequence":"first","affiliation":[]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[]},{"given":"Katsuhisa","family":"Yamanaka","sequence":"additional","affiliation":[]},{"given":"Shuji","family":"Kijima","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[]},{"given":"Koichi","family":"Yamazaki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem, ECCC TR98-014 (1998)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"25_CR3","first-page":"161","volume":"67","author":"J.M. Chang","year":"2003","unstructured":"Chang, J.M., Ho, C.W., Ko, M.T.: Powers of asteroidal triple-free graphs with applications. Ars Combin.\u00a067, 161\u2013173 (2003)","journal-title":"Ars Combin."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"D.G. Corneil","year":"1995","unstructured":"Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P.: Simple linear time recognition of unit interval graphs. Inform. Process. Lett.\u00a055, 99\u2013104 (1995)","journal-title":"Inform. Process. Lett."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math.\u00a010, 399\u2013430 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/S0097539795282377","volume":"28","author":"D.G. Corneil","year":"1999","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput.\u00a028, 1284\u20131297 (1999)","journal-title":"SIAM J. Comput."},{"key":"25_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-642-10631-6_59","volume-title":"Algorithms and Computation","author":"P. Golovach","year":"2009","unstructured":"Golovach, P., Heggernes, P., Kratsch, D., Lokshtanov, D., Meister, D., Saurabh, S.: Bandwidth on AT-Free Graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 573\u2013582. Springer, Heidelberg (2009)"},{"key":"25_CR9","first-page":"87","volume":"14","author":"P. Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic J. Comput.\u00a014, 87\u2013108 (2007)","journal-title":"Nordic J. Comput."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S.: The NP-completeness column: An ongoing guide. J. Algorithms\u00a06, 434\u2013451 (1985)","journal-title":"J. Algorithms"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1137\/S0097539793258143","volume":"25","author":"H. Kaplan","year":"1996","unstructured":"Kaplan, H., Shamir, R.: Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques. SIAM J. Comput.\u00a025, 540\u2013561 (1996)","journal-title":"SIAM J. Comput."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0403033","volume":"3","author":"D.J. Kleitman","year":"1990","unstructured":"Kleitman, D.J., Vohra, R.V.: Computing the bandwidth of interval graphs. SIAM J. Discrete Math.\u00a03, 373\u2013375 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR13","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. J. Algorithms\u00a032, 41\u201357 (1999)","journal-title":"J. Algorithms"},{"key":"25_CR14","unstructured":"Kobayashi, Y.: Private communication (September 2010)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0890-5401(91)90045-4","volume":"95","author":"R. Mahesh","year":"1991","unstructured":"Mahesh, R., Rangan, C.P., Srinivasan, A.: On finding the minimum bandwidth of interval graphs. Inform. and Comput.\u00a095, 218\u2013224 (1991)","journal-title":"Inform. and Comput."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0166-218X(97)00041-3","volume":"79","author":"A. Parra","year":"1997","unstructured":"Parra, A., Scheffler, P.: Characterizations and algorithmic applications of chordal graph embeddings. Discrete Appl. Math.\u00a079, 171\u2013188 (1997)","journal-title":"Discrete Appl. Math."},{"key":"25_CR17","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, 213\u2013220 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0166-218X(00)00275-4","volume":"110","author":"K. Yamazaki","year":"2001","unstructured":"Yamazaki, K.: On approximation intractability of the path-distance-width problem. Discrete Appl. Math.\u00a0110, 317\u2013325 (2001)","journal-title":"Discrete Appl. Math."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/PL00009273","volume":"24","author":"K. Yamazaki","year":"1999","unstructured":"Yamazaki, K., Bodlaender, H.L., de Fuiter, B., Thilikos, D.M.: Isomorphism for graphs of bounded distance width. Algorithmica\u00a024, 105\u2013127 (1999)","journal-title":"Algorithmica"}],"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-25870-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T00:04:48Z","timestamp":1560989088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}