Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor (and More)
cs.CC, cs.DM, cs.DS, math.CO
Submitted: 2026-09-10
Updated: 2026-11-03
Terminology
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?