default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSusan Margulies
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j13]Elisabeth Gaar
, Daniel Krenn, Susan Margulies, Angelika Wiegele:
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares. J. Symb. Comput. 107: 67-105 (2021)- 2016
- [j12]Susan Margulies, Jason Morton:
Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits. J. Symb. Comput. 74: 152-180 (2016) - 2015
- [j11]Keerti Choudhary, Susan Margulies, Illya V. Hicks:
Integer domination of Cartesian product graphs. Discret. Math. 338(7): 1239-1242 (2015) - [j10]Jesús A. De Loera, Jon Lee, Susan Margulies, Jacob Miller:
Weak orientability of matroids and polynomial equations. Eur. J. Comb. 50: 56-71 (2015) - [j9]Susan Margulies, Shmuel Onn, Dmitrii V. Pasechnik:
On the complexity of Hilbert refutations for partition. J. Symb. Comput. 66: 70-83 (2015) - 2013
- [j8]Keerti Choudhary, Susan Margulies, Illya V. Hicks:
A Note on Total and Paired Domination of Cartesian Product Graphs. Electron. J. Comb. 20(3): 25 (2013) - [j7]Jing Ma, Susan Margulies, Illya V. Hicks, Edray Goins:
Branch decomposition heuristics for linear matroids. Discret. Optim. 10(2): 102-119 (2013) - [j6]Jesús A. De Loera, Jon Lee, Susan Margulies, Jacob Miller:
Systems of Polynomials for Detecting Orientable Matroids. Electron. Notes Discret. Math. 43: 343-353 (2013) - [j5]Susan Margulies, Jing Ma, Illya V. Hicks:
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming. INFORMS J. Comput. 25(4): 599-610 (2013) - 2012
- [j4]Susan Margulies, Illya V. Hicks:
An Algebraic Exploration of Dominating Sets and Vizing's Conjecture. Electron. J. Comb. 19(2): 1 (2012) - 2011
- [j3]Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies:
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. J. Symb. Comput. 46(11): 1260-1283 (2011) - 2010
- [j2]John A. Gunnels, Jon Lee, Susan Margulies:
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization. Math. Program. Comput. 2(2): 103-124 (2010) - 2009
- [j1]Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn:
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Comb. Probab. Comput. 18(4): 551-582 (2009)
Conference and Workshop Papers
- 2019
- [c3]Elisabeth Gaar, Angelika Wiegele, Daniel Krenn, Susan Margulies:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. ISSAC 2019: 155-162 - 2015
- [c2]Jesús A. De Loera, Susan Margulies, Michael Pernpeintner, Eric Riedl, David Rolnick, Gwen Spencer, Despina Stasi, Jon Swenson:
Graph-Coloring Ideals: Nullstellensatz Certificates, Gröbner Bases for Chordal Graphs, and Hardness of Gröbner Bases. ISSAC 2015: 133-140 - 2008
- [c1]Jesús A. De Loera, Jon Lee, Peter N. Malkin, Susan Margulies:
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. ISSAC 2008: 197-206
Informal and Other Publications
- 2019
- [i4]Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. CoRR abs/1901.10288 (2019) - 2014
- [i3]Jesús A. De Loera, Susan Margulies, Michael Pernpeintner, Eric Riedl, David Rolnick, Gwen Spencer, Despina Stasi, Jon Swenson:
Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals. CoRR abs/1410.6806 (2014) - 2013
- [i2]Susan Margulies, Jason Morton:
Polynomial-time Solvable #CSP Problems via Algebraic Models and Pfaffian Circuits. CoRR abs/1311.4066 (2013) - 2011
- [i1]K. Choudhary, Susan Margulies, Illya V. Hicks:
A Note on Total and Paired Domination of Cartesian Product Graphs. CoRR abs/1109.2174 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
