We stand with Ukraine  

Neng Huang

Orcid: 0000-0002-5669-2646

Affiliations:
  • University of Michigan, Computer Science and Engineering Division, Ann Arbor, MI, USA
  • University of Chicago, Department of Computer Science, Chicago, IL, USA (PhD 2024)


According to our database1, Neng Huang authored at least 12 papers between 2018 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets.
[BibTeX]
[DOI]
Suprovat Ghoshal
,
Neng Huang
,
Euiwoong Lee
,
Konstantin Makarychev
,
Yury Makarychev
CoRR, April, 2026

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs.
[BibTeX]
[DOI]
Nikhil Bansal
,
Neng Huang
,
Euiwoong Lee
CoRR, February, 2026

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes.
[BibTeX]
[DOI]
Joshua Brakensiek
,
Neng Huang
,
Aaron Potechin
,
Uri Zwick
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

MAX BISECTION might be harder to approximate than MAX CUT.
[BibTeX]
[DOI]
Joshua Brakensiek
,
Neng Huang
,
Aaron Potechin
,
Uri Zwick
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Hardness of Sampling for the Anti-Ferromagnetic Ising Model on Random Graphs.
[BibTeX]
[DOI]
Neng Huang
,
Will Perkins
,
Aaron Potechin
Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems.
[BibTeX]
[DOI]
Ian DeHaan
,
Neng Huang
,
Euiwoong Lee
Proceedings of the Approximation, 2025

2024
Tight approximability of MAX 2-SAT and relatives, under UGC.
[BibTeX]
[DOI]
Joshua Brakensiek
,
Neng Huang
,
Uri Zwick
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs.
[BibTeX]
[DOI]
Antares Chen
,
Neng Huang
,
Kunal Marwaha
CoRR, 2023

Separating MAX 2-AND, MAX DI-CUT and MAX CUT.
[BibTeX]
[DOI]
Joshua Brakensiek
,
Neng Huang
,
Aaron Potechin
,
Uri Zwick
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021
On the Mysteries of MAX NAE-SAT.
[BibTeX]
[DOI]
Joshua Brakensiek
,
Neng Huang
,
Aaron Potechin
,
Uri Zwick
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
On the Approximability of Presidential Type Predicates.
[BibTeX]
[DOI]
Neng Huang
,
Aaron Potechin
Proceedings of the Approximation, 2020

2018
On the Decision Tree Complexity of String Matching.
[BibTeX]
[DOI]
Xiaoyu He
,
Neng Huang
,
Xiaoming Sun
Proceedings of the 26th Annual European Symposium on Algorithms, 2018


  Loading...