{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:39Z","timestamp":1725663099711},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16766-8_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:55:05Z","timestamp":1330196105000},"page":"96-107","source":"Crossref","is-referenced-by-count":4,"title":["Diogenes, circa 1986 \u03a8\u03b1\u03c7\u03bd\u03c9 \u03b3\u03b9\u03b1 \u03b5\u03bd\u03b1 \u03c4\u03b9\u03bc\u03b9o \u03b1\u03bd\u03d1\u03c1o\u03c0o"],"prefix":"10.1007","author":[{"given":"Arnold L.","family":"Rosenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"F. Bernhart and P.C. Kainen (1979): The book thickness of a graph. J. Comb. Th. (B) 27, 320\u2013331.","journal-title":"J. Comb. Th. (B)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"J. Buss and P. Shor (1984): On the pagenumber of planar graphs. 16th ACM Symp. on Theory of Computing, 98\u2013100.","DOI":"10.1145\/800057.808670"},{"key":"9_CR3","unstructured":"F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1983): DIOGENES \u2014 A methodology for designing fault-tolerant processor arrays. 13th Intl. Conf. on Fault-Tolerant Computing, 26\u201332."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1986): Embedding graphs in books: A layout problem with applications to VLSI design. SIAM J. Algebr. Discr. Meth., to appear.","DOI":"10.1137\/0608002"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Z. Galil, R. Kannan, E. Szemeredi (1986): On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines. 18th Ann. ACM Symp. on Theory of Computing.","DOI":"10.1145\/12130.12135"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"R.A. Games (1986): Optimal book embeddings of the FFT butterfly, Benes, and barrel shifter networks. Algorithmica, to appear.","DOI":"10.1007\/BF01840445"},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.R. Garey","year":"1980","unstructured":"M.R. Garey, D.S. Johnson, G.L. Miller, C.H. Papadimitriou (1980): The complexity of coloring circular arcs and chords. SIAM J. Algebr. Discr. Meth. 1, 216\u2013227.","journal-title":"SIAM J. Algebr. Discr. Meth."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"L.S. Heath (1984): Embedding planar graphs in seven pages. 25th IEEE Symp. on Foundations of Computer Science, 74\u201383.","DOI":"10.1109\/SFCS.1984.715903"},{"key":"9_CR9","unstructured":"L.S. Heath (1985): Algorithms for Embedding Graphs in Books. Ph.D. Dissertation, Univ. of North Carolina."},{"key":"9_CR10","unstructured":"L.S. Heath (1985): Embedding outerplanar graphs in small books. Typescript, MIT."},{"key":"9_CR11","unstructured":"L.S. Heath and A.L. Rosenberg (1985): Q-graphs. Typescript, MIT."},{"key":"9_CR12","unstructured":"D.J. Muder (1985): Book embeddings of regular complete bipartite graphs. Typescript, The MITRE Corp."},{"key":"9_CR13","unstructured":"A. Reibman (1984): DIOGENES layouts using queues. Typescript, Duke Univ."},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C-32","author":"A.L. Rosenberg","year":"1983","unstructured":"A.L. Rosenberg (1983): The DIOGENES approach to testable fault-tolerant arrays of processors. IEEE Trans. Comp., C-32, 902\u2013910.","journal-title":"IEEE Trans. Comp."},{"key":"9_CR15","unstructured":"A.L. Rosenberg (1984): On designing fault-tolerant VLSI processor arrays. Advances in Computing Research 2, (F.P. Preparata, ed.), JAI Press, Greenwich, CT, 181\u2013204."},{"key":"9_CR16","unstructured":"A.L. Rosenberg and B.T. Smith (1986): The DIOGENES design methodology: from embedding to layout. Rpt. CS-1986-13, Duke Univ.; submitted for publication."},{"key":"9_CR17","unstructured":"A. Wigderson (1982): The complexity of the hamiltonian circuit problem for maximal planar graphs. Princeton Univ. EECS Dept. Rpt. 298."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"M. Yannakakis (1986): Four pages are necessary and sufficient for planar graphs. 17th. ACM Symp. on Theory of Computing.","DOI":"10.1145\/12130.12141"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16766-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T17:44:34Z","timestamp":1687283074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}