{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:30Z","timestamp":1725664050920},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_70","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:59Z","timestamp":1330263659000},"page":"411-424","source":"Crossref","is-referenced-by-count":7,"title":["A more compact visibility representation"],"prefix":"10.1007","author":[{"given":"Goos","family":"Kant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Bertolazzi, P., R.F. Cohen, G. Di Battista, R. Tamassia and I.G. Tollis, How to draw a series-parallel graph, in: O. Nurmi and E. Ukkonen (Eds.), Proc. Scand. Workshop on Algorithm Theory (SWAT'92), Lecture Notes in Computer Science 621, Springer-Verlag, 1992, pp. 272\u2013283.","DOI":"10.1007\/3-540-55706-7_23"},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput. 14 (1985), pp. 210\u2013223.","journal-title":"SIAM J. Comput."},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Eades, P., and R. Tamassia, I.G. Tollis, Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Dept. of Comp. Science, Brown Univ., Technical Report, 1993.","DOI":"10.1016\/0925-7721(94)00014-X"},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., R. Tamassia and I.G. Tollis, Area requirement and symmetry display in drawing graphs, Discrete and Comp. Geometry 7 (1992), pp. 381\u2013401.","journal-title":"Discrete and Comp. Geometry"},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"G. Battista Di","year":"1992","unstructured":"Di Battista, G., R. Tamassia and I.G. Tollis, Constrained visibility representations of graphs, Inform. Process. Letters 41 (1992), pp. 1\u20137.","journal-title":"Inform. Process. Letters"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"Fraysseix, H. de, J. Pach and R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), pp. 41\u201351.","journal-title":"Combinatorica"},{"key":"35_CR7","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"Harary, F., Graph Theory, Addison-Wesley Publishing Company, Inc., Reading, Mass., 1972."},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., and R.E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2 (1973), pp. 135\u2013158.","journal-title":"SIAM J. Comput."},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Kanevsky, A., R. Tamassia, G. Di Battista and J. Chen, On-line maintenance of the four-connected components of a graph, in: Proc. 32th Annual IEEE Symp. on Found. of Comp. Science, Puerto Rico, 1991, pp. 793\u2013801.","DOI":"10.1109\/SFCS.1991.185451"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Kant, G., Drawing planar graphs using the lmc-ordering, Proc. 33th Ann. IEEE Symp. on Found. of Comp. Science, Pittsburgh, 1992, pp. 101\u2013110. Revised and extended version in","DOI":"10.1109\/SFCS.1992.267814"},{"key":"35_CR11","unstructured":"Kant, G., Algorithms for Drawing Planar Graphs, PhD thesis, Dept. of Computer Science, Utrecht University, 1993."},{"key":"35_CR12","unstructured":"Kant, G., On triangulating planar graphs, submitted to Information and Computation, 1993."},{"key":"35_CR13","unstructured":"Kant, G., and X. He, Two Algorithms for Finding Rectangular Duals of Planar Graphs, Tech. Report RUU-CS-92-41, Dept. of Computer Science, Utrecht University, 1992."},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0304-3975(92)90349-K","volume":"99","author":"J. Nummenmaa","year":"1992","unstructured":"Nummenmaa, J.; Constructing compact rectilinear planar layouts using canonical representation of planar graphs, Theoret. Comp. Science 99 (1992), pp. 213\u2013230.","journal-title":"Theoret. Comp. Science"},{"key":"35_CR15","unstructured":"Otten, R.H.J.M., and J.G. van Wijk, Graph representation in interactive layout design, in: Proc. IEEE Int. Symp. on Circuits and Systems, 1978, pp. 914\u2013918."},{"key":"35_CR16","first-page":"31","volume":"56","author":"R. C. Read","year":"1987","unstructured":"Read, R.C., A new method for drawing a graph given the cyclic order of the edges at each vertex, Congr. Numer. 56 (1987), pp. 31\u201344.","journal-title":"Congr. Numer."},{"key":"35_CR17","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0196-6774(86)90029-5","volume":"7","author":"D. Richards","year":"1986","unstructured":"Richards, D., Finding short cycles in planar graphs using separators, J. Alg. 7 (1986), pp. 382\u2013394.","journal-title":"J. Alg."},{"key":"35_CR18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., and R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 343\u2013353.","journal-title":"Discr. and Comp. Geometry"},{"key":"35_CR19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., and I.G. Tollis, A unified approach to visibility representations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 321\u2013341.","journal-title":"Discr. and Comp. Geometry"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., and I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits and Systems 36 (1989), pp. 1230\u20131234.","journal-title":"IEEE Trans. Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:36:38Z","timestamp":1687286198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}