ALICE M. DEAN'S PUBLICATIONS

  1. D. Boutin, S. Cockburn, A. Dean and A. Margea, Posets of Geometric Graphs, Ars Mathematica Contemporanea 5 (2012), 265-284.

  2. D. Boutin, S. Cockburn, A. Dean and A. Margea, Posets of Geometric Graphs (with appendices), arXiv:1107.1131v2 [math.CO] (2011).

  3. A. Dean and J. Hutchinson, Representing 3-trees as Unit Rectangle-Visibility Graphs, Congress Numerantium 203 (2010), pp. 139-160.

  4. A. Dean, Review of "Visibility Algorithms in the Plane" by Subir Kumar Ghosh, ACM SIGACT News, 40 (June, 2009), no. 2, 33-35.

  5. A. Dean, J. Ellis-Monaghan, S. Hamilton, and G. Pangborn, Unit rectangle visibility graphs, Electronic Journal of Combinatorics, 15 (2008), #R79, 1-24.

  6. 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.

  7. A. Dean, W. Evans, E. Gethner, J. Laison, M. Safari, W. 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.

  8. 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.

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

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

  11. 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.

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

  13. 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.

  14. A. Dean, Doing Mathematics -- A Skidmore View, Liberal Studies I: The Human Experience (10th ed.), D. Burrows (ed.), Copley (1996) 296-300.

  15. A. Dean, Symbol and Meaning in Mathematics, Liberal Studies I: The Human Experience (10th ed.), D. Burrows (ed.), Copley (1996) 146-148.

  16. 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.

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

  18. 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.

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

  20. A. Dean, Using Derive in Calculus 1 and 2, Lab Resource Manual for Calculus to Accompany the Student Edition of Derive, Addison-Wesley & Benjamin/Cummings, 1992, 9-16.

  21. A. Dean and G. Effinger, Common-Sense BASIC: Structured Programming with Microsoft QuickBASIC (out of print), Harcourt, Brace, Jovanovich (1991).

  22. 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.

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

  24. 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.

  25. A. Dean, Product update: Structured BASIC packages, J. Computers in Math. and Sci. Teaching 8 (1988), 111-112.

  26. A. Dean, A review of three structured BASIC packages: True BASIC 2.0, Turbo BASIC 1.0, Microsoft QuickBASIC 3.0, J. Computers in Math. and Sci. Teaching 7 (1988), 90-94.

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