Publications

Ellen Gethner
Assistant Professor of Computer Science
University of Colorado at Denver
ellen dot gethner at cudenver dot edu


Last updated 15 March 2008
Back to Ellen Gethner's homepage

[ Counting Stuff | Book Chapter | Expository Paper| Journal Articles | Conference Proceedings ]


Counting Stuff


Book Chapter

Expository Paper

Journal Articles

  1. Ellen Gethner, David G. Kirkpatrick and Nicholas Pippenger, Algorithmic Aspects of Escher Tilings, preprint, 47pp.
  2. Ellen Gethner and Joshua Laison, Unit bar-k visibility graphs and hereditary d-box visibility graphs, preprint, 13pp.
  3. Ellen Gethner and Thom Sulanke, Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Doubled Planar Graphs, and Singly and Doubly Outerplanar Graphs , 27 pp., submitted.
  4. Michael Ferrara, Ellen Gethner, Christine Lee**, and Phil Wallis*, The Irregular Chromatic Number of Paths and Cycles, 10 pp., submitted.
  5. Ellen Gethner, Bopanna Kallichanda*, Alexander Mentis*, Sarah Braudrick*, Sumeet Chawla*, Andy Clune*, Rachel Drummond*, Panagiota Evans*, Bill Roche*, Nao Takano*, A Recurrent Look at Kempe's False Proof of the Four-Color Theorem, 17pp., submitted.
  6. Debra Boutin, Ellen Gethner, and Thom Sulanke, Thickness-Two Graphs: New Nine-Chromatic Graphs, Permuted Layer Graphs, and Catlin's Graphs, Journal of Graph Theory, 57, (2008), no. 3, 198-214.
  7. Ellen Gethner, Doris Schattschneider, Steve Passiouras, J. Joseph Fowler*. Combinatorial enumeration of 2 x 2 ribbon patterns. European J. Combin. 28 (2007), no. 4, 1276-1311.
  8. Alice Dean, Will Evans, Ellen Gethner, Joshua Laison, Mohammed Safari***, and William Trotter, Bar k-Visibility Graphs, Journal of Graph Algorithms and Applications, 11 (2007), no. 1, 45-59.
  9. J. Joseph Fowler* and Ellen Gethner, Counting M.C. Escher's m x m ribbon patterns; Journal for Geometry and Graphics, 10 (2006) 1-13.
  10. Ellen Gethner and William M. Springer II*, How false is Kempe's proof of the four-color theorem?, Proceedings of the Thirty-Fourth Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Numer. 164 (2003), 159-175.
  11. Alex Brodsky***, Stephane Durocher***, and Ellen Gethner***, Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. Discrete Math. 262 (2003), no. 1-3, 59-77.
  12. Ellen Gethner, On a generalization of a combinatorial problem posed by M. C. Escher. Proceedings of the Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 2001). Congr. Numer. 153 (2001), 77-96.
  13. Alex Brodsky***, Stephane Durocher***, and Ellen Gethner***, The rectilinear crossing number of K10 is 62. The Electronic Journal of Combinatorics 8 (2001) no. 1, Research Paper 23, 30 pp. (electronic).
  14. Ellen Gethner, On the exact location of the zeros of certain families of rational period functions and other related rational functions. Proceedings of the American Mathematical Society 127 (1999), no. 1, 1-10.
  15. Ellen Gethner, Stan Wagon, and Brian Wick, A stroll through the Gaussian primes. American Mathematical Monthly 105 (1998), no. 4, 327-337.
  16. Ellen Gethner and H.M. Stark, Periodic Gaussian moats. Experimental Mathematics 6 (1997), no. 4, 289-292.
  17. Ellen Gethner, Rational period functions on G(\sqrt 2) and G(\sqrt 3) with hyperbolic poles are not Hecke eigenfunctions. Illinois Journal of Mathematics 39 (1995), no. 4, 695-722.
  18. Ellen Gethner, Rational period functions with irrational poles are not Hecke eigenfunctions. A tribute to Emil Grosswald: number theory and related analysis, 371-383, Contemporary Mathematics, 143, American Mathematical Society, Providence, RI, 1993.
  19. Ellen Gethner and Joan P. Hutchinson, Connected graphs with complementary edge-orbits. Ars Combinatoria 12 (1981), 135-146.

Refereed Conference Proceeedings

  1. 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.
  2. Alice M. Dean, Ellen Gethner, and Joan P. 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 (2005), 111-121.

Last updated 15 March 2008