The LSB Theorem Implies the KKM Lemma. - Gwen Spencer; Francis Edward Su (Am. Math. Mon., 2007)

Improved Lower Bounds for the Universal and a priori TSP. - Igor Gorodezky; Robert D. Kleinberg; David B. Shmoys; Gwen Spencer (APPROX-RANDOM, 2010)

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) - Prahladh Harsha; Moses Charikar; Matthew Andrews; Sanjeev Arora; Subhash Khot; Dana Moshkovitz; Lisa Zhang; Ashkan Aazami; Dev Desai; Igor Gorodezky; Geetha Jagannathan; Alexander S. Kulikov; et al. (CoRR, 2010)

Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control. - Gwen Spencer (AAAI, 2012)

Maximizing the Spread of Stable Influence: Leveraging Norm-driven Moral-Motivation for Green Behavior Change in Networks. - Gwen Spencer; Richard Howarth (CoRR, 2013)

Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals. - Jesús A. De Loera; Susan Margulies; Michael Pernpeintner; Eric Riedl; David Rolnick; Gwen Spencer; Despina Stasi; Jon Swenson (CoRR, 2014)

Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner Bases. - Jesús A. De Loera; Susan Margulies; Michael Pernpeintner; Eric Riedl; David Rolnick; Gwen Spencer; Despina Stasi; Jon Swenson (ISSAC, 2015)

On the robust hardness of Gröbner basis computation. - Gwen Spencer; David Rolnick (CoRR, 2015)

Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat. - David B. Shmoys; Gwen Spencer (Theory Comput. Syst., 2015)

Extended Hardness Results for Approximate Gröbner Basis Computation. - Gwen Spencer (CoRR, 2016)

Sticky Seeding in Discrete-Time Reversible-Threshold Networks. - Gwen Spencer (Discret. Math. Theor. Comput. Sci., 2016)

New bounds on the biplanar crossing number of low-dimensional hypercubes: How low can you go? - Gregory J. Clark; Gwen Spencer (Bull. ICA, 2018)

Clustered networks protect cooperation against catastrophic collapse. - Gwen Spencer (Netw. Sci., 2018)