The following pages link to Susan Margulies (Q426850):
Displaying 13 items.
- An algebraic exploration of dominating sets and Vizing's conjecture (Q426851) (← links)
- (Q491737) (redirect page) (← links)
- Weak orientability of matroids and polynomial equations (Q491739) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization (Q708777) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Graph-Coloring Ideals (Q2819750) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum (Q3557531) (← links)
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture (Q5120487) (← links)
- Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility (Q5301623) (← links)
