{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:50Z","timestamp":1725543110016},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_39","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T09:41:33Z","timestamp":1155634893000},"page":"368-377","source":"Crossref","is-referenced-by-count":0,"title":["An Edge Ordering Problem of Regular Hypergraphs"],"prefix":"10.1007","author":[{"given":"Hongbing","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Kalbfleisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1287\/moor.6.3.445","volume":"6","author":"I. Barany","year":"1981","unstructured":"Barany, I.: A Vector-Sum Theorem and Its Application to Improving Flow Guarantees. Mathematics of Operations Research\u00a06, 445\u2013455 (1981)","journal-title":"Mathematics of Operations Research"},{"key":"39_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5145-4","volume-title":"Architecure and CAD for Deep-Submicron FPGAs","author":"V. Betz","year":"1999","unstructured":"Betz, V., Rose, J., Marquardt, A.: Architecure and CAD for Deep-Submicron FPGAs. Kluwer-Academic Publisher, Boston (1999)"},{"issue":"1","key":"39_CR3","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/225871.225886","volume":"1","author":"Y.W. Chang","year":"1996","unstructured":"Chang, Y.W., Wong, D.F., Wong, C.K.: Universal Switch Modules for FPGA Design. ACM Transactions on Design Automation of Electronic Systems\u00a01(1), 80\u2013101 (1996)","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1994.1067","volume":"113","author":"E. Contejean","year":"1994","unstructured":"Contejean, E., Devie, H.: An Efficient Incremental Algorithm for Solving Systems of Linear Diophantine Equations. Inform. and Comput.\u00a0113(1), 143\u2013172 (1994)","journal-title":"Inform. and Comput."},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TC.2003.1159751","volume":"52","author":"H. Fan","year":"2003","unstructured":"Fan, H., Liu, J., Wu, Y.L.: General Models and a Reduction Design Technique for FPGA Switch Box Designs. IEEE Transactions on Computers\u00a052(1), 21\u201330 (2003)","journal-title":"IEEE Transactions on Computers"},{"issue":"12","key":"39_CR6","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1109\/TCAD.2003.819430","volume":"22","author":"H. Fan","year":"2003","unstructured":"Fan, H., Liu, J., Wu, Y.L., Cheung, C.C.: On Optimal Hyper Universal and Rearrageable Switch Box Designs. IEEE Transactions on Computer Aided Designs\u00a022(12), 1637\u20131649 (2003)","journal-title":"IEEE Transactions on Computer Aided Designs"},{"issue":"4","key":"39_CR7","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/605440.605443","volume":"7","author":"H. Fan","year":"2002","unstructured":"Fan, H., Liu, J., Wu, Y.L., Wong, C.K.: Reduction Design for Generic Universal Switch Blocks. ACM Transactions on Design Automation of Electronic Systems\u00a07(4), 526\u2013546 (2002)","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"39_CR8","unstructured":"Hemmecke, R., Hemmecke, R., Malkin, P.: 4ti2 Version 1.2\u2014Computation of Hilbert bases, Graver bases, toric Gr\u00f6bner bases, and more (September 2005), available at: \n                      \n                        www.4ti2.de"},{"key":"39_CR9","first-page":"66","volume":"32","author":"S.V. Sevast\u2019yanov","year":"1978","unstructured":"Sevast\u2019yanov, S.V.: On Approximate Solutions of Scheduling Problems. Metody Discretnogo Analiza\u00a032, 66\u201375 (1978) (in Russian)","journal-title":"Metody Discretnogo Analiza"},{"issue":"11","key":"39_CR10","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/12.966502","volume":"50","author":"M. Yen","year":"2001","unstructured":"Yen, M., Chen, S., Lan, S.: A Three-Stage One-Sided Rearrangeable Polygonal Switching Network. IEEE Trans. on Computers\u00a050(11), 1291\u20131294 (2001)","journal-title":"IEEE Trans. on Computers"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:26:38Z","timestamp":1619493998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11809678_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}