Lee, Euiwoong, and Manurangsi, Pasin. Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) . Web. doi:10.4230/LIPIcs.ITCS.2024.71.

Lee, Euiwoong, & Manurangsi, Pasin. Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), (). https://doi.org/10.4230/LIPIcs.ITCS.2024.71

Lee, Euiwoong, and Manurangsi, Pasin. "Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs". 15th Innovations in Theoretical Computer Science Conference (ITCS 2024) (). Country unknown/Code not available: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.71. https://par.nsf.gov/biblio/10488790.

@article{osti_10488790,
place = {Country unknown/Code not available}, title = {Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs}, url = {https://par.nsf.gov/biblio/10488790}, DOI = {10.4230/LIPIcs.ITCS.2024.71}, abstractNote = {}, journal = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author = {Lee, Euiwoong and Manurangsi, Pasin}, editor = {Guruswami, Venkatesan} }