{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:03Z","timestamp":1725664803480},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_60","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:38:40Z","timestamp":1330277920000},"page":"355-370","source":"Crossref","is-referenced-by-count":6,"title":["A pairing technique for area-efficient orthogonal drawings (extended abstract)"],"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,7]]},"reference":[{"key":"28_CR1","unstructured":"Therese Biedl, \u201cEmbedding Nonplanar Graphs in the Rectangular Grid\u201d, Rutcor Research Report 27\u201393, 1993."},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Therese Biedl, \u201cNew Lower Bounds for Orthogonal Graph Drawings\u201d, Proc. of GD '95, Lecture Notes in Comp, Sci., 1027, Springer-Verlag, 1995, pp. 28\u201339.","DOI":"10.1007\/BFb0021788"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"T. Biedl and G. Kant, \u201cA Better Heuristic for Orthogonal Graph Drawings\u201d, Technical Report, Utrecht Univ., Dept. of Comp. Sci., UU-CS-1995-04. Prelim. version appeared in 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"},{"issue":"no5","key":"28_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. DiBattista","year":"1994","unstructured":"G. DiBattista, P. Eades, R. Tamassia and I. Tollis, \u201cAlgorithms for Drawing Graphs: An Annotated Bibliography\u201d, Computational Geometry: Theory and Applications, vol. 4, no 5, 1994, pp. 235\u2013282. Also available via anonymous ftp from ftp.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in \/pub\/papers\/compgeo.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"28_CR5","unstructured":"G. DiBattista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari and F. Vargiu, \u201cAn Experimental Comparison of Three Graph Drawing Algorithms\u201d, Proc. of ACM Symp. on Computational Geometry, pp. 306\u2013315, 1995. The version of the paper with the four algorithms can be obtained from http:\/\/www.cs.brown\/people\/rt."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"G. DiBattista, G. Liotta and F. Vargiu, \u201cSpirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs,\u201d 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":"28_CR7","unstructured":"S. Even and G. Granot, \u201cRectilinear Planar Drawings with Few Bends in Each Edge\u201d, Tech. Report 797, Comp. Science Dept., Technion, Israel Inst. of Tech., 1994."},{"key":"28_CR8","doi-asserted-by":"publisher","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, \u201cComputing an st-numbering\u201d, Theor. Comp. Sci. 2 (1976), pp. 339\u2013344.","journal-title":"Theor. Comp. Sci."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia, \u201cOn the Computational Complexity of Upward and Rectilinear Planarity Testing\u201d, Proc. DIMACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 286\u2013297.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Goos Kant, \u201cDrawing planar graphs using the lmc-ordering\u201d, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, 1992, pp. 101\u2013110.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"F. T. Leighton, \u201cNew lower bound techniques for VLSI\u201d, Proc. 22nd Ann. IEEE Symp. on Found. of Comp. Science, 1981, pp. 1\u201312.","DOI":"10.1109\/SFCS.1981.22"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Charles E. Leiserson, \u201cArea-Efficient Graph Layouts (for VLSI)\u201d, Proc. 21st Ann. IEEE Symp. on Found. of Comp. Science, 1980, pp. 270\u2013281.","DOI":"10.1109\/SFCS.1980.13"},{"key":"28_CR13","volume-title":"Tech. Report UTDCS-06-95","author":"A. Papakostas","year":"1995","unstructured":"A. Papakostas and I. G. Tollis, \u201cAlgorithms for Area-Efficient Orthogonal Drawings\u201d, Tech. Report UTDCS-06-95, The University of Texas at Dallas, 1995. Also available on the WWW at http:\/\/wwwpub.utdallas.edu\/\u223ctollis."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"A. Papakostas and I. G. Tollis, \u201cImproved Algorithms and Bounds for Orthogonal Drawings\u201d, Proc. DIMACS Workshop GD '94, Lecture Notes in Comp. Sci. 894, Springer-Verlag, 1994, pp. 40\u201351.","DOI":"10.1007\/3-540-58950-3_355"},{"key":"28_CR15","unstructured":"A. Papakostas and I. G. Tollis, \u201cIssues in Interactive Orthogonal Graph Drawing\u201d, Proc. of GD '95, Lecture Notes in Comp. Sci. 1027, Springer-Verlag, 1995, pp. 419\u2013430."},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(94)00020-E","volume":"63","author":"M. Sch\u00e4ffter","year":"1995","unstructured":"Markus Sch\u00e4ffter, \u201cDrawing Graphs on Rectangular Grids\u201d, Discr. Appl. Math. 63 (1995), pp. 75\u201389.","journal-title":"Discr. Appl. Math."},{"key":"28_CR17","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","volume":"14","author":"J. Storer","year":"1984","unstructured":"J. Storer, \u201cOn minimal node-cost planar embeddings\u201d, Networks 14 (1984), pp. 181\u2013212.","journal-title":"Networks"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia, \u201cOn embedding a graph in the grid with the minimum number of bends\u201d, SIAM J. Comput. 16 (1987), pp. 421\u2013444.","journal-title":"SIAM J. Comput."},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I. Tollis, \u201cPlanar Grid Embeddings in Linear Time\u201d, IEEE Trans. on Circuits and Systems CAS-36 (1989), pp. 1230\u20131234.","journal-title":"IEEE Trans. on Circuits and Systems"},{"key":"28_CR20","doi-asserted-by":"publisher","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, \u201cLower Bounds for Planar Orthogonal Drawings of Graphs\u201d, Information Processing Letters 39 (1991), pp. 35\u201340.","journal-title":"Information Processing Letters"},{"issue":"no2","key":"28_CR21","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"L. Valiant, \u201cUniversality Considerations in VLSI Circuits\u201d, 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-62495-3_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:12:55Z","timestamp":1605629575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}