{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:24:06Z","timestamp":1766377446783},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:37:55Z","timestamp":1330295875000},"page":"155-168","source":"Crossref","is-referenced-by-count":12,"title":["2-Visibility drawings of planar graphs"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"F\u00f6\u00dfmeier","sequence":"first","affiliation":[]},{"given":"Goos","family":"Kant","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Biedl T. and G. Kant, A better heurisitic for orthogonal graph drawings, Proc. 2nd Ann. European Symposium on Algorithms (ESA'94), LNCS 855, Springer-Verlag, pp. 24\u201335, 1994.","DOI":"10.1007\/BFb0049394"},{"key":"13_CR2","volume-title":"Tech. Rep. UCR-CS-90-2","author":"M. Chrobak","year":"1990","unstructured":"Chrobak, M., and T.H. Payne, A Linear Time Algorithm for Drawing Planar Graphs on the Grid, Tech. Rep. UCR-CS-90-2, Dept. of Math. and Comp. Science, University of California at Riverside, 1990."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"Di Battista, G., P. Eades, R. Tamassia and I.G. Tollis, Algorithms for automatic graph drawing: an annotated bibliography, Computational Geometry: Theory and Practice 4, pp. 235\u2013282, 1994.","journal-title":"Computational Geometry: Theory and Practice"},{"key":"13_CR4","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, pp. 41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"F\u00f6\u00dfmeier, U., and M. Kaufmann, Drawing high degree graphs with low bend numbers, Proc. 4th Symposium on Graph Drawing (GD'95), LNCS 1027, Springer-Verlag, pp. 254\u2013266, 1995.","DOI":"10.1007\/BFb0021809"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Hutchinson, J.P., T. Shermer and A. Vince, On representation of some thickness-two graphs, Proc. 4th Symposium on Graph Drawing (GD'95), LNCS 1027, Springer-Verlag, pp. 324\u2013332, 1996.","DOI":"10.1007\/BFb0021815"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Kant, G., A more compact visibility representation, Proc. 19th Intern. Workshop on Graph-Theoretic Concepts in Comp. Science (WG'93), LNCS 790, Springer-Verlag, pp. 411\u2013424, 1994.","DOI":"10.1007\/3-540-57899-4_70"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Kant, G., and X. He, Two algorithms for finding rectangular duals of planar graphs, Proc. 19th Intern. Workshop on Graph-Theoretic Concepts in Comp. Science (WG'93), LNCS 790, Springer-Verlag, pp. 396\u2013410, 1994.","DOI":"10.1007\/3-540-57899-4_69"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., and S.K. Wismath, Weighted visibility graphs of bars and related flow problems, Proc. 1st Workshop Algorithms Data Structures (WADS'89), LNCS 382, Springer-Verlag, pp. 325\u2013334, 1989.","DOI":"10.1007\/3-540-51542-9_28"},{"key":"13_CR10","unstructured":"Mutzel, P., The Maximum Planar Subgraph Problem, Doctoral Dissertation, K\u00f6ln 1994."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Papakostas A. and I. Tollis, Improved algorithms and bounds for orthogonal drawings, Proc. DIMACS Workshop on Graph Drawing (GD'94), LNCS 894, Springer-Verlag, pp. 40\u201351, 1994.","DOI":"10.1007\/3-540-58950-3_355"},{"key":"13_CR12","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, Discrete Comput. Geom. 1, pp. 343\u2013353, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R., On embedding a graph in the grid with the minimum number of bends, SIAM Journal of Computing 16, pp. 421\u2013444, 1987.","journal-title":"SIAM Journal of Computing"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., G. Di Battista and C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. on Systems, Man and Cybernetics 18, pp. 61\u201379, 1988.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R. and I. Tollis, A unified approach to visibility representations of planar graphs, Discrete and Computational Geometry 1, pp. 321\u2013341, 1986.","journal-title":"Discrete and Computational Geometry"},{"key":"13_CR16","unstructured":"Tamassia, R., and I.G. Tollis, Efficient embedding of planar graphs in linear time, in: Proc. IEEE Int. Symp. on Circuits and Systems, Philadelphia, pp. 495\u2013498, 1987."},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/jgt.3190120306","volume":"12","author":"C. Thomassen","year":"1988","unstructured":"Thomassen, C., Rectilinear drawings of graphs, J. Graph Theory 12, pp. 335\u2013341, 1988.","journal-title":"J. Graph Theory"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Wismath, S.K., Characterizing bar line-of-sight graphs, Proc. 1st Annual ACM Symp. on Computational Geometry, pp. 147\u2013152, 1985.","DOI":"10.1145\/323233.323253"}],"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_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:51Z","timestamp":1605647571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}