{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:41Z","timestamp":1725664121742},"publisher-location":"Berlin, Heidelberg","reference-count":16,"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_355","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:59Z","timestamp":1330257359000},"page":"40-51","source":"Crossref","is-referenced-by-count":15,"title":["Improved algorithms and bounds for orthogonal drawings"],"prefix":"10.1007","author":[{"given":"Achilleas","family":"Papakostas","sequence":"first","affiliation":[]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","unstructured":"Therese Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"T. Biedl and G. Kant, A Better Heuristic for Orthogonal Graph Drawings, Proc. 2nd Ann. European Symposium on Algorithms (ESA '94), Lecture Notes in Computer Science, vol. 855, pp. 24\u201335, Springer-Verlag, 1994.","DOI":"10.1007\/BFb0049394"},{"key":"5_CR3","unstructured":"G. DiBattista, P. Eades, R. Tamassia and I. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Dept. of Comp. Science, Brown Univ., Tech. Report, 1993. To appear in Comput. Geom. Theory Appl. Preliminary version available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in \/pub\/papers\/compgeo."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"G. DiBattista, G. Liotta and F. Vargiu, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs, Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science 709, Springer-Verlag, 1993, pp. 151\u2013162.","DOI":"10.1007\/3-540-57155-8_244"},{"key":"5_CR5","unstructured":"S. Even and G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Tech. Report 797, Comp. Science Dept., Technion, Israel Inst. of Tech., 1994."},{"key":"5_CR6","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, Theor. Comp. Sci. 2 (1976), pp. 339\u2013344.","journal-title":"Theor. Comp. Sci."},{"key":"5_CR7","volume-title":"Tech. Report CS-94-10","author":"A. Garg","year":"1994","unstructured":"A. Garg and R. Tamassia, On the Computational Complexity of Upward and Rectilinear Planarity Testing, Tech. Report CS-94-10, Dept. of Computer Science, Brown University, Providence, 1994, also in these proceedings."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Goos Kant, Drawing planar graphs using the lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101\u2013110.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, New lower bound techniques for VLSI, Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science, 1981, pp. 1\u201312.","DOI":"10.1109\/SFCS.1981.22"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Charles E. Leiserson, Area-Efficient Graph Layouts (for VLSI), Proc. 21st Ann. IEEE Symp. on Found. of Comp. Science, 1980, pp. 270\u2013281.","DOI":"10.1109\/SFCS.1980.13"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Markus Sch\u00e4ffter, Drawing Graphs on Rectangular Grids, Discr. Appl. Math. (to appear).","DOI":"10.1016\/0166-218X(94)00020-E"},{"key":"5_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J. Storer","year":"1984","unstructured":"J. Storer, On minimal node-cost planar embeddings, Networks 14 (1984), pp. 181\u2013212.","journal-title":"Networks"},{"key":"5_CR13","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. Comput. 16 (1987), pp. 421\u2013444.","journal-title":"SIAM J. Comput."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I. Tollis, Planar Grid Embeddings in Linear Time, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230\u20131234.","journal-title":"IEEE Trans. on Circuits and Systems"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","volume":"39","author":"R. Tamassia","year":"1991","unstructured":"R. Tamassia, I. Tollis and J. Vitter, Lower Bounds for Planar Orthogonal Drawings of Graphs, Information Processing Letters 39 (1991), pp. 35\u201340.","journal-title":"Information Processing Letters"},{"issue":"no2","key":"5_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"L. Valiant, Universality Considerations in VLSI Circuits, IEEE Trans. on Comp., vol. C-30, no 2, (1981), pp. 135\u2013140.","journal-title":"IEEE Trans. on Comp."}],"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_355.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:24:47Z","timestamp":1605630287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_355","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}