Approximating Star Cover Problems. - Buddhima Gamlath; Vadim Grinberg (APPROX-RANDOM, 2020)

A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. - Julia Chuzhoy; Mina Dalirrooyfard; Vadim Grinberg; Zihan Tan (CoRR, 2022)

A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems. - Julia Chuzhoy; Mina Dalirrooyfard; Vadim Grinberg; Zihan Tan (ITCS, 2023)

How to Hide a Clique? - Uriel Feige; Vadim Grinberg (Theory Comput. Syst., 2024)

Fair allocations with subadditive and XOS valuations. - Uriel Feige; Vadim Grinberg (EC, 2025)

Upper bounds on the theta function of random graphs. - Uriel Feige; Vadim Grinberg (CoRR, 2025)