{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:09:27Z","timestamp":1755598167625},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_34","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T12:10:36Z","timestamp":1402488636000},"page":"405-416","source":"Crossref","is-referenced-by-count":7,"title":["Parameterized Complexity of Bandwidth on Trees"],"prefix":"10.1007","author":[{"given":"Markus Sortland","family":"Dregi","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"George, A., Liu, J.W.: Computer Solution of Large Sparse Positive Definite. Prentice Hall Professional Technical Reference (1981)"},{"key":"34_CR2","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 & Co., New York (1979)"},{"issue":"3","key":"34_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The np-completeness of the bandwidth minimization problem. Computing\u00a016(3), 263\u2013270 (1976)","journal-title":"Computing"},{"issue":"4","key":"34_CR4","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 Journal on Algebraic Discrete Methods\u00a07(4), 505\u2013512 (1986)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"1","key":"34_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. Journal of Computer and System Sciences\u00a077(1), 62\u201390 (2011)","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/3-540-44666-4_26","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"J. Dunagan","year":"2001","unstructured":"Dunagan, J., Vempala, S.: On euclidean embeddings and bandwidth minimization. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 229\u2013240. Springer, Heidelberg (2001)"},{"key":"34_CR7","unstructured":"Gupta, A.: Improved bandwidth approximation for trees. In: SODA, pp. 788\u2013793 (2000)"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s00453-007-9002-0","volume":"55","author":"U. Feige","year":"2009","unstructured":"Feige, U., Talwar, K.: Approximating the bandwidth of caterpillars. Algorithmica\u00a055(1), 190\u2013204 (2009)","journal-title":"Algorithmica"},{"issue":"4","key":"34_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J.B. Saxe","year":"1980","unstructured":"Saxe, J.B.: Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM Journal on Algebraic Discrete Methods\u00a01(4), 363\u2013369 (1980)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"4","key":"34_CR10","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci.\u00a063(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity, vol.\u00a03. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"34_CR12","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer-Verlag New York, Inc. (2006)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J.\u00a051(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"issue":"1-3","key":"34_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(89)90083-6","volume":"75","author":"F.R.K. Chung","year":"1989","unstructured":"Chung, F.R.K., Seymour, P.D.: Graphs with small bandwidth and cutwidth. Discrete Mathematics\u00a075(1-3), 113\u2013119 (1989)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"34_CR16","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/jcss.1999.1682","volume":"60","author":"U. Feige","year":"2000","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci.\u00a060(3), 510\u2013539 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fellows, M.R., Hallett, M.T.: Beyond np-completeness for problems of bounded width: hardness for the w hierarchy. In: STOC, pp. 449\u2013458 (1994)","DOI":"10.1145\/195058.195229"},{"issue":"50","key":"34_CR18","doi-asserted-by":"publisher","first-page":"7001","DOI":"10.1016\/j.tcs.2011.09.011","volume":"412","author":"P.A. Golovach","year":"2011","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Lokshtanov, D., Meister, D., Saurabh, S.: Bandwidth on at-free graphs. Theor. Comput. Sci.\u00a0412(50), 7001\u20137008 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"34_CR19","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/0602041","volume":"2","author":"S. Assmann","year":"1981","unstructured":"Assmann, S., Peck, G., Syslo, M., Zak, J.: The bandwidth of caterpillars with hairs of length 1 and 2. SIAM Journal on Algebraic Discrete Methods\u00a02(4), 387\u2013393 (1981)","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"issue":"4","key":"34_CR20","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. Discrete Algorithms\u00a07(4), 533\u2013544 (2009)","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"34_CR21","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 Journal on Discrete Mathematics\u00a03(3), 373\u2013375 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"34_CR22","unstructured":"Yan, J.H.: The bandwidth problem in cographs. Tamsui Oxford Journal of Mathematical Sciences\u00a0(13), 31\u201336 (1997)"},{"issue":"3","key":"34_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P.Z. Chinn","year":"1982","unstructured":"Chinn, P.Z., Chvatalova, J., Dewdney, A.K., Gibbs, N.E.: The bandwidth problem for graphs and matrices-a survey. Journal of Graph Theory\u00a06(3), 223\u2013254 (1982)","journal-title":"Journal of Graph Theory"},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Dregi, M.S., Lokshtanov, D.: Parameterized complexity of bandwidth on trees. CoRR abs\/1404.7810 (2014)","DOI":"10.1007\/978-3-662-43948-7_34"},{"issue":"1","key":"34_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(89)90083-6","volume":"75","author":"F.R. Chung","year":"1989","unstructured":"Chung, F.R., Seymour, P.D.: Graphs with small bandwidth and cutwidth. Discrete Mathematics\u00a075(1), 113\u2013119 (1989)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"34_CR26","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02090396","volume":"24","author":"J. Haralambides","year":"1991","unstructured":"Haralambides, J., Makedon, F., Monien, B.: Bandwidth minimization: an approximation algorithm for caterpillars. Mathematical Systems Theory\u00a024(1), 169\u2013177 (1991)","journal-title":"Mathematical Systems Theory"},{"key":"34_CR27","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, vol.\u00a057. Elsevier, Amsterdam (2004)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:19:22Z","timestamp":1558909162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}