Ellen Gethner

According to our database1, Ellen Gethner authored at least 25 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Angle Covers: Algorithms and Complexity.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2018
Predicting Code Hotspots in Open-Source Software from Object-Oriented Metrics Using Machine Learning.
Int. J. Softw. Eng. Knowl. Eng., 2018

Extending precolorings to distinguish group actions.
Eur. J. Comb., 2018

2017
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs.
J. Graph Theory, 2017

2016
Thickness and colorability of geometric graphs.
Comput. Geom., 2016

On the Biplanar Crossing Number of K<sub>n</sub>.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2014
Computational Aspects of M.C. Escher's Ribbon Patterns.
Theory Comput. Syst., 2014

2013
List distinguishing parameters of trees.
Discret. Appl. Math., 2013

2012
M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
List-Distinguishing Colorings of Graphs.
Electron. J. Comb., 2011

More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number.
Ars Math. Contemp., 2011

More directions in visibility graphs.
Australas. J Comb., 2011

2010
The thickness and chromatic number of r-inflated graphs.
Discret. Math., 2010

2009
Thickness-Two Graphs Part Two: More New Nine-Critical Graphs, Independence Ratio, Cloned Planar Graphs, and Singly and Doubly Outerplanar Graphs.
Graphs Comb., 2009

deBruijn-like sequences and the irregular chromatic number of paths and cycles.
Discret. Math., 2009

2008
Thickness-two graphs part one: New nine-critical graphs, permuted layer graphs, and Catlin's graphs.
J. Graph Theory, 2008

2007
Bar k-Visibility Graphs.
J. Graph Algorithms Appl., 2007

Combinatorial enumeration of 2×2 ribbon patterns.
Eur. J. Comb., 2007

2005
Bar <i>k</i>-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004
Unit Bar-Visibility Layouts of Triangulated Polygons.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Toward the rectilinear crossing number of <i>K<sub>n</sub></i>: new drawings, upper bounds, and asymptotics.
Discret. Math., 2003

2001
The Rectilinear Crossing Number of K<sub>10</sub> is 62.
Electron. J. Comb., 2001

2000
Toward the Rectilinear Crossing Number of $K_n$: New Drawings, Upper Bounds, and Asymptotics
CoRR, 2000

The Rectilinear Crossing Number of K_10 is 62
CoRR, 2000

1997
Periodic Gaussian Moats.
Exp. Math., 1997


  Loading...