| Improved Lower Bounds for the Universal and a priori TSP I Gorodezky, RD Kleinberg, DB Shmoys, G Spencer International Workshop on Randomization and Approximation Techniques in …, 2010 | 41 | 2010 |
| Graph-coloring ideals: Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases JA De Loera, S Margulies, M Pernpeintner, E Riedl, D Rolnick, G Spencer, ... Proceedings of the 2015 ACM on International Symposium on Symbolic and …, 2015 | 15 | 2015 |
| Short-term interventions for long-term change: Spreading stable green norms in networks G Spencer, S Carattini, RB Howarth Review of Behavioral Economics 6 (1), 2019 | 10 | 2019 |
| Robust cuts over time: Combatting the spread of invasive species with unreliable biological control G Spencer Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 377-383, 2012 | 10 | 2012 |
| Maximizing the spread of stable influence: Leveraging norm-driven moral-motivation for green behavior change in networks G Spencer, R Howarth arXiv preprint arXiv:1309.6455, 2013 | 9 | 2013 |
| Using block designs in crossing number bounds J Asplund, G Clark, G Cochran, É Czabarka, A Hamm, G Spencer, ... Journal of Combinatorial Designs 27 (10), 586-597, 2019 | 5 | 2019 |
| The LSB theorem implies the KKM lemma G Spencer, FE Su The American Mathematical Monthly 114 (2), 156-159, 2007 | 5 | 2007 |
| Gr\" obner Bases and Nullstellens\" atze for Graph-Coloring Ideals JA De Loera, S Margulies, M Pernpeintner, E Riedl, D Rolnick, G Spencer, ... arXiv preprint arXiv:1410.6806, 2014 | 4 | 2014 |
| Combinatorial Consequences of Relatives of the Lusternik-Schnirelmann-Borsuk Theorem G Spencer | 4 | 2005 |
| Approximation algorithms for fragmenting a graph against a stochastically-located threat DB Shmoys, G Spencer International Workshop on Approximation and Online Algorithms, 123-136, 2011 | 3 | 2011 |
| Limits of approximation algorithms: Pcps and unique games (dimacs tutorial lecture notes) P Harsha, M Charikar, M Andrews, S Arora, S Khot, D Moshkovitz, ... arXiv preprint arXiv:1002.3864, 2010 | 3 | 2010 |
| Sticky seeding in discrete-time reversible-threshold networks G Spencer Discrete Mathematics & Theoretical Computer Science 18 (Distributed …, 2016 | 2 | 2016 |
| Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located Threat DB Shmoys, G Spencer Theory of Computing Systems 56, 96-134, 2015 | 2 | 2015 |
| Using topological methods to force maximal complete bipartite subgraphs of Kneser graphs G Spencer, FE Su Manuscript, 2005 | 2 | 2005 |
| A Conversation with Scott Kim G Spencer Math Horizons 12 (2), 9-10, 2004 | 2 | 2004 |
| On the robust hardness of gröbner basis computation D Rolnick, G Spencer Journal of Pure and Applied Algebra 223 (5), 2080-2100, 2019 | 1 | 2019 |
| Measuring the value of accurate link prediction for network seeding Y Wei, G Spencer Computational Social Networks 4, 1-35, 2017 | 1 | 2017 |
| Approximation algorithms for stochastic combinatorial optimization, with applications in sustainability GM Spencer Cornell University, 2012 | 1 | 2012 |
| Anticipating anthropogenic threats in acquiring new protected areas HJ Albers, CH Chang, STM Dissanayake, KJ Helmstedt, K Kroetz, ... Conservation Biology 38 (2), e14176, 2024 | | 2024 |
| The wisdom of a crowd of near-best fits: Drug-resistant tuberculosis in the United States E Mainou, G Spencer, D Shepardson, R Dorit Letters in Biomathematics 7 (1), 15, 2020 | | 2020 |
David ShmoysProfessor of Operations Research & Information Engineering and of Computer ScienceVerified email at cs.cornell.edu
