Aritra Konar

activity

20142026

most citedFeasible Point Pursuit and Successive Approximation of Non-convex QCQPs

228 citations · 232 across the 14 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

eess.SP2025

A Scalable and Exact Relaxation for Densest $k$ -Subgraph via Error Bounds

Ya Liu, Junbin Liu, Wing-Kin Ma +1

Given an undirected graph and a size parameter $k$ , the Densest $k$ -Subgraph (D $k$ S) problem extracts the subgraph on $k$ vertices with the largest number of induced edges. While D…

cs.SI2025

The Vertex-Attribute-Constrained Densest $k$ -Subgraph Problem

Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar

Dense subgraph mining is a fundamental technique in graph mining, commonly applied in fraud detection, community detection, product recommendation, and document summarization. In s…

cs.DS2025

Differentially Private and Scalable Estimation of the Network Principal Component

Alireza Khayatian, Anil Vullikanti, Aritra Konar

Computing the principal component (PC) of the adjacency matrix of an undirected graph has several applications ranging from identifying key vertices for influence maximization and…

A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds

The Vertex-Attribute-Constrained Densest k-Subgraph Problem

Differentially Private and Scalable Estimation of the Network Principal Component

A Scalable and Exact Relaxation for Densest $k$ -Subgraph via Error Bounds

The Vertex-Attribute-Constrained Densest $k$ -Subgraph Problem