Abstract
In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research in graph drawing.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abello, J., Kumar, K.: Visibility graphs and oriented matroids. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 147–158. Springer, Heidelberg (1995)
Aichholzer, O., Aurenhammer, F., Chen, S.-W., Katoh, N., Taschwer, M., Rote, G., Xu, Y.-F.: Triangulations intersect nicely. Discrete Comput. Geom. 16, 339–359 (1996)
Aichholzer, O., Aurenhammer, F., Krasser, H.: On the crossing number of complete graphs. In: Proceedings of the 18th ACM Symposium on Computational Geometry, pp. 19–24. ACM Press, New York (2002)
Aronov, B., Erdős, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica 14, 127–134 (1994)
Barth, W., Jünger, M., Mutzel, P.: Simple and efficient cross counting. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 130–141. Springer, Heidelberg (2002)
Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 331–344. Springer, Heidelberg (1997)
Bhatt, S., Cosmadakis, S.: The complexity of minimizing wire lengths in VLSI layouts. Inform. Process. Lett. 25, 263–267 (1987)
Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300–343 (1984)
Biedl, T.: Drawing outer-planar graphs in O(n log n) area. In: Goodrich, M. (ed.) GD 2002. LNCS, vol. 2528, pp. 54–65. Springer, Heidelberg (2002)
Bienstock, D., Dean, N.: Bounds for rectilinear crossing numbers. J. Graph Theory 17, 333 (1993)
Blankenship, R., Oporowski, B.: Book embeddings of graphs and minor-closed classes. In: Thirty-Second Southeastern Internat. Conf. Combinatorics, Graph Theory and Computing, Baton Rouge. Dept. of Mathematics, p. 30. Louisiana State University (2001), http://www.math.lsu.edu/~conf_se/program.pdf
Bose, P.: On embedding an outer-planar graph in a point set. Comput. Geom. 23(3), 303–312 (2002)
Bose, P., Lenhart, W., Liotta, G.: Characterizing proximity trees. Algorithmica 16, 83–110 (1996)
Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete Comput. Geom. 23(2), 191–206 (2000)
Calamoneri, T., Sterbini, A.: 3D straight-line grid drawing of 4-colorable graphs. Inform. Process. Lett. 63(2), 97–102 (1997)
Calinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. In: Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 16–25 (1996)
Chan, T.: A near-linear area bound for drawing binary trees. Algorithmica 34, 1–13 (2001)
Chan, T.M., Goodrich, M.T., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 63–75. Springer, Heidelberg (1997)
Chazelle, B.: Reporting and counting segment intersections. J. Comput. Syst. Sci. 32, 156–182 (1986)
Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485–524 (1991)
Chazelle, B., Incerpi, J.: Triangulation and shape-complexity. ACM Trans. Graph. 3(2), 135–152 (1984)
Cheng, S.-W., Xu, Y.-F.: On β-skeleton as a subgraph of the minimum weight triangulation. Theoretical Computer Science 262(1-2), 459–471 (2001)
Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions. In: Proc. 12th Annu. ACM Sympos. Comput. Geom., pp. 319–328 (1996)
Chrobak, M., Ichi Nakano, S.: Minimum-width grid drawings of plane graphs. Comput. Geom. Theory Appl. 11, 29–54 (1998)
Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Internat. J. Comput. Geom. Appl. 7(3), 211–223 (1997)
Chrobak, M., Karloff, H.: A lower bound on the size of universal sets for planar graphs. SIGACT News 20 (1989)
Cohen, R.F., Eades, P., Lin, T., Ruskey, F.: Three-dimensional graph drawing. Algorithmica 17, 199–208 (1997)
Dahlhaus, E.: Linear time algorithm to recognize clustered planar graphs and its parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 239–248. Springer, Heidelberg (1998)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Devillers, O., Liotta, G., Preparata, F.P., Tamassia, R.: Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Theory Appl. 11, 187–208 (1998)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)
Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl. 7, 303–325 (1997)
Di Battista, G., Liotta, G.: Upward planarity checking: Faces are more than polygons. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 72–86. Springer, Heidelberg (1999)
Di Battista, G., Liotta, G., Lubiw, A., Whitesides, S.: Orthogonal drawings of cycles in 3D space. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 272–283. Springer, Heidelberg (2001)
Di Battista, G., Liotta, G., Lubiw, A., Whitesides, S.: Embedding problems for paths with direction constrained edges. Theoretical Computer Science 289(2), 897–917 (2002)
Di Battista, G., Liotta, G., Vargiu, F.: Spirality and optimal orhogonal drawings. SIAM J. Comput. 27(6), 1764–1811 (1998)
Di Battista, G., Vismara, L.: Angles of planar triangular graphs. SIAM J. Discrete Math. 9(3), 349–359 (1996)
Di Giacomo, E.: Drawing series-parallel graphs on restricted integer 3D grids. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 238–246. Springer, Heidelberg (2004)
Di Giacomo, E., Liotta, G., Meijer, H.: 3D straight-line drawings of k-trees. Technical Report TR-2003-473, Queen’s University, School of Computing (2003)
Di Giacomo, E., Liotta, G., Patrignani, M.: Orthogonal 3D shapes of theta graphs. In: Goodrich, M. (ed.) GD 2002. LNCS, vol. 2528, pp. 142–149. Springer, Heidelberg (2002)
Di Giacomo, E., Liotta, G., Wismath, S.: Drawing series-parallel graphs on a box. In: 14th Canadian Conference On Computational Geometry, CCCG 2002 (2002)
Di Giacomo, E., Meijer, H.: Track drawings of graphs with constant queue number. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 214–225. Springer, Heidelberg (2004)
Dickerson, M., Keil, J., Montague, M.: A large subgraph of the minimum weight triangulation. Discrete and Computational Geometry 18, 289–304 (1997)
Dickerson, M.T., Montague, M.H.: A (usually?) connected subgraph of the minimum weight triangulation. In: Proc. 12th Annu. ACM Sympos. Comput. Geom., pp. 204–213 (1996)
Dijdjev, H., Vrťo, I.: An improved lower bound for crossing numbers. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, p. 96. Springer, Heidelberg (2002) (to appear)
Dillencourt, M.B.: Realizability of Delaunay triangulations. Inform. Process. Lett. 33(6), 283–287 (1990)
Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Algorithms & Applications 4(3), 5–17 (2000)
Dillencourt, M.B., Smith, W.D.: Graph-theoretical conditions for inscribability and Delaunay realizability. In: Proc. 6th Canad. Conf. Comput. Geom., pp. 287–292 (1994)
Dujmović, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Radge, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D.: On the parameterized complexity of layered graph drawing. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 488–499. Springer, Heidelberg (2001)
Dujmović, V., Morin, P., Wood, D.: Pathwidth and three-dimensional straight line grid drawings of graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 42–53. Springer, Heidelberg (2002)
Dujmović, V., Wood, D.R.: Tree-partitions of k-trees with applications in graph layout. Technical Report 02-03, Dept. Comput. Sci., Carleton Univ., Ottawa, Canada (2002)
Dujmović, V., Wood, D.R.: On linear layouts of graphs. Technical Report 03-05, Dept. Comput. Sci., Carleton Univ., Ottawa, Canada (2003)
Dujmović, V., Wood, D.R.: Stacks, queues and tracks: Layouts of graphs subdivisions. Technical Report 03-07, Dept. Comput. Sci., Carleton Univ., Ottawa, Canada (2003)
Dujmović, V., Wood, D.R.: Three-dimensional grid drawings with subquadratic volume. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 190–201. Springer, Heidelberg (2004); These processing
Dujmović, V., Wood, D.R.: Track layouts of graphs. Technical Report 03-06, Dept. Comput. Sci., Carleton Univ., Ottawa, Canada (2003)
Dujmović, V., Wood, D.R.: Tree-partitions of k-trees with application in graph layout. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 205–217. Springer, Heidelberg (2003) (to appear)
Eades, P., Whitesides, S.: The realization problem for Euclidean minimum spanning trees is NP-hard. Algorithmica 16, 60–82 (1996); (Di Battista, G., Tamassia, R.(ed.) special issue on Graph Drawing)
Edler, B.: Effiziente Algorithmen für flächenminimale Layouts von Bäumen. Diplomarbeit, Universität Passau (1999)
ElGindy, H., Avis, D., Toussaint, G.T.: Applications of a two-dimensional hidden-line algorithm to other geometric problems. Computing 31, 191–202 (1983)
Even, G., Guha, S., Schieber, B.: Improved approximations of crossings in graph drawing and VLSI layout area. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC 2000), pp. 296–305. ACM Press, New York (2000)
Everett, H.: Visibility graph recognition. Report 231/90, Dept. Comput. Sci., Univ. Toronto, Toronto, ON. Ph.D. Thesis (1990)
Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18(1), 19–37 (2001)
Felsner, S., Liotta, G., Wismath, S.: Straight line drawings on restricted integer grids in two and three dimensions. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 328–342. Springer, Heidelberg (2002)
Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 213–226. Springer, Heidelberg (1995)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Garey, M.R., Johnson, D.S., Preparata, F.P., Tarjan, R.E.: Triangulating a simple polygon. Inform. Process. Lett. 7, 175–179 (1978)
Garg, A.: New results on drawing angle graphs. Comput. Geom. Theory Appl. 9(1-2), 43–82 (1998)
Garg, A., Goodrich, M.T., Tamassia, R.: Planar upward tree drawings with optimal area. Internat. J. Comput. Geom. Appl. 6, 333–356 (1996)
Garg, A., Liotta, G.: Almost bend-optimal planar orthogonal drawings of biconnected degree-3 planar graphs in quadratic time. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, p. 38. Springer, Heidelberg (1999)
Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and good aspect ratio. In: Goodrich, M. (ed.) GD 2002. LNCS, vol. 2528, pp. 320–331. Springer, Heidelberg (2002)
Garg, A., Rusu, A.: Area-efficient drawings of outerplanar graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 129–134. Springer, Heidelberg (2004); These proceedings
Garg, A., Tamassia, R.: A new minimum cost flow algorithm with applications to graph drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, Springer, Heidelberg (1997)
Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601–625 (2001)
Garg, A., Tamassia, R., Vocca, P.: Drawing with colors. In: Díaz, J. (ed.) ESA 1996. LNCS, vol. 1136, pp. 12–26. Springer, Heidelberg (1996)
Ghosh, S.K.: On recognizing and characterizing visibility graphs of simple polygons. Discrete Comput. Geom. 17, 143–162 (1997)
Gregori, A.: Unit length embedding of binary trees on a square grid. Inform. Process. Lett. 31, 167–172 (1989)
Grohe, M.: Computing crossing numbers in quadratic time. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC 2000), pp. 231–236. ACM Press, New York (2000)
Gutwenger, C., Jünger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in c-planarity testing of clustered graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 220–325. Springer, Heidelberg (2002)
Gutwenger, C., Mutzel, P.: An experimental study of crossing minimization heuristics. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 13–24. Springer, Heidelberg (2004); These proceedings
Gutwenger, C., Mutzel, P.: Graph embedding with minimum depth and maximum external face. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 259–272. Springer, Heidelberg (2004)
Gutwenger, C., Mutzel, P., Weiskircher, R.: Inserting an edge into a planar graph. In: Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms (SODA 2001), Washington, DC, pp. 246–255. ACM Press, New York (2001)
Healy, P., Kuusik, A.: The vertex-exchange graph: a new concept for multi-level crossing minimization. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 205–216. Springer, Heidelberg (1999)
Hertel, S., Mehlhorn, K.: Fast triangulation of the plane with respect to simple polygons. Inform. Control 64, 52–76 (1985)
Jaromczyk, J.W., Toussaint, G.T.: Relative neighborhood graphs and their relatives. Proc. IEEE 80(9), 1502–1517 (1992)
Jünger, M., Lee, E., Mutzel, P., Odenthal, T.: A polyhedral approach to the multi-layer crossing number problem. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 13–24. Springer, Heidelberg (1997)
Kant, G.: A new method for planar graph drawings on a grid. In: Proc. 33rd Annu. IEEE Sympos. Found. Comput. Sci., pp. 101–110 (1992)
Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16, 4–32 (1996); (Di Battista, G., Tamassia, R. (ed.) special issue on Graph Drawing)
Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications 6(1), 115–129 (2002)
Keil, M.: Computing a subgraph of the minimum weight triangulation. Comput. Geom. Theory Appl. 4, 13–26 (1994)
Kirkpatrick, D.G.: A note on Delaunay and optimal triangulations. Inform. Process. Lett. 10(3), 127–128 (1980)
Klau, G.W., Klein, K., Mutzel, P.: An experimental comparison of orthogonal compaction algorithms. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 37–51. Springer, Heidelberg (2001)
Klau, G.W., Mutzel, P.: Optimal compaction of orthogonal grid drawings. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 304–319. Springer, Heidelberg (1999)
Leighton, F.T.: New lower bound techniques for VLSI. In: Proc. 22nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 1–12 (1981)
Leighton, F.T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM 46(6), 787–832 (1999)
Lenhart, W., Liotta, G.: Drawing outerplanar minimum weight triangulations. Inform. Process. Lett. 57(5), 253–260 (1996)
Lenhart, W., Liotta, G.: Proximity drawings of outerplanar graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, Springer, Heidelberg (1997)
Lenhart, W., Liotta, G.: The drawability problem for minimum weight triangulations. Theoret. Comp. Sci. 270, 261–286 (2002)
Levcopoulos, C., Krznaric, D.: Tight lower bounds for minimum weight triangulation heuristic. Inform. Process. Lett. 57, 129–135 (1996)
Levcopoulos, C., Krznaric, D.: A linear-time approximation schema for minimum weight triangulation of convex polygons. Algorithmica 21, 285–311 (1998)
Lingas, A.: A new heuristic for minimum weight triangulation. SIAM J. Algebraic Discrete Methods 8(4), 646–658 (1987)
Liotta, G., Di Battista, G.: Computing proximity drawings of trees in the 3-dimensional space. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 239–250. Springer, Heidelberg (1995)
Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The rectangle of influence drawability problem. Comput. Geom. Theory Appl. 10(1), 1–22 (1998)
Liotta, G., Meijer, H.: Voronoi drawings of trees. Comput. Geom. Theory Appl. (2003) (to appear)
Lovasz, L., Vesztergombi, K., Wagner, U., Welzl, E.: Convex quadrilaterals and k-sets. Contemporary Mathematics (2003)
Lubiw, A., Sleumer, N.: Maximal outerplanar graphs are relative neighborhood graphs. In: Proc. 5th Canad. Conf. Comput. Geom., pp. 198–203 (1993)
Malitz, S., Papakostas, A.: On the angular resolution of planar graphs. In: Proc. 24th Annu. ACM Sympos. Theory Comput., pp. 527–538 (1992)
Manacher, G.K., Zobrist, A.L.: Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation. Inform. Process. Lett. 9, 31–34 (1979)
Mansfield, A.: Determining the thickness of a graph is NP-hard. Math. Proc. Cambridge Philos. Soc. 93(9), 9–23 (1983)
Mehlhorn, K., Näher, T.S.S., Schirra, S., Seel, M., Seidel, R., Uhrig, C.: Checking geometric programs or verification of geometric structures. Comput. Geom. Theory Appl. 12, 85–113 (1999)
Monma, C., Suri, S.: Transitions in geometric minimum spanning trees. Discrete Comput. Geom. 8, 265–293 (1992)
Mutzel, P., Weiskircher, R.: Computing optimal embeddings for planar graphs. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 95–104. Springer, Heidelberg (2000)
Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. Algorithmica 16, 111–117 (1996) (Di Battista, G., Tamassia, R.(ed.) special issue on Graph Drawing)
Pach, J., Thiele, T., Tóth, G.: Three-dimensional grid drawings of graphs. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 47–51. Springer, Heidelberg (1997)
Pach, J., Tóth, G.: Graphs drawn with few crossings per edge. Combinatorica 17, 427–439 (1997)
Pizzonia, M., Tamassia, R.: Minimum depth graph embedding. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 356–367. Springer, Heidelberg (2000)
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction, 3rd edn. Springer, Heidelberg (October 1990)
Rahman, S., Egi, N., Nishizeki, T.: No-bend orthogonal drawings of subdivisions of planar triconnected cubic graphs. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 387–392. Springer, Heidelberg (2004)
Rappaport, D., Meijer, H.: Computing the minimum weight triangulation of a set of linearly ordered points. Information Processing Letters 42, 35–38 (1992)
Richter, R., Thomassen, C.: Relations between crossing numbers of complete and complete bipartite graphs (February 1997)
Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1(4), 343–353 (1986)
Scheinerman, E.R., Wilf, H.S.: The rectilinear crossing number of a complete graph and Sylvester’s “four point problem” of geometric probability. Amer. Math. Monthly 101(10), 939–943 (1994)
Schnyder, W.: Planar graphs and poset dimension. Order 5, 323–343 (1989)
Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 138–148 (1990)
Schnyder, W., Trotter, W.T.: Convex embeddings of 3-connected plane graphs. Abstracts of the AMS 13(5), 502 (1992)
Shin, C.-S., Kim, S.K., Chwa, K.-Y.: Area-efficient algorithms for straight-line tree drawings. Comput. Geom. Theory Appl. 15, 175–202 (2000)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern. SMC-11(2), 109–125 (1981)
Sýkora, O., Vrťo, I.: On VLSI layouts of the star graph and related networks. The VLSI Journal 17, 83–93 (1994)
Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16(3), 421–444 (1987)
Toussaint, G.: Efficient triangulation of simple polygons. Visual Comput. 7, 280–295 (1991)
Vijayan, G., Wigderson, A.: Rectilinear graphs and their embeddings. SIAM J. Comput. 14, 355–372 (1985)
Vijayan, V.: Geometry of planar graphs with angles. In: Proc. 2nd Annu. ACM Sympos. Comput. Geom., pp. 116–124 (1986)
Waddle, V., Malhotra, A.: An E log E line crossing algorithm for levelled graphs. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 59–70. Springer, Heidelberg (1999)
Wang, C.A., Chin, F.Y., Yang, B.: Triangulations without minimum weight drawing. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 163–173. Springer, Heidelberg (2000)
Woo, T.C., Shin, S.Y.: A linear time algorithm for triangulating a point-visible polygon. ACM Trans. Graph. 4(1), 60–70 (1985)
Wood, D.R.: Queue layouts, tree-width, and three-dimensional graph drawing. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 348–359. Springer, Heidelberg (2002)
Zhang, H., He, X.: Compact visibility representations and straight-line grid embedding of plane graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 493–504. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brandenburg, F., Eppstein, D., Goodrich, M.T., Kobourov, S., Liotta, G., Mutzel, P. (2004). Selected Open Problems in Graph Drawing. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive