On the Decision Tree Complexity of String Matching. - Xiaoyu He; Neng Huang 001; Xiaoming Sun 001 (ESA, 2018)

On the Approximability of Presidential Type Predicates. - Neng Huang 001; Aaron Potechin (APPROX-RANDOM, 2020)

On the Mysteries of MAX NAE-SAT. - Joshua Brakensiek; Neng Huang 001; Aaron Potechin; Uri Zwick (SODA, 2021)

Separating MAX 2-AND, MAX DI-CUT and MAX CUT. - Joshua Brakensiek; Neng Huang 001; Aaron Potechin; Uri Zwick (FOCS, 2023)

Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs. - Antares Chen; Neng Huang 001; Kunal Marwaha (CoRR, 2023)

Tight approximability of MAX 2-SAT and relatives, under UGC. - Joshua Brakensiek; Neng Huang 001; Uri Zwick (SODA, 2024)

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems. - Ian DeHaan; Neng Huang 001; Euiwoong Lee (APPROX/RANDOM, 2025)

Hardness of Sampling for the Anti-Ferromagnetic Ising Model on Random Graphs. - Neng Huang 001; Will Perkins 001; Aaron Potechin (ITCS, 2025)

MAX BISECTION might be harder to approximate than MAX CUT. - Joshua Brakensiek; Neng Huang 001; Aaron Potechin; Uri Zwick (SODA, 2026)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes. - Joshua Brakensiek; Neng Huang 001; Aaron Potechin; Uri Zwick (STOC, 2026)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs. - Nikhil Bansal 001; Neng Huang 001; Euiwoong Lee (CoRR, 2026)

On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets. - Suprovat Ghoshal; Neng Huang 001; Euiwoong Lee; Konstantin Makarychev; Yury Makarychev (CoRR, 2026)