{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:40:19Z","timestamp":1734957619737,"version":"3.32.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01190901","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:57:59Z","timestamp":1108727879000},"page":"293-312","source":"Crossref","is-referenced-by-count":0,"title":["Single-layer cylindrical compaction"],"prefix":"10.1007","volume":"9","author":[{"given":"Richard","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Kahan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martine","family":"Schlag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"D. Boyer. Symbolic layout compaction review. InProceedings of the 15 th Design Automation Conference, pp. 383?389, 1988."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"R. Cole and A. Siegel. River routing every which way, but loose. InProceedings of the 25th Symposium on the Foundation of Computer Science, pp. 65?73, October 1984.","DOI":"10.1109\/SFCS.1984.715902"},{"key":"CR3","unstructured":"P. Eichenberger and M. Horowitz. Toroidal compaction of symbolic layouts for regular structures. InProceedings of the International Conference on Computer Aided Design, pp. 142?145, November 1987."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Z. Galil and E. Tardos. AnO(n 2(m+n logn) logn)min-cost flow algorithm. InProceedings of the 27th Symposium on Foundations of Computer Science, pp. 1?9, 1986.","DOI":"10.1109\/SFCS.1986.7"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"G. Kedem and H. Watanabe. Graph-optimization techniques for IC layout and compaction. InProceedings of the 20th Design Automation Conference, pp. 113?120, June 1983.","DOI":"10.1109\/DAC.1983.1585635"},{"key":"CR6","volume-title":"Master's thesis","author":"M. Kruckenberg","year":"1990","unstructured":"M. Kruckenberg. CMPT: a tile compactor for Magic files. Master's thesis, University of California, Santa Cruz, CA, June 1990."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson and F. Miller Maley. Algorithms for routing and testing routability of planar VLSI layouts. InProceedings of the 17th Symposium on the Theory of Computing, pp. 69?78, May 1985.","DOI":"10.1145\/22145.22153"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"T. Lengauer. The complexity of compacting hierarchically specified layouts of integrated circuits. InProceedings of the 23rd Symposium on Foundations of Computer Science, pp. 358?368, November 1982.","DOI":"10.1109\/SFCS.1982.92"},{"issue":"2","key":"CR9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TCAD.1983.1270022","volume":"2","author":"Y. Z. Liao","year":"1983","unstructured":"Y. Z. Liao and C. K. Wong. An algorithm to compact a VLSI symbolic layout with mixed constraints.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,2(2):62?69, April 1983.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn and S. N\u00e4her. A faster compaction algorithm with automatic jog insertion. InProceedings of the Advanced Research in VLSI Conference, pp. 297?314, 1988.","DOI":"10.7551\/mitpress\/1102.003.0024"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"F. Miller Maley. Compaction with automatic jog insertion. InProceedings of the Chapel Hill Conference on VLSI, pp. 261?283, May 1985.","DOI":"10.21236\/ADA176525"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"F. Miller Maley. Toward a mathematical theory of single-layer wire routing. InProceedings of the Advanced Research in VLSI Conference, pp. 277?296, 1988.","DOI":"10.7551\/mitpress\/1102.003.0023"},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/43.45870","volume":"9","author":"K. Mehlhorn","year":"1990","unstructured":"K. Mehlhorn and W. R\u00fclling. Compaction on the torus.IEEE Transaction on Computer-Aided Design,9(4):389?397, April 1990.","journal-title":"IEEE Transaction on Computer-Aided Design"},{"key":"CR14","volume-title":"Layout Design and Verification, Chapter 6","author":"D. Mlynski","year":"1986","unstructured":"D. Mlynski and C.-H. Sung. Layout compaction. In T. Ohtsuki, editor,Layout Design and Verification, Chapter 6. Elsevier (North Holland), Amsterdam, 1986."},{"issue":"2&3","key":"CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-9260(83)80019-4","volume":"1","author":"M. Schlag","year":"1983","unstructured":"M. Schlag, Y. Z. Liao, and C. K. Wong. An algorithm for optimal two dimensional compaction of VLSI layouts.integration, the VLSI Journal 1(2&3):179?209, October 1983.","journal-title":"integration, the VLSI Journal"},{"key":"CR16","first-page":"259","volume-title":"Advances in Computing Research: VLSI Theory, vol. 2","author":"M. Schlag","year":"1984","unstructured":"M. Schlag, F. Luccio, P. Maestrini, D. T. Lee, and C. K. Wong. A visibility problem in VLSI layout compaction. In F. P. Preparata, editor,Advances in Computing Research: VLSI Theory, vol. 2, pp. 259?282. JAI Press, Greenwich, 1984."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190901.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190901\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:17:12Z","timestamp":1734956232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01190901"],"URL":"https:\/\/doi.org\/10.1007\/bf01190901","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}