Susan Margulies

According to our database1, Susan Margulies authored at least 18 papers between 2008 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares.
J. Symb. Comput., 2021

2019
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2016
Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits.
J. Symb. Comput., 2016

2015
On the complexity of Hilbert refutations for partition.
J. Symb. Comput., 2015

Weak orientability of matroids and polynomial equations.
Eur. J. Comb., 2015

Integer domination of Cartesian product graphs.
Discret. Math., 2015

Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner Bases.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals.
CoRR, 2014

2013
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming.
INFORMS J. Comput., 2013

Systems of Polynomials for Detecting Orientable Matroids.
Electron. Notes Discret. Math., 2013

Branch decomposition heuristics for linear matroids.
Discret. Optim., 2013

A Note on Total and Paired Domination of Cartesian Product Graphs.
Electron. J. Comb., 2013

2012
An Algebraic Exploration of Dominating Sets and Vizing's Conjecture.
Electron. J. Comb., 2012

2011
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz.
J. Symb. Comput., 2011

A Note on Total and Paired Domination of Cartesian Product Graphs
CoRR, 2011

2010
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization.
Math. Program. Comput., 2010

2009
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.
Comb. Probab. Comput., 2009

2008
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008


  Loading...