Ramseyan Properties of Graphs. - Ermelinda DeLaViña; Siemion Fajtlowicz (Electron. J. Comb., 1996)

Graffiti.pc: A Variant of Graffiti. - Ermelinda DeLaViña (Graphs and Discovery, 2001)

Some History of the Development of Graffiti. - Ermelinda DeLaViña (Graphs and Discovery, 2001)

On Some Conjectures of Griggs and Graffiti. - Ermelinda DeLaViña; Siemion Fajtlowicz; William Waller (Graphs and Discovery, 2001)

Spanning Trees with Many Leaves and Average Distance. - Ermelinda DeLaViña; Bill Waller (Electron. J. Comb., 2008)

Heuristic algorithms for finding reliable lightpath under multiple failures. - Shengli Yuan; William Waller; Ermelinda DeLaViña (ICUMT, 2009)

A note on dominating sets and average distance. - Ermelinda DeLaViña; Ryan Pepper; Bill Waller (Discret. Math., 2009)

Lower bounds for the domination number. - Ermelinda DeLaViña; Ryan Pepper; Bill Waller (Discuss. Math. Graph Theory, 2010)

Bounds on the k-domination number of a graph. - Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaughan (Appl. Math. Lett., 2011)

A Characterization of Graphs Where the Independence Number Equals the Radius. - Ermelinda DeLaViña; Craig E. Larson; Ryan Pepper; Bill Waller (Graphs Comb., 2012)

A parallel algorithm for computing the critical independence number and related sets. - Ermelinda DeLaViña; Craig E. Larson (Ars Math. Contemp., 2013)