Faragó, András; Mojaveri, Zohre R. In search of the densest subgraph. (English) Zbl 1461.05210 Algorithms (Basel) 12, No. 8, Paper No. 157, 18 p. (2019). MSC: 05C85 05C82 PDFBibTeX XMLCite \textit{A. Faragó} and \textit{Z. R. Mojaveri}, Algorithms (Basel) 12, No. 8, Paper No. 157, 18 p. (2019; Zbl 1461.05210) Full Text: DOI
Yamazaki, Koichi Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis. (English) Zbl 1461.68169 Algorithms (Basel) 11, No. 11, Paper No. 173, 10 p. (2018). MSC: 68R10 68Q17 68W25 PDFBibTeX XMLCite \textit{K. Yamazaki}, Algorithms (Basel) 11, No. 11, Paper No. 173, 10 p. (2018; Zbl 1461.68169) Full Text: DOI
Manurangsi, Pasin Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis. (English) Zbl 1461.68160 Algorithms (Basel) 11, No. 1, Paper No. 10, 22 p. (2017). MSC: 68R10 68Q17 PDFBibTeX XMLCite \textit{P. Manurangsi}, Algorithms (Basel) 11, No. 1, Paper No. 10, 22 p. (2017; Zbl 1461.68160) Full Text: DOI arXiv