The following pages link to Gwen Spencer (Q1713026):
Displayed 11 items.
- On the robust hardness of Gröbner basis computation (Q1713027) (← links)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
- Graph-Coloring Ideals (Q2819750) (← links)
- Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat (Q2896384) (← links)
- (Q2965972) (← links)
- Improved Lower Bounds for the Universal and a priori TSP (Q3588406) (← links)
- The LSB Theorem Implies the KKM Lemma (Q3595152) (← links)
- Using block designs in crossing number bounds (Q5204969) (← links)
- (Q5376421) (← links)
- Gr\"obner Bases and Nullstellens\"atze for Graph-Coloring Ideals (Q6255779) (← links)
- New Bounds on the Biplanar Crossing Number of Low-dimensional Hypercubes (Q6293452) (← links)