| Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz JA Loera, J Lee, S Margulies, S Onn Combinatorics, Probability and Computing 18 (4), 551-582, 2009 | 54* | 2009 |
| Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility JA De Loera, J Lee, PN Malkin, S Margulies Proceedings of the twenty-first international symposium on Symbolic and …, 2008 | 37 | 2008 |
| Fitting experimental data using the method of least squares S Margulies Review of Scientific Instruments 39 (4), 478-480, 1968 | 28 | 1968 |
| Computing infeasibility certificates for combinatorial problems through Hilbert’s Nullstellensatz JA De Loera, J Lee, PN Malkin, S Margulies Journal of Symbolic Computation 46 (11), 1260-1283, 2011 | 23 | 2011 |
| Computer algebra, combinatorics, and complexity: hilbert's nullstellensatz and np-complete problems S Margulies University of California, Davis, 2008 | 20 | 2008 |
| On the complexity of Hilbert refutations for partition S Margulies, S Onn, DV Pasechnik Journal of Symbolic Computation 66, 70-83, 2015 | 12 | 2015 |
| 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 | 10 | 2015 |
| A note on total and paired domination of Cartesian product graphs K Choudhary, S Margulies, IV Hicks arXiv preprint arXiv:1109.2174, 2011 | 8 | 2011 |
| An algebraic exploration of dominating sets and Vizing's conjecture S Margulies, IV Hicks the electronic journal of combinatorics 19 (2), P1, 2012 | 6 | 2012 |
| Expressing combinatorial optimization problems by systems of polynomial equations and the nullstellensatz JA De Loera, J Lee, S Margulies, S Onn arXiv preprint arXiv:0706.0578, 2007 | 6 | 2007 |
| Integer domination of Cartesian product graphs K Choudhary, S Margulies, IV Hicks Discrete Mathematics 338 (7), 1239-1242, 2015 | 4 | 2015 |
| The Cunningham-Geelen method in practice: branch-decompositions and integer programming S Margulies, J Ma, IV Hicks INFORMS Journal on Computing 25 (4), 599-610, 2013 | 4 | 2013 |
| Weak orientability of matroids and polynomial equations JA De Loera, J Lee, S Margulies, J Miller European Journal of Combinatorics 50, 56-71, 2015 | 3 | 2015 |
| 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 | 3 | 2014 |
| Branch decomposition heuristics for linear matroids J Ma, S Margulies, IV Hicks, E Goins Discrete Optimization 10 (2), 102-119, 2013 | 3 | 2013 |
| Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization J Gunnels, J Lee, S Margulies Mathematical Programming Computation 2 (2), 103-124, 2010 | 3 | 2010 |
| Efficient high-precision dense matrix algebra on parallel architectures for nonlinear discrete optimization J Gunnels, J Lee, S Margulies Report RC24682, IBM Research, 2008 | 3 | 2008 |
| Polynomial-time solvable# CSP problems via algebraic models and Pfaffian circuits S Margulies, J Morton Journal of Symbolic Computation 74, 152-180, 2016 | 2 | 2016 |
| An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture E Gaar, A Wiegele, D Krenn, S Margulies Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019 | 1 | 2019 |
| Towards a Computational Proof of Vizing's Conjecture using Semidefinite Programming and Sums-of-Squares E Gaar, D Krenn, S Margulies, A Wiegele arXiv preprint arXiv:2003.04021, 2020 | | 2020 |
