228 citations · 232 across the 14 of their papers we have counts for
5 papers · 1 filter
The Vertex-Attribute-Constrained Densest -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…
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…
On Densest -Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
Qiheng Lu, Nicholas D. Sidiropoulos, Aritra Konar
The Densest -Subgraph (DS) is a fundamental combinatorial problem known for its theoretical hardness and breadth of applications. Recently, Lu et al. (AAAI 2025) introduced a…
Exploring the Subgraph Density-Size Trade-off via the Lovász Extension
Aritra Konar, Nicholas D. Sidiropoulos
Given an undirected graph, the Densest-k-Subgraph problem (DkS) seeks to find a subset of k vertices such that the sum of the edge weights in the corresponding subgraph is maximize…
Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods
Aritra Konar, Nicholas D. Sidiropoulos
Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks. In this work, we formally establish that two recurring characteristics of real-world graph…