Periodic Gaussian Moats. - Ellen Gethner; Harold M. Stark (Exp. Math., 1997)

The Rectilinear Crossing Number of K_10 is 62 - Alex Brodsky; Stephane Durocher; Ellen Gethner (CoRR, 2000)

Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics - Alex Brodsky; Stephane Durocher; Ellen Gethner (CoRR, 2000)

The Rectilinear Crossing Number of K10 is 62. - Alex Brodsky; Stephane Durocher; Ellen Gethner (Electron. J. Comb., 2001)

Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. - Alex Brodsky; Stephane Durocher; Ellen Gethner (Discret. Math., 2003)

Unit Bar-Visibility Layouts of Triangulated Polygons. - Alice M. Dean; Ellen Gethner; Joan P. Hutchinson (GD, 2004)

Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. - Alice M. Dean; William S. Evans; Ellen Gethner; Joshua D. Laison; Mohammad Ali Safari; William T. Trotter (GD, 2005)

Combinatorial enumeration of 2×2 ribbon patterns. - Ellen Gethner; Doris Schattschneider; Steve Passiouras; J. Joseph Fowler (Eur. J. Comb., 2007)

Bar k-Visibility Graphs. - Alice M. Dean; William S. Evans; Ellen Gethner; Joshua D. Laison; Mohammad Ali Safari; William T. Trotter (J. Graph Algorithms Appl., 2007)

Thickness-two graphs part one: New nine-critical graphs, permuted layer graphs, and Catlin's graphs. - Debra L. Boutin; Ellen Gethner; Thom Sulanke (J. Graph Theory, 2008)

deBruijn-like sequences and the irregular chromatic number of paths and cycles. - Michael Ferrara; Christine Lee; Phil Wallis; Ellen Gethner (Discret. Math., 2009)

Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Cloned Planar Graphs, and Singly and Doubly Outerplanar Graphs. - Ellen Gethner; Thom Sulanke (Graphs Comb., 2009)

The thickness and chromatic number of r-inflated graphs. - Michael O. Albertson; Debra L. Boutin; Ellen Gethner (Discret. Math., 2010)

More directions in visibility graphs. - Ellen Gethner; Joshua D. Laison (Australas. J Comb., 2011)

More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number. - Michael O. Albertson; Debra L. Boutin; Ellen Gethner (Ars Math. Contemp., 2011)

List-Distinguishing Colorings of Graphs. - Michael Ferrara; Breeann Flesch; Ellen Gethner (Electron. J. Comb., 2011)

M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. - Ellen Gethner; David G. Kirkpatrick; Nicholas Pippenger (FUN, 2012)

List distinguishing parameters of trees. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Discret. Appl. Math., 2013)

Computational Aspects of M.C. Escher's Ribbon Patterns. - Ellen Gethner; David G. Kirkpatrick; Nicholas Pippenger (Theory Comput. Syst., 2014)

On the Biplanar Crossing Number of Kn. - Stephane Durocher; Ellen Gethner; Debajyoti Mondal (CCCG, 2016)

Thickness and colorability of geometric graphs. - Stephane Durocher; Ellen Gethner; Debajyoti Mondal (Comput. Geom., 2016)

On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. - Ellen Gethner; Leslie Hogben; Bernard Lidický; Florian Pfender; Amanda Ruiz; Michael Young (J. Graph Theory, 2017)

Extending precolorings to distinguish group actions. - Michael Ferrara; Ellen Gethner; Stephen G. Hartke; Derrick Stolee; Paul S. Wenger (Eur. J. Comb., 2018)

Predicting Code Hotspots in Open-Source Software from Object-Oriented Metrics Using Machine Learning. - Rod Hilton; Ellen Gethner (Int. J. Softw. Eng. Knowl. Eng., 2018)

Angle Covers: Algorithms and Complexity. - William S. Evans; Ellen Gethner; Jack Spalding-Jamieson; Alexander Wolff 001 (J. Graph Algorithms Appl., 2021)

HoneyTree: Making Honeywords Sweeter. - Kuntal Das; Jafar Haadi Jafarian; Ellen Gethner; Ersin Dincelli; Thomas Bekman (HICSS, 2022)

Information Synthesis of Time-Geometry QCurve for Music Retrieval. - Shannon Steinmetz; Ellen Gethner (MCM, 2022)