{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:50Z","timestamp":1725663770813},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:24:28Z","timestamp":1330244668000},"page":"12-21","source":"Crossref","is-referenced-by-count":3,"title":["Advances in graph drawing"],"prefix":"10.1007","author":[{"given":"Ashim","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0166-218X(92)90018-6","volume":"40","author":"T. Andreae","year":"1992","unstructured":"T. Andreae. Some results on visibility graphs. Discrete Applied Mathematics, 40:5\u201317, 1992.","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"M. Beccaria, P. Bertolazzi, G. Di Battista, and G. Liotta. A tailorable and extensible automatic layout facility. In Proc. IEEE Workshop on Visual Languages (VL'91), pages 68\u201373, 1991.","DOI":"10.1109\/WVL.1991.238848"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi and G. Di Battista. On upward drawing testing of triconnected digraphs. In Proc. 7th Annu. ACM Sympos. Comput. Geom, pages 272\u2013280, 1991.","DOI":"10.1145\/109648.109679"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, G. Liotta, and C. Mannino. Upward drawings of triconnected digraphs. Algorithmica, to appear.","DOI":"10.1007\/BF01188716"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"P. Bertolazzi, G. Di Battista, C. Mannino, and R. Tamassia. Optimal upward planarity testing of single-source digraphs. In 1st Annual European Symposium on Algorithms (ESA '93), Lecture Notes in Computer Science. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57273-2_42"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"K. Booth and G. Lueker. Testing for the consecutive ones property interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci., 13:335\u2013379, 1976.","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/0020-0190(80)90034-4","volume":"11","author":"R. P. Brent","year":"1980","unstructured":"R.P. Brent and H.T. Kung. On the area of binary tree layouts. Information Processing Letters, 11:521\u2013534, 1980.","journal-title":"Information Processing Letters"},{"key":"2_CR8","volume-title":"Technical Report UCR-CS-90-2","author":"M. Chrobak","year":"1990","unstructured":"M. Chrobak and T. H. Payne. A linear time algorithm for drawing a planar graph on a grid. Technical Report UCR-CS-90-2, Dept. of Math. and Comput. Sci., Univ. California Riverside, 1990."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"R. F. Cohen, G. Di Battista, R. Tamassia, I. G. Tollis, and P. Bertolazzi. A framework for dynamic graph drawing. In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 261\u2013270, 1992.","DOI":"10.1145\/142675.142728"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"P. Crescenzi, G. Di Battista, and A. Piperno. A note on optimal area algorithms for upward drawings of binary trees. Computational Geometry: Theory and Applications, 2:187\u2013200, 1992.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"I. F. Cruz. DOODLE: A visual language for object-oriented databases. In Proc. ACM SIGMOD, pages 71\u201380, 1992.","DOI":"10.1145\/130283.130299"},{"key":"2_CR12","unstructured":"I. F. Cruz. Using a visual constraint language for data display specification. In P. C. Kanellakis, J.-L. Lassez, and V. Saraswat, editors, First Workshop on Principles and Practice of Constraint Programming, Newport, RI, April 1993."},{"key":"2_CR13","unstructured":"I. F. Cruz, R. Tamassia, and P. Van Hentenryk. A visual approach to graph drawing. In Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing), Paris, France, September 1993."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. Small sets supporting Fary embeddings of planar graphs. In Proc. 20th Annu. ACM Sympos. Theory Comput., pages 426\u2013433, 1988.","DOI":"10.1145\/62212.62254"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"2_CR16","first-page":"75","volume":"13","author":"H. Fraysseix de","year":"1982","unstructured":"H. de Fraysseix and P. Rosenstiehl. A depth-first-search characterization of planarity. Annals of Discrete Mathematics, 13:75\u201380, 1982.","journal-title":"Annals of Discrete Mathematics"},{"key":"2_CR17","unstructured":"G. Di Battista, P. Eades, H. de Fraysseix, P. Rosenstiehl, and R. Tamassia. Graph Drawing '93 (Proc. ALCOM Int. Workshop on Graph Drawing). 1993. Available via anonymous ftp from wilma.cs.brown.edu, \/pub\/papers\/compgeo\/gd93-v2.tex.Z."},{"key":"2_CR18","volume-title":"Algorithms for drawing graphs: an annotated bibliography","author":"G. Battista Di","year":"1993","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Preprint, Dept. Comput. Sci., Brown Univ., Providence, RI, November 1993. To appear in Comput. Geom. Theory Appl. Preliminary version available via anonymous ftp from wilma.cs.brown.edu, gdbiblio.tex.Z and gdbiblio.ps.Z in \/pub\/papers\/compgeo."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"G. Di Battista, A. Giammarco, G. Santucci, and R. Tamassia. The architecture of diagram server. In Proc. IEEE Workshop on Visual Languages (VL'90), pages 60\u201365, 1990.","DOI":"10.1109\/WVL.1990.128383"},{"key":"2_CR20","first-page":"415","volume":"36","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, G. Liotta, M. Strani, and F. Vargiu. Diagram server. In Advanced Visual Interfaces (Proceedings of AVI '92), volume 36 of World Scientific Series in Computer Science, pages 415\u2013417, 1992.","journal-title":"World Scientific Series in Computer Science"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G. Battista Di","year":"1990","unstructured":"G. Di Battista, W. P. Liu, and I. Rival. Bipartite graphs upward drawings and planarity. Inform. Process, Lett., 36:317\u2013322, 1990.","journal-title":"Inform. Process, Lett."},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61:175\u2013198, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom., 7:381\u2013401, 1992.","journal-title":"Discrete Comput. Geom."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"G. Di Battista and L. Vismara. Angles of planar triangular graphs. In Proc. 25th Annu. ACM Sympos. Theory Comput. (STOC 93), pages 431\u2013437, 1993.","DOI":"10.1145\/167088.167207"},{"key":"2_CR25","unstructured":"P. Eades and T. Lin. Algorithmic and declarative approaches to aesthetic layout. In Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing), Paris, France, September 1993."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger. Drawing graphs in the plane with high resolution. In Proc. 31th Annu. IEEE Sympos. Found. Comput. Sci., pages 86\u201395, 1990.","DOI":"10.1109\/FSCS.1990.89527"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawings. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 359\u2013368, 1993.","DOI":"10.1145\/160985.161165"},{"key":"2_CR28","unstructured":"A. Garg and R. Tamassia. Angular resolution of planar drawings. Technical report, Brown Univ., Dept. of Computer Science, 1993."},{"key":"2_CR29","unstructured":"A. Garg and R. Tamassia. On the complexity of upward planarity testing. Technical report, Brown Univ., Dept. of Computer Science, 1993."},{"issue":"4","key":"2_CR30","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549\u2013568, 1974.","journal-title":"J. ACM"},{"key":"2_CR31","unstructured":"M. D. Hutton and A. Lubiw. Upward planar drawing of single source acyclic digraphs. In Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, pages 203\u2013211, 1991."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science, 1989.","DOI":"10.1142\/0922"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"G. Kant. Drawing planar graphs using the lmc-ordering. In Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci., pages 101\u2013110, 1992.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"2_CR34","unstructured":"G. Kant. A more compact visibility representation. In Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (WG'93), 1993."},{"key":"2_CR35","unstructured":"G. Kant, G. Liotta, R. Tamassia, and I. Tollis. Area requirements of visibility representations of trees. In Proc. 5th Canad. Conf. Comput. Geom., pages 192\u2013197, Waterloo, Canada, 1993."},{"key":"2_CR36","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","volume":"63","author":"D. Kelly","year":"1987","unstructured":"D. Kelly. Fundamentals of planar ordered sets. Discrete Math., 63:197\u2013216, 1987.","journal-title":"Discrete Math."},{"issue":"3","key":"2_CR37","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","volume":"27","author":"D. Kelly","year":"1975","unstructured":"D. Kelly and I. Rival. Planar lattices. Canad. J. Math., 27(3):636\u2013665, 1975.","journal-title":"Canad. J. Math."},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick and S. K. Wismath. Weighted visibility graphs of bars and related flow problems. In Proc. 1st Workshop Algorithms Data Struct., volume 382 of Lecture Notes in Computer Science, pages 325\u2013334. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51542-9_28"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson. Area-efficient graph layouts (for VLSI). In Proc. 21st Annu. IEEE Sympos. Found. Comput. Sci., pages 270\u2013281, 1980.","DOI":"10.1109\/SFCS.1980.13"},{"key":"2_CR40","first-page":"215","volume-title":"An algorithm for planarity testing of graphs","author":"A. Lempel","year":"1967","unstructured":"A. Lempel, S. Even, and I. Cederbaum. An algorithm for planarity testing of graphs. In Theory of Graphs: Internat. Symposium (Rome 1966), pages 215\u2013232, New York, 1967. Gordon and Breach."},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"S. Malitz and A. Papakostas. On the angular resolution of planar graphs. In Proc. 24th Annu. ACM Sympos. Theory Comput., pages 527\u2013538, 1992.","DOI":"10.1145\/129712.129764"},{"key":"2_CR42","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S1045-926X(05)80006-0","volume":"26","author":"J. Marks","year":"1991","unstructured":"J. Marks. A formal specification for network diagrams that facilitates automated design. Journal of Visual Languages and Computing, 26:395\u2013414, 1991.","journal-title":"Journal of Visual Languages and Computing"},{"key":"2_CR43","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O'Rourke","year":"1987","unstructured":"J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987."},{"key":"2_CR44","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0095-8956(76)90024-1","volume":"21","author":"C. Platt","year":"1976","unstructured":"C. Platt. Planar lattices and planar graphs. J. Combin. Theory Ser. B, 21:30\u201339, 1976.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2_CR45","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, NY, 1985."},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"I. Rival. Graphical data structures for ordered sets. In I. Rival, editor, Algorithms and Order, pages 3\u201331. Kluwer Academic Publishers, 1989.","DOI":"10.1007\/978-94-009-2639-4_1"},{"issue":"4","key":"2_CR47","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 Comput. Geom., 1(4):343\u2013353, 1986.","journal-title":"Discrete Comput. Geom."},{"key":"2_CR48","unstructured":"W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 138\u2013148, 1990."},{"issue":"9","key":"2_CR49","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T. C. Shermer","year":"1992","unstructured":"T. C. Shermer. Recent results in art galleries. Proc. IEEE, 80(9):1384\u20131399, September 1992.","journal-title":"Proc. IEEE"},{"issue":"1","key":"2_CR50","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"4","key":"2_CR51","doi-asserted-by":"crossref","first-page":"321","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 Comput. Geom., 1(4):321\u2013341, 1986.","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"2_CR52","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF00353654","volume":"5","author":"C. Thomassen","year":"1989","unstructured":"C. Thomassen. Planar acyclic oriented graphs. Order, 5(4):349\u2013361, 1989.","journal-title":"Order"},{"issue":"2","key":"2_CR53","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. Comput., C-30(2):135\u2013140, 1981.","journal-title":"IEEE Trans. Comput."},{"key":"2_CR54","doi-asserted-by":"crossref","unstructured":"S. K. Wismath. Characterizing bar line-of-sight graphs. In Proc. 1st Annu. ACM Sympos. Comput. Geom., pages 147\u2013152, 1985.","DOI":"10.1145\/323233.323253"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:14:15Z","timestamp":1605629655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}