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 2024Show all

2 papers · 1 filter

cs.SI2024

Fairness-Aware Dense Subgraph Discovery

Emmanouil Kariotakis, Nicholas D. Sidiropoulos, Aritra Konar

Dense subgraph discovery (DSD) is a key graph mining primitive with myriad applications including finding densely connected communities which are diverse in their vertex compositio…

cs.SI2024

On Densest $k$ -Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis

Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar

The Densest $k$ -Subgraph (D $k$ S) is a fundamental combinatorial problem known for its theoretical hardness and breadth of applications. Recently, Lu et al. (AAAI 2025) introduced a…

Fairness-Aware Dense Subgraph Discovery

On Densest k-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis

On Densest $k$ -Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis