{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:39Z","timestamp":1725664119262},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_357","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:55:50Z","timestamp":1330275350000},"page":"64-75","source":"Crossref","is-referenced-by-count":5,"title":["Grid layouts of block diagrams \u2014 bounding the number of bends in each connection (extended abstract)"],"prefix":"10.1007","author":[{"given":"S.","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Granot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/00207168708803570","volume":"21","author":"A. Amihood","year":"1987","unstructured":"A. Amihood. A direct linear-time planarity test for unflippable modules. Intern. J. Computer Math., vol. 21, pp. 277\u2013290, 1987.","journal-title":"Intern. J. Computer Math."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. In Proc. of the Second Annual European Symposium (ESA '94), Lecture Notes in Computer Science, Vol. 855, pp. 24\u201335. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0049394"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, R. Tamassia, and I. G. Tollis. Constrained visibility representations of graphs. Information Processing Letters, vol. 41, pp. 1\u20137, 1992.","journal-title":"Information Processing Letters"},{"key":"7_CR4","unstructured":"S. Even and G. Granot. Rectilinear planar drawings with few bends in each edge. Technical Report 797, Computer Science Department, Technion, Israel Inst. of Tech., 1994. can be retrieved by anonymous ftp from ftp.technion.ac.il at directory \/pub\/supported\/cs\/Tech_Reports\/1994 as file TR797.ps.Z."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, vol. 2, pp. 339\u2013344, 1976.","journal-title":"Theoretical Computer Science"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0196-6774(85)90016-1","volume":"6","author":"Z. Miller","year":"1985","unstructured":"Z. Miller and J. B. Orlin. NP-completeness for minimizing maximum edge length in grid embeddings. Journal of Algorithms, vol. 6, pp. 10\u201316, 1985.","journal-title":"Journal of Algorithms"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"R. Y. Pinter. River routing: Methodology and analysis. In third CALTECH conference on Very Large Scale Integration, pp. 141\u2013163. Computer Science Press, 1983.","DOI":"10.1007\/978-3-642-95432-0_9"},{"issue":"no.4","key":"7_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry, vol. 1 no. 4, pp. 343\u2013353, 1986.","journal-title":"Discrete and Computational Geometry"},{"key":"7_CR9","volume-title":"PhD thesis","author":"Y. Shiloach","year":"1976","unstructured":"Y. Shiloach. Linear and Planar Arrangements of Graphs. PhD thesis, Department of Applied Mathematics, Weizmann Institute of Science, Rehovot Israel, 1976."},{"issue":"no.3","key":"7_CR10","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, vol. 16 no. 3, pp. 421\u2013444, 1987.","journal-title":"SIAM J. Computing"},{"issue":"no.4","key":"7_CR11","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry, vol. 1 no. 4, pp. 322\u2013341, 1986.","journal-title":"Discrete and Computational Geometry"},{"issue":"no.2","key":"7_CR12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02006104","volume":"7","author":"L. Yanpei","year":"1991","unstructured":"L. Yanpei, A. Morgana, and B. Simeone. General theoretical results on rectilinear embedability of graphs. Atca Mathematicae Applicatae Sinica Journal, vol. 7 no. 2, pp. 187\u2013192, 1991.","journal-title":"Atca Mathematicae Applicatae Sinica Journal"},{"key":"7_CR13","unstructured":"S. Zaks. An easy planarity test for unflippable modules. Technical Report 771, Computer Science Department, Technion, Israel Inst. of Tech., 1993."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_357.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:22Z","timestamp":1619572882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_357","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}