4 citations · 13 across the 8 of their papers we have counts for
8 papers
Using Block Designs in Crossing Number Bounds
John Asplund, Eva Czabarka, Gregory Clark +6
The crossing number ${\mbox {cr}}(G)$ of a graph is the smallest number of edge crossings over all drawings of in the plane. For any , the -planar crossing…
Extended Hardness Results for Approximate Gröbner Basis Computation
Gwen Spencer
Two models were recently proposed to explore the robust hardness of Gröbner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some…
On the robust hardness of Gröbner basis computation
Gwen Spencer, David Rolnick
The computation of Gröbner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robu…
Sticky Seeding in Discrete-Time Reversible-Threshold Networks
Gwen Spencer
When nodes can repeatedly update their behavior (as in agent-based models from computational social science or repeated-game play settings) the problem of optimal network seeding b…
Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals
Jesús A. De Loera, Susan Margulies, Michael Pernpeintner +5
We revisit a well-known family of polynomial ideals encoding the problem of graph--colorability. Our paper describes how the inherent combinatorial structure of the ideals impli…
Maximizing the Spread of Stable Influence: Leveraging Norm-driven Moral-Motivation for Green Behavior Change in Networks
Gwen Spencer, Richard Howarth
In an effort to understand why individuals choose to participate in personally-expensive pro-environmental behaviors, environmental and behavioral economists have examined a moral-…