{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T17:40:04Z","timestamp":1703958004092},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(00)00396-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:49Z","timestamp":1027591909000},"page":"341-359","source":"Crossref","is-referenced-by-count":6,"title":["On the design of efficient ATM routing schemes"],"prefix":"10.1016","volume":"270","author":[{"given":"Luca","family":"Becchetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Bertolazzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Gaibisso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Gambosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/S0304-3975(00)00396-0_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","article-title":"A partial k-arboretum of graphs with bounded tree-width","volume":"209","author":"Bodlaender","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB2","series-title":"A scalable approach to routing in ATM networks, Proc. of the 8th Internat. Workshop on Distributed Algorithms, Lecture Notes in Computer Science 857","first-page":"209","author":"Cidon","year":"1994"},{"issue":"6","key":"10.1016\/S0304-3975(00)00396-0_BIB3","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/90.556344","article-title":"The layout of virtual paths in ATM networks","volume":"4","author":"Cidon","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB4","series-title":"Asynchronous Transfer Mode: Solutions for Broadband ISDN","author":"de Prycker","year":"1993"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB5","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/jagm.1993.1013","article-title":"Edge separators of planar and outerplanar graphs with applications","volume":"14","author":"Diks","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB6","doi-asserted-by":"crossref","unstructured":"T. Eilam, M. Flammini, S. Zaks, Optimal layouts on a chain ATM network, Proc. of the 24th Internat. Colloquium on Algorithms, Languages and Programming \u2013 ICALP 97, Lecture Notes in Computer Science 1256, Springer, Berlin, 1997, pp. 527\u2013537.","DOI":"10.1007\/3-540-63165-8_208"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB7","doi-asserted-by":"crossref","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz, S. Tsch\u00f6ke, A better upper bound on the bisection width of the de Bruijn network, Proc. of the 14th Sympos. Theoretical Aspects of Computer Science, Lectures Notes in Computer Science 1200, Springer, Berlin, 1997, pp. 511\u2013522.","DOI":"10.1007\/BFb0023485"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB8","unstructured":"ATM Forum, ATM, User-Network Interface Specification. Version 3.0, Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB9","doi-asserted-by":"crossref","unstructured":"L. Gasienic, E. Kranakis, D. Krizanc, A. Pelc, Minimizing congestion of layouts for ATM networks with faulty links, Proc. of the 21st Symposium on Mathematical Foundations of Computer Science, Lectures Notes in Computer Science 1112, Springer, Berlin, 1996, pp. 372\u2013382.","DOI":"10.1007\/3-540-61550-4_163"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB10","doi-asserted-by":"crossref","unstructured":"O. Gerstel, Virtual Path Design in ATM Networks, Ph.D. Thesis, Technion-Haifa, Israel, 1995.","DOI":"10.1515\/9780773591158-011"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB11","doi-asserted-by":"crossref","unstructured":"O. Gerstel, A. Wool, S. Zaks, Optimal layouts on a chain ATM network, Proc. of the 3rd Ann. European Symp. on Algorithms, Lectures Notes in Computer Science 979, Springer, Berlin, 1995, pp. 508\u2013522.","DOI":"10.1007\/3-540-60313-1_167"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB12","doi-asserted-by":"crossref","unstructured":"O. Gerstel, S. Zaks, The virtual path layout problem in fast networks, Proc. of 13th ACM Conf. on Principles of Distributed Computing, 1994, pp. 235\u2013243.","DOI":"10.1145\/197917.198100"},{"issue":"2","key":"10.1016\/S0304-3975(00)00396-0_BIB13","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1137\/0608018","article-title":"Embedding outerplanar graphs in small books","volume":"8","author":"Heath","year":"1987","journal-title":"SIAM J. Algorithms Discrete Methods"},{"issue":"2","key":"10.1016\/S0304-3975(00)00396-0_BIB14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1142\/S0129054197000100","article-title":"Hop-congestion tradeoffs for ATM networks","volume":"8","author":"Kranakis","year":"1997","journal-title":"Internat. J. Foundations Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB15","series-title":"Introduction to Parallel Algorithms and Architectures","author":"Leighton","year":"1992"},{"key":"10.1016\/S0304-3975(00)00396-0_BIB16","series-title":"ATM: Theory and Applications","author":"McDysan","year":"1995"},{"issue":"1","key":"10.1016\/S0304-3975(00)00396-0_BIB17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1093\/comjnl\/36.1.19","article-title":"Feedback techniques for intra-media continuity and inter-media synchronization in distributed multimedia systems","volume":"36","author":"Ramanathan","year":"1993","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0166-218X(98)00031-6","article-title":"Bisecting de Bruijn and Kautz Graphs","volume":"85","author":"Rolim","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0166-218X(93)E0118-I","article-title":"Expanding and forwarding","volume":"58","author":"Sol\u00e9","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(95)00109-5","article-title":"Two remarks on \u201cExpanding and forwarding\u201d by P. Sol\u00e9","volume":"58","author":"Sol\u00e9","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB21","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1137\/S0097539796308151","article-title":"Virtual path layouts in ATM networks","volume":"29","author":"Stacho","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB22","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/0304-3975(93)90031-N","article-title":"Edge separators for graphs of bounded genus with applications","volume":"122","author":"Sykora","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00396-0_BIB23","doi-asserted-by":"crossref","unstructured":"S. Zaks, Path Layout in ATM Networks, Proc. of SOFSEM 97, Lecture Notes in Computer Science 1338, Springer, Berlin, 1997, pp. 144\u2013160.","DOI":"10.1007\/3-540-63774-5_103"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003960?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003960?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T17:25:26Z","timestamp":1703957126000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397500003960"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00396-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}