 |
|
Preprints:
11. (with J. Morton) 0/1 Constraint Satisfaction Problems and Tensor Contraction Networks,
manuscript in preparation, October 2012.
10. (with K. Choudhary and I.V. Hicks) A Note on Integer Domination of Cartesian Product Graphs
Graphs, preprint August 2012, pdf
9. (with S. Onn) On the Complexity of Hilbert Refutations for Partition, preprint August 2012, pdf
8. (with K. Choudhary and I.V. Hicks) A Note on Total and Paired Domination of Cartesian Product
Graphs, preprint August 2012, pdf
Publications:
7. (with E. Goins, I.V. Hicks and J. Ma) Branch Decomposition Heuristics for Linear Matroids,
accepted to Journal of Discrete Optimization, April 2012, pdf
6. (with I.V. Hicks) An Algebraic Exploration of Dominating Sets and Vizing's Conjecture,
Electronic Journal of Combinatorics, 19 (2), April 2012. pdf
5. (with I.V. Hicks and J. Ma) The Cunningham-Geelen Method in Practice: Branch-decompositions
and Integer Programming, accepted to INFORMS Journal of Computing, October 2011. pdf
4. (with J. A. De Loera, J. Lee, P.N. Malkin) Computing Infeasibility Certificates for Combinatorial
Problems through Hilbert's Nullstellensatz , Journal of Symbolic Computation 46(11), pg. 1260-1283, 2011. pdf
3. (with J. Gunnels, J. Lee) Efficient High-precision Dense Matrix Algebra on Parallel Architectures for
Nonlinear Discrete Optimization, Mathematical Programming Computation, 2(2), pg. 103--124, 2010. pdf
2. (with J. A. De Loera, J. Lee, P.N. Malkin) Hilbert's Nullstellensatz and an Algorithm for Proving
Combinatorial Infeasibility, International Symposium on Symbolic and Algebraic Computation
(ISSAC 2009). pdf
1. (with J. A. De Loera, J. Lee and S. Onn) Expressing Combinatorial Optimization Problems by
Polynomial Equations, Journal of Combinatorics, Probability and Computing, 18, 551--582, 2009. pdf
Other
0. University of California,
Davis, Ph.D. Thesis, Computer Algebra, Combinatorics, and Complexity:
Hilbert's Nullstellensatz and NP-complete Problems,
August 5, 2008. pdf
Susan Margulies
|
|
|
|
