{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T14:40:06Z","timestamp":1736520006790,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_4","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"27-37","source":"Crossref","is-referenced-by-count":0,"title":["Embedding Bounded Bandwidth Graphs into \u21131"],"prefix":"10.1007","author":[{"given":"Douglas E.","family":"Carroll","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Goel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Meyerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Badoiu, M., Dhamdhere, K., Gupta, A., Rabinovich, Y., Raecke, H., Ravi, R., Sidiropoulos, A.: Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 119\u2013128 (2005)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H. Bodlaender","year":"1998","unstructured":"Bodlaender, H.: A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science\u00a0209, 1\u201345 (1998)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","first-page":"144","volume":"3","author":"H. Bodlaender","year":"1999","unstructured":"Bodlaender, H.: A Note On Domino Treewidth. Discrete Mathematics and Theoretical Computer Science\u00a03, 144\u2013150 (1999)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF02776078","volume":"52","author":"J. Bourgain","year":"1985","unstructured":"Bourgain, J.: On Lipschitz Embeddings of Finite Metric Spaces in Hilbert Space. Israel Journal of Mathematics\u00a052, 46\u201352 (1985)","journal-title":"Israel Journal of Mathematics"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BF02766125","volume":"56","author":"J. Bourgain","year":"1986","unstructured":"Bourgain, J.: The Metrical Interpretation of Superreflexivity in Banach Spaces. Israel Journal of Mathematics\u00a056, 222\u2013230 (1986)","journal-title":"Israel Journal of Mathematics"},{"key":"4_CR6","unstructured":"Chekuri, C., Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Embedding k-Outerplanar Graphs into \u21131. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 527\u2013536 (2003)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(89)90083-6","volume":"75","author":"F. Chung","year":"1989","unstructured":"Chung, F., Seymour, P.: Graphs with Small Bandwidth and Cutwidth. Discrete Mathematics\u00a075, 113\u2013119 (1989)","journal-title":"Discrete Mathematics"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U.: Approximating the bandwidth via volume respecting embeddings. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 90-99 (1998)","DOI":"10.1145\/276698.276716"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and \u2113 -embeddings. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 399-408 (1999)","DOI":"10.1109\/SFFCS.1999.814611"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Indyk, P.: Algorithmic Aspects of Geometric Embeddings. In: Proceedings of the 42th Annual IEEE Symposium on Foundations of Computer Science, pp. 10-33 (2001)","DOI":"10.1109\/SFCS.2001.959878"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica\u00a015, 215\u2013245 (1995)","journal-title":"Combinatorica"},{"key":"4_CR12","unstructured":"Nakhleh, L., Warnow, T., Linder, C.R., St, K.: John, Reconstructing reticulate evolution in species - theory and practice, Journal of Computational Biology (to appear)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.: Multicommodity Flows in Planar Graphs. Journal of Combinatorial Theory Series B\u00a031, 75\u201381 (1981)","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Rabinovich, Y.: On Average Distortion of Embedding Metrics into the Line and into \u2113. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 456-462 (2003)","DOI":"10.1145\/780542.780609"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Rao, S.: Small distortion and volume preserving embeddings for Planar and Euclidean metrics. In: Proceedings of the 15th Annual Symposium on Computational Geometry, pp. 300-306 (1999)","DOI":"10.1145\/304893.304983"},{"key":"4_CR16","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.: Graph Minors II. Algorithmic Aspects of Tree-Width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T16:15:00Z","timestamp":1736439300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11786986_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}