Aritra Konar
4 papers · 2022–2026 · 1 conference · across top CS/AI conferences
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
π Renaissance Researcher (5) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (14) π§ Keyword Pioneer π Cross-Pollinator (15)
π
Keyword Champion
(3)
Conferences
AAAI (4)
Top co-authors
Keywords
dense subgraph
(3)
combinatorial optimization
(3)
graph algorithm
(2)
graph mining
(2)
continuous optimization
(1)
lovasz extension
(1)
continuous relaxation
(1)
proximal gradient
(1)
error bound
(1)
submodular function
(1)
frank-wolfe algorithm
(1)
densest subgraph
(1)
subgraph density
(1)
penalty method
(1)
dense subgraph discovery
(1)
subgraph discovery
(1)
non-convex optimization
(1)
document summarization
(1)
community detection
(1)
Papers
A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds
AAAI 2026
Densest k-Subgraph Mining via a Provably Tight Relaxation
AAAI 2025
Optimal Quasi-clique: Hardness, Equivalence with Densest-k-Subgraph, and Quasi-partitioned Community Mining
AAAI 2024
The Triangle-Densest-K-Subgraph Problem: Hardness, LovΓ‘sz Extension, and Application to Document Summarization
AAAI 2022