### 9 papers:

- STOC-2015-FoxKM #approximate #polynomial
- A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (KF, PNK, SM), pp. 841–850.
- STOC-2015-MosselNS #consistency
- Consistency Thresholds for the Planted Bisection Model (EM, JN, AS), pp. 69–75.
- STOC-2014-CyganLPPS #parametricity
- Minimum bisection is fixed parameter tractable (MC, DL, MP, MP, SS), pp. 323–332.
- FATES-2005-Mayer #adaptation #locality #random testing #testing
- Adaptive Random Testing by Bisection and Localization (JM), pp. 72–86.
- STOC-2004-HolmerinK #equation #linear #verification
- A new PCP outer verifier with applications to homogeneous linear equations and max-bisection (JH, SK), pp. 11–20.
- ICALP-2002-BermanK #approximate #bound
- Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.
- DAC-2000-CaldwellKM #question #recursion
- Can recursive bisection alone produce routable placements? (AEC, ABK, ILM), pp. 477–482.
- STOC-2000-FeigeKN #approximate
- Approximating the minimum bisection size (extended abstract) (UF, RK, KN), pp. 530–536.
- DAC-1989-BuiHJL #algorithm #graph #performance
- Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms (TNB, CH, CJ, FTL), pp. 775–778.