According to our database1, Sangxia Huang authored at least 12 papers between 2010 and 2018.
Legend:Book In proceedings Article PhD thesis Other
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2(\log N)1/4-o(1) Hardness for Hypergraph Coloring.
Electronic Colloquium on Computational Complexity (ECCC), 2015
Improved NP-Inapproximability for 2-Variable Linear Equations.
Proceedings of the Approximation, 2015
Approximation Resistance on Satisfiable Instances for Sparse Predicates.
Theory of Computing, 2014
Approximation resistance on satisfiable instances for predicates with few accepting inputs.
Proceedings of the Symposium on Theory of Computing Conference, 2013
Improved Hardness of Approximating Chromatic Number.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
Approximation Resistance on Satisfiable Instances for Predicates Strictly Dominating Parity.
Electronic Colloquium on Computational Complexity (ECCC), 2012
From Holant to #CSP and Back: Dichotomy for Holant c Problems.
A Dichotomy for Real Weighted Holant Problems.
Proceedings of the 27th Conference on Computational Complexity, 2012
The Complexity of Weighted Boolean #CSP Modulo k.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011
From Holant to #CSP and Back: Dichotomy for Holantc Problems.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010