{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:23:00Z","timestamp":1755220980557,"version":"3.43.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1023\/a:1011188411132","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T03:43:03Z","timestamp":1040614983000},"page":"57-75","source":"Crossref","is-referenced-by-count":36,"title":["Optimization of Dynamic Hardware Reconfigurations"],"prefix":"10.1007","volume":"19","author":[{"given":"J\u00fcrgen","family":"Teich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Schepers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Atmel. AT6000 FPGA cofiguration guide. Atmel Inc. [Atm]","key":"333398_CR1"},{"key":"333398_CR2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"J. E. Beasley","year":"1985","unstructured":"J. E. Beasley. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33:49-64, 1985. [Bea85]","journal-title":"Operations Research"},{"key":"333398_CR3","series-title":"Technical Report","volume-title":"Partial FPGA rearrangement by local repacking","author":"O. Diessel","year":"1997","unstructured":"O. Diessel and H. El Ghindy. Partial FPGA rearrangement by local repacking. Technical Report 97-08, Dept. of Comp. Sci and Software Eng., Univ. of Newcastle, Australia, September 1997. [DG97a]"},{"doi-asserted-by":"crossref","unstructured":"O. Diessel and H. El Ghindy. Run-time compaction of FPGA designs. In Proc. of FPL'97-the 7th Int. Workshop on field-programmable logic and applications, pages 131-140, Berlin, 1997. [DG97b]","key":"333398_CR4","DOI":"10.1007\/3-540-63465-7_218"},{"key":"333398_CR5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-63397-9_12","volume":"1284","author":"S. P. Fekete","year":"1997","unstructured":"S. P. Fekete and J. Schepers. A new exact algorithm for general orthogonal d-dimensional knapsack problems. In Algorithms\u2013ESA '97, volume 1284, pages 144-156, Springer Lecture Notes in Computer Science, 1997. [FS97]","journal-title":"Algorithms\u2013ESA '97"},{"key":"333398_CR6","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-69346-7_20","volume":"1412","author":"S. P. Fekete","year":"1998","unstructured":"S. P. Fekete and J. Schepers. New classes of lower bounds for bin packing problems. In Integer programming and Combinatorial Optimization (IPCO'98), volume 1412, pages 257-270, Springer Lecture Notes in Computer Science, 1998. [FS98a]","journal-title":"Integer programming and Combinatorial Optimization (IPCO'98)"},{"unstructured":"S. P. Fekete and J. Schepers. On more-dimensional packing I: Modeling. Technical Report 97-288, Angewandte Mathematik und Informatik, Universit\u00e4t K\u00f6ln, Available at http:\/\/www.zpr.unikoeln.de\/\u223cpaper, 1998. [FS98b]","key":"333398_CR7"},{"unstructured":"S. P. Fekete and J. Schepers. On more-dimensional packing II: Bounds. Technical Report 97-289, Angewandte Mathematik und Informatik, Universit\u00e4t K\u00f6ln, Available at http:\/\/www.zpr.unikoeln.de\/\u223cpaper, 1998. [FS98c]","key":"333398_CR8"},{"unstructured":"S. P. Fekete and J. Schepers. On more-dimensional packing III: Exact algorithms. Technical Report 97-290, Angewandte Mathematik und Informatik, Universit\u00e4t K\u00f6ln, Available at http:\/\/www.zpr.unikoeln.de\/\u223cpaper, 1998. [FS98d]","key":"333398_CR9"},{"key":"333398_CR10","first-page":"1370","volume":"254","author":"A. Ghouil\u00e0-Houri","year":"1962","unstructured":"A. Ghouil\u00e0-Houri. Caract\u00e9rization des graphes non orient\u00e9s dont on peut orienter les arr\u00eates de mani\u00e8re \u00e0 obtenir le graphe d'une relation d'ordre. C.R. Acad. Sci. Paris, 254:1370-1371, 1962. [GH62]","journal-title":"C.R. Acad. Sci. Paris"},{"key":"333398_CR11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P. C. Gilmore","year":"1964","unstructured":"P. C. Gilmore and A. J. Hoffmann. A characterization of comparability graphs and of interval graphs. Canadian Journal of Mathematics, 16:539-548, 1964. [GH64]","journal-title":"Canadian Journal of Mathematics"},{"key":"333398_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979. [GJ79]"},{"key":"333398_CR13","volume-title":"Algorithmic graph theory and perfect graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, New York, 1980. [Gol80]"},{"key":"333398_CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E. Hadjiconstantinou","year":"1995","unstructured":"E. Hadjiconstantinou and N. Christofides. An exact algorithm for general, orthogonal, twodimensional knapsack problems. European Journal of Operations Research, 83:39-56, 1995. [HC95]","journal-title":"European Journal of Operations Research"},{"unstructured":"C.-H. Huang and J.-Y. Juang. A partial compaction scheme for processor allocation in hypercube multiprocessors. In Proc. of 1990 Int. Conf. on Parallel Proc., pages 211-217, 1990. [HJ90]","key":"333398_CR15"},{"unstructured":"G. M. Megson and D. Comish. Systolic Algorithm Design Environments (SADEs), chapter 9, Transformational Approaches to Systolic Design, pages 205-239. 1994. [MC94]","key":"333398_CR16"},{"key":"333398_CR17","volume-title":"Multidimensional Piecewise Regular Arrays","author":"T. Plaks","year":"1997","unstructured":"T. Plaks. Multidimensional Piecewise Regular Arrays. PhD thesis, Chalmers University of Technology, G\u00f6teborg, Sweden, April 1997. [Pla97]"},{"unstructured":"J. Schepers. Exakte Algorithmen f\u00fcr orthogonale Packungsprobleme. Technical Report 97-302, Doctoral thesis, Angewandte Mathematik und Informatik, Universit\u00e4t K\u00f6ln, 1997. [Sch97]","key":"333398_CR18"},{"unstructured":"J. Teich. A Compiler for Application-Specific Processor Arrays. Shaker (Reihe Elektrotechnik). Zugl. Saarbr\u00fccken, Univ. Diss, ISBN 3-86111-701-0, Aachen, Germany, 1993. [Tei93]","key":"333398_CR19"},{"unstructured":"J. Teich, S. F. Fekete, and J. Schepers. Optimizing dynamic hardware cofigurations. Technical Report 98-336, Angewandte Mathematik und Informatik, Universit\u00e4t K\u00f6ln, Available at http:\/\/www. zpr.uni-koeln.de\/\u223cpaper, 1998. [TFS98]","key":"333398_CR20"},{"issue":"1","key":"333398_CR21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1007935215591","volume":"17","author":"J. Teich","year":"1997","unstructured":"J. Teich, L. Thiele, and L. Zhang. Partitioning processor arrays under resource constraints. Int. Journal on VLSI and Signal Processing Systems, 17(1):5-20, 1997. [TTZ97]","journal-title":"Int. Journal on VLSI and Signal Processing Systems"},{"unstructured":"Xilinx. XC6200 field programmable gate arrays. Technical report, Xilinx, Inc., October 1996. [Xil96]","key":"333398_CR22"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011188411132.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011188411132\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011188411132.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:31:57Z","timestamp":1754631117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011188411132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["333398"],"URL":"https:\/\/doi.org\/10.1023\/a:1011188411132","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}