default search action
Ellen Gethner
Person information
- affiliation: University of Colorado Denver, CO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c8]Kuntal Das, Jafar Haadi Jafarian, Ellen Gethner, Ersin Dincelli, Thomas Bekman:
HoneyTree: Making Honeywords Sweeter. HICSS 2022: 1-10 - [c7]Shannon Steinmetz, Ellen Gethner:
Information Synthesis of Time-Geometry QCurve for Music Retrieval. MCM 2022: 398-404 - 2021
- [j19]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. J. Graph Algorithms Appl. 25(2): 643-661 (2021) - 2020
- [c6]William S. Evans
, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
Angle Covers: Algorithms and Complexity. WALCOM 2020: 94-106
2010 – 2019
- 2019
- [i3]William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff:
Angle Covers: Algorithms and Complexity. CoRR abs/1911.02040 (2019) - 2018
- [j18]Michael Ferrara, Ellen Gethner, Stephen G. Hartke
Extending precolorings to distinguish group actions. Eur. J. Comb. 72: 12-28 (2018) - [j17]Rod Hilton, Ellen Gethner:
Predicting Code Hotspots in Open-Source Software from Object-Oriented Metrics Using Machine Learning. Int. J. Softw. Eng. Knowl. Eng. 28(3): 311-332 (2018) - 2017
- [j16]Ellen Gethner, Leslie Hogben, Bernard Lidický
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. J. Graph Theory 84(4): 552-565 (2017) - 2016
- [j15]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
Thickness and colorability of geometric graphs. Comput. Geom. 56: 1-18 (2016) - [c5]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
On the Biplanar Crossing Number of Kn. CCCG 2016: 93-100 - 2014
- [j14]Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger:
Computational Aspects of M.C. Escher's Ribbon Patterns. Theory Comput. Syst. 54(4): 640-658 (2014) - 2013
- [j13]Michael Ferrara, Ellen Gethner, Stephen G. Hartke, Derrick Stolee, Paul S. Wenger:
List distinguishing parameters of trees. Discret. Appl. Math. 161(6): 864-869 (2013) - [c4]Stephane Durocher, Ellen Gethner, Debajyoti Mondal:
Thickness and Colorability of Geometric Graphs. WG 2013: 237-248 - 2012
- [c3]Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger:
M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. FUN 2012: 198-209 - 2011
- [j12]Ellen Gethner, Joshua D. Laison:
More directions in visibility graphs. Australas. J Comb. 50: 55-66 (2011) - [j11]Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number. Ars Math. Contemp. 4(1): 5-24 (2011) - [j10]Michael Ferrara, Breeann Flesch, Ellen Gethner:
List-Distinguishing Colorings of Graphs. Electron. J. Comb. 18(1) (2011) - 2010
- [j9]Michael O. Albertson, Debra L. Boutin, Ellen Gethner:
The thickness and chromatic number of r-inflated graphs. Discret. Math. 310(20): 2725-2734 (2010)
2000 – 2009
- 2009
- [j8]Michael Ferrara, Christine Lee, Phil Wallis, Ellen Gethner:
deBruijn-like sequences and the irregular chromatic number of paths and cycles. Discret. Math. 309(20): 6074-6080 (2009) - [j7]Ellen Gethner, Thom Sulanke:
Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Cloned Planar Graphs, and Singly and Doubly Outerplanar Graphs. Graphs Comb. 25(2): 197-217 (2009) - 2008
- [j6]Debra L. Boutin, Ellen Gethner, Thom Sulanke:
Thickness-two graphs part one: New nine-critical graphs, permuted layer graphs, and Catlin's graphs. J. Graph Theory 57(3): 198-214 (2008) - 2007
- [j5]Ellen Gethner, Doris Schattschneider, Steve Passiouras, J. Joseph Fowler:
Combinatorial enumeration of 2×2 ribbon patterns. Eur. J. Comb. 28(4): 1276-1311 (2007) - [j4]Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter:
Bar k-Visibility Graphs. J. Graph Algorithms Appl. 11(1): 45-59 (2007) - 2005
- [c2]Alice M. Dean, William S. 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. GD 2005: 73-82 - 2004
- [c1]Alice M. Dean, Ellen Gethner, Joan P. Hutchinson:
Unit Bar-Visibility Layouts of Triangulated Polygons. GD 2004: 111-121 - 2003
- [j3]Alex Brodsky, Stephane Durocher, Ellen Gethner:
Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics. Discret. Math. 262(1-3): 59-77 (2003) - 2001
- [j2]Alex Brodsky, Stephane Durocher, Ellen Gethner:
The Rectilinear Crossing Number of K10 is 62. Electron. J. Comb. 8(1) (2001) - 2000
- [i2]Alex Brodsky, Stephane Durocher, Ellen Gethner:
The Rectilinear Crossing Number of K_10 is 62. CoRR cs.DM/0009023 (2000) - [i1]Alex Brodsky, Stephane Durocher, Ellen Gethner:
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics. CoRR cs.DM/0009028 (2000)
1990 – 1999
- 1997
- [j1]Ellen Gethner, Harold M. Stark:
Periodic Gaussian Moats. Exp. Math. 6(4): 289-292 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: