ALICE M. DEAN: Research Publications

  1. A. Dean, J. Ellis-Monaghan, S. Hamilton, and G. Pangborn, Unit rectangle visibility graphs, Submitted manuscript, 2007.

  2. A. Dean, W. Evans, E. Gethner, J. Laison, M. Safari, and W. Trotter, Bar k-Visibility Graphs, Journal of Graph Algorithms and Applications, 11 (2007), no. 1, 45-59.

  3. Alice M. Dean, William Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter, Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness, Lecture Notes in Computer Science 3843: Graph Drawing 2005, Patrick Healy, Nikola S. Nikolov (Eds.), Springer-Verlag, Berlin (2006), 73-82.

  4. A. Dean, E. Gethner, and J. Hutchinson, Unit bar-visibility layouts of triangulated polygons: extended abstract, in Lecture Notes in Computer Science 3383: Graph Drawing 2004, J. Pach (Ed.), Springer-Verlag, Berlin (2004), 111-121.

  5. A. Dean and N. Veytsel, Unit bar-visibility graphs, Congressus Numerantium 160 (2003), 161-175.

  6. A. Dean, A layout algorithm for bar-visibility graphs on the Möbius band, in Lecture Notes in Computer Science: Graph Drawing 2000, J. Marks (ed.), Springer-Verlag, Berlin (2001), 350-359.

  7. A. Dean and J. Hutchinson, Rectangle-visibility layouts of unions and products of trees, Journal of Graph Algorithms and Applications, 2 (1998), no. 8, 1-21.

  8. A. Dean and J. Hutchinson, Rectangle-visibility representations of bipartite graphs, Discrete Applied Mathematics, 75 (1997), 9-25.

  9. P. Bose, A. Dean, J. Hutchinson, and T. Shermer, On rectangle visibility graphs, in Lecture Notes in Computer Science 1190: Graph Drawing, S. North (ed.), Springer-Verlag, Berlin (1997), 25-44.

  10. A. Dean and J. Hutchinson, Rectangle-visibility representations of bipartite graphs: extended abstract, in Lecture Notes in Computer Science 894: Graph Drawing, R. Tamassia and I. Tollis (eds.), Springer-Verlag, Berlin (1995), 159-166.

  11. A. Dean and R.B. Richter, The crossing number of C4 x C4, J. Graph Theory, 19 (1995), 125-129.

  12. A. Dean and R.B. Richter, When is an algebraic duality a geometric duality?, in Graph Theory, Combinatorics, and Applications, Y. Alavi and A.J. Schwenk (eds.), Wiley (1995), 991-997.

  13. A. Dean, The computational complexity of deciding hamiltonian-connectedness, Congressus Numerantium, 93 (1993), 209-214.

  14. A. Dean and J. Hutchinson, Relations among embedding parameters for graphs, in Graph Theory, Combinatorics, and Applications, Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (eds.), Wiley (1991), 287-296.

  15. A. Dean, J. Hutchinson, and E. Scheinerman, On the thickness and arboricity of a graph, J. Comb. Theory Ser. B 52 (1991), 147-151.

  16. A. Dean, C.J. Knickerbocker, P.F. Lock, and M. Sheard, A survey of graphs hamiltonian-connected from a vertex, in Graph Theory, Combinatorics, and Applications, Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (eds.), Wiley (1991), 297-313.

  17. A. Dean, Nearnesses and T0-extensions of topological spaces, Canad. Math. Bull. 26 (1983), 430-437.