Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling. - Vedangi Bengali; Nate Veldt (CIKM, 2023)

On the tractability and approximability of non-submodular cardinality-based s-t cut problems in hypergraphs. - Vedangi Bengali; Nate Veldt (CoRR, 2024)

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards. - Vedangi Bengali; Nikolaj Tatti; Iiro Kumpulainen; Florian Adriaens; Nate Veldt (CoRR, 2025)