The following publications are possibly variants of this publication:
- Strong Inapproximability Results on Balanced Rainbow-Colorable HypergraphsVenkatesan Guruswami, Euiwoong Lee. eccc, 21:43, 2014. [doi]
- Strong Inapproximability Results on Balanced Rainbow-Colorable HypergraphsVenkatesan Guruswami, Euiwoong Lee. combinatorica, 38(3):547-599, 2018. [doi]
- The Quest for Strong Inapproximability Results with Perfect CompletenessJoshua Brakensiek, Venkatesan Guruswami. approx 2017: [doi]
- The Quest for Strong Inapproximability Results with Perfect CompletenessJoshua Brakensiek, Venkatesan Guruswami. eccc, 24:80, 2017. [doi]
- The Quest for Strong Inapproximability Results with Perfect CompletenessJoshua Brakensiek, Venkatesan Guruswami. TALG, 17(3), 2021. [doi]
- Improved Inapproximability Results for Maximum k-Colorable SubgraphVenkatesan Guruswami, Ali Kemal Sinop. approx 2009: 163-176 [doi]
- Improved Inapproximability Results for Maximum k-Colorable SubgraphVenkatesan Guruswami, Ali Kemal Sinop. eccc, 16:99, 2009. [doi]